A study on the correlation coefficient matching algorithm of general digital stereo under the approximate epipolar line constraints

Author(s):  
Lijun Yang ◽  
Jingqun Wang ◽  
Susheng Chao ◽  
Donglai Jiao
2012 ◽  
Vol 433-440 ◽  
pp. 6190-6194
Author(s):  
Shuo Bo Xu ◽  
Di Shi Xu ◽  
Hua Fang

A new method for solving the stereo matching problem in the presence of large occlusion is presented. This method for stereo matching and occlusion detection is based on searching disparity point. In this paper, we suppose that a pair of epipolar-line images is a projection of a group of piece-wise straight lines on the left and right images respective. Therefore the disparity curve corresponding to a pair of epipolar-line images may be approximated by a group of piece-wise straight lines. Then the key of solving disparity curve is how to get the “characteristic points” on the group of piece-wise straight lines. Based on this view, we fetched out the conception “disparity point”, and three kinds of special disparity points are correctly corresponding to the “characteristic point”. By analyzing intensity property of a disparity point and its neighbor points, an approach which combines stepwise hypothesis-verification strategy with three constraint conditions is devised to extract the candidate disparity points from the epipolar images.


2013 ◽  
Vol 278-280 ◽  
pp. 764-770
Author(s):  
Xue Qi Sun ◽  
Ming Li Dong ◽  
Jun Wang

In order to realize the correspondence of feature points in the binocular dynamic vision measurement system, the two homologous images matching problem in the paper is studied. First of all, a method of strong space resection. The strong space resection optimizes the elements of exterior orientation, improves the precision, so as to improve the calculating precision of epipolar line. Secondly, an algorithm of multiple restriction matching which is for two homologous images matching of feature points has been introduced. This algorithm based on epipolar line constrain, increases the uniqueness constraint and double constraint, combined with the second match with disparity gradient constrain, finally get the correct matching relationship of feature points in two homologous images. The experimental results show that: this method for matching of binocular dynamic vision measurement system, can get 100% of the matching accuracy rate. And it would satisfy the need of binocular dynamic vision measurement system.


2019 ◽  
Vol 2 (2) ◽  
pp. 105
Author(s):  
Sayuti Rahman ◽  
Ulfa Sahira

Abstract - Biometrics is the study of automatic methods for recognizing humans based on one or more parts of the human body that are unique. One human characteristic that can be used is iris, iris features can be used as distinguishing characteristics with other individuals. The stage that the writer did to be able to recognize the iris pattern of someone's eye in a digital image was the pre-processing stage, the template saving stage and the matching stage. In this study the author applies the template matching method to store the image into a template image stored in the database and the algorithm correlation coefficient for the characteristic matching algorithm between template data and test data. The application is designed using the Matlab R2010a programming language. The results of testing 22 images obtained by the percentage of system success was 86.36%. Keywords - Iris, Template Matching, Correlation Coefficient


2014 ◽  
Vol 522-524 ◽  
pp. 1166-1170
Author(s):  
Ai Hua Xu ◽  
An Tao ◽  
Jia Jing Zhuo ◽  
Lan Qiong Sun

The characteristic points matching is the hot point in the aerial images processing. The matching algorithm of characteristic points based on epipolar line was put forward according to the characteristics of aerial images. This algorithm overcomes some problems in the process of image sampling, solves the matching problem of untextured regions better, and deletes the dissimilarity points, shortens the calculation time greatly as well.


Sign in / Sign up

Export Citation Format

Share Document