کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
533733 870161 2015 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Fast nearest neighbor searching based on improved VP-tree
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
Fast nearest neighbor searching based on improved VP-tree
چکیده انگلیسی


• A novel nearest neighbor searching framework is proposed.
• PCA is adopted to optimize the VP-tree structure for efficiency improvement.
• A novel approach to controlling the pruning conditions of VP-tree is developed.
• A completely eliminating redundancy method CERM is specially designed.

Nearest neighbor searching is an important issue in both pattern recognition and image processing. However, most of the previous methods suffer from high computational complexity, restricting nearest neighbor searching from practical applications. This paper proposes a novel fast nearest neighbor searching method by combining improved VP-tree and PatchMatch method. PCA (Principal Component Analysis) method is employed to optimize the VP-tree so as to improve the searching speed. We also design an approach to controlling the pruning conditions of VP-tree which further improves the searching efficiency. A thorough redundancy elimination method on GPU is also developed, with a satisfactory independent-of-the-patch-size computational complexity. Various experiments show that our new method achieves a better balance between computational efficiency and memory requirements, while also improves the searching accuracy somehow, with great potential for practical real-time applications.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Pattern Recognition Letters - Volumes 60–61, 1 August 2015, Pages 8–15
نویسندگان
, ,