Share Email Print

Proceedings Paper

SubPatch: random kd-tree on a sub-sampled patch set for nearest neighbor field estimation
Author(s): Fabrizio Pedersoli; Sergio Benini; Nicola Adami; Masahiro Okuda; Riccardo Leonardi
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

We propose a new method to compute the approximate nearest-neighbors field (ANNF) between image pairs using random kd-tree and patch set sub-sampling. By exploiting image coherence we demonstrate that it is possible to reduce the number of patches on which we compute the ANNF, while maintaining high overall accuracy on the final result. Information on missing patches is then recovered by interpolation and propagation of good matches. The introduction of the sub-sampling factor on patch sets also allows for setting the desired trade off between accuracy and speed, providing a flexibility that lacks in state-of-the-art methods. Tests conducted on a public database prove that our algorithm achieves superior performance with respect to PatchMatch (PM) and Coherence Sensitivity Hashing (CSH) algorithms in a comparable computational time.

Paper Details

Date Published: 14 February 2015
PDF: 5 pages
Proc. SPIE 9445, Seventh International Conference on Machine Vision (ICMV 2014), 944514 (14 February 2015); doi: 10.1117/12.2180577
Show Author Affiliations
Fabrizio Pedersoli, Univ. of Brescia (Italy)
Sergio Benini, Univ. of Brescia (Italy)
Nicola Adami, Univ. of Brescia (Italy)
Masahiro Okuda, Univ. of Kitakyushu (Japan)
Riccardo Leonardi, Univ. of Brescia (Italy)

Published in SPIE Proceedings Vol. 9445:
Seventh International Conference on Machine Vision (ICMV 2014)
Antanas Verikas; Branislav Vuksanovic; Petia Radeva; 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?