Share Email Print

Proceedings Paper

Graphic matching based on shape contexts and reweighted random walks
Author(s): Mingxuan Zhang; Dongmei Niu; Xiuyang Zhao; Mingjun Liu
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Graphic matching is a very critical issue in all aspects of computer vision. In this paper, a new graphics matching algorithm combining shape contexts and reweighted random walks was proposed. On the basis of the local descriptor, shape contexts, the reweighted random walks algorithm was modified to possess stronger robustness and correctness in the final result. Our main process is to use the descriptor of the shape contexts for the random walk on the iteration, of which purpose is to control the random walk probability matrix. We calculate bias matrix by using descriptors and then in the iteration we use it to enhance random walks’ and random jumps' accuracy, finally we get the one-to-one registration result by discretization of the matrix. The algorithm not only preserves the noise robustness of reweighted random walks but also possesses the rotation, translation, scale invariance of shape contexts. Through extensive experiments, based on real images and random synthetic point sets, and comparisons with other algorithms, it is confirmed that this new method can produce excellent results in graphic matching.

Paper Details

Date Published: 13 April 2018
PDF: 7 pages
Proc. SPIE 10696, Tenth International Conference on Machine Vision (ICMV 2017), 106960N (13 April 2018); doi: 10.1117/12.2309949
Show Author Affiliations
Mingxuan Zhang, Univ. of Jinan (China)
Dongmei Niu, Univ. of Jinan (China)
Xiuyang Zhao, Univ. of Jinan (China)
Mingjun Liu, Univ. of Jinan (China)

Published in SPIE Proceedings Vol. 10696:
Tenth International Conference on Machine Vision (ICMV 2017)
Antanas Verikas; Petia Radeva; Dmitry Nikolaev; Jianhong Zhou, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?