HVS Based Face Recognition Using Slant Transform
-
2018-09-01 https://doi.org/10.14419/ijet.v7i3.34.19215 -
Slant Transform, HVS, Sub Blocks. -
Abstract
There are many person identification technologies like password, PIN, key, and token are used in many applications. Present, popular identification technology is face. In many applications the database is large. Hence, recognition with high speed is major challenge. This paper presents a recognition using HVS features in transform domain. Human visual system identifies perceptual important information in the images. Slant transform basis vector is sawtooth. It efficiently represents linear brightness variations along an image line. Hence, in this work HVS features in slant transform domain is explored for face recognition. Feature vector is based on HVS parameters. In this method image is decomposed into subblocks using Slant Transform. Important elements are identified using HVS weightage. Experiments are performed on bench mark face databases. Proposed method has better recognition performance than existing methods. Retrieval time is also less.
Â
Â
-
References
[1] zheng-xin hou et al,†Fast slant transform with sequency increment and its Application in image compression'â€, Proceedmgs of the Third International Conference on Machine Learning and Cybemetics, Shanghai, 26-29 August 2004, pp 4085-4089
[2] .Sudeep D. Thepade, Vandana Mhaske, Vedant Kurhade†New Clustering Algorithm for Vector Quantization using Slant Transform, proceedings by ICETACS 2013 and published by IEEE,pp-161-166.
[3] Anthony T. S. Ho et al,“Slant transform watermarking for textured images†proceedings by ISCAS 2004,pp-V-700-704
[4] Cheng-Tao Hsieh a, Jeu-Min Lin b, Shyh-Jier Huang “Slant transform applied to electric power quality detection with field programmable gate array design enhancedâ€, Electrical Power and Energy Systems 32 (2010) 428–432. pp- 428-432
[5] Sos Agaian, Khaled Tourshan, Joseph P. Noonan “Generalized parametric Slant–Hadamard transformâ€, Signal Processing 84 (2004) 1299 – 1306.
[6] Bernard j. fino et al,, Slant Haar Transform, (1973) pp-653-654
[7] http://cvc.yale.edu/projects/yalefaces/yalefaces.html.
[8] A. Gnativ†orthogonal transforms in bases of slant step functions methods of generating orthogonal slant transforms with fast algorithms†Cybernetics and Systems Analysis, Vol. 41, No. 4, 2005,pp-576-586.
[9] William k. pratt, “Slant Transform Image Coding†Vision Res. 37 (23) pp-1075-1093.
[10] K.Veeraswamy , B.Chandra Mohan, S.Srinivas Kumar “HVS based Robust Image Watermarking Scheme using Slant Transformâ€, proceedings by international conference on digital image processing, Singapore.2010
[11] Zhong-de wang “New Algorithm for the Slant Transform†IEEE transactions on pattern analysis and machine intelligence, vol. pami-4, no. 5, september 1982.
[12] Laurent Galluccio et al,. Clustering with a new distance measure based on a dual-rooted tree. Information Sciences 251 (2013) pp. 96–113.
[13] Jiho han, “Comparison of distance measure on fuzzy means algorithms†AASRI Procedia 4 ( 2013 ) 50 – 56.
[14] David Koloseni,Jouni Lampinen, Pasi Luukka. “Differential evolution based nearest prototype classifier with optimized distance measures for the features in the data setsâ€. Expert Systems with Applications 40 (2013) 4075–4082
[15] Jiye Liang, Ru Li, Yuhua Qianâ€Distance: A more comprehensible perspective for measures in rough set theory†Knowledge-Based Systems 27 (2012) 126–136
[16] Donghui Wang, XikuiWang, Shu Kong “Integration of multi-feature fusion and dictionary learning for face recognition. Image and Vision Computing 31 (2013) 895–904.
[17] Ningbo Zhu et al,A sparse representation method based on kernel and virtual samplesfor face recognition Optik 124 (2013) 6236– 6241
-
Downloads
-
How to Cite
Veearaswamy, K., Koteswara Rao, M., Anithasheela, K., & Himabindu, C. (2018). HVS Based Face Recognition Using Slant Transform. International Journal of Engineering & Technology, 7(3.34), 313-315. https://doi.org/10.14419/ijet.v7i3.34.19215Received date: 2018-09-07
Accepted date: 2018-09-07
Published date: 2018-09-01