Filterbank and DFT Based Fast Parallel Discrete Gabor Transform for Image Representation

2012 ◽  
Vol 461 ◽  
pp. 444-447 ◽  
Author(s):  
Juan Juan Gu ◽  
Liang Tao
Keyword(s):  
Image Processing ◽  
Fourier Transform ◽  
Computational Complexity ◽  
Parallel Algorithm ◽  
Image Representation ◽  
Gabor Transform ◽  
Parallel Channel ◽  
Real Time Image ◽  
Parallel Channels ◽  
Time Image

Fast parallel algorithm for the 2-D discrete Gabor transform (DGT) is presented based on 2-D filterbank. A 2-D analysis filterbank is designed for the 2-D DGT. The parallel channels in the filterbank have a unified structure and can apply the 2-D inverse fast discrete Fourier transform (IFFT) algorithm to reduce the computational load. The computational complexity of each parallel channel is very low and is independent of the oversampling rate. Thus, the proposed parallel algorithm is attractive for real time image processing.

Multirate and DFT Based Fast Parallel Algorithm for 2-D Inverse Discrete Gabor Transform

2013 ◽  
Vol 411-414 ◽  
pp. 1377-1380
Author(s):  
Juan Juan Gu ◽  
Liang Tao
Keyword(s):  
Image Processing ◽  
Fourier Transform ◽  
Computational Complexity ◽  
Parallel Algorithm ◽  
Gabor Transform ◽  
Parallel Channel ◽  
Inverse Discrete Fourier Transform ◽  
Real Time Image ◽  
Parallel Channels ◽  
Time Image

Multirate and DFT based fast parallel algorithm for the 2-D inverse discrete Gabor transform (IDGT) is presented. A 2-D synthesis filterbank is designed for the 2-D IDGT. The parallel channels in the filterbank have a unified structure and can apply the 2-D fast inverse discrete Fourier transform (IFFT) algorithm to reduce the computational load. The computational complexity of each parallel channel is very low and is independent of the oversampling rate. Thus, the proposed parallel algorithm is attractive for real time image processing.

Multirate-Based Fast Parallel Algorithm for 2-D DCT-Based Real-Valued Discrete Gabor Transform

2012 ◽  
Vol 461 ◽  
pp. 448-452
Author(s):  
Juan Juan Gu ◽  
Liang Tao
Keyword(s):  
Image Processing ◽  
Computational Complexity ◽  
Parallel Algorithm ◽  
Parallel Implementation ◽  
Gabor Transform ◽  
Parallel Channel ◽  
Analysis Process ◽  
Real Time Image ◽  
Parallel Channels ◽  
Time Image

Novel and fast algorithm for the multirate and parallel implementation of the 2-D DCT-based real-valued discrete Gabor transform (RDGT) is presented. A 2-D multirate-based analysis filterbank is designed for the 2-D RDGT. Each of the parallel channels in the filterbank has a unified structure and can apply the 2-D fast discrete cosine transform (DCT) algorithm to reduce its computational load. The computational complexity of each parallel channel is very low and is independent of the oversampling rate. All the RDGT coefficients are computed in parallel during the analysis process. Thus, the proposed parallel algorithm is attractive for real time image processing.

The Parallel Design and Implementation of the PCNN Algorithm Based on the Visual Perception Information

2013 ◽  
Vol 291-294 ◽  
pp. 2936-2940 ◽  
Author(s):  
Yan Ming Zhao ◽  
Yong Wang
Keyword(s):  
Image Processing ◽  
Computational Complexity ◽  
Visual Perception ◽  
Parallel Algorithm ◽  
Real Time ◽  
Parallel Design ◽  
Design And Implementation ◽  
Real Time Image ◽  
Time Image ◽  
High Computational Complexity

The PCNN algorithm based on the visual perception of information can better analyze and understand the natural essence of image. But the multi-parameter settings and high computational complexity restrict the application of the algorithm in the industrial real-time image processing. Based on this, The parallel design and implementation of the PCNN algorithm based on the visual perception information is proposed. The PCNN algorithm is improved by the visual perception method, through analyzing parallelization of the feasibility of the algorithm, the parallel algorithm running at the cluster and experimental environment are developed. The performance of the parallel algorithm is verified by industrial image on the cluster, the experimental results show that the parallelized the PCNN algorithm has a better scalability and speedup.

Comparison of Image Decompositions Through Inverse Difference and Laplacian Pyramids

2015 ◽  
Vol 6 (1) ◽  
pp. 19-38 ◽  
Author(s):  
Roumen Kountchev ◽  
Stuart Rubin ◽  
Mariofanna Milanova ◽  
Roumiana Kountcheva
Keyword(s):  
Image Processing ◽  
Fourier Transform ◽  
Computational Complexity ◽  
Image Representation ◽  
Quantization Noise ◽  
Laplacian Pyramid ◽  
Image Transfer ◽  
Multi Level ◽  
Real Time Applications ◽  
The Fourier Transform

In this work, the Inverse Difference Pyramid (IDP) and its modification – the Reduced IDP (RIDP), are compared and evaluated with the famous Laplacian Pyramid (LP) for multi-level decomposition of digital images. The comparison comprises: the structures of LP and IDP, the image representation through LP and IDP in the pixel space and in the spectrum space of the Fourier transform, the efficiency of both transforms for the aims of the progressive image transfer, the LP and the IDP computation graphs and the evaluation of the computational complexity of the algorithms for the 3-level reduced LP and the 3-level reduced IDP. The influence of the quantization noise on both decompositions is also analyzed. On the basis of the comparison are outlined the basic advantages of the RIDP for pipeline image processing. The results obtained could be used for the design of coders for image compression, aimed at real-time applications, etc.

Sign in / Sign up

Export Citation Format

Share Document