Sciweavers

1024 search results - page 111 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
ICCV
2009
IEEE
16 years 2 months ago
GroupSAC: Efficient Consensus in the Presence of Groupings
We present a novel variant of the RANSAC algorithm that is much more efficient, in particular when dealing with problems with low inlier ratios. Our algorithm assumes that there...
Kai Ni, Hailin Jin, Frank Dellaert
ICDM
2006
IEEE
145views Data Mining» more  ICDM 2006»
15 years 4 months ago
Stability Region Based Expectation Maximization for Model-based Clustering
In spite of the initialization problem, the ExpectationMaximization (EM) algorithm is widely used for estimating the parameters in several data mining related tasks. Most popular ...
Chandan K. Reddy, Hsiao-Dong Chiang, Bala Rajaratn...
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
15 years 3 months ago
Evolutionary change in developmental timing
This paper presents a mutation-based evolutionary algorithm that evolves genotypic genes for regulating developmental timing of phenotypic values. The genotype sequentially genera...
Kei Ohnishi, Kaori Yoshida
COCOON
2010
Springer
15 years 2 months ago
Clustering with or without the Approximation
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Frans Schalekamp, Michael Yu, Anke van Zuylen
IPMI
2001
Springer
15 years 10 months ago
Deformation Analysis for Shape Based Classification
Statistical analysis of anatomical shape differences between two different populations can be reduced to a classification problem, i.e., learning a classifier function for assignin...
Polina Golland, W. Eric L. Grimson, Martha Elizabe...