Sciweavers

299 search results - page 24 / 60
» A Convex Relaxation Approach for Computing Minimal Partition...
Sort
View
CVPR
2007
IEEE
15 years 11 months ago
A Linear Programming Approach for Multiple Object Tracking
We propose a linear programming relaxation scheme for the class of multiple object tracking problems where the inter-object interaction metric is convex and the intraobject term q...
Hao Jiang, Sidney Fels, James J. Little
ICPR
2008
IEEE
15 years 4 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
CVPR
2009
IEEE
15 years 4 months ago
Automatic facial landmark labeling with minimal supervision
Landmark labeling of training images is essential for many learning tasks in computer vision, such as object detection, tracking, and alignment. Image labeling is typically conduc...
Yan Tong, Xiaoming Liu 0002, Frederick W. Wheeler,...
JPDC
2006
146views more  JPDC 2006»
14 years 9 months ago
A semi-static approach to mapping dynamic iterative tasks onto heterogeneous computing systems
Minimization of the execution time of an iterative application in a heterogeneous parallel computing environment requires an appropriate mapping scheme for matching and scheduling...
Yu-Kwong Kwok, Anthony A. Maciejewski, Howard Jay ...
CVPR
2011
IEEE
14 years 5 months ago
Piecing Together the Segmentation Jigsaw using Context
We present an approach to jointly solve the segmentation and recognition problem using a multiple segmentation framework. We formulate the problem as segment selection from a pool...
Xi Chen, Arpit Jain, Abhinav Gupta, Larry Davis