Download presentation

Presentation is loading. Please wait.

Published byAshtyn Widger Modified over 3 years ago

1
A Multi-Resolution Technique for Comparing Images Using the Hausdorff Distance Daniel P. Huttenlocher and William J. Rucklidge Nov 7 2000 Presented by Chang Ha Lee

2
Introduction Registration methods Correlation and sequential methods Fourier methods Point mapping Elastic model-based matching

3
The Hausdorff Distance Given two finite point sets A = {a 1,…,a p } and B = {b 1,…,b q } H(A, B) = max(h(A, B), h(B, A)) where

4
With transformations A: a set of image points B: a set of model points transformations: translations, scales t = (t x, t y, s x, s y ) w = (w x, w y ) => t(w) = (s x w x +t x, s y w y +t y ) f(t) = H(A, t(B))

5
With transformations Forward distance f B (t) = h(t(B), A) a hypothesize reverse distance f A (t) = h(A, t(B)) a test method

6
Computing Hausdorff distance Voronoi surface d(x) = {(x, d(x))|x R 2 }

7
Computing Hausdorff distance The forward distance for a transformation t = (t x, t y, s x, s y )

8
Comparing Portion of Shapes Partial distance The partial bidirectional Hausdorff distance H LK (A,t(B))=max(h L (A,t(B)), h K (t(B),A))

9
A Multi-Resolution Approach Claim 1. 0 b x x max, 0 b y y max for all b=(b x,b y ) B, t = (t x, t y, s x, s y ),

10
A Multi-Resolution Approach If H LK (A, t(B)) = >, then any transformation t with (t,t) < - cannot have H LK (A, t(B)) A rectilinear region(cell) The center of this cell If then no transformation t R have H LK (A, t(B))

11
A Multi-Resolution Approach 1. Start with a rectilinear region(cell) which contains all transformations 2. For each cell, If Mark this cell as interesting 3. Make a new list of cells that cover all interesting cells. 4. Repeat 2,3 until the cell size becomes small enough

12
The Hausdorff distance for grid points A = {a 1,…,a p } and B = {b 1,…,b q } where each point a A, b B has integer coordinates The set A is represented by a binary array A[k,l] where the k,l-th entry is nonzero when the point (k,l) A The distance transform of the image set A D[x,y] is zero when A[k,l] is nonzero, Other locations of D[x,y] specify the distance to the nearest nonzero point

13
Rasterizing transformation space Translations An accuracy of one pixel Scales b=(b x,b y ) B, 0 b x x max, 0 b y y max x-scale: an accuracy of 1/x max y-scale: an accuracy of 1/y max Lower limits: s xmin, s ymin Ratio limits: s x /s y > a max or s y /s x > a max Transformations can be represented by ( i x, i y, j x, j y ) represents the transformation (i x, i y, j x /x max, j y /y max )

14
Rasterizing transformation space Restrictions where A[k,l], 0 k m a, 0 l n a

15
Rasterizing transformation space Forward distance h K (t(B),A) Bidirectional distance

16
Reverse distances in cluttered images When the model is considerably smaller than the image Compute a partial reverse distance only for image points near the current position of the model

17
Increasing the efficiency of the computation Early rejection K = f 1 q where q = |B| If the number of probe values greater than the threshold exceeds q-K, then stop for the current cell Early Acceptance Accept false positive and no false negative A fraction s, 0~~
{
"@context": "http://schema.org",
"@type": "ImageObject",
"contentUrl": "http://images.slideplayer.com/5/1525337/slides/slide_17.jpg",
"name": "Increasing the efficiency of the computation Early rejection K = f 1 q where q = |B| If the number of probe values greater than the threshold exceeds q-K, then stop for the current cell Early Acceptance Accept false positive and no false negative A fraction s, 0~~~~
~~

18
Increasing the efficiency of the computation Skipping forward Relies on the order of cell scanning Assume that cells are scanned in the x-scale order. D +x [x,y]: the distance in the increasing x direction to the nearest location where D[x,y] Computing D +x [x,y]: Scan right-to-left along each row of D[x,y] F B [i x,i y,j x,j y ],…,FB[i x,i y,j x + -1,j y ] must be greater than

19
Examples Camera images Edge detection

20
Examples Engineering drawing Find circles

21
Conclusion A multi-resolution method for searching possible transformations of a model with respect to an image Problem domain Two dimensional images which are taken of an object in the 3-dimensional world Engineering drawings

Similar presentations

OK

CS654: Digital Image Analysis Lecture 36: Feature Extraction and Analysis.

CS654: Digital Image Analysis Lecture 36: Feature Extraction and Analysis.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

A ppt on pollution Ppt on power system security Ppt on two point perspective images Download ppt on mind controlled robotic arms for sale Ppt on different types of reactions and their applications Ppt on semi solid casting video Ppt on acute and chronic diseases for class 9 Ppt on harvard business review Ppt on airport automation Ppt on dot net