0363820 20240103195501.120111108235959.9 Praha ÚTIA AVČR 2011 24 s. Research Report 2306 compressed sensing sparse signal matching pursuit cav_un_auth*0072714 Hoskovec J. CZ cav_un_auth*0101212 Tichavský Petr Stochastická informatika Department of Stochastic Informatics SI SI UTIA-B Department of Stochastic Informatics Ústav teorie informace a automatizace AV ČR, v. v. i. http://library.utia.cas.cz/separaty/2011/SI/tichavsky-experimental comparison of sparse signal recovery algorithms.pdf GA102/09/1278 GA ČR cav_un_auth*0253174 CEZ:AV0Z10750506 This report presents an experimental comparison of some of the newest and/or most common algorithms that are used for solving the sparse recovery problem: matching pursuit, orthogonal matching pursuit (OMP), A*OMP, basis pursuit, re-weighted least square (also known as FOCUSS), re-weighted L1 optimization (RL1). The comparison is done on synthetic (random) data set (dictionary) of the size 50x250 and 500x2500. 2012 BB 2 4 O 4o 20231122134642.9 http://hdl.handle.net/11104/0199475 2011 Soubory v repozitáři: 0363820.pdf 2011 Praha ÚTIA AVČR