An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Min-wise independent permutations
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Multiple view geometry in computer vision
Multiple view geometry in computer vision
A Factorization Based Algorithm for Multi-Image Projective Structure and Motion
ECCV '96 Proceedings of the 4th European Conference on Computer Vision-Volume II - Volume II
Bundle Adjustment - A Modern Synthesis
ICCV '99 Proceedings of the International Workshop on Vision Algorithms: Theory and Practice
On the Resemblance and Containment of Documents
SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
An Automated Method for Large-Scale, Ground-Based City Model Acquisition
International Journal of Computer Vision
Distinctive Image Features from Scale-Invariant Keypoints
International Journal of Computer Vision
Photo tourism: exploring photo collections in 3D
ACM SIGGRAPH 2006 Papers
A Comparison and Evaluation of Multi-View Stereo Reconstruction Algorithms
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Detailed Real-Time Urban 3D Reconstruction from Video
International Journal of Computer Vision
Speeded-Up Robust Features (SURF)
Computer Vision and Image Understanding
Fusion of Feature- and Area-Based Information for Urban Buildings Modeling from Aerial Imagery
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part IV
IEEE Transactions on Neural Networks
DAISY: An Efficient Dense Descriptor Applied to Wide-Baseline Stereo
IEEE Transactions on Pattern Analysis and Machine Intelligence
Building Rome on a cloudless day
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part IV
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
Discriminative Learning of Local Image Descriptors
IEEE Transactions on Pattern Analysis and Machine Intelligence
Descriptor learning for efficient retrieval
ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III
LDAHash: Improved Matching with Smaller Descriptors
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Multimedia Retrieval Framework Based on Semi-Supervised Ranking and Relevance Feedback
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hamming embedding similarity-based image classification
Proceedings of the 2nd ACM International Conference on Multimedia Retrieval
Three things everyone should know to improve object retrieval
CVPR '12 Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
The power of comparative reasoning
ICCV '11 Proceedings of the 2011 International Conference on Computer Vision
Hi-index | 0.00 |
Structure-from-Motion reconstruction is to recover the 3 dimensional structure from 2 dimensional images. Recent research in this field demonstrates the ability to reconstruct cities based on images extracted from a photo collection website; SIFT feature is typically extracted to detect correspondences between images. For the reconstruction of large scale unsorted images, the system is required to store all features and points information in the memory to search for correspondences. As SIFT feature is a 128 dimensional real-valued vector, storing each descriptor would consume a significant amount of memory. Due to this limitation, we propose to project the high-dimensional feature into a lower-dimensional space by using a new learned projection matrix while still maintaining the property of the original features. Hence, the result of this projection will shorten the distance among descriptors of the same point while lengthening the distance among descriptors of different points. These projected descriptors use Hellinger distance for calculation of the similarity between features. Furthermore, we learn a mapping function, which will map the real-valued descriptor into binary code coping with the variation of correspondence searching method. Experiments demonstrate that our method achieve excellent results with limited memory requirement.