This paper proposes a new approach to solve the well-known matching or correspondence problem. This approach incorporates the image space based matching techniques with the general knowledge of the scenes. The low-level processing (edge detection, segmentation) and candidate matching are performed in image space, while the final matching is determined in object space by a relaxation procedure which combines the result of candidate matching, general geometric constraints of scenes (GGCS) and other constraints of image matching. The innovative features of our approach lie in back-projecting (back tracing) the line pairs from candidate matching into the object (scene) space, and combining all the constraints in an unified process. The concept of "figure continuity" in the image space is substituted by a new concept of "General Geometric Constraints of Scenes (GGCS)", which is object space based and has much more scope than "figure continuity". Under the new scheme, the final matching becomes a consistent labeling problem. An experiment is used to illustrate our approach.
Matching in image/object dual spaces
Industrial Vision Metrology ; 1991 ; Winnipeg,Canada
Proc. SPIE ; 1526
1991-09-01
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
British Library Conference Proceedings | 1998
|A Multiresolution Image Matching Algorithm for Moving Object Detection by Wavelets
British Library Conference Proceedings | 1994
|Inexact graph matching based on kernels for object retrieval in image databases
British Library Online Contents | 2011
|Matching interest points of an object
IEEE | 2005
|