Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Feature Extraction via Balanced Average Neighborhood Margin Maximization

  • Conference paper
Neural Information Processing (ICONIP 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7063))

Included in the following conference series:

  • 2638 Accesses

Abstract

Average Neighborhood Margin Maximization (ANMM) is an effective method for feature extraction, especially for addressing the Small Sample Size (SSS) problem. For each specific training sample, ANMM enlarges the margin between itself and its neighbors which are not in its class (heterogeneous neighbors), meanwhile keeps this training sample and its neighbors which belong to the same class (homogeneous neighbor) as close as possible. However, these two requirements are sometimes conflicting in practice. For the purpose of balancing these conflicting requirements and discovering the side information for both the homogeneous neighborhood and the heterogeneous neighborhood, we propose a new type of ANMM in this paper, called Balance ANMM (BANMM). The proposed algorithm not only can enhance the discriminative ability of ANMM, but also can preserve the local structure of training data. Experiments conducted on three well-known face databases i.e. Yale, YaleB and CMU PIE demonstrate the proposed algorithm outperforms ANMM in all three data sets.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Jolliffe, I.: Principal Component Analysis. Springer, New York (1986)

    Book  MATH  Google Scholar 

  2. Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification. Wiley, New York (2001)

    MATH  Google Scholar 

  3. Belhumeur, P.N., Hespanha, J.P., Kriegman, D.J.: Eigenfaces vs. fisherfaces: Recognition using class specific linear projection. IEEE Trans. on Pattern Analysis and Machine Intelligence 19(7), 711–720 (1997)

    Article  Google Scholar 

  4. Chen, L.F., Liao, H.Y.M., Ko, M.T., Lin, J.C., Yu, G.J.: A new LDA-based face recognition system which can solve the small sample size problem. Pattern Recognition 33(10), 1713–1726 (2000)

    Article  Google Scholar 

  5. Wang, F., Zhang, C.: Feature extraction by maximizing the average neighborhood margin. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–8 (2007)

    Google Scholar 

  6. Turk, M., Pentland, A.: Eigenfaces for recognition. Journal of Cognitive Neuroscience 3(1), 71–86 (1991)

    Article  Google Scholar 

  7. Wang, X., Tang, X.: A unified framework for subspace face recognition. IEEE Trans on Pattern Analysis and Machine Intelligence 26(9), 1222–1228 (2004)

    Article  Google Scholar 

  8. Wang, X., Tang, X.: Dual-space linear discriminant analysis for face recognition. In: IEEE Conference on Computer Vision and Pattern Recognition (2004)

    Google Scholar 

  9. Liu, C., Wechsler, H.: Gabor feature based classification using the enhanced fisher linear discriminant model for face recognition. IEEE Trans on Image Processing 11(4), 467–476 (2002)

    Article  Google Scholar 

  10. Li, H., Jiang, T., Zhang, K.: Efficient and robust feature extraction by maximum margin criterion. IEEE Trans. on Neural Networks 17(1), 157–165 (2006)

    Article  Google Scholar 

  11. Lu, J., Plataniotis, K.N., Venetsanopoulos, A.N.: Face recognition using LDA-based algorithms. IEEE Trans. on Neural Networks 14(1), 195–200 (2003)

    Article  Google Scholar 

  12. He, X., Niyogi, P.: Locality preserving projections (lpp). In: Advances in Neural Information Processing Systems (2003)

    Google Scholar 

  13. He, X., Yan, S., Hu, Y., Niyogi, P., Zhang, H.J.: Face recognition using laplacianfaces. IEEE Trans on Pattern Analysis and Machine Intelligence 27(3), 328–340 (2005)

    Article  Google Scholar 

  14. Zhao, W., Chellappa, R., Krishnaswamy, A.: Discriminant analysis of principal components for face recognition. In: IEEE International Conference on Automatic Face and Gesture Recognition, pp. 336–341 (1998)

    Google Scholar 

  15. Qiu, X., Wu, L.: Face recognition by stepwise nonparametric margin maximum criterion. In: IEEE International Conference on Computer Vision (2005)

    Google Scholar 

  16. Yan, S., Xu, D., Zhang, B., Zhang, H.J.: Graph embedding: A general framework for dimensionality reduction. In: IEEE Conference on Computer Vision and Pattern Recognition (2005)

    Google Scholar 

  17. Xing, E.P., Ng, A.Y., Jordan, M.I., Russell, S.: Distance metric learning with application to clustering with side-information. In: Advances in Neural Information Processing Systems (2003)

    Google Scholar 

  18. Weinberger, K.Q., Blitzer, J., Saul, L.K.: Distance metric learning for large margin nearest neighbor classification. In: Advances in Neural Information Processing Systems (2006)

    Google Scholar 

  19. Kohavi, R.: A study of cross-validation and bootstrap for accuracy estimation and model selection. In: International joint Conference on artificial intelligence, pp. 1137–1145 (1995)

    Google Scholar 

  20. Devijver, P.A., Kittler, J.: Pattern recognition: A statistical approach. Prentice-Hall, London (1982)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, X., Liu, W., Lai, J., Fan, K. (2011). Feature Extraction via Balanced Average Neighborhood Margin Maximization. In: Lu, BL., Zhang, L., Kwok, J. (eds) Neural Information Processing. ICONIP 2011. Lecture Notes in Computer Science, vol 7063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24958-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24958-7_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24957-0

  • Online ISBN: 978-3-642-24958-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics