Text
Submatrices with NonUniformly Selected Random Supports and Insights into Sparse Approximation
In this paper, we derive tail bounds for the norms of random submatrices with nonuniformly distributed supports. We apply these results to sparse approximation and conduct an analysis of the average case performance of thresholding, orthogonal matching pursuit, and basis pursuit. As an application of these results, we characterize sensing dictionaries to improve average performance in the nonuniform case and test their performance numerically.
Barcode | Tipe Koleksi | Nomor Panggil | Lokasi | Status | |
---|---|---|---|---|---|
art139930 | null | Artikel | Gdg9-Lt3 | Tersedia namun tidak untuk dipinjamkan - No Loan |
Tidak tersedia versi lain