2016
DOI: 10.1016/j.neuroimage.2015.10.026
|View full text |Cite
|
Sign up to set email alerts
|

Matched signal detection on graphs: Theory and application to brain imaging data classification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
44
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
9
1

Relationship

1
9

Authors

Journals

citations
Cited by 43 publications
(44 citation statements)
references
References 41 publications
0
44
0
Order By: Relevance
“…Hu et al . developed a MSD theory for signals derived from weighted graphs 46 . Graph Laplacian eigenvalues are regarded as frequencies of graph-signals and the signals are assumed to lie in a subspace spanned by the first few graph Laplacian eigenvectors that are associated with lower eigenvalues.…”
Section: Methodsmentioning
confidence: 99%
“…Hu et al . developed a MSD theory for signals derived from weighted graphs 46 . Graph Laplacian eigenvalues are regarded as frequencies of graph-signals and the signals are assumed to lie in a subspace spanned by the first few graph Laplacian eigenvectors that are associated with lower eigenvalues.…”
Section: Methodsmentioning
confidence: 99%
“…The filtered noise back is used in the iterative regularization [27] to denoise the image at each iteration to improve the quality of the image based on the previous estimation using Eq. (10).…”
Section: Iterative Regularizationmentioning
confidence: 99%
“…Although no proper treatment exists to cure this illness, its early detection is helpful in controlling the disease [28]. Various attempts have been made to detect the AD in the early stage called mild cognitive impairment (MCI) using different modalities like graph signal processing [29], machine learning [30], [31] and diffusion model [5] etc. Recently, GCNN has also been applied for this detection purpose [26], [27].…”
Section: Introductionmentioning
confidence: 99%