Improved DSP matching with RPCA for dense correspondences

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Deformable Spatial Pyramid (DSP) matching method is popular for dense matching of images with different scenes but sharing similar semantic content, which achieves high matching accuracy. However, the warped image generated by DSP is not smooth, which mainly results from the noisy flow field by DSP. We observed the flow field could be decomposed into a low-rank term and a sparse term. Meanwhile, Robust Principle Component Analysis (RPCA) is capable of recovering the low-rank component from an observation with sparse noises. So, in this paper we propose to use RPCA to deal with the non-smoothness in DSP by recovering the low-rank term from the flow field. Experiments on VGG and LMO datasets verify that our approach obtains smoother warped image and gains higher matching accuracy than the DSP.

Cite

CITATION STYLE

APA

Shi, F., & Zhang, Y. (2016). Improved DSP matching with RPCA for dense correspondences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9730, pp. 377–384). Springer Verlag. https://doi.org/10.1007/978-3-319-41501-7_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free