GDL

Journal from gdlhub / 2018-08-07 11:22:08
Oleh : Koredianto Usman, Hendra Gunawan, Andriyan B. Suksmono, STIKOM Dinamika Bangsa Jambi
Dibuat : 2018-08-07, dengan 1 file

Keyword : compressive sampling; convex combination; convex polytope; sparse reconstruction; l1-norm, weight point.
Url : http://journals.itb.ac.id/index.php/jictra/article/view/3393
Sumber pengambilan dokumen : web

In this paper we propose a new approach of the compressive sensing (CS) reconstruction problem based on a geometrical interpretation of l1-norm minimization. By taking a large l1-norm value at the initial step, the intersection of l1-norm and the constraint curves forms a convex polytope and by exploiting the fact that any convex combination of the polytope’s vertexes gives a new point that has a smaller l1-norm, we are able to derive a new algorithm to solve the CS reconstruction problem. Compared to the greedy algorithm, this algorithm has better performance, especially in highly coherent environments. Compared to the convex optimization, the proposed algorithm has simpler computation requirements. We tested the capability of this algorithm in reconstructing a randomly down-sampled version of the Dow Jones Industrial Average (DJIA) index. The proposed algorithm achieved a good result but only works on real-valued signals.

Beri Komentar ?#(0) | Bookmark

Properti	Nilai Properti
ID Publisher	gdlhub
Organisasi	STIKOM Dinamika Bangsa Jambi
Nama Kontak	Herti Yani, S.Kom
Alamat	Jln. Jenderal Sudirman
Kota	Jambi
Daerah	Jambi
Negara	Indonesia
Telepon	0741-35095
Fax	0741-35093
E-mail Administrator	elibrarystikom@gmail.com
E-mail CKO	elibrarystikom@gmail.com