Sciweavers

315 search results - page 48 / 63
» An Optimal Algorithm for the Maximum-Density Segment Problem
Sort
View
IJON
2002
85views more  IJON 2002»
13 years 6 months ago
Learning statistically efficient features for speaker recognition
We apply independent component analysis (ICA) for extracting an optimal basis to the problem of finding efficient features for a speaker. The basis functions learned by the algori...
Gil-Jin Jang, Te-Won Lee, Yung-Hwan Oh
ICIP
2010
IEEE
13 years 4 months ago
Randomized motion estimation
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
Sylvain Boltz, Frank Nielsen
CVPR
2010
IEEE
14 years 2 months ago
Parallel Graph-cuts by Adaptive Bottom-up Merging
Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today’s ubiquitou...
Jiangyu Liu, Jian Sun
ESA
2006
Springer
77views Algorithms» more  ESA 2006»
13 years 10 months ago
Traversing the Machining Graph
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao W...
ICIP
2003
IEEE
14 years 8 months ago
A Bayesian framework for Gaussian mixture background modeling
Background subtraction is an essential processing component for many video applications. However, its development has largely been application driven and done in ad hoc manners. I...
Dar-Shyang Lee, Jonathan J. Hull, Berna Erol