scispace - formally typeset
Search or ask a question
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
More filters
Proceedings ArticleDOI
23 May 1989
TL;DR: The result is that a 3-D DCT can be obtained from a 3,D DFT (discrete Fourier transform) of the same size on reals at the cost of permutations and O(3/2N/sup 3/) multiplications.
Abstract: An overview of some alternative algorithms for one- and two-dimensional DCTs (discrete cosine transforms) is given. Operation counts are derived for typical examples useful in image processing. It is shown that it is possible to generalize the 2-D schemes to 3-D DCTs as well. The result is that a 3-D DCT can be obtained from a 3-D DFT (discrete Fourier transform) of the same size on reals at the cost of permutations and O(3/2N/sup 3/) multiplications. The scheme involves rotations on eight output points at a time. Improvements through scaling are discussed, and implementation issues (both in hardware and software) are addressed. >

32 citations

Proceedings ArticleDOI
09 May 1995
TL;DR: A discrete version of the AFT (DRFT) that represents a rotation in discrete time-frequency space and some properties of the transform that support its interpretation as a rotation are presented.
Abstract: The continuous-time angular Fourier transformation (AFT) represents a rotation in continuous time-frequency space and also serves as an orthonormal signal representation for chirp signals. We present a discrete version of the AFT (DRFT) that represents a rotation in discrete time-frequency space and some properties of the transform that support its interpretation as a rotation. The transform is a generalization of the DFT. The eigenvalue structure of the DFT is then exploited to develop an efficient algorithm for the computation of this transform.

32 citations

Journal ArticleDOI
TL;DR: The proposed perceptual video hashing system has been shown to outperform related state-of-the art video hashing techniques in terms of identification and authentication with the advantageous ability to locate tampered regions.
Abstract: Perceptual hashing has been broadly used in the literature to identify similar contents for video copy detection. It has also been adopted to detect malicious manipulations for video authentication. However, targeting both applications with a single system using the same hash would be highly desirable as this saves the storage space and reduces the computational complexity. This paper proposes a perceptual video hashing system for content identification and authentication. The objective is to design a hash extraction technique that can withstand signal processing operations on one hand and detect malicious attacks on the other hand. The proposed system relies on a new signal calibration technique for extracting the hash using the discrete cosine transform (DCT) and the discrete sine transform (DST). This consists of determining the number of samples, called the normalizing shift, that is required for shifting a digital signal so that the shifted version matches a certain pattern according to DCT/DST coefficients. The rationale for the calibration idea is that the normalizing shift resists signal processing operations while it exhibits sensitivity to local tampering (i.e., replacing a small portion of the signal with a different one). While the same hash serves both applications, two different similarity measures have been proposed for video identification and authentication, respectively. Through intensive experiments with various types of video distortions and manipulations, the proposed system has been shown to outperform related state-of-the art video hashing techniques in terms of identification and authentication with the advantageous ability to locate tampered regions.

32 citations

Journal ArticleDOI
TL;DR: Efficient and accurate numerical methods are presented for computing ground states and dynamics of the three-dimensional (3D) nonlinear relativistic Hartree equation both without and with an external potential to demonstrate the spectral accuracy of the methods.

32 citations

Journal ArticleDOI
TL;DR: A efficient pipelined hardware implementation of the adaptive multiple transform (AMT) as a new approach of the transform core design with larger and more flexible partitioning block sizes is presented.
Abstract: Versatile video coding is the next generation video coding standard expected by the end of 2020. Several new contributions have been proposed to enhance the coding efficiency beyond the high efficiency video coding standard. One of these tools is the adaptive multiple transform (AMT) as a new approach of the transform core design. The AMT involves five discrete cosine transform/discrete sine transform types with larger and more flexible partitioning block sizes. However, the AMT coding efficiency comes with the cost of higher computational complexity, especially at the encoder side. In this paper, a efficient pipelined hardware implementation of the AMT including the five types of sizes $4\times 4$ , $8\times 8$ , $16\times 16$ and $32\times 32$ is proposed. The architecture design takes advantage of the internal software/hardware resources of the target field-programmable gate array device such as library of parametrized modules core intellectual properties and digital signal processing blocks. The proposed 1-D 32-point AMT design allows to process 4K video at 44 frames/s. A unified 2-D implementation of the 4, 8, 16, and 32-point AMT design is also presented.The implementation takes into account all the asymmetric 2-D block size combinations from 4 to 32. The 2-D architecture design is able to sustain 2K video coding at 50 frames/s with an operational frequency up to 147 MHz.

31 citations


Network Information
Related Topics (5)
Feature extraction
111.8K papers, 2.1M citations
84% related
Image processing
229.9K papers, 3.5M citations
82% related
Image segmentation
79.6K papers, 1.8M citations
82% related
Optimization problem
96.4K papers, 2.1M citations
81% related
Network packet
159.7K papers, 2.2M citations
80% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20234
202234
202124
202021
201925
201833