Sciweavers

2520 search results - page 448 / 504
» The complexity of approximating entropy
Sort
View
CVPR
2004
IEEE
16 years 1 days ago
Collaborative Tracking of Multiple Targets
Coalescence, meaning the tracker associates more than one trajectories to some targets while loses track for others, is a challenging problem for visual tracking of multiple targe...
Ting Yu, Ying Wu
ECCV
2006
Springer
15 years 12 months ago
EMD-L1: An Efficient and Robust Algorithm for Comparing Histogram-Based Descriptors
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
Haibin Ling, Kazunori Okada
ICIP
2005
IEEE
15 years 11 months ago
A dynamic Bezier curve model
Bezier curves (BC) are fundamental to a wide range of applications from computer-aided design through to object shape descriptions and surface mapping. Since BC only consider glob...
Ferdous Ahmed Sohel, Laurence S. Dooley, Gour C. K...
ISBI
2004
IEEE
15 years 10 months ago
Fast Multiresolution Photon-Limited Image Reconstruction
The techniques described in this paper allow multiscale photon-limited image reconstruction methods to be implemented with significantly less computational complexity than previou...
Rebecca Willett, Robert Nowak
WWW
2008
ACM
15 years 10 months ago
Utility-driven load shedding for xml stream processing
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
Mingzhu Wei, Elke A. Rundensteiner, Murali Mani