Image Analysis Using Multigrid Relaxation Methods
IEEE Transactions on Pattern Analysis and Machine Intelligence
Labeled point pattern matching by Delaunay triangulation and maximal cliques
Pattern Recognition
Multiresolution elastic matching
Computer Vision, Graphics, and Image Processing
A nonlinear variational problem for image matching
SIAM Journal on Scientific Computing
Computer and Robot Vision
Nonserial Dynamic Programming
Graphs and Hypergraphs
Graph Matching With a Dual-Step EM Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Estimating Human Body Configurations Using Shape Context Matching
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Monocuolar Perception of Biological Motion - Clutter and Partial Occlusion
ECCV '00 Proceedings of the 6th European Conference on Computer Vision-Part II
Alignment and Correspondence Using Singular Value Decomposition
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
A New Distance Measure for Non-rigid Image Matching
EMMCVPR '99 Proceedings of the Second International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Procrustes Alignment with the EM Algorithm
CAIP '99 Proceedings of the 8th International Conference on Computer Analysis of Images and Patterns
Relational Constraints for Point Distribution Models
CAIP '01 Proceedings of the 9th International Conference on Computer Analysis of Images and Patterns
Unsupervised Learning of Human Motion
IEEE Transactions on Pattern Analysis and Machine Intelligence
A new point matching algorithm for non-rigid registration
Computer Vision and Image Understanding - Special issue on nonrigid image registration
A unified framework for alignment and correspondence
Computer Vision and Image Understanding
An Efficient Algorithm for Discovering Frequent Subgraphs
IEEE Transactions on Knowledge and Data Engineering
Representation and Detection of Deformable Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Object recognition using wavelets, L-G graphs and synthesis of regions
Pattern Recognition
Dynamic quantization for belief propagation in sparse spaces
Computer Vision and Image Understanding
Labeling of Human Motion by Constraint-Based Genetic Algorithm
Computational Intelligence and Security
Model-Based Segmentation Using Graph Representations
MICCAI '08 Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I
A Generative Shape Regularization Model for Robust Face Alignment
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part I
Verbal and Nonverbal Features of Human-Human and Human-Machine Interaction
Labeling Still Image Databases Using Graphical Models
IbPRIA '09 Proceedings of the 4th Iberian Conference on Pattern Recognition and Image Analysis
Closed-loop learning of visual control policies
Journal of Artificial Intelligence Research
Tracking a detected face with dynamic programming
Image and Vision Computing
Model-guided deformable hand shape recognition without positioning aids
Pattern Recognition
Detection of near-regular object configurations by elastic graph search
ICCVG'10 Proceedings of the 2010 international conference on Computer vision and graphics: Part I
Representation and detection of deformable shapes
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Recognizing objects in adversarial clutter: breaking a visual captcha
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Inference and Learning with Hierarchical Shape Models
International Journal of Computer Vision
Skeleton Search: Category-Specific Object Recognition and Segmentation Using a Skeletal Shape Model
International Journal of Computer Vision
| Hi-index | 0.14 |
Abstract-A new method of model registration is proposed using graphical templates. A graph of landmarks is chosen in the template image. All possible candidates for these landmarks are found in the data image using local operators. A dynamic programming algorithm on decomposable subgraphs of the template graph finds the optimal match to a subset of the candidate points in polynomial time. This combination of local operators to describe points of interest/landmarks and a graph to describe their geometric orientation in the plane, yields fast and precise matches of the model to the data, with no initialization required.