Abstract

We present a novel perspective on characterizing the spectral correspondence between nodes of the weighted graph with application to image registration. It is based on matrix perturbation analysis on the spectral graph. The contribution may be divided into three parts. Firstly, the perturbation matrix is obtained by perturbing the matrix of graph model. Secondly, an orthogonal matrix is obtained based on an optimal parameter, which can better capture correspondence features. Thirdly, the optimal matching matrix is proposed by adjusting signs of orthogonal matrix for image registration. Experiments on both synthetic images and real-world images demonstrate the effectiveness and accuracy of the proposed method.

© 2009 Chinese Optics Letters

PDF Article

References

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription