کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8898214 | 1631325 | 2018 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Spark-level sparsity and the â1 tail minimization
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
آنالیز ریاضی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Spark-level sparsity and the â1 tail minimization Spark-level sparsity and the â1 tail minimization](/preview/png/8898214.png)
چکیده انگلیسی
Solving compressed sensing problems relies on the properties of sparse signals. It is commonly assumed that the sparsity s needs to be less than one half of the spark of the sensing matrix A, and then the unique sparsest solution exists, and is recoverable by â1-minimization or related procedures. We discover, however, a measure theoretical uniqueness exists for nearly spark-level sparsity from compressed measurements Ax=b. Specifically, suppose A is of full spark with m rows, and suppose m2m2 in thousands and thousands of random tests. We further show instead that the mere â1-minimization would actually fail if s>m2 even from the same measure theoretical point of view.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied and Computational Harmonic Analysis - Volume 45, Issue 1, July 2018, Pages 206-215
Journal: Applied and Computational Harmonic Analysis - Volume 45, Issue 1, July 2018, Pages 206-215
نویسندگان
Chun-Kit Lai, Shidong Li, Daniel Mondo,