語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
FindBook
Google Book
Amazon
博客來
Approximate Message Passing Algorithms for Compressed Sensing.
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Approximate Message Passing Algorithms for Compressed Sensing./
作者:
Maleki, Arian.
出版者:
Ann Arbor : ProQuest Dissertations & Theses, : 2010,
面頁冊數:
311 p.
附註:
Source: Dissertations Abstracts International, Volume: 82-03, Section: B.
Contained By:
Dissertations Abstracts International82-03B.
標題:
Applied mathematics. -
電子資源:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28169030
ISBN:
9798672133546
Approximate Message Passing Algorithms for Compressed Sensing.
Maleki, Arian.
Approximate Message Passing Algorithms for Compressed Sensing.
- Ann Arbor : ProQuest Dissertations & Theses, 2010 - 311 p.
Source: Dissertations Abstracts International, Volume: 82-03, Section: B.
Thesis (Ph.D.)--Stanford University, 2010.
This item must not be sold to any third party vendors.
Compressed sensing refers to a growing body of techniques that 'undersample' high-dimensional signals and yet recover them accurately. Such techniques make fewer measurements than traditional sampling theory demands: rather than sampling proportional to frequency bandwidth, they make only as many measurements as the underlying `information content' of those signals. However, as compared with traditional sampling theory, which can recover signals by applying simple linear reconstruction formulas, the task of signal recovery from reduced measurements requires nonlinear, and so far, relatively expensive reconstruction schemes. One popular class of reconstruction schemes uses linear programming (LP) methods; there is an elegant theory for such schemes promising large improvements over ordinary sampling rules in recovering sparse signals. However, solving the required LPs is substantially more expensive in applications than the linear reconstruction schemes that are now standard. In certain imaging problems, the signal to be acquired may be an image with 106 pixels and the required LP would involve tens of thousands of constraints and millions of variables. Despite advances in the speed of LP, such methods are still dramatically more expensive to solve than we would like. In this thesis we focus on a class of low computational complexity algorithms known as iterative thresholding. We study them both theoretically and empirically. We will also introduce a new class of algorithms called approximate message passing or AMP. These schemes have several advantages over the classical thresholding approaches. First, they take advantage of the statistical properties of the problem to improve the convergence rate and predictability of the algorithm. Second, the nice properties of these algorithms enable us to make very accurate theoretical predictions on the asymptotic performance of LPs as well. It will be shown that more traditional techniques such as coherence and restricted isometry property are not able to make such precise predictions.
ISBN: 9798672133546Subjects--Topical Terms:
2122814
Applied mathematics.
Subjects--Index Terms:
Compressed sensing
Approximate Message Passing Algorithms for Compressed Sensing.
LDR
:03214nmm a2200349 4500
001
2348554
005
20220912135605.5
008
241004s2010 ||||||||||||||||| ||eng d
020
$a
9798672133546
035
$a
(MiAaPQ)AAI28169030
035
$a
(MiAaPQ)STANFORDrd797hn1131
035
$a
AAI28169030
040
$a
MiAaPQ
$c
MiAaPQ
100
1
$a
Maleki, Arian.
$3
3687920
245
1 0
$a
Approximate Message Passing Algorithms for Compressed Sensing.
260
1
$a
Ann Arbor :
$b
ProQuest Dissertations & Theses,
$c
2010
300
$a
311 p.
500
$a
Source: Dissertations Abstracts International, Volume: 82-03, Section: B.
500
$a
Advisor: Donoho, David Leigh; Gray, Robert M.;Montanari, Andrea.
502
$a
Thesis (Ph.D.)--Stanford University, 2010.
506
$a
This item must not be sold to any third party vendors.
520
$a
Compressed sensing refers to a growing body of techniques that 'undersample' high-dimensional signals and yet recover them accurately. Such techniques make fewer measurements than traditional sampling theory demands: rather than sampling proportional to frequency bandwidth, they make only as many measurements as the underlying `information content' of those signals. However, as compared with traditional sampling theory, which can recover signals by applying simple linear reconstruction formulas, the task of signal recovery from reduced measurements requires nonlinear, and so far, relatively expensive reconstruction schemes. One popular class of reconstruction schemes uses linear programming (LP) methods; there is an elegant theory for such schemes promising large improvements over ordinary sampling rules in recovering sparse signals. However, solving the required LPs is substantially more expensive in applications than the linear reconstruction schemes that are now standard. In certain imaging problems, the signal to be acquired may be an image with 106 pixels and the required LP would involve tens of thousands of constraints and millions of variables. Despite advances in the speed of LP, such methods are still dramatically more expensive to solve than we would like. In this thesis we focus on a class of low computational complexity algorithms known as iterative thresholding. We study them both theoretically and empirically. We will also introduce a new class of algorithms called approximate message passing or AMP. These schemes have several advantages over the classical thresholding approaches. First, they take advantage of the statistical properties of the problem to improve the convergence rate and predictability of the algorithm. Second, the nice properties of these algorithms enable us to make very accurate theoretical predictions on the asymptotic performance of LPs as well. It will be shown that more traditional techniques such as coherence and restricted isometry property are not able to make such precise predictions.
590
$a
School code: 0212.
650
4
$a
Applied mathematics.
$3
2122814
650
4
$a
Electrical engineering.
$3
649834
653
$a
Compressed sensing
653
$a
Linear programming
653
$a
Thresholding approaches
690
$a
0544
690
$a
0364
710
2
$a
Stanford University.
$3
754827
773
0
$t
Dissertations Abstracts International
$g
82-03B.
790
$a
0212
791
$a
Ph.D.
792
$a
2010
793
$a
English
856
4 0
$u
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28169030
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9470992
電子資源
11.線上閱覽_V
電子書
EB
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入