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.