Abstract | ||
---|---|---|
Recently, it has been found that the redundant blocks problem existed in many fields, such as face recognition and motion segmentation. In this paper, taking the redundant blocks into account, we propose some greedy type algorithms that exploit the subspace information of the redundant blocks to solve the redundant blocks problem. The exact recovery conditions of these algorithms are presented via block restricted isometry property (RIP). Numerical experiments demonstrate the validity of these algorithms in solving the problems with both non-redundant and redundant blocks. HighlightsThe exact recovery condition of BOMP is proved based on block RIP.The BOMPR algorithm is given to solve the case of redundant blocks.The BMMVR algorithm is proposed and applied to face recognition. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1016/j.sigpro.2013.10.030 | Signal Processing |
Keywords | Field | DocType |
numerical experiment,face recognition,redundant blocks problem,block-sparse recovery,greedy type algorithm,redundant block,isometry property,motion segmentation,subspace information,exact recovery condition,orthogonal matching pursuit | Matching pursuit,Facial recognition system,Mathematical optimization,Subspace topology,Segmentation,Algorithm,Theoretical computer science,Exploit,Restricted isometry property,Mathematics | Journal |
Volume | Issue | ISSN |
97 | C | 0165-1684 |
Citations | PageRank | References |
7 | 0.45 | 26 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yuli Fu | 1 | 200 | 29.90 |
Haifeng Li | 2 | 25 | 7.92 |
Qiheng Zhang | 3 | 21 | 3.87 |
Jian Zou | 4 | 16 | 3.00 |