Sciweavers

3 search results - page 1 / 1
» Graph Laplacian Tomography From Unknown Random Projections
Sort
View
85
Voted
TIP
2008
124views more  TIP 2008»
14 years 9 months ago
Graph Laplacian Tomography From Unknown Random Projections
We introduce a graph Laplacian based algorithm for the tomography reconstruction of a planar object from its projections taken at random unknown directions. The algorithm is shown ...
Ronald R. Coifman, Yoel Shkolnisky, Fred J. Sigwor...
88
Voted
ECML
2004
Springer
15 years 3 months ago
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
Marco Saerens, François Fouss, Luh Yen, Pie...
TIT
2010
174views Education» more  TIT 2010»
14 years 4 months ago
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Compressed sensing (CS) has recently emerged as a powerful signal acquisition paradigm. In essence, CS enables the recovery of high-dimensional sparse signals from relatively few ...
Jarvis Haupt, Waheed Uz Zaman Bajwa, Gil M. Raz, R...