Issue No. 07 - July (1994 vol. 16)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.297956
<p>A new search method over (x,y,/spl theta/), called position-orientation masking is introduced. It is applied to vertices that are allowed to be separated into different bands of acuteness. Position-orientation masking yields exactly one /spl theta/ value for each (x,y) that it considers to be the location of a possible occurrence of an object. Detailed matching of edge segments is performed at only these candidate (x,y,/spl theta/) to determine if objects actually do occur there. Template matching is accelerated dramatically since the candidates comprise only a small fraction of all (x,y,/spl theta/). Position-orientation masking eliminates the need for exhaustive search when deriving the candidate (x,y,/spl theta/). Search is guided by correlations between template vertices and distance transforms of image vertices. When a poor correlation is encountered at a particular position and orientation, nearby positions at that orientation and nearby orientations at that position are masked out. Position and orientation traversal are by quadrant and binary decomposition.</p>
edge detection; search problems; correlation methods; transforms; position-orientation masking; parametric search; template matching; edge segments matching; correlations; template vertices; distance transforms; image vertices; binary decomposition; quadrant decomposition
E. Tsujimoto, D. Paglieroni and G. Ford, "The Position-Orientation Masking Approach to Parametric Search for Template Matching," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 16, no. , pp. 740-747, 1994.