16,556 research outputs found
Fast algorithm for the 3-D DCT-II
Recently, many applications for three-dimensional
(3-D) image and video compression have been proposed using 3-D discrete cosine transforms (3-D DCTs). Among different types of DCTs, the type-II DCT (DCT-II) is the most used. In order to use the 3-D DCTs in practical applications, fast 3-D algorithms are essential. Therefore, in this paper, the 3-D vector-radix decimation-in-frequency (3-D VR DIF) algorithm that calculates the 3-D DCT-II directly is introduced. The mathematical analysis and the implementation of the developed algorithm are presented,
showing that this algorithm possesses a regular structure, can be implemented in-place for efficient use of memory, and is faster than the conventional row-column-frame (RCF) approach. Furthermore, an application of 3-D video compression-based 3-D DCT-II is implemented using the 3-D new algorithm. This has led to a substantial speed improvement for 3-D DCT-II-based compression systems and proved the validity of the developed algorithm
Reconstruction of Binary Functions and Shapes from Incomplete Frequency Information
The characterization of a binary function by partial frequency information is
considered. We show that it is possible to reconstruct binary signals from
incomplete frequency measurements via the solution of a simple linear
optimization problem. We further prove that if a binary function is spatially
structured (e.g. a general black-white image or an indicator function of a
shape), then it can be recovered from very few low frequency measurements in
general. These results would lead to efficient methods of sensing,
characterizing and recovering a binary signal or a shape as well as other
applications like deconvolution of binary functions blurred by a low-pass
filter. Numerical results are provided to demonstrate the theoretical
arguments.Comment: IEEE Transactions on Information Theory, 201
- …