Informatics Publishing Limited

Atinderpal Singh ¹, Navmeet Kaur ¹, Jasmeet Kaur ¹

Affiliations
1 Department of CSE, GZSPTU Campus, Bathinda, IN

Abstract

Face recognition has received considerable attention recently, as a promising approach for security and surveillance. Face recognition have the challenges of the light illumination and variations in the poses in various fields. The main aim of this work is to find out the optimum approach which can be used against these challenges and to study various approaches. The problems comes in the various algorithms are also defined and how these problems are resolved by using the new approaches. In this paper the different types of face recognition approaches and the various performance matrices for face recognition on the basis of different parameters have been discussed.

Keywords

Face Recognition, 2DPCA, PCA, LBP, LDP.

Full Text

   

Neha Sharma , Jasmeet Kaur , Navmeet Kaur

Abstract

Compression algorithms reduce the redundancy in data representation thus increasing effective data density. Data compression is a very useful technique that helps in reducing the size of text data and storing the same amount of data in relatively fewer bits resulting in reducing the data storage space, resource usage or transmission capacity. There are a number of techniques that have been used for text data compression which can be categorized as Lossy and Lossless data compression techniques. In this paper, various lossless data compression techniques have been reviewed that are in use such as Run Length Encoding, Burrows- wheeler transform, Shannon-Fano coding, Huffman coding, Arithmetic coding, Lempel-Ziv Welch and Bit-Reduction algorithm.

Keywords

Text Data Compression, Lossless Compression, Huffman Coding, Arithmetic Coding, Bit Reduction.

Full Text