CN104318261B - A kind of sparse representation face identification method representing recovery based on figure embedding low-rank sparse - Google Patents
A kind of sparse representation face identification method representing recovery based on figure embedding low-rank sparse Download PDFInfo
- Publication number
- CN104318261B CN104318261B CN201410607957.2A CN201410607957A CN104318261B CN 104318261 B CN104318261 B CN 104318261B CN 201410607957 A CN201410607957 A CN 201410607957A CN 104318261 B CN104318261 B CN 104318261B
- Authority
- CN
- China
- Prior art keywords
- matrix
- training sample
- identified
- data
- class
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V30/00—Character recognition; Recognising digital ink; Document-oriented image-based pattern recognition
- G06V30/10—Character recognition
- G06V30/19—Recognition using electronic means
- G06V30/192—Recognition using electronic means using simultaneous comparisons or correlations of the image signals with a plurality of references
- G06V30/195—Recognition using electronic means using simultaneous comparisons or correlations of the image signals with a plurality of references using a resistor matrix
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V40/00—Recognition of biometric, human-related or animal-related patterns in image or video data
- G06V40/10—Human or animal bodies, e.g. vehicle occupants or pedestrians; Body parts, e.g. hands
- G06V40/16—Human faces, e.g. facial parts, sketches or expressions
- G06V40/172—Classification, e.g. identification
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Multimedia (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Physics (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Oral & Maxillofacial Surgery (AREA)
- Human Computer Interaction (AREA)
- Image Processing (AREA)
Abstract
The invention discloses a kind of figure embedding low-rank sparse and represent recovery sparse representation face identification method, belong to computer vision and mode identification technology.The present invention includes following steps: first, propose a kind of figure embedding low-rank sparse and represent restoration methods, the strong clean training sample data matrix of judgement index can be recovered from training sample data matrix, obtain training sample data error matrix simultaneously; Then, with clean training sample data matrix for dictionary, with training sample data error matrix for error dictionary, adopt
norm optimization technique solve the rarefaction representation coefficient of human face data to be identified; Further, utilize the rarefaction representation coefficient of human face data to be identified, class association reconstruct is carried out to human face data to be identified; Finally, based on the class association reconstructed error of human face data to be identified, the identification of facial image to be identified is completed.The present invention can solve the recognition of face problem that training sample image and image to be identified are all blocked in situation by noise pollution or local.
Description
Technical field
The present invention relates to computer vision and mode identification technology, be specifically related to a kind of sparse representation face identification method representing recovery based on figure embedding low-rank sparse.
Background technology
At present, face recognition technology due to its widespread use in identification, video frequency searching, security monitoring etc., one of hot research problem becoming computer vision and mode identification technology.
In recent years, along with compressive sensing theory and l
1the development of norm optimization technique, rarefaction representation is subject to lot of domestic and foreign focus of attention.Under rarefaction representation, signal can be expressed as the most sparse linear combination of given dictionary atom.Research shows, sparse representation model and human visual system's principle closely similar.Therefore, rarefaction representation is widely used in the computer vision fields such as image filtering, Image Reconstruction, compression of images.
2009, the people such as JohnWright proposed a kind of face identification method based on rarefaction representation sorter (SparseRepresentationclassification, SRC).The method first respectively with original training sample data matrix and unit matrix for dictionary and error dictionary, adopt l
1norm minimum technology solves the rarefaction representation coefficient of facial image to be identified; Then, utilize the rarefaction representation coefficient of facial image to be identified, class association reconstruct is carried out to facial image to be identified; Finally, based on the class association reconstructed error of facial image to be identified, the identification of facial image to be identified is completed.Thus, the face identification method based on rarefaction representation receives numerous concern, and many scholars have done many research work in this respect.
Under the precondition that the training sample image as dictionary is clean, the face identification method based on rarefaction representation achieves good recognition effect.But when training sample image is blocked by noise pollution or local, the recognition effect based on the face identification method of rarefaction representation is poor.In addition, owing to adopting the unit matrix of higher-dimension to make error dictionary based on the face identification method of rarefaction representation, process the noise in facial image to be identified and block, its computational complexity is very high.
Summary of the invention
The object of this invention is to provide and a kind ofly embed low-rank sparse based on figure and represent that the sparse representation face identification method of recovery, object solve training sample image and image to be identified all by the recognition of face problem under noise pollution or the situation that is locally blocked.
For above-mentioned based on Problems existing in the face identification method of rarefaction representation sorter, the present invention proposes a kind of sparse representation face identification method representing recovery based on figure embedding low-rank sparse.
The present invention adopts following technical proposals: a kind of sparse representation face identification method representing recovery based on figure embedding low-rank sparse, comprises the following steps:
S01: suppose there is K class training sample image, every class has n to open training sample image, and N=K × n opens training sample image, if often opening training sample image resolution is r × c altogether, be converted to M=r × c dimensional vector by often opening training sample image, then training sample data matrix is designated as
S02: the class label utilizing training sample data matrix X and correspondence thereof, builds a undirected neighbour of supervision that has comprising N number of node and schemes G; Wherein, node annexation and the weight thereof of scheming G are: if data x
iwith data x
jbelong to same class, and x
ifor x
jk neighbour or x
jfor x
ik neighbour, k is positive integer, span 3≤k≤n-1, then the node i scheming G is connected with node j, and its connection weight W
ijbe 1; Otherwise the node i of figure G is not connected with node j, its weights W
ijbe 0, definition data x
idegree be:
Definition data read matrix D is: D=diag (d
1, d
2..., d
n), wherein diag (d
1, d
2..., d
n) represent with d
1, d
2..., d
nfor the diagonal matrix of diagonal element;
S03: the weight matrix W tried to achieve according to step S02 and data read matrix D, definition Laplacian Matrix L:
suppose Z=[z
1, z
2..., z
n] be the expression matrix of coefficients of X, in order to enable the expression coefficient of training sample data keep the local geometry of data space and have strong judgement index, based on Laplacian Matrix L, defining one has the figure of supervision to embed regular terms:
In formula, the mark of Tr () representing matrix;
S04: make E be training sample data error matrixes, α > 0, β > 0, γ > 0 are iotazation constant, definition figure embeds low-rank sparse and represents that restoration methods objective function is:
In formula || ||
*the nuclear norm of representing matrix, i.e. singular values of a matrix sum, || ||
1the l of representing matrix
1norm, the mark of Tr () representing matrix;
Embed low-rank sparse according to figure and represent that restoration methods objective function tries to achieve expression matrix of coefficients Z and the training sample data error matrix E of training sample data matrix;
S05: according to the expression matrix of coefficients Z of the training sample data matrix X that step S04 tries to achieve, adopts following formula to recover clean training sample data Matrix C:
C=XZ;
S06: for arbitrary facial image to be identified, be translated into M dimensional vector, be designated as face image data y to be identified,
S07: take C as dictionary, E is error dictionary, adopts l
1norm optimization technique, solve the rarefaction representation coefficient of face image data y to be identified by following formula:
In formula, iotazation constant λ=0.05;
S08: calculate the class reconstructed error of all kinds of training sample to face image data y to be identified:
In formula, δ
i(α) be only retain with the i-th class coefficient of correspondence, be set to the coefficient vector of 0 with other class coefficient of correspondence;
S09: according to class reconstructed error e (i), i=1,2 ..., K, calculates the class label of face image data y to be identified:
Class (y)=argmin
ie (i); In formula, Class (y) represents the class label of face image data y to be identified, argmin
ithe i of e (i) correspondence that e (i) representative value is minimum;
S10: the recognition result exporting facial image to be identified.
Figure described in described step S04 embeds low-rank sparse and represents that solving of restoration methods objective function is an iterative process, and algorithm flow is:
A), introduce auxiliary variable J, figure embedded low-rank sparse and represents that restoration methods objective function equivalence is converted into:
B), constitution step a) in the Augmented Lagrangian Functions of objective function:
L(Z,J,E,Y
1,Y
2,μ)=||Z||
*+α||E||
1+β||J||
1+f(Z,J,E,Y
1,Y
2,μ);
Wherein, Y
1and Y
2for Lagrange multiplier matrix, μ > 0 is punishment parameter; F (Z, J, E, Y
1, Y
2, μ) be:
Wherein || ||
ffor the F-norm of matrix;
C), initialization
Given maximum iteration time maxiter=500, iteration error ε=0.001; Given parameters α=0.5, β=0.2, γ=500; Initialization iterative steps k=0;
D), fixing J
k, E
k, Y
1 k,
μ
k, adopt speedup gradient method to solve Z by following formula
k+1:
E), fixing Z
k+1, Y
1 k,
μ
k, solve J by following formula
k+1:
Wherein S
bx () is contracting function, be defined as
F), fixing Z
k+1, Y
1 k,
μ
k, solve E by following formula
k+1:
Wherein S
bx () is contracting function, its definition and step e) identical;
G), Lagrange multiplier matrix is upgraded:
H), undated parameter μ: μ
k+1=min (ρ μ
k, μ
max);
I), convergence conditions is checked, if met
|| X-XZ
k+1-E
k+1||
∞< ε and || Z
k+1-J
k+1||
∞< ε, jump procedure j);
Otherwise k=k+1, returns steps d);
J) expression matrix of coefficients Z and data error matrix E, is exported.
Compared with prior art, beneficial effect of the present invention is:
1, the present invention is by addition sparsity constraints and the low-rank constraint of the representing matrix of training sample, and introducing figure embeds data space local geometry hold facility and judgement index that regular terms emphasizes data representation coefficient, effectively the strong clean training sample data matrix of judgement index can be recovered from the face training sample image data matrix be blocked by noise pollution or local;
2, the figure utilizing the present invention to propose embeds low-rank sparse and represents the data error matrix that restoration methods is tried to achieve, and can describe the noise in facial image and partial occlusion exactly.Therefore, make error dictionary with this data error matrix, effectively can process the noise in facial image to be identified and block, and computational complexity is low;
3, with clean training sample data matrix for dictionary, with data error matrix for error dictionary, effectively can solve the recognition of face problem that training sample image and image to be identified are all blocked in situation by noise pollution or local, increase substantially face recognition accuracy rate and operation efficiency.
Accompanying drawing explanation
Fig. 1 is a kind of sparse representation face identification method process flow diagram representing recovery based on figure embedding low-rank sparse.
Embodiment
The present invention proposes a kind of sparse representation face identification method representing recovery based on figure embedding low-rank sparse, object solves training sample image and image to be identified all by the recognition of face problem under noise pollution or the situation that is locally blocked, as shown in Figure 1, specifically comprise the following steps:
S01: suppose there is K class training sample image, every class has n to open training sample image, N=K × n opens training sample image altogether.If often opening training sample image resolution is r × c, be converted to M=r × c dimensional vector by often opening training sample image, then training sample data matrix is designated as
S02: the class label utilizing training sample data matrix X and correspondence thereof, builds a undirected neighbour of supervision that has comprising N number of node and schemes G; Wherein, node annexation and the weight thereof of scheming G are: if data x
iwith data x
jbelong to same class, and x
ifor x
jk neighbour or x
jfor x
ik neighbour (k is positive integer, span 3≤k≤n-1), then the node i scheming G is connected with node j, and its connection weight W
ijbe 1; Otherwise the node i of figure G is not connected with node j, its weights W
ijbe 0.Definition data x
idegree be:
Definition data read matrix D is: D=diag (d
1, d
2..., d
n), wherein diag (d
1, d
2..., d
n) represent with d
1, d
2..., d
nfor the diagonal matrix of diagonal element;
S03: the weight matrix W tried to achieve according to step S02 and data read matrix D, definition Laplacian Matrix
suppose Z=[z
1, z
2..., z
n] be the expression matrix of coefficients of X, in order to enable the expression coefficient of training sample data keep the local geometry of data space and have strong judgement index, based on Laplacian Matrix L, defining one has the figure of supervision to embed regular terms:
In formula, the mark of Tr () representing matrix;
S04: make E be training sample data error matrixes, α > 0, β > 0, γ > 0 are iotazation constant, definition figure embeds low-rank sparse and represents that restoration methods objective function is:
In formula || ||
*the nuclear norm of representing matrix, i.e. singular values of a matrix sum, || ||
1the l of representing matrix
1norm, the mark of Tr () representing matrix;
Embed low-rank sparse according to figure and represent that restoration methods objective function tries to achieve expression matrix of coefficients Z and the training sample data error matrix E of training sample data matrix; Wherein figure embedding low-rank sparse represents that solving of restoration methods objective function is an iterative process, and algorithm flow is:
A) introduce auxiliary variable J, figure embedded low-rank sparse and represents that restoration methods objective function equivalence is converted into:
B) constitution step a) in the Augmented Lagrangian Functions of objective function:
L(Z,J,E,Y
1,Y
2,μ)=||Z||
*+α||E||
1+β||J||
1+f(Z,J,E,Y
1,Y
2,μ);
Wherein, Y
1and Y
2for Lagrange multiplier matrix, μ > 0 is punishment parameter; F (Z, J, E, Y
1, Y
2, μ) be:
Wherein || ||
ffor the F-norm of matrix;
C) initialization
Given maximum iteration time maxiter=500, iteration error ε=0.001; Given parameters α=0.5, β=0.2, γ=500; Initialization iterative steps k=0;
D) fixing J
k, E
k, Y
1 k,
μ
k, adopt speedup gradient method (acceleratedgradientmethod) to solve Z by following formula
k+1:
E) fixing Z
k+1, Y
1 k,
μ
k, solve J by following formula
k+1:
Wherein S
bx () is contracting function, be defined as
F) fixing Z
k+1, Y
1 k, Y
2 k, μ
k, solve E by following formula
k+1:
Wherein S
bx () is contracting function, its definition and step e) identical;
G) Lagrange multiplier matrix is upgraded:
H) undated parameter μ: μ
k+1=min (ρ μ
k, μ
max);
I) convergence conditions is checked, if met
|| X-XZ
k+1-E
k+1||
∞< ε and || Z
k+1-J
k+1||
∞< ε, jump procedure j);
Otherwise k=k+1, returns steps d);
J) expression matrix of coefficients Z and data error matrix E is exported.
S05: according to the expression matrix of coefficients Z of the training sample data matrix X that step S04 tries to achieve, adopts following formula to recover clean training sample data Matrix C:
C=XZ;
S06: for arbitrary facial image to be identified, be translated into M dimensional vector, be designated as face image data y to be identified,
S07: take C as dictionary, E is error dictionary, adopts l
1norm optimization technique, solve the rarefaction representation coefficient of face image data y to be identified by following formula:
In formula, iotazation constant λ=0.05;
S08: calculate the class reconstructed error of all kinds of training sample to face image data y to be identified:
In formula, δ
i(α) be only retain with the i-th class coefficient of correspondence, be set to the coefficient vector of 0 with other class coefficient of correspondence;
S09: according to class reconstructed error e (i), i=1,2 ..., K, calculates the class label of face image data y to be identified:
Class(y)=argmin
ie(i);
In formula, Class (y) represents the class label of face image data y to be identified, argmin
ithe i of e (i) correspondence that e (i) representative value is minimum;
S10: the recognition result exporting facial image to be identified.
By said method, the present invention can solve the recognition of face problem that training sample image and image to be identified are all blocked in situation by noise pollution or local effectively, improves face recognition accuracy rate and operation efficiency.
Be more than the present invention's better embodiment, all changes made with technical solution of the present invention, when the function produced does not exceed the scope of technical solution of the present invention, all belong to protection scope of the present invention.
Claims (2)
1. represent a sparse representation face identification method for recovery based on figure embedding low-rank sparse, it is characterized in that: comprise the following steps:
S01: suppose there is K class training sample image, every class has n to open training sample image, and N=K × n opens training sample image, if often opening training sample image resolution is r × c altogether, be converted to M=r × c dimensional vector by often opening training sample image, then training sample data matrix is designated as
S02: the class label utilizing training sample data matrix X and correspondence thereof, builds a undirected neighbour of supervision that has comprising N number of node and schemes G; Wherein, node annexation and the weight thereof of scheming G are: if data x
iwith data x
jbelong to same class, and x
ifor x
jk neighbour or x
jfor x
ik neighbour, k is positive integer, span 3≤k≤n-1, then the node i scheming G is connected with node j, and its connection weight W
ijbe 1; Otherwise the node i of figure G is not connected with node j, its weights W
ijbe 0, definition data x
idegree be:
Definition data read matrix D is: D=diag (d
1, d
2..., d
n), wherein diag (d
1, d
2..., d
n) represent with d
1, d
2..., d
nfor the diagonal matrix of diagonal element;
S03: the weight matrix W tried to achieve according to step S02 and data read matrix D, definition Laplacian Matrix
suppose Z=[z
1, z
2..., z
n] be the expression matrix of coefficients of X, in order to enable the expression coefficient of training sample data keep the local geometry of data space and have strong judgement index, based on Laplacian Matrix L, defining one has the figure of supervision to embed regular terms:
In formula, the mark of Tr () representing matrix;
S04: make E be training sample data error matrixes, α > 0, β > 0, γ > 0 are iotazation constant, definition figure embeds low-rank sparse and represents that restoration methods objective function is:
In formula || ||
*the nuclear norm of representing matrix, i.e. singular values of a matrix sum, || ||
1the l of representing matrix
1norm, the mark of Tr () representing matrix;
Embed low-rank sparse according to figure and represent that restoration methods objective function tries to achieve expression matrix of coefficients Z and the training sample data error matrix E of training sample data matrix;
S05: according to the expression matrix of coefficients Z of the training sample data matrix X that step S04 tries to achieve, adopts following formula to recover clean training sample data Matrix C:
C=XZ;
S06: for arbitrary facial image to be identified, be translated into M dimensional vector, be designated as face image data y to be identified,
S07: take C as dictionary, E is error dictionary, adopts l
1norm optimization technique, solve the rarefaction representation coefficient of face image data y to be identified by following formula:
In formula, iotazation constant λ=0.05;
S08: calculate the class reconstructed error of all kinds of training sample to face image data y to be identified:
In formula, δ
i(α) be only retain with the i-th class coefficient of correspondence, be set to the coefficient vector of 0 with other class coefficient of correspondence;
S09: according to class reconstructed error e (i), i=1,2 ..., K, calculates the class label of face image data y to be identified:
Class(y)=argmin
ie(i);
In formula, Class (y) represents the class label of face image data y to be identified, argmin
ithe i of e (i) correspondence that e (i) representative value is minimum;
S10: the recognition result exporting facial image to be identified.
2. a kind of sparse representation face identification method representing recovery based on figure embedding low-rank sparse according to claim 1, it is characterized in that: the figure described in described step S04 embeds low-rank sparse and represents that solving of restoration methods objective function is an iterative process, and algorithm flow is:
A), introduce auxiliary variable J, figure embedded low-rank sparse and represents that restoration methods objective function equivalence is converted into:
B), constitution step a) in the Augmented Lagrangian Functions of objective function:
L(Z,J,E,Y
1,Y
2,μ)=||Z||
*+α||E||
1+β||J||
1+f(Z,J,E,Y
1,Y
2,μ);
Wherein, Y
1and Y
2for Lagrange multiplier matrix, μ > 0 is punishment parameter; F (Z, J, E, Y
1, Y
2, μ) be:
Wherein || ||
ffor the F-norm of matrix;
C), initialization
μ
0=0.1, ρ=1.1, μ
max=10
30, given maximum iteration time maxiter=500, iteration error ε=0.001; Given parameters α=0.5, β=0.2, γ=500; Initialization iterative steps k=0;
D), fixing J
k, E
k,
μ
k, adopt speedup gradient method to solve Z by following formula
k+1:
E), fixing
j is solved by following formula
k+1:
Wherein S
bx () is contracting function, be defined as
F), fixing Z
k+1,
μ
k, solve E by following formula
k+1:
Wherein S
bx () is contracting function, its definition and step e) identical;
G), Lagrange multiplier matrix is upgraded:
H), undated parameter μ: μ
k+1=min (ρ μ
k, μ
max);
I), convergence conditions is checked, if met
|| X-XZ
k+1-E
k+1||
∞< ε and || Z
k+1-J
k+1||
∞< ε, jump procedure j);
Otherwise k=k+1, returns steps d);
J) expression matrix of coefficients Z and data error matrix E, is exported.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410607957.2A CN104318261B (en) | 2014-11-03 | 2014-11-03 | A kind of sparse representation face identification method representing recovery based on figure embedding low-rank sparse |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201410607957.2A CN104318261B (en) | 2014-11-03 | 2014-11-03 | A kind of sparse representation face identification method representing recovery based on figure embedding low-rank sparse |
Publications (2)
Publication Number | Publication Date |
---|---|
CN104318261A CN104318261A (en) | 2015-01-28 |
CN104318261B true CN104318261B (en) | 2016-04-27 |
Family
ID=52373490
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201410607957.2A Expired - Fee Related CN104318261B (en) | 2014-11-03 | 2014-11-03 | A kind of sparse representation face identification method representing recovery based on figure embedding low-rank sparse |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN104318261B (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107958229A (en) * | 2017-12-21 | 2018-04-24 | 苏州大学 | A kind of face identification method, device and equipment that low-rank representation is kept based on neighbour |
Families Citing this family (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105654128B (en) * | 2015-12-30 | 2019-04-12 | 南京邮电大学 | Fan blade image failure recognition methods based on nuclear norm canonical low-rank coding |
CN105718934A (en) * | 2016-01-25 | 2016-06-29 | 无锡中科富农物联科技有限公司 | Method for pest image feature learning and identification based on low-rank sparse coding technology |
CN106295677B (en) * | 2016-07-28 | 2019-07-26 | 浙江工业大学 | A kind of water flow image cluster-dividing method for combining Lars regular terms and feature self study |
CN106295694B (en) * | 2016-08-05 | 2019-04-09 | 浙江工业大学 | Face recognition method for iterative re-constrained group sparse representation classification |
CN106503652A (en) * | 2016-10-21 | 2017-03-15 | 南京理工大学 | Based on the accident detection method that low-rank adaptive sparse is rebuild |
CN106503647A (en) * | 2016-10-21 | 2017-03-15 | 南京理工大学 | The accident detection method that structural sparse is represented is approached based on low-rank |
CN107292316B (en) * | 2017-05-31 | 2020-08-25 | 昆明理工大学 | Sparse representation-based method for improving image definition |
CN107169531B (en) * | 2017-06-14 | 2018-08-17 | 中国石油大学(华东) | A kind of image classification dictionary learning method and device based on Laplce's insertion |
CN107392128A (en) * | 2017-07-13 | 2017-11-24 | 南京邮电大学 | The robust image recognition methods returned based on double low-rank representations and local constraint matrix |
CN107145841B (en) * | 2017-07-20 | 2021-08-10 | 深圳大学 | Low-rank sparse face recognition method and system based on matrix |
CN107392190B (en) * | 2017-09-07 | 2020-08-11 | 南京信息工程大学 | Color face recognition method based on semi-supervised multi-view dictionary learning |
CN108021950B (en) * | 2017-12-28 | 2021-05-25 | 河南科技大学 | Image classification method based on low-rank sparse representation |
CN108171215B (en) * | 2018-01-25 | 2023-02-03 | 河南大学 | Face camouflage detection and camouflage type detection method based on low-rank variation dictionary and sparse representation classification |
CN108446589B (en) * | 2018-02-07 | 2022-03-22 | 杭州电子科技大学 | Face recognition method based on low-rank decomposition and auxiliary dictionary in complex environment |
CN108681725A (en) * | 2018-05-31 | 2018-10-19 | 西安理工大学 | A kind of weighting sparse representation face identification method |
CN108985161B (en) * | 2018-06-08 | 2021-08-03 | 广东工业大学 | Low-rank sparse representation image feature learning method based on Laplace regularization |
CN109063555B (en) * | 2018-06-26 | 2021-07-02 | 杭州电子科技大学 | Multi-pose face recognition method based on low-rank decomposition and sparse representation residual error comparison |
CN109522841A (en) * | 2018-11-16 | 2019-03-26 | 重庆邮电大学 | A kind of face identification method restored based on group's rarefaction representation and low-rank matrix |
CN110458092B (en) * | 2019-08-09 | 2022-08-30 | 南京邮电大学 | Face recognition method based on L2 regularization gradient constraint sparse representation |
CN110837804A (en) * | 2019-11-07 | 2020-02-25 | 江南大学 | Face identification method for sparse mixed dictionary learning |
CN111950387B (en) * | 2020-07-22 | 2023-07-25 | 中原工学院 | Error face recognition method based on sparse representation |
CN112541554B (en) * | 2020-12-18 | 2024-03-22 | 华中科技大学 | Multi-mode process monitoring method and system based on time constraint and nuclear sparse representation |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101667246A (en) * | 2009-09-25 | 2010-03-10 | 西安电子科技大学 | Human face recognition method based on nuclear sparse expression |
CN101976360A (en) * | 2010-10-27 | 2011-02-16 | 西安电子科技大学 | Sparse characteristic face recognition method based on multilevel classification |
CN102902961A (en) * | 2012-09-21 | 2013-01-30 | 武汉大学 | Face super-resolution processing method based on K neighbor sparse coding average value constraint |
-
2014
- 2014-11-03 CN CN201410607957.2A patent/CN104318261B/en not_active Expired - Fee Related
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101667246A (en) * | 2009-09-25 | 2010-03-10 | 西安电子科技大学 | Human face recognition method based on nuclear sparse expression |
CN101976360A (en) * | 2010-10-27 | 2011-02-16 | 西安电子科技大学 | Sparse characteristic face recognition method based on multilevel classification |
CN102902961A (en) * | 2012-09-21 | 2013-01-30 | 武汉大学 | Face super-resolution processing method based on K neighbor sparse coding average value constraint |
Non-Patent Citations (1)
Title |
---|
基于稀疏表示的人脸识别方法;杨荣根等;《计算机科学》;20100930;第37卷(第09期);267-269 * |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107958229A (en) * | 2017-12-21 | 2018-04-24 | 苏州大学 | A kind of face identification method, device and equipment that low-rank representation is kept based on neighbour |
CN107958229B (en) * | 2017-12-21 | 2021-12-24 | 苏州大学 | Face recognition method, device and equipment based on neighbor keeping low-rank representation |
Also Published As
Publication number | Publication date |
---|---|
CN104318261A (en) | 2015-01-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN104318261B (en) | A kind of sparse representation face identification method representing recovery based on figure embedding low-rank sparse | |
Chen et al. | Convolutional neural network based dem super resolution | |
CN105138973A (en) | Face authentication method and device | |
CN105046664A (en) | Image denoising method based on self-adaptive EPLL algorithm | |
CN110796625A (en) | Image compressed sensing reconstruction method based on group sparse representation and weighted total variation | |
CN104036296B (en) | A kind of expression of image and processing method and processing device | |
Liu et al. | A three-domain fuzzy support vector regression for image denoising and experimental studies | |
CN102629374A (en) | Image super resolution (SR) reconstruction method based on subspace projection and neighborhood embedding | |
CN104298974A (en) | Human body behavior recognition method based on depth video sequence | |
CN110223231A (en) | A kind of rapid super-resolution algorithm for reconstructing of noisy image | |
CN115496928A (en) | Multi-modal image feature matching method based on multi-feature matching | |
CN109284668A (en) | A kind of pedestrian's weight recognizer based on apart from regularization projection and dictionary learning | |
CN108664941B (en) | Nuclear sparse description face recognition method based on geodesic mapping analysis | |
Yang et al. | Reconstruction of structurally-incomplete matrices with reweighted low-rank and sparsity priors | |
CN105631469A (en) | Bird image recognition method by multilayer sparse coding features | |
CN117974693B (en) | Image segmentation method, device, computer equipment and storage medium | |
CN114581965A (en) | Training method of finger vein recognition model, recognition method, system and terminal | |
CN106157240A (en) | Remote sensing image super resolution method based on dictionary learning | |
Wang et al. | Zero-shot-learning cross-modality data translation through mutual information guided stochastic diffusion | |
CN116597635B (en) | Wireless communication intelligent gas meter controller and control method thereof | |
Maji et al. | Reconstructing an image from its edge representation | |
CN111126123B (en) | Incremental kernel zero-space transformation pedestrian re-identification method based on compression | |
Mou et al. | State recognition of electric control cabinet switches based on cnns | |
CN116311345A (en) | Transformer-based pedestrian shielding re-recognition method | |
Ni et al. | High-order generalized orderless pooling networks for synthetic-aperture radar scene classification |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160427 Termination date: 20191103 |
|
CF01 | Termination of patent right due to non-payment of annual fee |