@conference {64916,
	title = {Matched signal detection on graphs: Theory and application to brain network classification},
	booktitle = {Proc. 23rd International Conference on Information Processing in Medical Imaging (IPMI 2013)},
	year = {2013},
	month = {29 Jun. - 3 Jul.},
	address = {Asilomar, CA},
	abstract = {We develop a matched signal detection (MSD) theory for signals with an intrinsic structure described by a weighted graph. Hypothesis tests are formulated under different signal models. In the simplest scenario, we assume that the signal is deterministic with noise in a subspace spanned by a subset of eigenvectors of the graph Laplacian. The conventional matched subspace detection can be easily extended to this case. Furthermore, we study signals with certain level of smoothness. The test turns out to be a weighted energy detector, when the noise variance is negligible. More generally, we presume that the signal follows a prior distribution, which could be learnt from training data. The test statistic is then the difference of signal variations on associated graph structures, if an Ising model is adopted. Effectiveness of the MSD on graph is evaluated both by simulation and real data. We apply it to the network classification problem of Alzheimer{\textquoteright}s disease (AD) particularly. The preliminary results demonstrate that our approach is able to exploit the sub-manifold structure of the data, and therefore achieve a better performance than the traditional principle component analysis (PCA).},
	author = {Chenhui Hu and Lin Cheng and Jorge Sepulcre and Georges El Fakhri and Yue M. Lu and Quanzheng Li}
}
