A Simple Algorithm for Nearest Neighbor Search in High Dimensions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multi-view Matching for Unordered Image Sets, or "How Do I Organize My Holiday Snaps?"
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part I
Indexing the Distance: An Efficient Method to KNN Processing
Proceedings of the 27th International Conference on Very Large Data Bases
Video Google: A Text Retrieval Approach to Object Matching in Videos
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Distinctive Image Features from Scale-Invariant Keypoints
International Journal of Computer Vision
Multi-Image Matching Using Multi-Scale Oriented Patches
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Photo tourism: exploring photo collections in 3D
ACM SIGGRAPH 2006 Papers
Scalable Recognition with a Vocabulary Tree
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
Automatic Panoramic Image Stitching using Invariant Features
International Journal of Computer Vision
Robust multi-view feature matching from multiple unordered views
Pattern Recognition
PCA-SIFT: a more distinctive representation for local image descriptors
CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Wide-baseline multiple-view correspondences
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Hi-index | 0.00 |
In this paper, we present a photo grouping method in multi-view feature matching problem, especially from multiple unordered wide-baseline images. By analyzing and comparing the connections between images with undirected weighted graph, we abstract the photo grouping into a nonlinear optimization problem and tackle it by using an annealing based method. Additionally, a new high-dimensional feature searching algorithm is also developed to find out the initial features matching number more robustly, which is used to be the measurement of image relativities in the grouping algorithm. Finally, we show the analyses and discussions of the performance of the proposed method and experimental results have proven that the novel approach is more efficient than the traditional ones.