Sparse Over-complete Patch Matching
Akila Pemasiri, Kien Nguyen, Sridha Sridharan, Clinton Fookes

TL;DR
This paper introduces a novel patch matching method that leverages sparse over-complete representations of image patches, combined with neural networks, to improve matching accuracy over existing techniques.
Contribution
The paper proposes a new paradigm using sparse coding of image patches as input to neural networks, outperforming state-of-the-art methods on benchmark datasets.
Findings
Achieved new benchmark results on UBC patch datasets.
Outperformed all existing patch matching techniques on evaluated datasets.
Demonstrated the effectiveness of sparse over-complete representations for patch matching.
Abstract
Image patch matching, which is the process of identifying corresponding patches across images, has been used as a subroutine for many computer vision and image processing tasks. State -of-the-art patch matching techniques take image patches as input to a convolutional neural network to extract the patch features and evaluate their similarity. Our aim in this paper is to improve on the state of the art patch matching techniques by observing the fact that a sparse-overcomplete representation of an image posses statistical properties of natural visual scenes which can be exploited for patch matching. We propose a new paradigm which encodes image patch details by encoding the patch and subsequently using this sparse representation as input to a neural network to compare the patches. As sparse coding is based on a generative model of natural image patches, it can represent the patch in terms…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
