Sciweavers

1111 search results - page 47 / 223
» Fast Image Alignment Using Anytime Algorithms
Sort
View
99
Voted
ICIP
2003
IEEE
15 years 11 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ä
84
Voted
CVPR
2010
IEEE
15 years 5 months ago
Fast Matting Using Large Kernel Matting Laplacian Matrices
Image matting is of great importance in both computer vision and graphics applications. Most existing state-of-the-art techniques rely on large sparse matrices such as the matting ...
Kaiming He, Jian Sun, Xiaoou Tang
JPDC
2006
134views more  JPDC 2006»
14 years 9 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
CMPB
2010
152views more  CMPB 2010»
14 years 9 months ago
Fast free-form deformation using graphics processing units
A large number of algorithms have been developed to perform non-rigid registration and it is a tool commonly used in medical image analysis. The FreeForm Deformation algorithm is ...
Marc Modat, Gerard R. Ridgway, Zeike A. Taylor, Ma...
DCC
2004
IEEE
15 years 9 months ago
Fast Near-Lossless or Lossless Compression of Large 3D Neuro-Anatomical Images
3D neuro-anatomical images and other volumetric data sets are important in many scientific and biomedical fields. Since such sets may be extremely large, a scalable compression me...
Rongkai Zhao, Michael Gabriel, Geneva G. Belford