Low-rank partitioning sparse representation human face identifying method

A sparse representation and face recognition technology, applied in character and pattern recognition, instruments, computer parts, etc., can solve the problem that face recognition methods cannot effectively deal with face image occlusion, camouflage and illumination changes at the same time

Active Publication Date: 2014-03-12
NANJING UNIV OF INFORMATION SCI & TECH
View PDF3 Cites 43 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The technical problem to be solved by the present invention is: face recognition methods in the prior art cannot effectively deal with occlusion, camouflage and illumination changes in face imag

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Low-rank partitioning sparse representation human face identifying method
  • Low-rank partitioning sparse representation human face identifying method
  • Low-rank partitioning sparse representation human face identifying method

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0076] The technical scheme of the present invention will be further described in detail below in conjunction with the accompanying drawings:

[0077] First select the database you want to experiment, such as AR face database. The AR database contains 126 subjects and a total of 4000 face images. In the experiment, we select 50 subjects from male pictures, and randomly select 20 from each subject as training pictures to form the training matrix, and the other 6 as test pictures to form the test matrix.

[0078] Perform low-rank matrix decomposition on the training matrix, and apply the new low-rank algorithm proposed in the present invention to improve the incoherence between classes in the matrix.

[0079] The final objective function of the algorithm is expressed as:

[0080] min A i , E i | | A i | | * + λ 1 | | E i | | 1 + λ 2 | | A i - M i | | F 2 s . t . ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a low-rank partitioning sparse representation human face identifying method, which adopts low-rank matrix decomposition, introduces a reference item, adopts a DCT (discrete cosine transform) algorithm to realize the normalization of images and effectively solves the problem of uneven lighting in a human face image. At a classifying stage, a clustering thought is used, and the identifying speed is effectively improved. The algorithm is used on a standard human face database to perform multiple times of tests, and the test result shows that compared with the existing human face identifying method, the low-rank partitioning sparse representation human dace identifying method has the advantage that the identifying accuracy and computing efficiency of the algorithm are all consistently improved. The precision and stability on human face identifying are improved under the complex conditions, such as shielding, disguising and illumination varying, of the human face image.

Description

technical field [0001] The invention discloses a face recognition method with low-rank block sparse representation, and relates to the fields of image processing and pattern recognition. Background technique [0002] Face recognition is a popular research topic in the field of computer vision. It widely uses feature analysis algorithms, integrates computer image processing technology and biostatistics principles, and uses computer image processing technology to extract portrait feature points from videos. The principle of biostatistics is used to analyze and establish mathematical models, which has broad development prospects. For a robust face recognition algorithm, it is necessary to effectively deal with various challenges in face recognition such as face occlusion, camouflage, illumination changes, and image drift. [0003] Sparse coding is an emerging face recognition algorithm. It regards the face image to be recognized as a linear combination of all training images ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06K9/00G06K9/62
Inventor 胡昭华赵孝磊徐玉伟何军
Owner NANJING UNIV OF INFORMATION SCI & TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap