Wavelet transform based error concealment approach for image denoising

Denoising of images in compressed wavelet domain has potential application in transmission technology such as mobile communication. In this paper, we present a new image denoising scheme based on restoration of bit-planes of wavelet coefficients in compressed domain. It exploits the fundamental property of wavelet transform - its ability to analyze the image at different resolution levels and the edge information associated with each band. The proposed scheme relies on the fact that noise commonly manifests itself as a fine-grained structure in image and wavelet transform allows the restoration strategy to adapt itself according to directional features of edges. The proposed approach shows promising results when compared with conventional unrestored scheme, in context of error reduction and has capability to adapt to situations where noise level in the image varies. The applicability of the proposed approach has implications in restoration of images due to noisy channels. This scheme, in addition, to being very flexible, tries to retain all the features, including edges of the image. The proposed scheme is computationally efficient.

Wavelet transform based error concealment approach for image denoising

Denoising of images in compressed wavelet domain has potential application in transmission technology such as mobile communication. In this paper, we present a new image denoising scheme based on restoration of bit-planes of wavelet coefficients in compressed domain. It exploits the fundamental property of wavelet transform - its ability to analyze the image at different resolution levels and the edge information associated with each band. The proposed scheme relies on the fact that noise commonly manifests itself as a fine-grained structure in image and wavelet transform allows the restoration strategy to adapt itself according to directional features of edges. The proposed approach shows promising results when compared with conventional unrestored scheme, in context of error reduction and has capability to adapt to situations where noise level in the image varies. The applicability of the proposed approach has implications in restoration of images due to noisy channels. This scheme, in addition, to being very flexible, tries to retain all the features, including edges of the image. The proposed scheme is computationally efficient.

Deformation and failure of a film/substrate system subjected to spherical indentation: Part 1. Experimental validation of stresses and strains derived using Hankel transform technique in an elastic film/substrate system

Our concern here is to rationalize experimental observations of failure modes brought about by indentation of hard thin ceramic films deposited on metallic substrates. By undertaking this exercise, we would like to evolve an analytical framework that can be used for designs of coatings. In Part I of the paper we develop an algorithm and test it for a model system. Using this analytical framework we address the issue of failure of columnar TiN films in Part II [J. Mater. Res. 21, 783 (2006)] of the paper. In this part, we used a previously derived Hankel transform procedure to derive stress and strain in a birefringent polymer film glued to a strong substrate and subjected to spherical indentation. We measure surface radial strains using strain gauges and bulk film stresses using photo elastic technique (stress freezing). For a boundary condition based on Hertzian traction with no film interface constraint and assuming the substrate constraint to be a function of the imposed strain, the theory describes the stress distributions well. The variation in peak stresses also demonstrates the usefulness of depositing even a soft film to protect an underlying substrate.

Segal-Bargmann transform and Paley-Wiener theorems on M(2)

We study the Segal-Bargmann transform on M(2). The range of this transform is characterized as a weighted Bergman space. In a similar fashion Poisson integrals are investigated. Using a Gutzmer's type formula we characterize the range as a class of functions extending holomorphically to an appropriate domain in the complexification of M(2). We also prove a Paley-Wiener theorem for the inverse Fourier transform.

Interior Medial Axis Transform computation of 3D objects bound by free-form surfaces

This paper presents an algorithm for generating the Interior Medial Axis Transform (iMAT) of 3D objects with free-form boundaries. The algorithm proposed uses the exact representation of the part and generates an approximate rational spline description of the iMAT. The algorithm generates the iMAT by a tracing technique that marches along the object's boundary. The level of approximation is controlled by the choice of the step size in the tracing procedure. Criteria based on distance and local curvature of boundary entities are used to identify the junction points and the search for these junction points is done in an efficient way. The algorithm works for multiply-connected objects as well. Results of the implementation are provided. (C) 2010 Elsevier Ltd. All rights reserved.

Molecular Dynamics Simulations of Orientational Relaxation in Dipolar Lattice: Lack of Diffusive Decay for Second and Higher Rank Correlation Functions

