Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Collection
For ¥0.57 per day, unlimited downloads CREATE MEMBERSHIP Download

toTop

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

home > search >

Author:
Jun Tang   Dong Liang   Nian Wang    Yi zheng Fan  


Journal:
Pattern Recognition Letters


Issue Date:
2007


Abstract(summary):

This paper presents a novel algorithm of stereo correspondence by using Laplacian spectra of graphs. Firstly, according to the feature points of two images to be matched, a Laplacian matrix with Gaussian-weighted distance is defined and a closed-form solution is given in terms of the matching matrix constructed on the vectors of eigenspace of the Laplacian matrix. Secondly, we introduce a new method to judge correspondences by using doubly stochastic matrix. Thirdly, in order to render our method robust, we describe an approach to embedding the Laplacian spectral method within the framework of iterative correspondence and transformation estimation. Experimental results show the feasibility and comparatively high accuracy of our methods.


Page:
1391-1399


VIEW PDF

The preview is over

If you wish to continue, please create your membership or download this.

Create Membership

Similar Literature

Submit Feedback

This function is a member function, members do not limit the number of downloads