Feature-based correspondence: an eigenvector approach
Image and Vision Computing - Special issue: BMVC 1991
An Eigenspace Projection Clustering Method for Inexact Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Distinctive Image Features from Scale-Invariant Keypoints
International Journal of Computer Vision
A Spectral Technique for Correspondence Problems Using Pairwise Constraints
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
IEEE Transactions on Pattern Analysis and Machine Intelligence
Negative Samples Analysis in Relevance Feedback
IEEE Transactions on Knowledge and Data Engineering
Image alignment and stitching: a tutorial
Foundations and Trends® in Computer Graphics and Vision
Geometric Mean for Subspace Selection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Deterministic Column-Based Matrix Decomposition
IEEE Transactions on Knowledge and Data Engineering
Image annotation by kNN-sparse graph-based label propagation over noisily tagged web images
ACM Transactions on Intelligent Systems and Technology (TIST)
Signal Processing
Max-Min Distance Analysis by Using Sequential SDP Relaxation for Dimension Reduction
IEEE Transactions on Pattern Analysis and Machine Intelligence
Manifold elastic net: a unified framework for sparse dimension reduction
Data Mining and Knowledge Discovery
Efficient image matching using weighted voting
Pattern Recognition Letters
Image Annotation by Graph-Based Inference With Integrated Multiple/Single Instance Representations
IEEE Transactions on Multimedia
Gabor-Based Region Covariance Matrices for Face Recognition
IEEE Transactions on Circuits and Systems for Video Technology
Robust Tensor Analysis With L1-Norm
IEEE Transactions on Circuits and Systems for Video Technology
Non-Negative Patch Alignment Framework
IEEE Transactions on Neural Networks
Manifold Regularized Discriminative Nonnegative Matrix Factorization With Fast Gradient Descent
IEEE Transactions on Image Processing
SCoBeP: Dense image registration using sparse coding and belief propagation
Journal of Visual Communication and Image Representation
Correspondence construction for cartoon animation via sparse coding
Proceedings of the Fifth International Conference on Internet Multimedia Computing and Service
| Hi-index | 0.01 |
Due to limited computational resource, image matching on mobile phone places great demand on efficiency and scale invariant. Though spectral matching (SM) with pairwisely geometric constraints is widely used in matching, it is not efficient and scale invariant for applications in mobile phones. The main factor that limits its efficiency is that it requires to eign-decomposition of a large affinity matrix when the number of candidate correspondences is large. It lacks scale invariance because the pairwise constraints cannot hold when large scale variation occurs. In this paper, we attempt to tackle these problems. In the proposed method, each candidate correspondence is considered as a voter and a candidate as well. As a voter it gives voting scores to other candidates and also votes itself. Based on the voting scores, the optimal correspondences are computed by simple addition operations and ranking operations, which results in high efficiency. To make the proposed method scale invariant, we propose a novel triple-wisely geometric constraint formed by three potential correspondences with one being the candidate and the other two being voters. The three correspondences constitute a pair of triangles. The similarity of the two triangles is the core of the triple-wisely constraint, which is robust to scale variation. The information of triple-wise constraints are encoded in a 3-dimensional matrix from which the optimal correspondence can be obtained by simple summation and ranking operations. Experimental results on real-data show the effectiveness and efficiency of the proposed method.