Extensive molecular dynamics simulations have been carried out to calculate the orientational correlation functions Cl(t), G(t) = [4n/(21 + l)]Ci=-l (Y*lm(sZ(0)) Ylm(Q(t))) (where Y,,(Q) are the spherical harmonics) of point dipoles in a cubic lattice. The decay of Cl(t) is found to be strikingly different from higher l-correlation functions-the latter do not exhibit diffusive dynamics even in the long time. Both the cumulant expansion expression of Lynden-Bell and the conventional memory function equation provide very good description of the Cl(t) in the short time but fail to reproduce the observed slow, long time decay of c1 (t) .

Performance of a pipelined ring algorithm for Fast Fourier Transform on transputer arrays

In this paper a pipelined ring algorithm is presented for efficient computation of one and two dimensional Fast Fourier Transform (FFT) on a message passing multiprocessor. The algorithm has been implemented on a transputer based system and experiments reveal that the algorithm is very efficient. A model for analysing the performance of the algorithm is developed from its computation-communication characteristics. Expressions for execution time, speedup and efficiency are obtained and these expressions are validated with experimental results obtained on a four transputer system. The analytical model is then used to estimate the performance of the algorithm for different number of processors, and for different sizes of the input data.

Rank dependence of orientational relaxation in dipolar systems

An important yet unsolved problem in the field of orientational relaxation in dipolar liquids is the dependence of the correlation functions C(l)(t), C(l)(t) = [4pi/(2l + 1)SIGMA(m = -l)l [Y(lm)(OMEGA(0)Y(lm)(OMEGA(t))] on the rank l (where Y(lm)(OMEGA) are the usual spherical harmonics). The existing theories on this effect differ in their predictions. To investigate this, we have carried out extensive computer simulations of a Brownian dipolar lattice. The dielectric friction was found to decrease rapidly with increasing l, in qualitative agreement with the predictions of Hubbard-Wolynes. However, the observed effect is much stronger than the predictions of the existing theories.

Wavelet Transform Codec for Fast Retrieval of Slices of 3D Objects

We propose a method to encode a 3D magnetic resonance image data and a decoder in such way that fast access to any 2D image is possible by decoding only the corresponding information from each subband image and thus provides minimum decoding time. This will be of immense use for medical community, because most of the PET and MRI data are volumetric data. Preprocessing is carried out at every level before wavelet transformation, to enable easier identification of coefficients from each subband image. Inclusion of special characters in the bit stream facilitates access to corresponding information from the encoded data. Results are taken by performing Daub4 along x (row), y (column) direction and Haar along z (slice) direction. Comparable results are achieved with the existing technique. In addition to that decoding time is reduced by 1.98 times. Arithmetic coding is used to encode corresponding information independently

GMM basedbayesian approach to speech enhancement in signal/transform domain

Considering a general linear model of signal degradation, by modeling the probability density function (PDF) of the clean signal using a Gaussian mixture model (GMM) and additive noise by a Gaussian PDF, we derive the minimum mean square error (MMSE) estimator.The derived MMSE estimator is non-linear and the linear MMSE estimator is shown to be a special case. For speech signal corrupted by independent additive noise, by modeling the joint PDF of time-domain speech samples of a speech frame using a GMM, we propose a speech enhancement method based on the derived MMSE estimator. We also show that the same estimator can be used for transform-domain speech enhancement.

Dynamic matrix rank with partial lookahead

We consider the problem of maintaining information about the rank of a matrix $M$ under changes to its entries. For an $n \times n$ matrix $M$, we show an amortized upper bound of $O(n^{\omega-1})$ arithmetic operations per change for this problem, where $\omega < 2.376$ is the exponent for matrix multiplication, under the assumption that there is a {\em lookahead} of up to $\Theta(n)$ locations. That is, we know up to the next $\Theta(n)$ locations $(i_1,j_1),(i_2,j_2),\ldots,$ whose entries are going to change, in advance; however we do not know the new entries in these locations in advance. We get the new entries in these locations in a dynamic manner.

An optimal transform Architecture for H.264/AVC

This paper presents the design of the area optimized integer two dimensional discrete cosine transform (2-D DCT) used in H.264/AVC codecs. The 2-D DCT calculation is performed by utilizing the separability property, in such a way that 2-D DCT is divided into two 1-D DCT calculation that are joined through a common memory. Due to its area optimized approach, the design will find application in mobile devices. Verilog hardware description language (HDL) in cadence environment has been used for design, compilation, simulation and synthesis of transform block in 0.18 mu TSMC technology.