Sciweavers

1111 search results - page 54 / 223
» Fast Image Alignment Using Anytime Algorithms
Sort
View
75
Voted
ICIP
1995
IEEE
15 years 1 months ago
Novel fast block motion estimation in feature subspace
Motion estimation and compensation are widely used in video coding. This paper presents two fast block matching algorithms for motion estimation. These algorithms use the subspace...
Yiu-Hung Fok, Oscar C. Au, Ross D. Murch
77
Voted
CVPR
2003
IEEE
15 years 11 months ago
On Region Merging: The Statistical Soundness of Fast Sorting, with Applications
This work explores a statistical basis for a process often described in computer vision: image segmentation by region merging following a particular order in the choice of regions...
Frank Nielsen, Richard Nock
VISUALIZATION
1998
IEEE
15 years 1 months ago
Eliminating popping artifacts in sheet buffer-based splatting
Splatting is a fast volume rendering algorithm which achieves its speed by projecting voxels in the form of pre-integrated interpolation kernels, or splats. Presently, two main va...
Klaus Mueller, Roger Crawfis
ICIP
2010
IEEE
14 years 7 months ago
Fast object detection using boosted co-occurrence histograms of oriented gradients
Co-occurrence histograms of oriented gradients (CoHOG) are powerful descriptors in object detection. In this paper, we propose to utilize a very large pool of CoHOG features with ...
Haoyu Ren, Cher-Keng Heng, Wei Zheng, Luhong Liang...
76
Voted
TIP
2010
89views more  TIP 2010»
14 years 4 months ago
Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
Nonconvex nonsmooth regularization has advantages over convex regularization for restoring images with neat edges. However, its practical interest used to be limited by the difficu...
Mila Nikolova, Michael K. Ng, Chi-Pan Tam