International Journal of Computer
Trends and Technology

Research Article | Open Access | Download PDF

Volume 3 | Issue 2 | Year 2012 | Article Id. IJCTT-V3I2P103 | DOI : https://doi.org/10.14445/22312803/IJCTT-V3I2P103

Face Comparison Using PSO Algorithm

Dr.A.V.Senthilkumar, J.Savitha

Citation :

Dr.A.V.Senthilkumar, J.Savitha, "Face Comparison Using PSO Algorithm," International Journal of Computer Trends and Technology (IJCTT), vol. 3, no. 2, pp. 211-214, 2012. Crossref, https://doi.org/10.14445/22312803/ IJCTT-V3I2P103

Abstract

It is used specially for the compression of images where tolerable degradation is required. With the wide use of computers and consequently need for large scale storage and transmission of data, efficient ways of storing of data have become necessary. With the growth of technology and entrance into the Digital Age, the world has found itself amid a vast amount of information. Dealing with such enormous information can often present difficulties. Image compression is minimizing the size in bytes of a graphics file without degrading the quality of the image to an unacceptable level. The reduction in file size allows more images to be stored in a given amount of disk or memory space. It also reduces the time required for images to be sent over the Internet or downloaded from Web pages.JPEG and JPEG 2000 are two important techniques used for image compression. JPEG image compression standard use DCT (DISCRETE COSINE TRANSFORM). The discrete cosine transform is a fast transform. It is a widely used and robust method for image compression. It has excellent compaction for highly correlated data.DCT has fixed basis images DCT gives good compromise between information packing ability and computational complexity.

Keywords

Put your keywords here, keywords are separated by comma.

References

[1] J. Kennedy and R. Eberhart, Particle Swarm Optimization. Proceedings of the IEEE International Conference on Neural Networks, vol. 6, pp. 1942–1948, Piscataway, NJ, December 1995.
[2] J. Kennedy and R. C. Eberhart. A Discrete Binary Version the Particle Swarm Algorithm.Proc. IEEEInternational Conference on Systems, Man, and Cybernetics, vol. 5, pp. 4104-4108, Oct. 1997.   
[3] W. Zhao, R. Chellappa, P. J. Phillips  and A. Rosenfeld. Face recognition: A literature survey. ACM Computing Surveys, 35(4):399–458, 2003. 
[4] Gregory Shakhnarovich and Baback Moghaddam. Face recognition in subspaces. Technical Report TR2004-41, Mitsubishi Electric Research  Laboratories, 201 Broadway, Cambridge, Massachusetts 02139, 2004. 
[5] A. S. Tolba, A.H. El-Baz, and A.A. El-Harby. Face Recognition: A Literature Review. International Journal ofSignal Processing, vol. 2, no. 2, pp. 88-103. 2006
[6] Rabab M. Ramadan and Rehab F. Abdel Kader. Face Recognition using Particle Swarm Optimization-based selected features. International Journal of Signal Processing, Image Processing and Pattern Recognition, 2(2):51-66, 2009. 
[7] Ziad M. Hafed and Martin D. Levine. Face Recognition using the Discrete Cosine Transform. International Journal of ComputerVision, 43(3):167–188, 2001.  
[8] F. M. Matos, L. V. Batista, and J. Poel. Face Recognition Using DCT Coefficients Selection. Proc. of the 2008 ACM Symposium on Applied Computing, (SAC’08),pp. 1753-1757, March 2008.  
[9] Dr H B Kekre, Tanuja Sarode, Prachi Natu and Shachi Natu. Performance comparison of Face Recognition using DCT against Face Recognition using Vector Quantization Algorithms LBG, KPE, KMGC, KFCG. International Journal Of Image Processing, 4(3):377–389,2010.