An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Computer Vision: A Modern Approach
Computer Vision: A Modern Approach
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Fast template matching using bounded partial correlation
Machine Vision and Applications
Fast normalized cross correlation for defect detection
Pattern Recognition Letters
Robust Real-Time Face Detection
International Journal of Computer Vision
Distinctive Image Features from Scale-Invariant Keypoints
International Journal of Computer Vision
Tracking news stories across different sources
Proceedings of the 13th annual ACM international conference on Multimedia
Scalable Recognition with a Vocabulary Tree
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
Scalability of local image descriptors: a comparative study
MULTIMEDIA '06 Proceedings of the 14th annual ACM international conference on Multimedia
Robust voting algorithm based on labels of behavior for video copy detection
MULTIMEDIA '06 Proceedings of the 14th annual ACM international conference on Multimedia
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Communications of the ACM - 50th anniversary issue: 1958 - 2008
Pagerank for product image search
Proceedings of the 17th international conference on World Wide Web
Evaluation of Stereo Matching Costs on Images with Radiometric Differences
IEEE Transactions on Pattern Analysis and Machine Intelligence
Evaluation of GIST descriptors for web-scale image search
Proceedings of the ACM International Conference on Image and Video Retrieval
Mining TV broadcasts for recurring video sequences
Proceedings of the ACM International Conference on Image and Video Retrieval
Efficient normalized cross correlation based on adaptive multilevel successive elimination
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part I
Proceedings of the international workshop on Very-large-scale multimedia corpus, mining and retrieval
A news video browser using identical video segment detection
PCM'04 Proceedings of the 5th Pacific Rim Conference on Advances in Multimedia Information Processing - Volume Part II
Content-Based Copy Retrieval Using Distortion-Based Probabilistic Similarity Search
IEEE Transactions on Multimedia
Near-Duplicate Keyframe Identification With Interest Point Matching and Pattern Learning
IEEE Transactions on Multimedia
A multilevel successive elimination algorithm for block matching motion estimation
IEEE Transactions on Image Processing
Fast Full-Search Equivalent Template Matching by Enhanced Bounded Correlation
IEEE Transactions on Image Processing
Hi-index | 0.10 |
This paper proposes new low-dimensional image features that enable images to be very efficiently matched. Image matching is one of the key technologies for many vision-based applications, including template matching, block motion estimation, video compression, stereo vision, image/video near-duplicate detection, similarity join for image/video database, and so on. Normalized cross correlation (NCC) is one of widely used method for image matching with preferable characteristics such as robustness to intensity offsets and contrast changes, but it is computationally expensive. The proposed features, derived by the method of Lagrange multipliers, can provide upper-bounds of NCC as a simple dot product between two low-dimensional feature vectors. By using the proposed features, NCC-based image matching can be effectively accelerated. The matching performance with the proposed features is demonstrated using an image database obtained from actual broadcast videos. The new features are shown to outperform other methods: multilevel successive elimination algorithm (MSEA), discrete cosine transform (DCT) coefficients, and histograms, achieving very high precision while only slightly sacrificing recall.