Sciweavers

1040 search results - page 31 / 208
» A Fast Algorithm of Image Layer-Presentation
Sort
View
ICIP
2003
IEEE
16 years 4 months ago
A new rate-minimizing matching criterion and a fast algorithm for block motion estimation
We present a new block matching criterion for motion estimation in video coding that will give better encoded video quality than the commonly used sum of absolute differences (SAD...
Tuukka Toivonen, Janne Heikkilä
CVPR
2000
IEEE
15 years 7 months ago
Provably Fast Algorithms for Contour Tracking
A new tracker is presented. Two sets are identified: one which contains all possible curves as found in the image, and a second which contains all curves which characterize the o...
Daniel Freedman, Michael S. Brandstein
ICIP
2010
IEEE
15 years 13 days ago
A concave cost formulation for parametric curve fitting: Detection of leukocytes from intravital microscopy images
We formulate parametric curve fitting as a concave cost minimization problem. Our formulation is general encompassing any parametric curve where parameters can be free or constrai...
Nilanjan Ray
JPDC
2006
134views more  JPDC 2006»
15 years 2 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
SIAMIS
2011
14 years 9 months ago
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
Stephen Becker, Jérôme Bobin, Emmanue...