This document describes a hardware implementation of the discrete cosine transform (DCT) using an FPGA for image compression. It presents the theory behind DCT and describes implementing a 2D DCT algorithm using a Lee algorithm on an FPGA. Experimental results show the FPGA implementation achieves a maximum 8% error compared to MATLAB and uses only 14% of FPGA resources while allowing real-time processing for video compression.
FPGA Implementation of 2-D DCT & DWT Engines for Vision Based Tracking of Dyn...IJERA Editor
Real time motion estimation for tracking is a challenging task. Several techniques can transform an image into frequency domain, such as DCT, DFT and wavelet transform. Direct implementation of 2-D DCT takes N^4 multiplications for an N x N image which is impractical. The proposed architecture for implementation of 2-D DCT uses look up tables. They are used to store pre-computed vector products that completely eliminate the multiplier. This makes the architecture highly time efficient, and the routing delay and power consumption is also reduced significantly. Another approach, 2-D discrete wavelet transform based motion estimation (DWT-ME) provides substantial improvements in quality and area. The proposed architecture uses Haar wavelet transform for motion estimation. In this paper, we present the comparison of the performance of discrete cosine transform, discrete wavelet transform for implementation in motion estimation.
Matlab Implementation of Baseline JPEG Image Compression Using Hardware Optim...inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
MEDIAN BASED PARALLEL STEERING KERNEL REGRESSION FOR IMAGE RECONSTRUCTIONcsandit
Image reconstruction is a process of obtaining the original image from corrupted data.Applications of image reconstruction include Computer Tomography, radar imaging, weather forecasting etc. Recently steering kernel regression method has been applied for image reconstruction [1]. There are two major drawbacks in this technique. Firstly, it is computationally intensive. Secondly, output of the algorithm suffers form spurious edges(especially in case of denoising). We propose a modified version of Steering Kernel Regression called as Median Based Parallel Steering Kernel Regression Technique. In the proposed algorithm the first problem is overcome by implementing it in on GPUs and multi-cores. The second problem is addressed by a gradient based suppression in which median filter is used.Our algorithm gives better output than that of the Steering Kernel Regression. The results are compared using Root Mean Square Error(RMSE). Our algorithm has also shown a speedup of 21x using GPUs and shown speedup of 6x using multi-cores.
Median based parallel steering kernel regression for image reconstructioncsandit
Image reconstruction is a process of obtaining the original image from corrupted data.
Applications of image reconstruction include Computer Tomography, radar imaging, weather
forecasting etc. Recently steering kernel regression method has been applied for image
reconstruction [1]. There are two major drawbacks in this technique. Firstly, it is
computationally intensive. Secondly, output of the algorithm suffers form spurious edges
(especially in case of denoising). We propose a modified version of Steering Kernel Regression
called as Median Based Parallel Steering Kernel Regression Technique. In the proposed
algorithm the first problem is overcome by implementing it in on GPUs and multi-cores. The
second problem is addressed by a gradient based suppression in which median filter is used.
Our algorithm gives better output than that of the Steering Kernel Regression. The results are
compared using Root Mean Square Error(RMSE). Our algorithm has also shown a speedup of
21x using GPUs and shown speedup of 6x using multi-cores.
A Review on Image Compression using DCT and DWTIJSRD
Image Compression addresses the matter of reducing the amount of data needed to represent the digital image. There are several transformation techniques used for data compression. Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT) is mostly used transformation. The Discrete cosine transform (DCT) is a method for transform an image from spatial domain to frequency domain. DCT has high energy compaction property and requires less computational resources. On the other hand, DWT is multi resolution transformation. The research paper includes various approaches that have been used by different researchers for Image Compression. The analysis has been carried out in terms of performance parameters Peak signal to noise ratio, Bit error rate, Compression ratio, Mean square error. and time taken for decomposition and reconstruction.
PIPELINED ARCHITECTURE OF 2D-DCT, QUANTIZATION AND ZIGZAG PROCESS FOR JPEG IM...VLSICS Design
This paper presents the architecture and VHDL design of a Two Dimensional Discrete Cosine Transform (2D-DCT) with Quantization and zigzag arrangement. This architecture is used as the core and path in JPEG image compression hardware. The 2D- DCT calculation is made using the 2D- DCT Separability property, such that the whole architecture is divided into two 1D-DCT calculations by using a transpose buffer. Architecture for Quantization and zigzag process is also described in this paper. The quantization process is done using division operation. This design aimed to be implemented in Spartan-3E XC3S500 FPGA. The 2D- DCT architecture uses 1891 Slices, 51I/O pins, and 8 multipliers of one Xilinx Spartan-3E XC3S500E FPGA reaches an operating frequency of 101.35 MHz One input block with 8 x 8 elements of 8 bits each is processed in 6604 ns and pipeline latency is 140 clock cycles .
FPGA Implementation of 2-D DCT & DWT Engines for Vision Based Tracking of Dyn...IJERA Editor
Real time motion estimation for tracking is a challenging task. Several techniques can transform an image into frequency domain, such as DCT, DFT and wavelet transform. Direct implementation of 2-D DCT takes N^4 multiplications for an N x N image which is impractical. The proposed architecture for implementation of 2-D DCT uses look up tables. They are used to store pre-computed vector products that completely eliminate the multiplier. This makes the architecture highly time efficient, and the routing delay and power consumption is also reduced significantly. Another approach, 2-D discrete wavelet transform based motion estimation (DWT-ME) provides substantial improvements in quality and area. The proposed architecture uses Haar wavelet transform for motion estimation. In this paper, we present the comparison of the performance of discrete cosine transform, discrete wavelet transform for implementation in motion estimation.
Matlab Implementation of Baseline JPEG Image Compression Using Hardware Optim...inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
MEDIAN BASED PARALLEL STEERING KERNEL REGRESSION FOR IMAGE RECONSTRUCTIONcsandit
Image reconstruction is a process of obtaining the original image from corrupted data.Applications of image reconstruction include Computer Tomography, radar imaging, weather forecasting etc. Recently steering kernel regression method has been applied for image reconstruction [1]. There are two major drawbacks in this technique. Firstly, it is computationally intensive. Secondly, output of the algorithm suffers form spurious edges(especially in case of denoising). We propose a modified version of Steering Kernel Regression called as Median Based Parallel Steering Kernel Regression Technique. In the proposed algorithm the first problem is overcome by implementing it in on GPUs and multi-cores. The second problem is addressed by a gradient based suppression in which median filter is used.Our algorithm gives better output than that of the Steering Kernel Regression. The results are compared using Root Mean Square Error(RMSE). Our algorithm has also shown a speedup of 21x using GPUs and shown speedup of 6x using multi-cores.
Median based parallel steering kernel regression for image reconstructioncsandit
Image reconstruction is a process of obtaining the original image from corrupted data.
Applications of image reconstruction include Computer Tomography, radar imaging, weather
forecasting etc. Recently steering kernel regression method has been applied for image
reconstruction [1]. There are two major drawbacks in this technique. Firstly, it is
computationally intensive. Secondly, output of the algorithm suffers form spurious edges
(especially in case of denoising). We propose a modified version of Steering Kernel Regression
called as Median Based Parallel Steering Kernel Regression Technique. In the proposed
algorithm the first problem is overcome by implementing it in on GPUs and multi-cores. The
second problem is addressed by a gradient based suppression in which median filter is used.
Our algorithm gives better output than that of the Steering Kernel Regression. The results are
compared using Root Mean Square Error(RMSE). Our algorithm has also shown a speedup of
21x using GPUs and shown speedup of 6x using multi-cores.
A Review on Image Compression using DCT and DWTIJSRD
Image Compression addresses the matter of reducing the amount of data needed to represent the digital image. There are several transformation techniques used for data compression. Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT) is mostly used transformation. The Discrete cosine transform (DCT) is a method for transform an image from spatial domain to frequency domain. DCT has high energy compaction property and requires less computational resources. On the other hand, DWT is multi resolution transformation. The research paper includes various approaches that have been used by different researchers for Image Compression. The analysis has been carried out in terms of performance parameters Peak signal to noise ratio, Bit error rate, Compression ratio, Mean square error. and time taken for decomposition and reconstruction.
PIPELINED ARCHITECTURE OF 2D-DCT, QUANTIZATION AND ZIGZAG PROCESS FOR JPEG IM...VLSICS Design
This paper presents the architecture and VHDL design of a Two Dimensional Discrete Cosine Transform (2D-DCT) with Quantization and zigzag arrangement. This architecture is used as the core and path in JPEG image compression hardware. The 2D- DCT calculation is made using the 2D- DCT Separability property, such that the whole architecture is divided into two 1D-DCT calculations by using a transpose buffer. Architecture for Quantization and zigzag process is also described in this paper. The quantization process is done using division operation. This design aimed to be implemented in Spartan-3E XC3S500 FPGA. The 2D- DCT architecture uses 1891 Slices, 51I/O pins, and 8 multipliers of one Xilinx Spartan-3E XC3S500E FPGA reaches an operating frequency of 101.35 MHz One input block with 8 x 8 elements of 8 bits each is processed in 6604 ns and pipeline latency is 140 clock cycles .
Distributed Video Coding (DVC) has become increasingly popular in recent times among the researchers in video coding due to its attractive and promising features. DVC primarily has a modified complexity balance between the encoder and decoder, in contrast to conventional video codecs. However, Most of the reported DVC schemes have a high time-delay in decoder which hinders its practical application in real-time systems. In this work, we focus on speed up the Side Information(SI) generation module in DVC, which is a major function in the DVC coding algorithm and one of the time-consuming factor at the decoder. By applied it through Compute Unified Device Architecture (CUDA) based on General-Purpose Graphics Processing Unit (GPGPU), the experimental results show that a considerable speedup can be obtained by using the proposed parallelized SI generation algorithm.
Highly Parallel Pipelined VLSI Implementation of Lifting Based 2D Discrete Wa...idescitation
The lifting scheme based Discrete Wavelet
Transform is a powerful tool for image processing
applications. The lack of disk space during transmission and
storage of images pushes the demand for high speed
implementation of efficient compression technique. This paper
proposes a highly pipelined and distributed VLSI architecture
of lifting based 2D DWT with lifting coefficients represented
in fixed point [2:14] format. Compared to conventional
architectures [11], [13]-[16], the proposed highly pipelined
architecture optimizes the design which increases
significantly the performance speed. The design raises the
operating frequency, at the expense of more hardware area.
In this paper, initially a software model of the proposed design
was developed using MATLAB ®. Corresponding to this
software model, an efficient highly parallel pipelined
architecture was designed and developed using verilog HDL
language and implemented in VIRTEX ® 6 (XC6VHX380T)
FPGA. Also the design was synthesized on TSMC 0.18μm
ASIC Library by using Synopsis Design Compiler. The entire
system is suitable for several real time applications.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
n recent years, with the development of graphics p
rocessors, graphics cards have been widely
used to perform general-purpose calculations. Espec
ially with release of CUDA C
programming languages in 2007, most of the research
ers have been used CUDA C
programming language for the processes which needs
high performance computing.
In this paper, a scaling approach for image segment
ation using level sets is carried out by the
GPU programming techniques. Approach to level sets
is mainly based on the solution of partial
differential equations. The proposed method does no
t require the solution of partial differential
equation. Scaling approach, which uses basic geomet
ric transformations, is used. Thus, the
required computational cost reduces. The use of the
CUDA programming on the GPU has taken
advantage of classic programming as spending time a
nd performance. Thereby results are
obtained faster. The use of the GPU has provided to
enable real-time processing. The developed
application in this study is used to find tumor on
MRI brain images.
Adaptive lifting based image compression scheme using interactive artificial ...csandit
This paper presents image compression method using Interactive Artificial Bee Colony (IABC) optimization algorithm. The proposed method reduces storage and facilitates data transmission by reducing transmission costs. To get the finest quality of compressed image, utilizing local search, IABC determines different update coefficient, and the best update coefficient is chosen
optimally. By using local search in the update step, we alter the center pixels with the coefficient in 8-different directions with a considerable window size, to produce the compressed image, expressed in terms of both PSNR and compression ratio. The IABC brings in the idea of
universal gravitation into the consideration of the affection between onlooker bees and the employed bees. By passing on different values of the control parameter, the universal gravitation involved in the IABC has various quantities of the single onlooker bee and employed bees. As a result when compared to existing methods, the proposed work gives better PSNR.
Image Compression Using Intra Prediction of H.264/AVC and Implement of Hiding...ijsrd.com
The current still image compression technique lacks the required level of standardization and still have something can be improve according to compression rate, computation, and so on. This paper employs the technique of H.264/MPEG-4 Advanced Video Coding to improve still image compression. The H.264/MPEG-4 standard promises much higher compression and quality compared to other existing standard, such as MPEG-4 and H.263. This paper utilizes the intra prediction approach of H.264/AVC and Huffman coding to improve the compression rate. Each 4x4 block is predicted by choosing the best mode out of the 9 different modes. The best prediction mode is selected by SAE (Sum of Absolute Error) method. Also this paper deals with an image hiding algorithm based on singular value decomposition algorithm. This paper propose a data hiding algorithm, applying on encoded bit-stream. Before embedding the secret image into cover image, the residue of the cover image is first calculated and encoded using Huffman coding. At the decoder side the secret image is extracted and the cover image is reconstructed with sufficient peak signal to noise ratio.
Improved anti-noise attack ability of image encryption algorithm using de-noi...TELKOMNIKA JOURNAL
Information security is considered as one of the important issues in the information age used to preserve the secret information through out transmissions in practical applications. With regard to image encryption, a lot of schemes related to information security were applied. Such approaches might be categorized into 2 domains; domain frequency and domain spatial. The presented work develops an encryption technique on the basis of conventional watermarking system with the use of singular value decomposition (SVD), discrete cosine transform (DCT), and discrete wavelet transform (DWT) together, the suggested DWT-DCT-SVD method has high robustness in comparison to the other conventional approaches and enhanced approach for having high robustness against Gaussian noise attacks with using denoising approach according to DWT. MSE in addition to the peak signal-to-noise ratio (PSNR) specified the performance measures which are the base of this study’s results, as they are showing that the algorithm utilized in this study has high robustness against Gaussian noise attacks.
Transformation and dynamic visualization of images from computer through an F...TELKOMNIKA JOURNAL
This article shows the implementation of a system that uses a graphic interface to load a digital image into a programmable logic device, which is stored in its internal RAM memory and is responsible for visualizing it in a matrix of RGB LEDs, so that This way, the LEDs show an equivalent to the image that was sent from the PC, conserving an aspect ratio and respecting as much as possible the color of the original image. To carry out this task, a Matlab script was designed to load the image, convert and format the data, which are transmitted to the FPGA using the RS232 protocol. The FPGA is in charge of receiving them, storing them and generating all the signals of control and synchronization of the system including the control of the PWM signals necessary to conserve the brightness of each one of the LEDs. This system allows the visualization of static images in standard formats and, in addition, thanks to the flexibility of the hardware used, it allows the visualization of moving images type GIF.
An Efficient Multiplierless Transform algorithm for Video CodingCSCJournals
This paper presents an efficient algorithm to accelerate software video encoders/decoders by reducing the number of arithmetic operations for Discrete Cosine Transform (DCT). A multiplierless Ramanujan Ordered Number DCT (RDCT) is presented which computes the coefficients using shifts and addition operations only. The reduction in computational complexity has improved the performance of the video codec by almost 58% compared with the commonly used integer DCT. The results show that significant computation reduction can be achieved with negligible average peak signal-to-noise ratio (PSNR) degradation. The average structural similarity index matrix (SSIM) also ensures that the degradation due to the approximation is minimal.
Color image compression based on spatial and magnitude signal decomposition IJECEIAES
In this paper, a simple color image compression system has been proposed using image signal decomposition. Where, the RGB image color band is converted to the less correlated YUV color model and the pixel value (magnitude) in each band is decomposed into 2-values; most and least significant. According to the importance of the most significant value (MSV) that influenced by any simply modification happened, an adaptive lossless image compression system is proposed using bit plane (BP) slicing, delta pulse code modulation (Delta PCM), adaptive quadtree (QT) partitioning followed by an adaptive shift encoder. On the other hand, a lossy compression system is introduced to handle the least significant value (LSV), it is based on an adaptive, error bounded coding system, and it uses the DCT compression scheme. The performance of the developed compression system was analyzed and compared with those attained from the universal standard JPEG, and the results of applying the proposed system indicated its performance is comparable or better than that of the JPEG standards.
Real-time traffic sign detection and recognition using Raspberry Pi IJECEIAES
Nowadays, the number of road accident in Malaysia is increasing expeditiously. One of the ways to reduce the number of road accident is through the development of the advanced driving assistance system (ADAS) by professional engineers. Several ADAS system has been proposed by taking into consideration the delay tolerance and the accuracy of the system itself. In this work, a traffic sign recognition system has been developed to increase the safety of the road users by installing the system inside the car for driver’s awareness. TensorFlow algorithm has been considered in this work for object recognition through machine learning due to its high accuracy. The algorithm is embedded in the Raspberry Pi 3 for processing and analysis to detect the traffic sign from the real-time video recording from Raspberry Pi camera NoIR. This work aims to study the accuracy, delay and reliability of the developed system using a Raspberry Pi 3 processor considering several scenarios related to the state of the environment and the condition of the traffic signs. A real-time testbed implementation has been conducted considering twenty different traffic signs and the results show that the system has more than 90% accuracy and is reliable with an acceptable delay.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Novel Image Compression Approach Inexact Computingijtsrd
This work proposes a novel approach for digital image processing that relies on faulty computation to address some of the issues with discrete cosine transformation DCT compression. The proposed system has three processing stages the first employs approximated DCT for picture compression to eliminate all compute demanding floating point multiplication and to execute DCT processing with integer additions and, in certain cases, logical right left modifications. The second level reduces the amount of data that must be processed from the first level by removing frequencies that cannot be perceived by human senses. Finally, in order to reduce power consumption and delay, the third stage employs erroneous circuit level adders for DCT computation. A collection of structured pictures is compressed for measurement using the suggested three level method. Various figures of merit such as energy consumption, delay, power signal to noise ratio, average difference, and absolute maximum difference are compared to current compression techniques an error analysis is also carried out to substantiate the simulation findings. The results indicate significant gains in energy and time reduction while retaining acceptable accuracy levels for image processing applications. Sonam Kumari | Manish Rai "A Novel Image Compression Approach-Inexact Computing" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-6 | Issue-6 , October 2022, URL: https://www.ijtsrd.com/papers/ijtsrd52197.pdf Paper URL: https://www.ijtsrd.com/engineering/electrical-engineering/52197/a-novel-image-compression-approachinexact-computing/sonam-kumari
Distributed Video Coding (DVC) has become increasingly popular in recent times among the researchers in video coding due to its attractive and promising features. DVC primarily has a modified complexity balance between the encoder and decoder, in contrast to conventional video codecs. However, Most of the reported DVC schemes have a high time-delay in decoder which hinders its practical application in real-time systems. In this work, we focus on speed up the Side Information(SI) generation module in DVC, which is a major function in the DVC coding algorithm and one of the time-consuming factor at the decoder. By applied it through Compute Unified Device Architecture (CUDA) based on General-Purpose Graphics Processing Unit (GPGPU), the experimental results show that a considerable speedup can be obtained by using the proposed parallelized SI generation algorithm.
Highly Parallel Pipelined VLSI Implementation of Lifting Based 2D Discrete Wa...idescitation
The lifting scheme based Discrete Wavelet
Transform is a powerful tool for image processing
applications. The lack of disk space during transmission and
storage of images pushes the demand for high speed
implementation of efficient compression technique. This paper
proposes a highly pipelined and distributed VLSI architecture
of lifting based 2D DWT with lifting coefficients represented
in fixed point [2:14] format. Compared to conventional
architectures [11], [13]-[16], the proposed highly pipelined
architecture optimizes the design which increases
significantly the performance speed. The design raises the
operating frequency, at the expense of more hardware area.
In this paper, initially a software model of the proposed design
was developed using MATLAB ®. Corresponding to this
software model, an efficient highly parallel pipelined
architecture was designed and developed using verilog HDL
language and implemented in VIRTEX ® 6 (XC6VHX380T)
FPGA. Also the design was synthesized on TSMC 0.18μm
ASIC Library by using Synopsis Design Compiler. The entire
system is suitable for several real time applications.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
n recent years, with the development of graphics p
rocessors, graphics cards have been widely
used to perform general-purpose calculations. Espec
ially with release of CUDA C
programming languages in 2007, most of the research
ers have been used CUDA C
programming language for the processes which needs
high performance computing.
In this paper, a scaling approach for image segment
ation using level sets is carried out by the
GPU programming techniques. Approach to level sets
is mainly based on the solution of partial
differential equations. The proposed method does no
t require the solution of partial differential
equation. Scaling approach, which uses basic geomet
ric transformations, is used. Thus, the
required computational cost reduces. The use of the
CUDA programming on the GPU has taken
advantage of classic programming as spending time a
nd performance. Thereby results are
obtained faster. The use of the GPU has provided to
enable real-time processing. The developed
application in this study is used to find tumor on
MRI brain images.
Adaptive lifting based image compression scheme using interactive artificial ...csandit
This paper presents image compression method using Interactive Artificial Bee Colony (IABC) optimization algorithm. The proposed method reduces storage and facilitates data transmission by reducing transmission costs. To get the finest quality of compressed image, utilizing local search, IABC determines different update coefficient, and the best update coefficient is chosen
optimally. By using local search in the update step, we alter the center pixels with the coefficient in 8-different directions with a considerable window size, to produce the compressed image, expressed in terms of both PSNR and compression ratio. The IABC brings in the idea of
universal gravitation into the consideration of the affection between onlooker bees and the employed bees. By passing on different values of the control parameter, the universal gravitation involved in the IABC has various quantities of the single onlooker bee and employed bees. As a result when compared to existing methods, the proposed work gives better PSNR.
Image Compression Using Intra Prediction of H.264/AVC and Implement of Hiding...ijsrd.com
The current still image compression technique lacks the required level of standardization and still have something can be improve according to compression rate, computation, and so on. This paper employs the technique of H.264/MPEG-4 Advanced Video Coding to improve still image compression. The H.264/MPEG-4 standard promises much higher compression and quality compared to other existing standard, such as MPEG-4 and H.263. This paper utilizes the intra prediction approach of H.264/AVC and Huffman coding to improve the compression rate. Each 4x4 block is predicted by choosing the best mode out of the 9 different modes. The best prediction mode is selected by SAE (Sum of Absolute Error) method. Also this paper deals with an image hiding algorithm based on singular value decomposition algorithm. This paper propose a data hiding algorithm, applying on encoded bit-stream. Before embedding the secret image into cover image, the residue of the cover image is first calculated and encoded using Huffman coding. At the decoder side the secret image is extracted and the cover image is reconstructed with sufficient peak signal to noise ratio.
Improved anti-noise attack ability of image encryption algorithm using de-noi...TELKOMNIKA JOURNAL
Information security is considered as one of the important issues in the information age used to preserve the secret information through out transmissions in practical applications. With regard to image encryption, a lot of schemes related to information security were applied. Such approaches might be categorized into 2 domains; domain frequency and domain spatial. The presented work develops an encryption technique on the basis of conventional watermarking system with the use of singular value decomposition (SVD), discrete cosine transform (DCT), and discrete wavelet transform (DWT) together, the suggested DWT-DCT-SVD method has high robustness in comparison to the other conventional approaches and enhanced approach for having high robustness against Gaussian noise attacks with using denoising approach according to DWT. MSE in addition to the peak signal-to-noise ratio (PSNR) specified the performance measures which are the base of this study’s results, as they are showing that the algorithm utilized in this study has high robustness against Gaussian noise attacks.
Transformation and dynamic visualization of images from computer through an F...TELKOMNIKA JOURNAL
This article shows the implementation of a system that uses a graphic interface to load a digital image into a programmable logic device, which is stored in its internal RAM memory and is responsible for visualizing it in a matrix of RGB LEDs, so that This way, the LEDs show an equivalent to the image that was sent from the PC, conserving an aspect ratio and respecting as much as possible the color of the original image. To carry out this task, a Matlab script was designed to load the image, convert and format the data, which are transmitted to the FPGA using the RS232 protocol. The FPGA is in charge of receiving them, storing them and generating all the signals of control and synchronization of the system including the control of the PWM signals necessary to conserve the brightness of each one of the LEDs. This system allows the visualization of static images in standard formats and, in addition, thanks to the flexibility of the hardware used, it allows the visualization of moving images type GIF.
An Efficient Multiplierless Transform algorithm for Video CodingCSCJournals
This paper presents an efficient algorithm to accelerate software video encoders/decoders by reducing the number of arithmetic operations for Discrete Cosine Transform (DCT). A multiplierless Ramanujan Ordered Number DCT (RDCT) is presented which computes the coefficients using shifts and addition operations only. The reduction in computational complexity has improved the performance of the video codec by almost 58% compared with the commonly used integer DCT. The results show that significant computation reduction can be achieved with negligible average peak signal-to-noise ratio (PSNR) degradation. The average structural similarity index matrix (SSIM) also ensures that the degradation due to the approximation is minimal.
Color image compression based on spatial and magnitude signal decomposition IJECEIAES
In this paper, a simple color image compression system has been proposed using image signal decomposition. Where, the RGB image color band is converted to the less correlated YUV color model and the pixel value (magnitude) in each band is decomposed into 2-values; most and least significant. According to the importance of the most significant value (MSV) that influenced by any simply modification happened, an adaptive lossless image compression system is proposed using bit plane (BP) slicing, delta pulse code modulation (Delta PCM), adaptive quadtree (QT) partitioning followed by an adaptive shift encoder. On the other hand, a lossy compression system is introduced to handle the least significant value (LSV), it is based on an adaptive, error bounded coding system, and it uses the DCT compression scheme. The performance of the developed compression system was analyzed and compared with those attained from the universal standard JPEG, and the results of applying the proposed system indicated its performance is comparable or better than that of the JPEG standards.
Real-time traffic sign detection and recognition using Raspberry Pi IJECEIAES
Nowadays, the number of road accident in Malaysia is increasing expeditiously. One of the ways to reduce the number of road accident is through the development of the advanced driving assistance system (ADAS) by professional engineers. Several ADAS system has been proposed by taking into consideration the delay tolerance and the accuracy of the system itself. In this work, a traffic sign recognition system has been developed to increase the safety of the road users by installing the system inside the car for driver’s awareness. TensorFlow algorithm has been considered in this work for object recognition through machine learning due to its high accuracy. The algorithm is embedded in the Raspberry Pi 3 for processing and analysis to detect the traffic sign from the real-time video recording from Raspberry Pi camera NoIR. This work aims to study the accuracy, delay and reliability of the developed system using a Raspberry Pi 3 processor considering several scenarios related to the state of the environment and the condition of the traffic signs. A real-time testbed implementation has been conducted considering twenty different traffic signs and the results show that the system has more than 90% accuracy and is reliable with an acceptable delay.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Novel Image Compression Approach Inexact Computingijtsrd
This work proposes a novel approach for digital image processing that relies on faulty computation to address some of the issues with discrete cosine transformation DCT compression. The proposed system has three processing stages the first employs approximated DCT for picture compression to eliminate all compute demanding floating point multiplication and to execute DCT processing with integer additions and, in certain cases, logical right left modifications. The second level reduces the amount of data that must be processed from the first level by removing frequencies that cannot be perceived by human senses. Finally, in order to reduce power consumption and delay, the third stage employs erroneous circuit level adders for DCT computation. A collection of structured pictures is compressed for measurement using the suggested three level method. Various figures of merit such as energy consumption, delay, power signal to noise ratio, average difference, and absolute maximum difference are compared to current compression techniques an error analysis is also carried out to substantiate the simulation findings. The results indicate significant gains in energy and time reduction while retaining acceptable accuracy levels for image processing applications. Sonam Kumari | Manish Rai "A Novel Image Compression Approach-Inexact Computing" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-6 | Issue-6 , October 2022, URL: https://www.ijtsrd.com/papers/ijtsrd52197.pdf Paper URL: https://www.ijtsrd.com/engineering/electrical-engineering/52197/a-novel-image-compression-approachinexact-computing/sonam-kumari
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
Modified approximate 8-point multiplier less DCT like transformIJERA Editor
Discrete Cosine Transform (DCT) is widely usedtransformation for compression in image and video standardslike H.264 or MPEGv4, JPEG etc. Currently the new standarddeveloped Codec is Highly Efficient Video Coding (HEVC) orH.265. With the help of the transformation matrix the computational cost can be dynamically reduce. This paper proposesa novel approach of multiplier-less modified approximate DCT like transformalgorithm and also comparison with exact DCT algorithm and theapproximate DCT like transform. This proposed algorithm willhave lower computational complexity. Furthermore, the proposedalgorithm will be modular in approach, and suitable for pipelinedVLSI implementation.
To store and transmit digital images in least memory space and bandwidth image compression is needed.
Image compression refers to the process of minimizing the image size by removing redundant data bits in a
manner that quality of an image should not be degrade. Hence image compression reduces quantity of the
image size without reducing its quality. In this paper it is being attempted to enhance the basic JPEG
compression by reducing image size. The proposed technique is about amendment of the conventional run
length coding for JPEG (Joint Photographic Experts Group) image compression by using the concept of
sparse matrix. In this algorithm, the redundant data has been completely eliminated and hence leaving the
quality of an image unaltered. The JPEG standard document specifies three steps: Discrete cosine
transform, Quantization followed by Entropy coding. The proposed work aims at the enhancement of the
third step which is Entropy coding.
SQUASHED JPEG IMAGE COMPRESSION VIA SPARSE MATRIXijcsit
To store and transmit digital images in least memory space and bandwidth image compression is needed. Image compression refers to the process of minimizing the image size by removing redundant data bits in a manner that quality of an image should not be degrade. Hence image compression reduces quantity of the image size without reducing its quality. In this paper it is being attempted to enhance the basic JPEG compression by reducing image size. The proposed technique is about amendment of the conventional run length coding for JPEG (Joint Photographic Experts Group) image compression by using the concept of sparse matrix. In this algorithm, the redundant data has been completely eliminated and hence leaving the quality of an image unaltered. The JPEG standard document specifies three steps: Discrete cosine transform, Quantization followed by Entropy coding. The proposed work aims at the enhancement of the third step which is Entropy coding.
To store and transmit digital images in least memory space and bandwidth image compression is needed. Image compression refers to the process of minimizing the image size by removing redundant data bits in a manner that quality of an image should not be degrade. Hence image compression reduces quantity of the image size without reducing its quality. In this paper it is being attempted to enhance the basic JPEG compression by reducing image size. The proposed technique is about amendment of the conventional run length coding for JPEG (Joint Photographic Experts Group) image compression by using the concept of sparse matrix. In this algorithm, the redundant data has been completely eliminated and hence leaving the quality of an image unaltered. The JPEG standard document specifies three steps: Discrete cosine transform, Quantization followed by Entropy coding. The proposed work aims at the enhancement of the third step which is Entropy coding.
A Review on Image Compression in Parallel using CUDAIJERD Editor
Now a days images are prodigiously and sizably voluminous in size. So, this size is not facilely fits in applications. For that image compression is require. Image Compression algorithms are more resource conserving. It takes more time to consummate the task of compression. Utilizing Parallel implementation of the compression algorithm this quandary can be overcome. CUDA (Compute Unified Device Architecture) Provides parallel execution for algorithm utilizing the multi-threading. CUDA is NVIDIA`s parallel computing platform. CUDA uses GPU (Graphical Processing Unit) for the parallel execution. GPU have the number of the cores for parallel execution support. Image compression can additionally implemented in parallel utilizing CUDA. There are number of algorithms for image compression. Among them DWT (Discrete Wavelet Transform) is best suited for parallel implementation due to its more mathematical calculation and good compression result compare to other methods. In this paper included different parallel techniques for image compression. With the actualizing this image compression algorithm over the GPU utilizing CUDA it will perform the operations in parallel. In this way, vast diminish in processing time is conceivable. Furthermore it is conceivable to enhance the execution of image compression algorithms.
FAST AND EFFICIENT IMAGE COMPRESSION BASED ON PARALLEL COMPUTING USING MATLABJournal For Research
Image compression technique is used in many applications for example, satellite imaging, medical imaging, video where the size of the iamge requires more space to store, in such application image compression effectively can be used. There are two types in image compression techniques Lossy and Lossless comression. Both these techniques are used for compression of images, but these techniques are not fast. The image compression techniques both lossy and lossless image compression techniques are not fast, they take more time for compression and decompression. For fast and efficient image compression a parallel computing technique is used in matlab. Matlab is used in this project for parallel computing of images. In this paper we will discuss Regular image compression technique, three alternatives of parallel computing using matlab, comparison of image compression with and without parallel computing.
Pipelined Architecture of 2D-DCT, Quantization and ZigZag Process for JPEG Im...VLSICS Design
This paper presents the architecture and VHDL design of a Two Dimensional Discrete Cosine Transform (2D-DCT) with Quantization and zigzag arrangement. This architecture is used as the core and path in JPEG image compression hardware. The 2D- DCT calculation is made using the 2D- DCT Separability property, such that the whole architecture is divided into two 1D-DCT calculations by using a transpose buffer. Architecture for Quantization and zigzag process is also described in this paper. The quantization process is done using division operation. This design aimed to be implemented in Spartan-3E XC3S500 FPGA. The 2D- DCT architecture uses 1891 Slices, 51I/O pins, and 8 multipliers of one Xilinx Spartan-3E XC3S500E FPGA reaches an operating frequency of 101.35 MHz One input block with 8 x 8 elements of 8 bits each is processed in 6604 ns and pipeline latency is 140 clock cycles.
International Journal on Soft Computing ( IJSC )ijsc
A variety of new and powerful algorithms have been developed for image compression over the years.
Among them the wavelet-based image compression schemes have gained much popularity due to their
overlapping nature which reduces the blocking artifacts that are common phenomena in JPEG
compression and multiresolution character which leads to superior energy compaction with high quality
reconstructed images. This paper provides a detailed survey on some of the popular wavelet coding
techniques such as the Embedded Zerotree Wavelet (EZW) coding, Set Partitioning in Hierarchical Tree
(SPIHT) coding, the Set Partitioned Embedded Block (SPECK) Coder, and the Embedded Block Coding
with Optimized Truncation (EBCOT) algorithm. Other wavelet-based coding techniques like the Wavelet
Difference Reduction (WDR) and the Adaptive Scanned Wavelet Difference Reduction (ASWDR)
algorithms, the Space Frequency Quantization (SFQ) algorithm, the Embedded Predictive Wavelet Image
Coder (EPWIC), Compression with Reversible Embedded Wavelet (CREW), the Stack-Run (SR) coding and
the recent Geometric Wavelet (GW) coding are also discussed. Based on the review, recommendations and
discussions are presented for algorithm development and implementation.
Wavelet based Image Coding Schemes: A Recent Survey ijsc
A variety of new and powerful algorithms have been developed for image compression over the years. Among them the wavelet-based image compression schemes have gained much popularity due to their overlapping nature which reduces the blocking artifacts that are common phenomena in JPEG compression and multiresolution character which leads to superior energy compaction with high quality reconstructed images. This paper provides a detailed survey on some of the popular wavelet coding techniques such as the Embedded Zerotree Wavelet (EZW) coding, Set Partitioning in Hierarchical Tree (SPIHT) coding, the Set Partitioned Embedded Block (SPECK) Coder, and the Embedded Block Coding with Optimized Truncation (EBCOT) algorithm. Other wavelet-based coding techniques like the Wavelet Difference Reduction (WDR) and the Adaptive Scanned Wavelet Difference Reduction (ASWDR) algorithms, the Space Frequency Quantization (SFQ) algorithm, the Embedded Predictive Wavelet Image Coder (EPWIC), Compression with Reversible Embedded Wavelet (CREW), the Stack-Run (SR) coding and the recent Geometric Wavelet (GW) coding are also discussed. Based on the review, recommendations and discussions are presented for algorithm development and implementation.
Transforming Brand Perception and Boosting Profitabilityaaryangarg12
In today's digital era, the dynamics of brand perception, consumer behavior, and profitability have been profoundly reshaped by the synergy of branding, social media, and website design. This research paper investigates the transformative power of these elements in influencing how individuals perceive brands and products and how this transformation can be harnessed to drive sales and profitability for businesses.
Through an exploration of brand psychology and consumer behavior, this study sheds light on the intricate ways in which effective branding strategies, strategic social media engagement, and user-centric website design contribute to altering consumers' perceptions. We delve into the principles that underlie successful brand transformations, examining how visual identity, messaging, and storytelling can captivate and resonate with target audiences.
Methodologically, this research employs a comprehensive approach, combining qualitative and quantitative analyses. Real-world case studies illustrate the impact of branding, social media campaigns, and website redesigns on consumer perception, sales figures, and profitability. We assess the various metrics, including brand awareness, customer engagement, conversion rates, and revenue growth, to measure the effectiveness of these strategies.
The results underscore the pivotal role of cohesive branding, social media influence, and website usability in shaping positive brand perceptions, influencing consumer decisions, and ultimately bolstering sales and profitability. This paper provides actionable insights and strategic recommendations for businesses seeking to leverage branding, social media, and website design as potent tools to enhance their market position and financial success.
Unleash Your Inner Demon with the "Let's Summon Demons" T-Shirt. Calling all fans of dark humor and edgy fashion! The "Let's Summon Demons" t-shirt is a unique way to express yourself and turn heads.
https://dribbble.com/shots/24253051-Let-s-Summon-Demons-Shirt
Between Filth and Fortune- Urban Cattle Foraging Realities by Devi S Nair, An...Mansi Shah
This study examines cattle rearing in urban and rural settings, focusing on milk production and consumption. By exploring a case in Ahmedabad, it highlights the challenges and processes in dairy farming across different environments, emphasising the need for sustainable practices and the essential role of milk in daily consumption.
Can AI do good? at 'offtheCanvas' India HCI preludeAlan Dix
Invited talk at 'offtheCanvas' IndiaHCI prelude, 29th June 2024.
https://www.alandix.com/academic/talks/offtheCanvas-IndiaHCI2024/
The world is being changed fundamentally by AI and we are constantly faced with newspaper headlines about its harmful effects. However, there is also the potential to both ameliorate theses harms and use the new abilities of AI to transform society for the good. Can you make the difference?
Book Formatting: Quality Control Checks for DesignersConfidence Ago
This presentation was made to help designers who work in publishing houses or format books for printing ensure quality.
Quality control is vital to every industry. This is why every department in a company need create a method they use in ensuring quality. This, perhaps, will not only improve the quality of products and bring errors to the barest minimum, but take it to a near perfect finish.
It is beyond a moot point that a good book will somewhat be judged by its cover, but the content of the book remains king. No matter how beautiful the cover, if the quality of writing or presentation is off, that will be a reason for readers not to come back to the book or recommend it.
So, this presentation points designers to some important things that may be missed by an editor that they could eventually discover and call the attention of the editor.
Expert Accessory Dwelling Unit (ADU) Drafting ServicesResDraft
Whether you’re looking to create a guest house, a rental unit, or a private retreat, our experienced team will design a space that complements your existing home and maximizes your investment. We provide personalized, comprehensive expert accessory dwelling unit (ADU)drafting solutions tailored to your needs, ensuring a seamless process from concept to completion.
2. 2
1)( =uC for u=0, otherwise 1.
The DCT is a frequency transform which is equivalent to
the real part of the discrete Fourier transform (DFT).
Equation (2) shows the forward transformation for the
generation of the two dimensional discrete cosine transform
2D-DCT, of the original NxN image block:
∑∑
−
=
−
=
=
1
0
1
0
2
),()()(
4
),(
N
i
N
j
jifvCuC
N
vuF
)
2
)12(
()
2
)12(
(
N
vj
Cos
N
ui
Cos
++ ππ
, (2)
where F(u,v): coefficient values in the transform domain,
f(i,j): coefficient values in the pixel domain,
i,j: spatial coordinates in the pixel domain,
u,v: coordinates in the transform domain,
2
1)( =uC for u=0, otherwise 1.
2
1)( =vC for v=0, otherwise 1.
The separability property of the DCT, has an advantage
that F(u, v) can be computed in two successive steps, 1-D
operations on rows and columns of an image block and then
calculate the 2D-DCT as shown in figure 2. Using this
property equation (2), becomes as the following equation
(3):
∑ ∑
−
=
−
=⎪⎩
⎪
⎨
⎧
⎪⎭
⎪
⎬
⎫+
=
1
0
1
0
)
2
)12(
(),()(
2
)(
2
),(
N
i
N
j
N
vj
CosjifvC
N
uC
N
vuF
π
)
2
)12(
(
N
ui
Cos
+π
, (3)
Fig. 2. Computation of 2-D DCT using separability property
To minimize the computation of the 1D-DCT in equation
(1), a LEE graph will be used [7]. The LEE graph can be
produced by rewriting the equation (1) as follows:
∑
−
=
+
=
1
0
)12(
2)(
2
)(
N
n
mn
Nc CnF
N
mF & , m= 0, 1, …., N-1, (4)
where )cos( kiCi
k π= ;
and )()()( nFnCnF =&
This graph, shown in figure 3, for N=8 requires
1)(log
2
3
2 +− NN
N
Real additions,
and
)(log
2
2 N
N
Real multiplications.
B. DCT Hardware Implementation
The block diagram of the hardware implementation of the
2D-DCT using LEE graph is shown in figure 4. The
operative part is used to calculate the 1D-DCT on the rows,
and the 1D-DCT on the columns, alternatively, to obtain the
2D-DCT for N=8.
Fig. 3. LEE graph to compute the 1D-DCT for N=8
321
3. The 1D-DCT algorithm is applied firstly on the data
sequences for the rows and the results are stored in the
memory. Afterwards the algorithm is applied on the
columns obtaining the final results of the 1D-DCT. During
operation of the 1D-DCT on the columns, the next data
sequences enter into the system, thus creating a pipeline
architecture [8]. Each output transform sequence is rounded
off by using an 11 bits adder and comparator subsystems.
IV. RESULTS
2D Discrete Cosine Transform can be implemented onto
an FPGA through system generator using hardware models,
which can be used as a building block for various image
processing systems. System Generator works with standard
Simulink models including “Gateway In” and “Gateway
Out” defines the boundary of the FPGA.
The input image is obtained by MATLAB and
transformed into a matrix representation. This image is then
decomposed into (8x8) block images. Figure 5 shows an
8x8 block image obtained from a 256x256 gray scale image.
Fig.5. Image test divided into 8x8 blocks used for DCT
And the corresponding matrix representation, obtained by
MATLAB, of the 8x8 block is shown by matrix 1.
Matrix 1. Pixel level of 8x8 block using MALAB.
⎥
⎥
⎥
⎥
⎥
⎥
⎥
⎥
⎥
⎥
⎥
⎦
⎤
⎢
⎢
⎢
⎢
⎢
⎢
⎢
⎢
⎢
⎢
⎢
⎣
⎡
738293856711510987
80947393967711578
7364475885609472
7681565963576259
5855535561626258
5958575961626066
5462677071897783
579110910410197109106
The 2D-DCT matrix of this block calculated by
MATLAB is represented by matrix 2.
Matrix 2. 2D-DCT result using MATLAB.
597.079 35.59 -1.172 -5.127 -15.25 -4.32 -19.81 -1.6
-17.287 8.613 -14.64 20.567 6.254 14.25 17.41 2.37
99.4702 29.92 -18.89 18.946 -24.64 -9.7 6.752 6.47
30.9677 0.635 -1.171 2.7918 10.074 5.313 -24.98 -15.4
18.5024 -6.76 -4.47 11.6 -15.75 0.051 14.03 7.99
19.6004 0.68 -10.38 6.8812 5.0155 -3.58 -17.08 -10.4
-5.4927 6.033 3.503 1.6981 1.2775 0.91 5.144 -6.26
13.2943 -20.1 0.54 8.287 0.1484 3.332 -7.513 3.68
After downloading the bit mapping file of the design (2D-
DCT) onto the FPGA board type SPARTAN 3-E
STARTER mounted on the laptop through the USB port.
The obtained matrix by the hardware is presented by the
matrix 3 using a frequency of 50 MHz. The hardware
implementation of the 2D-DCT occupies only 14% of the
total number of slices and 10% of the total LUT. However,
inherent limitations in the interface to the FPGA limited the
overall performance of the design.
Fig. 4. Block diagram of the hardware implementation of the 2D-DCT using LEE graph
322
4. The Maximum percentage error is found to be 7.86%≈8%
on the grayscale pixel range [0,255]. This error doesn’t
appear when motion images in process; this due of the fact
that the Human Visual System (HVS) is less sensitive to
errors in high frequency coefficients than it is to lower
frequency coefficients, the higher frequency components
can be more finely quantized, as done by the quantization
matrix.
Matrix 3. 2D-DCT result using LEE graph implemented in Hardware.
597.1 35.6 -1.2 -5.1 -15.3 -4.3 -19.8 -1.6
-17.3 8.6 -14.6 20.6 6.3 14.3 17.4 2.4
99.5 29.9 -18.9 18.9 -24.6 -9.7 6.8 6.5
31.0 0.6 -1.2 2.8 10.1 5.3 -25.0 -15.4
18.5 -6.8 -4.5 11.6 -15.8 0.1 14.0 8.0
19.6 0.7 -10.4 6.9 5.0 -3.6 -17.1 -10.4
-5.5 6.0 3.5 1.7 1.3 0.9 5.1 -6.3
13.3 -20.1 0.5 8.3 0.2 3.3 -7.5 3.7
The 2D-DCT architecture shows a good performance
when it is applied to 32x32 sub-images where each sub-
image is composed by 8x8 pixels as shown in table 1. The
timing diagram of this implementation is depicted by figure
6, where
Ni: Number of images;
Ns: Number of sub-images;
Nl: Number of Lines of the sub-image;
Nc: Number of Columns of the sub-image;
Tc: T-cycle = 1 clock cycle;
Tci: Time to initialize the 1st
sub-image = Nl * Tc;
Ts: Time to initialize the next sub-image = Nc * Tc;
Tsi: Time required to compute one sub-image;
Tti: Total time required to compute one image= Ns * Tsi;
Fig.6. Timing diagram of the implemented 2D-DCT
Block 1 and 2 of figure 4 work in pipeline, when they are
loaded by the sub-image pixels. In addition the initialization
time to load the 1st
sub-image can be omitted.
Table 1: Performance of the 2D-DCT implemented in hardware.
Ni Ns Nl*Tc
(us)
Nc*Tc
(us)
Tsi
(us)
Tti
(ms)
1 1024 0.16 0.16 0.16 0.16
12 12288 0.16 0.16 0.16 1.97
25 25600 0.16 0.16 0.16 4.1
30 30720 0.16 0.16 0.16 4.92
As shown in table 1, about 0.2% (5 ms) is used by the
2D-DCT, which means that 98.8% is left to the other blocks
such as QV, LVC and the decompressor block to produce a
real time motion image (30 image/second).
V. CONCLUSION
We have presented the implementation of the 2D-DCT
algorithm using LEE graph with combined pipeline
architecture. This implementation was realized with a Xilinx
XC3S500E Spartan-3E Starter FPGA, clocked at 50 MHz.
The use of a reprogrammable device permits the continuing
parametric changes of the DCT in real time. The Xilinx
System Generator, embedded in MATLAB Simulink was
used to program the model and test in the FPGA board using
the hardware co-simulation feature tools. Finally, the error
percentages about 8 % of the grayscale pixel were very
small between the images before the 2D-DCT
implementation and after the hardware implementation.
ACKNOWLEDGMENT
The authors would like to acknowledge the financial
support of the use of CAD tools from the Xilinx
Corporation.
REFERENCES
[1] A. K. Jain, “Fundamental of Digital Image Processing”, Prentice-Hall,
1st
Ed.,1989.
[2] I. E. G. Richardson, “Video Codec Design: Developing Image and
Video Compression Systems”, Wiley & Sons, 1st
Ed., 2002.
[3] A. Puri, “Video Coding using the MPEG-1 Compression Standard”,
Society for Information Display Digest of Technical papers, pp. 123-
126, 1992.
[4] L. V. Agostini, I. S. Silva, S. Bampi, “Pipelined fast 2D DCT
architecture for JPEG image Compression”, The 14th
Symposium on
Integrated Circuits and Systems Design, pp. 226-231, Sept, 2001.
[5] A. B. Watson, “DCT Quantization Matrices Visually Optimized for
Individual Images”, Proceedings of SPIE, pp. 202-2216, 1993
[6] N. Ahamed, T. Natarjian, and K. R. Rao, “Discrete Cosine
Transform”, IEEE Trans. on Comp., Vol. C-23, pp. 90-93, Jan. 1974.
[7] B.G. LEE, “A new algorithm to compute the discrete cosine
transform”, IEEE Trans. on Acc., Speech, and Signal Process., pp.
1243-1245 vol. ASSP-32, no. 6, Dec.1984.
[8] A. Kassem et al., “Simulation and Implementation of DCT for Image
Processing Applications”, Second LAAS International Conference on
Computer Simulation, 1997.
323