Paper Info
Title
Tensor Representation Of Color Images And Fast 2-D Quaternion Discrete Fourier Transform
Abstract
In this paper, a general, efficient, split algorithm to compute the two-dimensional quaternion discrete Fourier transform (2-D QDFT), by using the special partitioning in the frequency domain, is introduced. The partition determines an effective transformation, or color image representation in the form of 1-D quaternion signals which allow for splitting the N x M-point 2-D QDFT into a set of 1-D QDFTs. Comparative estimates revealing the efficiency of the proposed algorithms with respect to the known ones are given. In particular, a proposed method of calculating the 2(r) x 2(r)-point 2-D QDFT uses 18N(2) less multiplications than the well-known column-row method and method of calculation based on the symplectic decomposition. The proposed algorithm is simple to apply and design, which makes it very practical in color image processing in the frequency domain.
Year
DOI
Venue
2015
10.1117/12.2083199
IMAGE PROCESSING: ALGORITHMS AND SYSTEMS XIII
Keywords
Field
DocType
Discrete quaternion Fourier transform, 2-D Fourier transform, 2-D discrete tensor transform, tensor representation of the image
Discrete-time Fourier transform,Non-uniform discrete Fourier transform,Algebra,Algorithm,Fourier transform,Discrete Fourier transform (general),Discrete Hartley transform,Discrete Fourier transform,Fractional Fourier transform,Discrete sine transform,Mathematics
Conference
Volume
ISSN
Citations 
9399
0277-786X
1
PageRank 
References 
Authors
0.35
13
2
Name
Order
Citations
PageRank
Artyom M. Grigoryan113427.30
Sos Agaian26716.48