Sciweavers

327 search results - page 16 / 66
» A Spectral Approach to Learning Structural Variations in Gra...
Sort
View
CVPR
2005
IEEE
14 years 9 months ago
Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
David Tolliver, Gary L. Miller, Robert T. Collins
MICCAI
2010
Springer
13 years 5 months ago
Segmentation Subject to Stitching Constraints: Finding Many Small Structures in a Large Image
International Conference on Medical Image Computing and Computer Assisted Intervention, Beijing, China, 20-24 September 2010 Extracting numerous cells in a large microscopic image...
Elena Bernardis, Stella X. Yu
EUROCOLT
1995
Springer
13 years 11 months ago
The structure of intrinsic complexity of learning
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
Sanjay Jain, Arun Sharma
ICASSP
2011
IEEE
12 years 11 months ago
A non-negative approach to semi-supervised separation of speech from noise with the use of temporal dynamics
We present a semi-supervised source separation methodology to denoise speech by modeling speech as one source and noise as the other source. We model speech using the recently pro...
Gautham J. Mysore, Paris Smaragdis
DAGSTUHL
2006
13 years 8 months ago
Many-to-Many Feature Matching in Object Recognition
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
Ali Shokoufandeh, Yakov Keselman, M. Fatih Demirci...