参考文献:1. Forsyth, D.A., Ponce, J.: Computer Vision: A Modern Approach. Prentice Hall (2011) 2. Li, S.Z., Jain, A.K. (eds.): Handbook of Face Recognition, 2nd edn. Springer (2011) 3. Beis, J., Lowe, D.G.: Shape indexing using approximate nearest-neighbour search in high dimensional spaces. In: Conference on Computer Vision and Pattern Recognition, pp. 1000鈥?006 (1997) 4. Savchenko, A.V.: Directed enumeration method in image recognition. Pattern Recognition聽45(8), 2952鈥?961 (2012) CrossRef 5. Liu, T., Moore, A.W., Gray, A., Yang, K.: An Investigation of Practical Approximate Nearest Neighbor Algorithms. In: NIPS-2004, pp. 825鈥?32 (2004) 6. Kleinberg, J.: Two algorithms for nearest-neighbor search in high dimensions. In: Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 599鈥?08 (1997) 7. Novak, D., Zezula, P.: M-Chord: A Scalable Distributed Similarity Search Structure. In: Infoscale, pp. 149鈥?60 (2006) 8. Haghani, P., Michel, S., Aberer, K.: Distributed similarity search in high dimensions using locality sensitive hashing. In: EDBT 2009, pp. 744鈥?55 (2009) 9. Savchenko, A.V.: Face Recognition in Real-Time Applications: Comparison of Directed Enumeration Method and K-d Trees. In: Aseeva, N., Babkin, E., Kozyrev, O. (eds.) BIR 2012. LNBIP, vol.聽128, pp. 187鈥?99. Springer, Heidelberg (2012) CrossRef 10. Dalal, N., Triggs, B.: Histograms of Oriented Gradients for Human Detection. In: Conference on Computer Vision and Pattern Recognition, pp. 886鈥?93 (2005) 11. Savchenko, A.V.: Statistical Recognition of a Set of Patterns Using Novel Probability Neural Network. In: Mana, N., Schwenker, F., Trentin, E. (eds.) ANNPR 2012. LNCS, vol.聽7477, pp. 93鈥?03. Springer, Heidelberg (2012) CrossRef 12. Sneath, P., Sokal, R.: Numerical Taxonomy: The Principles and Practice of Numerical Classification. Freeman (1973)
作者单位:Andrey V. Savchenko (19)
19. National Research University Higher School of Economics, Nizhniy Novgorod, Russian Federation
文摘
The parallel computing algorithms are explored to improve the efficiency of image recognition with large database. The novel parallel version of the directed enumeration method (DEM) is proposed. The experimental study results in face recognition problem with FERET and Essex datasets are presented. We compare the performance of our parallel DEM with the original DEM and parallel implementations of the nearest neighbor rule and conventional Best Bin First (BBF) k-d tree. It is shown that the proposed method is characterized by increased computing efficiency (2-10 times in comparison with exhaustive search and the BBF) and lower error rate than the original DEM.