What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
- 1 January 2008
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Scene completion using millions of photographsACM Transactions on Graphics, 2007
- Distinctive Image Features from Scale-Invariant KeypointsInternational Journal of Computer Vision, 2004
- Example-based super-resolutionIEEE Computer Graphics and Applications, 2002
- Searching in metric spacesACM Computing Surveys, 2001
- An optimal algorithm for approximate nearest neighbor searching fixed dimensionsJournal of the ACM, 1998
- A simple algorithm for nearest neighbor search in high dimensionsIeee Transactions On Pattern Analysis and Machine Intelligence, 1997
- Refinements to nearest-neighbor searching ink-dimensional treesAlgorithmica, 1991
- An Algorithm for Vector Quantizer DesignIEEE Transactions on Communications, 1980
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Analysis of a complex of statistical variables into principal components.Journal of Educational Psychology, 1933