Sciweavers

164 search results - page 30 / 33
» Outlier-Robust Convex Segmentation
Sort
View
AMFG
2005
IEEE
155views Biometrics» more  AMFG 2005»
14 years 3 months ago
Linear Programming for Matching in Human Body Gesture Recognition
We present a novel human body gesture recognition method using a linear programming based matching scheme. Instead of attempting to segment an object from the background, we develo...
Hao Jiang, Ze-Nian Li, Mark S. Drew
DATE
2003
IEEE
79views Hardware» more  DATE 2003»
14 years 3 months ago
Time Budgeting in a Wireplanning Context
Wireplanning is an approach in which the timing of inputoutput paths is planned before modules are specified, synthesized or sized. If these global wires are optimally segmented ...
Jurjen Westra, Dirk-Jan Jongeneel, Ralph H. J. M. ...
ICVGIP
2008
13 years 11 months ago
Monocular Depth by Nonlinear Diffusion
Following the phenomenological approach of gestaltists, sparse monocular depth cues such as T- and X-junctions and the local convexity are crucial to identify the shape and depth ...
Jean-Michel Morel, Philippe Salembier
AAAI
2000
13 years 11 months ago
Generalizing Boundary Points
The complexity of numerical domain partitioning depends on the number of potential cut points. In multiway partitioning this dependency is often quadratic, even exponential. There...
Tapio Elomaa, Juho Rousu
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
13 years 11 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson