In this paper we propose a 3D image compression method which is volume rendering oriented and uses wavelet transform. Via separable wavelet transform, dataset is decomposed into subbands with different importance to r...
详细信息
ISBN:
(纸本)7505338900
In this paper we propose a 3D image compression method which is volume rendering oriented and uses wavelet transform. Via separable wavelet transform, dataset is decomposed into subbands with different importance to rendering process. According to this difference, an efficient classified quantization and a bit allocation strategy are designed,and zero-tree structure is used to represent zero coefficients.
We present planar curve descriptors that allow a hierarchical representation of curves. The descriptors are based on wavelet and multiwavelet transforms and they decompose a curve into components of different scales.
ISBN:
(纸本)0819429139
We present planar curve descriptors that allow a hierarchical representation of curves. The descriptors are based on wavelet and multiwavelet transforms and they decompose a curve into components of different scales.
In this paper, the relationship between wavelet transform and Differential Mapping Singularities Theory (DMST) is discussed in the context of image compression. DMST maps 3-D surfaces accurately, with exact results, a...
详细信息
ISBN:
(纸本)0819425915
In this paper, the relationship between wavelet transform and Differential Mapping Singularities Theory (DMST) is discussed in the context of image compression. DMST maps 3-D surfaces accurately, with exact results, and to construct an image compression algorithm based on an expanded set of operations. This set includes shift, scaling rotation, and homogenous nonlinear transformations. This approach permits the mathematical description of a full set of singularities that describe edges and other specific points of objects. The edges and specific points (degenerate critical points) are the product of mapping smooth 3-D surfaces, which can be described by a simple set of polynomials that are suitable for image compression and Automatic Target Recognition (ATR). In signal and imageprocessing, wavelets have been used for several years to provide multi-resolution data representation [1] Originally, wavelets were developed for one-dimensional signal decomposition. Subsequently, they were generalized to 2-D image coding. Now, wavelet transform is used to hierarchically decompose an input signal into a series of lower resolution reference signals and associated detail signals. At each level, a reference signal and its associated detail signal contain information required to reconstruct the reference signal at the next higher resolution level. Efficient image coding is enabled by allocating the bandwidth according to the relative importance of information in the reference and detail signals, and then applying the next level of the lossy and lossless compression algorithm.
image watermarking is in use for proving ownership for a fairly long time. For most of the study on this area, a pseudo random number sequence PRSN or a binary image logo is embedded as watermark. Nowadays the owner&#...
详细信息
ISBN:
(纸本)9781467373869
image watermarking is in use for proving ownership for a fairly long time. For most of the study on this area, a pseudo random number sequence PRSN or a binary image logo is embedded as watermark. Nowadays the owner's face or sound is also embedded as biometric watermark. image is transferred to discrete wavelet transform domain, watermark is embedded to DWT values, then DWT values are retransformed to spatial domain to obtain watermarked image. Embedding a vector image logo as watermark was not tried in previous works. In this work, non-blind robust watermarking is applied using a vector image as watermark. Various attacks are applied to watermarked images and for each of these attacks vector image watermark is obtained equal or almost equal to the original. Embedding vector image as watermark will bring a new discipline for image watermarking and a new development will arise in this perspective.
In this paper, we propose a method of efficient computation of wavelet coefficients from DCT-based coded image/video signals. Block transform domain filtering is well suited for transcoding of such data. First direct ...
详细信息
ISBN:
(纸本)0819422134
In this paper, we propose a method of efficient computation of wavelet coefficients from DCT-based coded image/video signals. Block transform domain filtering is well suited for transcoding of such data. First direct transform domain processing removes the necessary of inverse transform. Second, the number of nonzero elements in the blocks are significantly smaller than spatial domain. Therefore, the amount of computation can be reduced accordingly. Finally, the block processing algorithm provides a parallel processing method. Hence a fast implementation of the algorithm is well suited.
We discover a new relationship between two seemingly different image modeling methodologies;the Besov space theory and the wavelet-domain statistical image models. Besov spaces characterize the set of real-world image...
详细信息
ISBN:
(纸本)0819432997
We discover a new relationship between two seemingly different image modeling methodologies;the Besov space theory and the wavelet-domain statistical image models. Besov spaces characterize the set of real-world images through a deterministic characterization of the image smoothness, while statistical image models capture the probabilistic properties of images. By establishing a relationship between the Besov norm and the normalized likelihood function under an independent wavelet domain generalized Gaussian model, we obtain a new interpretation of the Besov norm which provides a natural generalization of the theory for practical imageprocessing. Based on this new interpretation of the Besov space, we propose a new image denoising algorithm based on projections onto the convex sets defined in the Besov space: After pointing out the limitations of Besov spaces, we propose possible generalizations using more accurate image models.
We give many examples of bivariate nonseparable compactly supported orthonormal wavelets which are supported over [0,3]x[0,3]. The Holder continuity properties of these wavelets are studied.
ISBN:
(纸本)0819425915
We give many examples of bivariate nonseparable compactly supported orthonormal wavelets which are supported over [0,3]x[0,3]. The Holder continuity properties of these wavelets are studied.
In this paper, an objective criterion on wavelet filters in proposed. wavelet transforms are used in number of important signal and image industrial processing tasks including image coding and denoising. The choice of...
详细信息
ISBN:
(纸本)0819455601
In this paper, an objective criterion on wavelet filters in proposed. wavelet transforms are used in number of important signal and image industrial processing tasks including image coding and denoising. The choice of the wavelet filter bank is is very important and is directly linked to the efficiency of the application. Some criteria have been proposed such as regularity, size of the support of the wavelet and number of vanishing moments. The size of the wavelet support increases with the number of vanishing moments. The wavelet regularity is important to reduce the artifacts. The choice of an optimal wavelet is thus the result of a trade-off between the number of vanishing moments and artifacts. But there is only a partial correlation between filter regularity and reconstructed image quality. The proposed criterion is composed of two indexes. The first one is a frequency index computed from the aliasing of the filters. The second is a spatial index computed from the spread of the coefficients in spatial domain. From these indexes a filter set can be represented by a point in a criteria-plan. The abscissa is given by the frequency index and the ordinate by the spatial index. The quality of a wavelet filter bank is a trade-off between frequency and spatial quality. So the quality of a wavelet filter bank can be assessed from the position of the corresponding point in the criteria-plan. The coding and denoising performances are estimated for various filters (including orthogonal splines and Daubechies). These performances are connected to the indexes of each filter bank. The results show that the two proposed indexes allow : a good estimation of the coding and denoising performances of the wavelet filters, an objective comparison of the filters. Some clues on the connection between our indexes and the kernel size in the Heisenberg-Gabor formula are also given.
We show that signals which are harmonically related to a fundamental frequency which has a finite bandwidth is modeled by the sum of scaled functions. We present a method to study such signals and give an example whic...
详细信息
ISBN:
(纸本)0819416274;9780819416278
We show that signals which are harmonically related to a fundamental frequency which has a finite bandwidth is modeled by the sum of scaled functions. We present a method to study such signals and give an example which illustrates the method.
A novel wavelet subtree partitioning algorithm is proposed, which divides a subtree into scalar quantized wavelet coefficients and a fractal coded sub-subtree. Based on this new technique, a variable size wavelet subt...
详细信息
暂无评论