- 1、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
《数字图像处理 Digital Image Processing》课件 Digital Image Fundamentals[精品]
Define distance function: For pixels p, q, and z, with coordinates (x,y), (s,t), and (v,w), respectively, D is a distance function or metric if 1) D(p,q) ≥ 0 (D(p,q) = 0 iff p = q), 2) D(p,q) = D(q,p), and 3) D(p,z) ≤ D(p,q) + D(q,z). Distance measures Lecture 3: Chapter 2: Digital Image Fundamentals 1. The Euclidean distance between p and q is defined as: Different ways of measuring distance Using this method, the pixels having a distance less than or equal to some value r from (x,y) are the points contained in a disk of radius r centered at (x,y). p q Lecture 3: Chapter 2: Digital Image Fundamentals 2. The D4 distance (also called city block distance) between p and q is defined as: Using this method, the pixels having a D4 distance from (x,y) less than or equal to some value r form a diamond centered at (x,y). For example, the pixels with D4 distance ≤ 2 from (x,y) form the following contours of constant distance: The pixels with D4 = 1 are the 4-neighbors of (x,y). 2 2 1 1 2 2 1 0 2 2 2 1 2 D4 distance Different ways of measuring distance con’t Lecture 3: Chapter 2: Digital Image Fundamentals 3. The D8 distance (also called chessboard distance) between p and q is defined as: D8(p,q) = max( x-s , y-t ) 2 2 2 2 2 2 1 1 1 2 2 1 0 1 2 2 1 1 1 2 2 2 2 2 2 D8 distance Different ways of measuring distance con’t The pixels with D8 = 1 are the 8-neighbors of (x,y). Lecture 3: Chapter 2: Digital Image Fundamentals 4. The Dm distance between two points is defined as the shortest m-path between the points. In this case, the distance between two pixels will depend on the values of the pixels along the path, as well as the values of their neighbors. Let’s see the following example: Different ways of measuring distance con’t Lecture 3: Chapter 2: Digital Image Fundamentals p2 p p1 p4 p3 Assume that p, p2, and p4 have value 1 and that p1 and p3 can have a value 0 or 1. For V = {1}, solve for Dm distance between p and p4. Solution: If p1 and p3 are 0, then Dm is 2. If
文档评论(0)