Sciweavers

1646 search results - page 144 / 330
» fast 2007
Sort
View
CORR
2007
Springer
79views Education» more  CORR 2007»
15 years 7 months ago
Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
We present algorithms for the discrete cosine transform (DCT) and discrete sine transform (DST), of types II and III, that achieve a lower count of real multiplications and additi...
Xuancheng Shao, Steven G. Johnson
ICCV
2007
IEEE
16 years 9 months ago
Interactive Offline Tracking for Color Objects
In this paper, we present an interactive offline tracking system for generic color objects. The system achieves 60100 fps on a 320 ? 240 video. The user can therefore easily refin...
Yichen Wei, Jian Sun, Xiaoou Tang, Heung-Yeung Shu...
223
Voted
ICCV
2007
IEEE
16 years 9 months ago
Finding a Closed Boundary by Growing Minimal Paths from a Single Point on 2D or 3D Images
In this paper, we present a new method for segmenting closed contours and surfaces. Our work builds on a variant of the Fast Marching algorithm. First, an initial point on the des...
Fethallah Benmansour, Stephane Bonneau, Laurent D....
ICIP
2007
IEEE
16 years 1 months ago
Software Pipelines Design for Variable Block-Size Motion Estimation with Large Search Range
This paper presents some techniques for efficient motion estimation (ME) implementation on fixed-point digital signal processor (DSP) for high resolution video coding. First, chal...
Zhigang Yang, Wen Gao, Yan Liu, Debin Zhao
LATIN
2010
Springer
16 years 1 months ago
Layered Working-Set Trees
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...