A new algorithm to get the correspondences from the image sequences

Authors:
Zhiquan Feng;Xiangxu Meng;Chenglei Yang
Affiliations:
,School of Computer Science and Technology, Shandong University, Jinan, Shandong, P.R. China;School of Computer Science and Technology, Shandong University, Jinan, Shandong, P.R. China;School of Computer Science and Technology, Shandong University, Jinan, Shandong, P.R. China
Venue:
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part II
Year:
2005

Citing 5
Cited 0

Feature-based image metamorphosis

SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Matching and motion estimation of three-dimensional point and line sets using eigenstructure without correspondences

Pattern Recognition
Self-Calibration and Metric Reconstruction Inspite of Varying and Unknown Intrinsic Camera Parameters

International Journal of Computer Vision - 1998 Marr Prize
3D modeling using a statistical sensor model and stochastic search

CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Disparity Analysis of Images

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Acquisition of the correspondences from the image sequences with high-efficiency and high-precision is a fundamental and key problem in computer virtual techniques and human-computer interaction systems. In this paper, we start from image topological structures, aiming firstly finding the correspondences between topological structures of the image sequences. Then, we further attain accurate correspondences between feature points by adopting local search methods. In order to speed up the search process for desired data, a grid technique is introduced and some new concepts, such as SQVSBS, and related theories are put forward. The specific characteristics of the algorithm are: (1) using the Top-to-Bottom strategy, from rough estimates to accurateness, from local to global; (2) getting better time complexity, O(Max(f2,A)), which is better than that that given in the references [11] and [12],here, f is the number of feature grids; (3) avoiding wrong matches deriving from local optical solutions; and (4) Focusing on the internal topological relationships between feature griddings upon which the characteristic of a feature gridding is based.