A Novel Architecture for Computing Approximate Radon Transform

by   M. A. Khorsandi, et al.

Radon transform is a type of transform which is used in image processing to transfer the image into intercept-slope coordinate. Its diagonal properties made it appropriate for some applications which need processes in different degrees. Radon transform computation needs a lot of arithmetic operations which makes it a compute-intensive algorithm. In literature an approximate algorithm for computing Radon transform is introduces which reduces the complexity of computations. But this algorithm is complex and need arbitrary accesses to memory. In this paper we proposed an algorithm which accesses to memory sequentially. In the following an architecture is introduced which uses pipeline to reduce the time complexity of algorithm.


Multiplierless 16-point DCT Approximation for Low-complexity Image and Video Coding

An orthogonal 16-point approximate discrete cosine transform (DCT) is in...

Discrete Gyrator Transforms: Computational Algorithms and Applications

As an extension of the 2D fractional Fourier transform (FRFT) and a spec...

An Algorithm for Computing the Covering Radius of a Linear Code Based on Vilenkin-Chrestenson Transform

We present a generalization of Walsh-Hadamard transform that is suitable...

Proof of Correctness and Time Complexity Analysis of a Maximum Distance Transform Algorithm

The distance transform algorithm is popular in computer vision and machi...

Point spread function estimation for blind image deblurring problems based on framelet transform

One of the most important issues in the image processing is the approxim...

Multiple Watermarking Algorithm Based on Spread Transform Dither Modulation

Multiple watermarking technique, embedding several watermarks in one car...

VLSI Computational Architectures for the Arithmetic Cosine Transform

The discrete cosine transform (DCT) is a widely-used and important signa...