Journal
PATTERN RECOGNITION
Volume 90, Issue -, Pages 147-160Publisher
ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2019.01.018
Keywords
Binary sparse signal recovery; Logic observation; Matching pursuit method; Bayesian method
Funding
- Natural Science Foundation of China [61703283, 61573248, 61672357, 61802267, U1713214]
- Guangdong Natural Science Foundation [2017A030310067, 2017A030313367, 2018A030310450, 2018A030310451]
- Science and Technology Funding of Guangdong Province [2018A050501014]
- Hong Kong Polytechnic University [G-YBD9]
- China Postdoctoral Science Foundation [2016M590812, 2017M612736, 2017T100645]
- Shenzhen Municipal Science and Technology Innovation Council [JCYJ20160429182058044, JCYJ20170302153434048]
- Fundamental Research Funds for the Shenzhen University
Ask authors/readers for more resources
Binary observation has been widely reported in the literature to localize or track moving objects due to its simple realization and good performance in improving energy efficiency. However, with the implementation of logic operators, the new observation models are out of the range of standard compressive sensing context, and thus lack of effective recovery algorithm. The purpose of this paper is to develop effective recovery algorithms and analyze their performance. Two kinds of recovery algorithms are developed and they are inspired from the matching pursuit method and Bayesian method, respectively. Theoretical conditions are also formulated to guarantee the successful recovery and the proposed algorithms are verified by a series of numerical experiments. Moreover, a construction method for the measurement matrix is also proposed, which is essential for model design. It is hoped that the proposed theories and algorithms can make contribution to the related applications of pattern recognition. (C) 2019 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available