Article Fingerprint
ReserarchID
1BE6U
This paper presents a novel idea for implementing face recognition system in compressed domain. A major advantage of the proposed approach is the fact that face recognition systems can directly work with JPEG and JPEG2000 compressed images, i.e. it uses directly the entropy points provided by the compression standards as input without any necessity of completely decompressing the image before recognition. The Kd-tree technique is used in the proposed approach for the matching of the images. This algorithm shows improvement in reducing the computational time of the overall approach. This proposed method significantly improves the recognition rates while greatly reducing computational time and storage requirements.
Dr. Menila James. 1970. \u201cFace Recognition in compressed domain based on wavelet transform and kd-tree matching\u201d. Unknown Journal GJCST Volume 11 (GJCST Volume 11 Issue 10): .
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 132
Country: Oman
Subject: Uncategorized
Authors: Dr. Menila James, Dr. S.Arockiasamy (PhD/Dr. count: 2)
View Count (all-time): 119
Total Views (Real + Logic): 20162
Total Downloads (simulated): 10995
Publish Date: 1970 01, Thu
Monthly Totals (Real + Logic):
This paper attempted to assess the attitudes of students in
Advances in technology have created the potential for a new
Inclusion has become a priority on the global educational agenda,
This paper presents a novel idea for implementing face recognition system in compressed domain. A major advantage of the proposed approach is the fact that face recognition systems can directly work with JPEG and JPEG2000 compressed images, i.e. it uses directly the entropy points provided by the compression standards as input without any necessity of completely decompressing the image before recognition. The Kd-tree technique is used in the proposed approach for the matching of the images. This algorithm shows improvement in reducing the computational time of the overall approach. This proposed method significantly improves the recognition rates while greatly reducing computational time and storage requirements.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.