Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci., XL-5/W6, 9-12, 2015
http://www.int-arch-photogramm-remote-sens-spatial-inf-sci.net/XL-5-W6/9/2015/ doi:10.5194/isprsarchives-XL-5-W6-9-2015 © Author(s) 2015. This work is distributed under the Creative Commons Attribution 3.0 License. |

18 May 2015

Murom Institut Vladimir State University, CAD Department, , 602264, Orlovskaya 23, Murom, Russian Federation

Keywords: Image Recognition, Human Pose, Spectral Graph Matching Abstract. Recognition of human pose is an actual problem in computer vision. To increase the reliability of the recognition it is proposed to use structured information in the form of graphs. The spectrum of graphs is applied for the comparison of the structures. Image skeletonization is used to construct graphs. Line segments are the nodes of the graph. The end point of line segments are the edges of the graph. The angles between adjacent segments are used to set the weights of the adjacency matrix. The Laplacian matrix is used to generate the spectrum graph. The algorithm consists of the following steps. The graph on the basis of the vectorized image is constructed. The angles between the adjacent segments are calculated. The Laplacian matrix on the basis of the linear graph is calculated. The eigenvalues and eigenvectors of the Laplacian matrix are calculated. The spectral matrix is calculated using its eigenvalues and eigenvectors of the Laplacian matrix. The principal component method is used for the data representation in the space of smaller dimensions. The results of the algorithm are given.

Conference paper (PDF, 1292 KB)

BibTeX EndNote Reference Manager XML

Keywords: Image Recognition, Human Pose, Spectral Graph Matching Abstract. Recognition of human pose is an actual problem in computer vision. To increase the reliability of the recognition it is proposed to use structured information in the form of graphs. The spectrum of graphs is applied for the comparison of the structures. Image skeletonization is used to construct graphs. Line segments are the nodes of the graph. The end point of line segments are the edges of the graph. The angles between adjacent segments are used to set the weights of the adjacency matrix. The Laplacian matrix is used to generate the spectrum graph. The algorithm consists of the following steps. The graph on the basis of the vectorized image is constructed. The angles between the adjacent segments are calculated. The Laplacian matrix on the basis of the linear graph is calculated. The eigenvalues and eigenvectors of the Laplacian matrix are calculated. The spectral matrix is calculated using its eigenvalues and eigenvectors of the Laplacian matrix. The principal component method is used for the data representation in the space of smaller dimensions. The results of the algorithm are given.

Conference paper (PDF, 1292 KB)

**Citation:**Zakharov, A. A., Barinov, A. E., and Zhiznyakov, A. L.: RECOGNITION OF HUMAN POSE FROM IMAGES BASED ON GRAPH SPECTRA, Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci., XL-5/W6, 9-12, doi:10.5194/isprsarchives-XL-5-W6-9-2015, 2015.BibTeX EndNote Reference Manager XML