image data require huge amounts of disk space and large bandwidths for transmission. hence, imagecompression is necessary to reduce the amount of data required to represent a digital image. thereforean efficient technique for image compression is highly pushed to demand. although, lots of compressiontechniques are available, but the technique which is faster, memory efficient and simple, surely...

Abstract. This paper presents a novel algorithm for rate-complexity scalable multi-view image coding using an adaptive disparity-compensated (DC) wavelet lifting scheme. First, image regions of multi-view images are prioritized by counting matching points. The proposed algorithm selects either Haar, 5/3, or our proposed multiple picture reference DC wavelet lifting adaptively. The selection cri...

Image data require huge amounts of disk space and large bandwidths for transmission. Hence, imagecompression is necessary to reduce the amount of data required to represent a digital image. Thereforean efficient technique for image compression is highly pushed to demand. Although, lots of compressiontechniques are available, but the technique which is faster, memory efficient and simple, surely...

Lifting scheme for the real field wavelet transform has provided a new insight into its practical implementation. This paper shows that a similar scheme can be developed for the binary field wavelet transform. In particular, by using the Euclidean algorithm, the binary filters can be decomposed into a finite sequence of simple lifting steps over the binary field. This provides an alternative me...

In this paper an attempt has been made to derive the lifting scheme for a set of new bi-orthogonal wavelets and apply on image compression. Four new bi-orthogonal wavelets are designed by taking different basis functions which are selected so as to capture the sharp edges which are common in images. For these classical wavelets, lifting versions are calculated and presented in this paper. The l...

The aim of the study is application of Triangular Prism Method (TPM) algorithm in computer assisted Papanicolaou smears analysis that is useful in cervical cancer screening. The TPM algorithm allows estimation of the FD (fractal dimension) for optical density of cell nuclei. Selection of the local FD for green color channel gives efficient separation between both cell nuclei classes. Proposed a...

In this paper, we present a method for fast liftingbased simulations of continuous-time (CT) Sigma Delta (Σ∆) modulators with arbitrary input signal waveforms. Our approach allows for a very time-efficient simulation of important modulator parameters such as inter-modulation distortion, the response to a spread spectrum input or blocker signals, and evaluation of its signal transfer function. T...

A parallel algorithm for diffusion-limited aggregation (DLA) is described and analyzed from the perspective of computational complexity. The dynamic exponent z of the algorithm is defined with respect to the probabilistic parallel random-access machine (PRAM) model of parallel computation according to T ∼ L z , where L is the cluster size, T is the running time, and the algorithm uses a number ...

A least square method based on data fitting is proposed to construct a new lifting wavelet, together with the nonlinear idea and redundant algorithm, the adaptive redundant lifting transform based on fitting is firstly stated in this paper. By variable combination selections of basis function, sample number and dimension of basis function, a total of nine wavelets with different characteristics...

We develop the skeleton algorithm to define the number of main branches Nb of diffusion-limited aggregation (DLA) clusters. The skeleton algorithm provides a systematic way to remove dangling side branches of the DLA cluster and has successfully been applied to study the ramification properties of percolation. We study the skeleton of comparatively large (≈ 10 sites) off-lattice DLA clusters in...