Sciweavers

28 search results - page 3 / 6
» Downsampling graphs using spectral theory
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
Diana Mateus, Radu Horaud, David Knossow, Fabio Cu...
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 8 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
SIGGRAPH
2009
ACM
14 years 2 months ago
Spectral mesh processing
Spectral methods for mesh processing and analysis rely on the eigenvalues, eigenvectors, or eigenspace projections derived from appropriately defined mesh operators to carry out ...
Bruno Lévy, Hao Zhang 0002
TMI
2008
144views more  TMI 2008»
13 years 7 months ago
Automatic Detection of Regional Heart Rejection in USPIO-Enhanced MRI
Contrast-enhanced magnetic resonance imaging (MRI) is useful to study the infiltration of cells in vivo. This research adopts ultrasmall superparamagnetic iron oxide (USPIO) parti...
Hsun-Hsien Chang, José M. F. Moura, Yijen L...
MM
2004
ACM
195views Multimedia» more  MM 2004»
14 years 29 days ago
Hierarchical clustering of WWW image search results using visual, textual and link information
We consider the problem of clustering Web image search results. Generally, the image search results returned by an image search engine contain multiple topics. Organizing the resu...
Deng Cai, Xiaofei He, Zhiwei Li, Wei-Ying Ma, Ji-R...