Using Polygons to Recognize and Locate Partially Occluded Objects
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Feature-based correspondence: an eigenvector approach
Image and Vision Computing - Special issue: BMVC 1991
A Bayesian approach to model matching with geometric hashing
Computer Vision and Image Understanding
Structural Matching by Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Unsupervised Clustering in Hough Space for Identification of Partially Occluded Objects
IEEE Transactions on Pattern Analysis and Machine Intelligence
A line feature matching technique based on an Eigenvector approach
Computer Vision and Image Understanding
Comparing Images Using the Hausdorff Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Modal Matching for Correspondence and Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Matching in Computer Vision Using Probabilistic Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Object matching algorithms using robust Hausdorff distance measures
IEEE Transactions on Image Processing
Face Recognition Using Face-ARG Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Reliable face recognition using adaptive and robust correlation filters
Computer Vision and Image Understanding
Structural Object Recognition Using Entropy Correspondence Measure of Line Features
IEICE - Transactions on Information and Systems
Attributed relational graph matching based on the nested assignment structure
Pattern Recognition
A novel stochastic attributed relational graph matching based on relation vector space analysis
ACIVS'06 Proceedings of the 8th international conference on Advanced Concepts For Intelligent Vision Systems
GREC'05 Proceedings of the 6th international conference on Graphics Recognition: ten Years Review and Future Perspectives
A method for symbol spotting in graphical documents
DAS'06 Proceedings of the 7th international conference on Document Analysis Systems
Hi-index | 0.00 |
In this paper, we propose a novel 2-D partial matching algorithm using the model-based probabilistic analysis of feature correspondences in the relation vector space, which is quite robust to shape variations due to noise and occlusions and invariant to 2-D geometric transformations as well. We represent an object using the attributed relational graph (ARG) model with nodes (features) of a set of the binary relation vectors. By defining relation vector space which can describe the structural information of an object centered at a specific feature, and modeling distortions due to partial occlusion or the input noise statistically in this space, lost features can be easily identified, so that the partial matching is performed efficiently. The proposed partial matching algorithm consists of two-phases. First, a finite number of candidate subgraphs are selected in an image, by using the logical constraint embedding local and structural consistency as well as the correspondence measure between model and image features. Second, the feature loss detection is done iteratively by the error detection and voting scheme through the error analysis in the relation vector space. Experimental results on real images demonstrate that the proposed algorithm has superior performance to those of the conventional relaxation algorithms, by localizing target objects robustly and correctly even in severely noisy and occluded scenes.