Skip to main content
SpringerLink
Log in

Pattern recognition and increasing of the computational efficiency of a parallel realization of the probabilistic neural network with homogeneity testing

  • Published:
Optical Memory and Neural Networks Aims and scope Submit manuscript

Abstract

The research subject is the computational complexity of the probabilistic neural network (PNN) in the pattern recognition problem for large model databases. We examined the following methods of increasing the efficiency of a neural-network classifier: a parallel multithread realization, reducing the PNN to a criterion with testing of homogeneity of feature histograms of input and reference images, approximate nearest-neighbor analyses (Best-Bin First, directed enumeration methods). The approach was tested in facial-recognition experiments with FERET dataset.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bishop, C., Neural Networks for Pattern Recognition, Oxford University Press, 1996, p. 504.

    MATH  Google Scholar 

  2. Forsyth, D.A. and Ponce, J., Computer Vision: A Modern Approach, Pearson Education, Prentice Hall, 2011, p. 792.

    Google Scholar 

  3. Lapko, A.V. and Lapko, V.A., Nonparametric pattern recognition systems in the conditions of large learning samples, Pattern Recognition and Image Analysis, (Advances in Mathematical Theory and Applications), 2010, vol. 20, no. 2, pp. 129–136.

    Google Scholar 

  4. Specht, D.F., Probabilistic neural networks, Neural Networks, 1990, vol. 3. no. 1, pp. 109–118.

    Article  Google Scholar 

  5. Savchenko, A.V., Statistical Recognition of a Set of Patterns Using Novel Probability Neural Network (Proc. of Int. Conf. ANNPR’12 LNCS), 2012, vol. 7477, pp. 93–103.

    Google Scholar 

  6. Borovkov, A.A., Mathematical Statistics: Additional Chapters, Nauka, 1984, p. 144.

    Google Scholar 

  7. Cortes, C. and Vapnik, V.N., Support-vector networks, Machine Learning, 1995, vol. 20, no. 3, pp. 273–297.

    MATH  Google Scholar 

  8. Borisov, E.S., Using the language MC# for the implementation of a parallel pattern classifier, Cybernetics and Systems Analysis, 2005, vol. 41, no. 3, pp. 468–472.

    Article  MATH  Google Scholar 

  9. Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., and Wu, A.Y., An optimal algorithm for approximate nearest neighbor searching, Journal of the ACM, 1998, vol. 45, pp. 891–923.

    Article  MathSciNet  MATH  Google Scholar 

  10. Beis, J. and Lowe, D.G., Shape indexing using approximate nearest-neighbour search in high dimensional spaces (Proc. of Int. Conf. on Computer Vision and Pattern Recognition), 1997, pp. 1000–1006.

    Google Scholar 

  11. Savchenko, A.V., Directed enumeration method in image recognition, Pattern Recognition, 2012, vol. 45, no. 8, pp. 2952–2961.

    Article  Google Scholar 

  12. Savchenko, A.V., Probabilistic neural network with homogeneity testing in recogntion of discrete patterns set, Neural Networks, 2013, vol. 46, pp. 227–241. doi: 10.1016/j.neunet.2013.06.003

    Article  Google Scholar 

  13. Savchenko, A.V., Adaptive video image recognition system using a committee machine, Optical Memory and Neural Networks (Information Optics), 2012, vol. 21, no. 4, pp. 219–226.

    Article  Google Scholar 

  14. Cleary, J.G., Analysis of an algorithm for finding nearest neighbors in Euclidean space, ACM Transactions on Mathematical Software, 1979, vol. 5, no. 2, pp. 183–192.

    Article  MathSciNet  MATH  Google Scholar 

  15. Savchenko, A.V., Real-time image recognition with the parallel directed enumeration method (Proc. of Int. Conf. ICVS 2013 LNCS), 2013, vol. 7963, pp. 123–132.

    Google Scholar 

  16. Savchenko, A.V., Image recognition on the basis of probabilistic neural network with homogeneity testing, Computer Optics, 2013, vol. 37, no. 2, pp. 255–263.

    MathSciNet  Google Scholar 

  17. Kullback, S., Information Theory and Statistics, New York: Dover Pub., 1997, p. 399.

    MATH  Google Scholar 

  18. Malkov, Y., Ponomarenko, A., Logvinov, A., and Krylov, V., Scalable distributed algorithm for approximate nearest neighbor search problem in high dimensional general metric spaces (Proc. of Int. Conf SISAP’12 LNCS), 2012, vol. 7404, pp. 132–147.

    Google Scholar 

  19. Bentley, J.L., Weide, B.W., and Yao, A.C., Optimal expected-time algorithms for closest point problems, ACM Transactions on Mathematical Software, 1980, vol. 6, no. 4, pp. 563–580.

    Article  MathSciNet  MATH  Google Scholar 

  20. Batko, M., Gennaro, C., and Zezula, P., Similarity Grid for Searching in Metric Spaces (Proc. of Int. Conf. DELOS LNCS), 2005, vol. 3664, pp. 25–44.

    Google Scholar 

  21. Beaumont, O., Kermarrec, A.-M., Marchal, L., and Riviere, E., VoroNet: A scalable object network based on Voronoi tessellations (Proc. of Int. Symposium Parallel and Distributed Processing), 2007, pp. 1–10.

    Google Scholar 

  22. Savchenko, A.V., Face Recognition in Real-Time Applications: Comparison of Directed Enumeration Method and K-d Trees (Proc. of Int. Conf. BIR’12 LNBIP), 2012, vol. 128, pp. 187–199.

    Google Scholar 

  23. Chellappa, R., Du, M., Turaga, P., and Zhou, S.K., Face tracking and recognition in video, Handbook of Face Recognition, 2011, pp. 323–351.

    Chapter  Google Scholar 

  24. The FERET dataset, http://www.itl.nist.gov/iad/humanid/feret/feret-master.html

  25. Dalal, N. and Triggs, B., Histograms of Oriented Gradients for Human Detection. Proceedings (Proc. of Int. Conf. on Computer Vision & Pattern Recognition), 2005, pp. 886–893.

    Google Scholar 

  26. Lowe, D., Distinctive image features from scale-invariant keypoints, International Journal of Computer Vision, 2004, vol. 60, no. 2, pp. 91–110.

    Article  Google Scholar 

  27. Tuytelaars, T. and Mikolajczyk, K., Local invariant feature detectors: A Survey, Foundations and Trends in Computer Graphics and Vision, 2007, vol. 3, no. 3, pp. 177–280.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Business Informatics and Applied Mathematics Department, National Research University Higher School of Economics, Nizhny Novgorod, Russia

    A. V. Savchenko

Authors
  1. A. V. Savchenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Savchenko.

About this article

Cite this article

Savchenko, A.V. Pattern recognition and increasing of the computational efficiency of a parallel realization of the probabilistic neural network with homogeneity testing. Opt. Mem. Neural Networks 22, 184–192 (2013). https://doi.org/10.3103/S1060992X13030090

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1060992X13030090

Keywords

Search

Navigation