Tree search network for sparse estimation

Cited 1 time in webofscience Cited 1 time in scopus
  • Hit : 492
  • Download : 0
We consider the classical sparse estimation problem of recovering a synthetic sparse signal x(0) given measurement vector y = Phi x(0) + w. We propose a tree search algorithm, TSN, driven by a deep neural network for sparse estimation. TSN improves the signal reconstruction performance of the deep neural network designed for sparse estimation by performing a tree search with pruning. In both noiseless and noisy cases, the proposed TSN recovers all synthetic signals at lower complexity than conventional tree search and outperforms existing algorithms by a large margin regarding several variations of sensing matrix Phi, which is widely used in sparse estimation. We also demonstrate the superiority of TSN for two typical applications of sparse estimation.
Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
Issue Date
2020-05
Language
English
Article Type
Article
Citation

DIGITAL SIGNAL PROCESSING, v.100

ISSN
1051-2004
DOI
10.1016/j.dsp.2020.102680
URI
http://hdl.handle.net/10203/273953
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0