Sciweavers

101 search results - page 10 / 21
» Graph Partition by Swendsen-Wang Cuts
Sort
View
ICML
2004
IEEE
15 years 10 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
MICCAI
2004
Springer
15 years 10 months ago
Clustering Fiber Traces Using Normalized Cuts
In this paper we present a framework for unsupervised segmentation of white matter fiber traces obtained from diffusion weighted MRI data. Fiber traces are compared pairwise to cre...
Anders Brun, Hans Knutsson, Hae-Jeong Park, Martha...
ICASSP
2007
IEEE
15 years 4 months ago
Sound Source Tracking and Formation using Normalized Cuts
The goal of computational auditory scene analysis (CASA) is to create computer systems that can take as input a mixture of sounds and form packages of acoustic evidence such that ...
Mathieu Lagrange, George Tzanetakis
91
Voted
TASLP
2008
123views more  TASLP 2008»
14 years 9 months ago
Normalized Cuts for Predominant Melodic Source Separation
The predominant melodic source, frequently the singing voice, is an important component of musical signals. In this paper, we describe a method for extracting the predominant sourc...
Mathieu Lagrange, Luis Gustavo Martins, Jennifer M...
CPC
2007
61views more  CPC 2007»
14 years 9 months ago
Maximizing Several Cuts Simultaneously
Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that for both i = 1, 2 we hav...
Daniela Kühn, Deryk Osthus