語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Blue Noise and Optimal Sampling on G...
~
Parada-Mayorga, Alejandro.
FindBook
Google Book
Amazon
博客來
Blue Noise and Optimal Sampling on Graphs.
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Blue Noise and Optimal Sampling on Graphs./
作者:
Parada-Mayorga, Alejandro.
出版者:
Ann Arbor : ProQuest Dissertations & Theses, : 2019,
面頁冊數:
239 p.
附註:
Source: Dissertations Abstracts International, Volume: 81-04, Section: B.
Contained By:
Dissertations Abstracts International81-04B.
標題:
Electrical engineering. -
電子資源:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=22592156
ISBN:
9781687974693
Blue Noise and Optimal Sampling on Graphs.
Parada-Mayorga, Alejandro.
Blue Noise and Optimal Sampling on Graphs.
- Ann Arbor : ProQuest Dissertations & Theses, 2019 - 239 p.
Source: Dissertations Abstracts International, Volume: 81-04, Section: B.
Thesis (Ph.D.)--University of Delaware, 2019.
This item must not be sold to any third party vendors.
New data science tools are emerging to process signals on graph structures and concepts of algebraic and spectral graph theory are being merged with methods used in computational harmonic analysis to analyze these signals. A common problem in these networks is to determine which nodes play the most important role, assuming there is a quantity of interest defined on the network. Graph signal sampling thus becomes essential. In the first part of this dissertation, we explore a novel departure from prior work, inspired by sampling patterns in traditional dithering and halftoning. Specifically, we design graph signal sampling techniques that promote the maximization of the distance between sampling nodes on the vertex domain and that are characterized on some subclasses of graphs by a low frequency energy. Sampling patterns with these characteristics are referred to in the spatial dithering literature as blue-noise. The connection between existing theoretical results about sampling signals on graphs and blue noise sampling patterns on graphs is established, showing also how the spectral characteristics of these patterns are shaped by their vertex domain attributes. Additionally, for the generation of blue noise patterns a void and cluster algorithm on graphs is proposed exploiting the vertex-domain distribution of the sampling nodes. Numerical experiments show that the reconstruction error obtained with these patterns is similar to the one obtained by the state of the art approaches. Additionally, we explore the uniqueness sets for signals on cographs. Using the structure of the tree representation of a cograph, we proposed an algorithm that find its uniqueness sets from very simple small size graphs without any spectral decomposition or extensive searches on the vertex domain. The analysis performed on threshold graphs allowed us to calculate a closed form solution for the uniqueness sets. In the second part of this dissertation we consider the problem of sampling on regular grids for compressed sensing applications. We design optimal sampling patterns in coded apertures for CASSI systems and compressive X-ray tomosynthesis architectures, providing closed form solutions that outperform the results achieved using designs obtained with previous approaches, at a very low computational cost. Additionally, a rigorous estimate of the spectral resolution in general colored CASSI systems is provided exploiting the structure of the non-ideal sampling patterns obtained when wide spectral filters are considered.
ISBN: 9781687974693Subjects--Topical Terms:
649834
Electrical engineering.
Subjects--Index Terms:
Blue-noise sampling
Blue Noise and Optimal Sampling on Graphs.
LDR
:03595nmm a2200337 4500
001
2268739
005
20200824072440.5
008
220629s2019 ||||||||||||||||| ||eng d
020
$a
9781687974693
035
$a
(MiAaPQ)AAI22592156
035
$a
AAI22592156
040
$a
MiAaPQ
$c
MiAaPQ
100
1
$a
Parada-Mayorga, Alejandro.
$3
3546040
245
1 0
$a
Blue Noise and Optimal Sampling on Graphs.
260
1
$a
Ann Arbor :
$b
ProQuest Dissertations & Theses,
$c
2019
300
$a
239 p.
500
$a
Source: Dissertations Abstracts International, Volume: 81-04, Section: B.
500
$a
Advisor: Arce, Gonzalo R.
502
$a
Thesis (Ph.D.)--University of Delaware, 2019.
506
$a
This item must not be sold to any third party vendors.
520
$a
New data science tools are emerging to process signals on graph structures and concepts of algebraic and spectral graph theory are being merged with methods used in computational harmonic analysis to analyze these signals. A common problem in these networks is to determine which nodes play the most important role, assuming there is a quantity of interest defined on the network. Graph signal sampling thus becomes essential. In the first part of this dissertation, we explore a novel departure from prior work, inspired by sampling patterns in traditional dithering and halftoning. Specifically, we design graph signal sampling techniques that promote the maximization of the distance between sampling nodes on the vertex domain and that are characterized on some subclasses of graphs by a low frequency energy. Sampling patterns with these characteristics are referred to in the spatial dithering literature as blue-noise. The connection between existing theoretical results about sampling signals on graphs and blue noise sampling patterns on graphs is established, showing also how the spectral characteristics of these patterns are shaped by their vertex domain attributes. Additionally, for the generation of blue noise patterns a void and cluster algorithm on graphs is proposed exploiting the vertex-domain distribution of the sampling nodes. Numerical experiments show that the reconstruction error obtained with these patterns is similar to the one obtained by the state of the art approaches. Additionally, we explore the uniqueness sets for signals on cographs. Using the structure of the tree representation of a cograph, we proposed an algorithm that find its uniqueness sets from very simple small size graphs without any spectral decomposition or extensive searches on the vertex domain. The analysis performed on threshold graphs allowed us to calculate a closed form solution for the uniqueness sets. In the second part of this dissertation we consider the problem of sampling on regular grids for compressed sensing applications. We design optimal sampling patterns in coded apertures for CASSI systems and compressive X-ray tomosynthesis architectures, providing closed form solutions that outperform the results achieved using designs obtained with previous approaches, at a very low computational cost. Additionally, a rigorous estimate of the spectral resolution in general colored CASSI systems is provided exploiting the structure of the non-ideal sampling patterns obtained when wide spectral filters are considered.
590
$a
School code: 0060.
650
4
$a
Electrical engineering.
$3
649834
650
4
$a
Applied mathematics.
$3
2122814
653
$a
Blue-noise sampling
653
$a
Graph signal processing
653
$a
Optimal sampling
690
$a
0544
690
$a
0364
710
2
$a
University of Delaware.
$b
Electrical and Computer Engineering.
$3
3183620
773
0
$t
Dissertations Abstracts International
$g
81-04B.
790
$a
0060
791
$a
Ph.D.
792
$a
2019
793
$a
English
856
4 0
$u
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=22592156
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9420973
電子資源
11.線上閱覽_V
電子書
EB
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入