In medical imaging, the Radon transform, used for tomographic reconstruction, recovers a N-Dimensional image from a set of acquired (N-1)D projections. However, it implies approximations in discrete domain. Beside this transform, Mojette transform has been developped as a discrete and exact transform. However, its construction is incompatible with physical X-Rays properties. In this paper, afte...

We examine the rate-distortion performance and computational complexity of linear transforms for lossy data compression. The goal is to better understand the performance/complexity tradeoffs associated with using the Karhunen-Loeve transform (KLT) and its fast approximations. Since the optimal transform for transform coding is unknown in general, we investigate the performance penalties associa...

The Hough Transform is the choice technique for identifying straight lines through digital images, with applications to high energy physics and computer vision. Classical methods for implementing the Hough transform of a N N binary image require to compute N3 additions over n = log2(N) bits integers, hence nN3 bit operations per transform. We introduce a new algorithm for computing the fast Hou...

although elzaki transform is stronger than sumudu and laplace transforms to solve the ordinary differential equations withnon-constant coefficients, but this method does not lead to finding the answer of some differential equations. in this paper, a method is introduced to find that a differential equation by elzaki transform can be ‎solved?‎

The Hough transform has many applications in image processing and computer vision, including line detection, shape recognition and range alignment for moving imaging objects. Many constant-time algorithms for computing the Hough transform have been proposed on recon gurable meshes [1, 5, 6, 7, 9, 10]. Among them, the ones described in [1, 10] are the most e cient. For a problem with an N N imag...

the 9/7 Filter for Image Blocks Hongying Meng and Zhihua Wang A new fast spatial Combinative lifting algorithm (SCLA) of the wavelet transform with the 9/7 filter for image blocks is proposed. In comparison with its lifting-based implementation, the multiplication is reduced by a ratio of 5/12. The SCLA can speed up the implementation of the wavelet transform. Introduction: The popular 9/7 filt...

This document provides proofs of the following: • The binomial distribution can be approximated with a Gaussian distribution at large values of N . • The arcsin square-root transform is the variance stabilising transform for the binomial distribution. • The Gaussian approximation for the binomial distribution is more accurate at smaller values of N after the variance stabilising transform has b...

The Lapped Orthogonal Transform (LOT) [1][3] is a new transform for block image coding. It has basis functions that overlap adjacent blocks and decay smoothly to zero, and so it can reduce the blocking effect to very low levels, without any data overhead. In t'his paper we show that a quasi-optimal LOT can be computed with an algorithm based on the discrete cosine transform (DCT), with only 30 ...

Transform coding is routinely used for lossy compression of discrete sources with memory. The input signal is divided into N -dimensional vectors, which are transformed by means of a linear mapping. Then, transform coefficients are quantized and entropy coded. In this paper we consider the problem of identifying the transform matrix as well as the quantization step sizes. We study the challengi...

A new family of probability distributions βM,N , M = 0 · · ·N, N ∈ N on the unit interval (0, 1] is defined by the Mellin transform. The Mellin transform of βM,N is characterized in terms of products of ratios of Barnes multiple gamma functions, shown to satisfy a functional equation, and a Shintani-type infinite product factorization. The distribution log βM,N is infinitely divisible. If M < N...