数字图像处理知识课件.pptVIP

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Neighbors of a Pixel 相邻像素 Neighborhood relation is used to tell adjacent pixels. It is useful for analyzing regions. x y (0,0) (x,y) (x+1,y) (x-1,y) (x,y-1) (x,y+1) (x+1,y-1) (x-1,y-1) (x-1,y+1) (x+1,y+1) Basic Relationship of Pixels * p (x+1,y) (x-1,y) (x,y-1) (x,y+1) 4-neighbors of p: N4(p) = (x-1,y) (x+1,y) (x,y-1) (x,y+1) Note: q ? N4(p) implies p ? N4(q) 4-neighborhood relation considers only vertical and horizontal neighbors. N4(p) 4 – neighbor * p (x+1,y-1) (x-1,y-1) (x-1,y+1) (x+1,y+1) Diagonal neighbors of p: ND(p) = (x-1,y-1) (x+1,y-1) (x-1,y+1) (x+1,y+1) Diagonal -neighborhood relation considers only diagonal neighbor pixels. ND(p) Diagonal neighbor * p (x+1,y) (x-1,y) (x,y-1) (x,y+1) (x+1,y-1) (x-1,y-1) (x-1,y+1) (x+1,y+1) 8-neighbors of p: (x-1,y-1) (x,y-1) (x+1,y-1) (x-1,y) (x+1,y) (x-1,y+1) (x,y+1) (x+1,y+1) N8(p) = 8-neighborhood relation considers all neighbor pixels. N8(p) 8 – neighbor * Two pixels p and q with values from V are 4 – adjacency if q is in the set N4(p). 4 - adjacency 设用V 表示定义连接的灰度值集合。 8 - adjacency Two pixels p and q with values from V are 8 – adjacency if q is in the set N8(p). * N4(p)∩N4(q)不包含V中取值的像素,即交集是空集,不能有元素同时出现在N4(p)和N4(q)中。 m- adjacency(mixed adjacency ) Two pixels p and q with values from V are m-adjacency if (i) q is in the N4(p), (ii)q is in the ND(p) and the set N4 (p) ∩ N4 (q) has no pixels whose values are from V. 设用V 表示定义连接的灰度值集合 * Histogram Processing 直方图处理 Histograms?plots?how?many?times?(frequency)?each? intensity?value?in?image?occur. Example: Image?(left)?has?256?distinct?gray?levels?(8?bits). Histogram?(right)?shows?frequency?(how?many?times)each gray?level?occurs. * MN=n p(rk) is an estimate of the portability of occurrence of intensity level rk in an image. The sum of all components of a normalized histogram in equal to 1. Normalized Histogram 归一化的直方图 * 直方图 15 5 4 3 2 1 0 直方图的绘制 The horizontal axis of each histogram plot corre

文档评论(0)

燕虞昊 + 关注
实名认证
文档贡献者

教师资格证持证人

该用户很懒,什么也没介绍

领域认证该用户于2023年05月19日上传了教师资格证

1亿VIP精品文档

相关文档