作者: Yuli Fu , Haifeng Li , Qiheng Zhang , Jian Zou
DOI: 10.1016/J.SIGPRO.2013.10.030
关键词: Restricted isometry property 、 Matching pursuit 、 Algorithm 、 Block (programming) 、 Mathematics 、 Facial recognition system 、 Subspace topology 、 Segmentation 、 Motion (geometry)
摘要: 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 into account, we propose some greedy type algorithms exploit subspace information of to solve problem. The exact recovery conditions these are presented via block restricted isometry property (RIP). Numerical experiments demonstrate validity solving problems with both non-redundant blocks. HighlightsThe condition BOMP is proved based on RIP.The BOMPR algorithm given case blocks.The BMMVR proposed applied recognition.