Recognizing solid objects by alignment with an image
International Journal of Computer Vision
Elements of information theory
Elements of information theory
International Journal of Computer Vision
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Combinatorial and experimental results for randomized point matching algorithms
Proceedings of the twelfth annual symposium on Computational geometry
Matrix computations (3rd ed.)
Semidefinite programming in combinatorial optimization
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Selection of relevant features and examples in machine learning
Artificial Intelligence - Special issue on relevance
The pyramid-technique: towards breaking the curse of dimensionality
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Efficient Invariant Representations
International Journal of Computer Vision
Object Detection and Localization by Dynamic Template Warping
International Journal of Computer Vision
Derandomizing Approximation Algorithms Based on Semidefinite Programming
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Feature Transformation and Subset Selection
IEEE Intelligent Systems
Parametric Distributional Clustering for Image Segmentation
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Some Methods for Nonlinear Multi-objective Optimization
EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
Deflating the Dimensionality Curse Using Multiple Fractal Dimensions
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Object Recognition from Local Scale-Invariant Features
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Selecting Canonical Views for View-Based 3-D Object Recognition
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
Multicriteria Optimization
Approximation of canonical sets and their applications to 2D view simplification
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
On Computing Canonical Subsets of Graph-Based Behavioral Representations
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Combining different types of scale space interest points using canonical sets
SSVM'07 Proceedings of the 1st international conference on Scale space and variational methods in computer vision
| Hi-index | 0.00 |
A common approach to the image matching problem is representing images as sets of features in some feature space followed by establishing correspondences among the features. Previous work by Huttenlocher and Ullman [1] shows how a similarity transformation – rotation, translation, and scaling – between two images may be determined assuming that three corresponding image points are known. While robust, such methods suffer from computational inefficiencies for general feature sets. We describe a method whereby the feature sets may be summarized using the stable bounded canonical set (SBCS), thus allowing the efficient computation of point correspondences between large feature sets. We use a notion of stability to influence the set summarization such that stable image features are preferred.