Topic
Discrete sine transform
About: Discrete sine transform is a research topic. Over the lifetime, 3269 publications have been published within this topic receiving 73181 citations.
Papers published on a yearly basis
Papers
More filters
01 Dec 2013
TL;DR: This work devise a novel ADST-like transform whose kernel is consistent with that of DCT, thereby enabling butterfly structured computation flow, while largely retaining the performance advantages of hybrid transform coding scheme in terms of compression efficiency.
Abstract: The hybrid transform coding scheme that alternates amongst the asymmetric discrete sine transform (ADST) and the discrete cosine transform (DCT) depending on the boundary prediction conditions, is an efficient tool for video and image compression. It optimally exploits the statistical characteristics of prediction residual, thereby achieving significant coding performance gains over the conventional DCT-based approach. A practical concern lies in the intrinsic conflict between transform kernels of ADST and DCT, which prevents a butterfly structured implementation for parallel computing. Hence the hybrid transform coding scheme has to rely on matrix multiplication, which presents a speed-up barrier due to under-utilization of the hardware, especially for larger block sizes. In this work, we devise a novel ADST-like transform whose kernel is consistent with that of DCT, thereby enabling butterfly structured computation flow, while largely retaining the performance advantages of hybrid transform coding scheme in terms of compression efficiency. A prototype implementation of the proposed butterfly structured hybrid transform coding scheme is available in the VP9 codec repository.
21 citations
TL;DR: The result is able to define a class of discrete tranformations which can be considered as a generalization of the discrete Fourier transform.
Abstract: In [2] we have considered a class of integral transforms which generalizs the classical Fourier tranform. We are able now to define a class of discrete tranformations which can be considered as a generalization of the discrete Fourier transform. Furthermore, when our result is considered in connnection with the particular kernel associated with th Fourier transform, the fast Fourier transform algorithm can be used in order to approximate the Hermite-Fourier coefficients of a class of functions *
21 citations
TL;DR: In this paper, a mathematical method has been developed to characterize discrete devices such as focal plane arrays using discrete Fourier transform (DFT) techniques, and the previous non-isoplanatic (space variant) problem may be avoided.
21 citations
TL;DR: A new fast Fouriertransform is proposed to recover a real non-negative signal xR+N from its discrete Fourier transform x=FNxCN if the signal x appears to have a short support, i.e., vanishes outside a support interval of length m.
21 citations
TL;DR: In this article, two methods of solving the inverse heat conduction problem with employment of the discrete Fournier transform are presented, which operate similarly to the SVD algorithm and consist in reducing the number of components of the DFT which are taken into account to determine the solution to the inverse problem.
Abstract: Two methods of solving the inverse heat conduction problem with employment of the discrete Fournier transform are presented in this article. The first one operates similarly to the SVD algorithm and consists in reducing the number of components of the discrete Fournier transform which are taken into account to determine the solution to the inverse problem. The second method is related to the regularization of the solution to the inverse problem in the discrete Fournier transform domain. Those methods were illustrated by numerical examples. In the first example, an influence of the boundary conditions disturbance by a random error on the solution to the inverse problem (its stability) was examined. In the second example, the temperature distribution on the inner boundary of the multiply connected domain was determined. Results of calculations made in both ways brought very good outcomes and confirm the usefulness of applying the discrete Fournier transform to solving inverse problems.
21 citations