First, a general procedure for constructing a variety of orthogonal wavelets which are compactly supported in frequency domain is presented. These orthogonal wavelets, as a result of the method of multiresolution anal...
详细信息
ISBN:
(纸本)0780336798
First, a general procedure for constructing a variety of orthogonal wavelets which are compactly supported in frequency domain is presented. These orthogonal wavelets, as a result of the method of multiresolution analysis (MRA), share the same space structure. This property makes it possible to construct a "combined" orthonormal base of L/sup 2/(R) which contains more than one wavelet functions. This kind of combined orthonormal wavelet bases are more flexible and are expected to be more efficient than the conventional wavelet bases in data compression, speech coding and image coding.
In order to satisfy the needs of new applications in a multimedia environment the problem of object-oriented coding has to be addressed. In this paper two main approaches are presented to tackle this problem. First, a...
详细信息
In order to satisfy the needs of new applications in a multimedia environment the problem of object-oriented coding has to be addressed. In this paper two main approaches are presented to tackle this problem. First, an algorithm for shape coding is presented. It, is based on a chain coding algorithm where powerful modeling techniques are used to increase the compression ratio. Second, an algorithm for interior coding is described, It is based on an arbitrarily-shaped subband transform followed by a generalized embedded zerotree wavelet algorithm. It is shown in the paper that it achieves good compression results and has additional properties such as supporting arbitrarily shaped regions, being computationally efficient, keeping the same dimensionality in the transformed domain, allowing perfect reconstruction and an intrinsic rate control mechanism. The presented results show that the two algorithms build an efficient basis to design object-oriented video coding schemes.
We present a region-based wavelet compression method for encoding video sequences at very low bit rates suitable for videophone applications. By selectively coding texture information in the regions of interest, we av...
详细信息
We present a region-based wavelet compression method for encoding video sequences at very low bit rates suitable for videophone applications. By selectively coding texture information in the regions of interest, we avoid spending bits in the unimportant regions and improve video quality. The embedded zerotree wavelet algorithm is extended to efficiently represent the wavelet coefficients within the regions of interest while exploiting redundancy between subbands. The locations of the regions of interest are selected during the motion estimation process and are transmitted as part of the macroblock type. This technique can provide better quality compared to the new H.263 videophone compression standard. This technique was also incorporated in a more general object-based compression scheme which obtained high scores during the recent MPEG-4 subjective quality evaluations.
Linear filter banks with critical subsampling and perfect reconstruction (PR) property have received much interest and found numerous applications in signal and imageprocessing. Nonlinear filter bank structures with ...
详细信息
Linear filter banks with critical subsampling and perfect reconstruction (PR) property have received much interest and found numerous applications in signal and imageprocessing. Nonlinear filter bank structures with PR and critical subsampling have been proposed and used in image coding. It is shown that PR nonlinear subband decomposition can be performed using the Galois field (GF) arithmetic. The result of the decomposition of an n-ary (e.g. 256-ary) input signal is still n-ary at different resolutions. This decomposition structure can be utilized for binary and 2/sup k/ (k is an integer) level signal decompositions. Simulation studies are presented.
A fully compatible and scalable coding scheme for super high definition (SHD) video has been developed. wavelet decomposition is performed such that the low frequency band is of CIF order, which forms a low-resolution...
详细信息
A fully compatible and scalable coding scheme for super high definition (SHD) video has been developed. wavelet decomposition is performed such that the low frequency band is of CIF order, which forms a low-resolution core of the full sized video, and is coded by MPEG. The high frequency wavelet coefficients are coded by the proposed virtual zerotree which encodes the wavelets more efficiently than the simple zerotree. Embedded in the scheme is also the hierarchical motion compensation that gives high performance with a large capable compensation range, requires minimum computation, and reduces overhead motion information. With its scalability, data prioritization and precise bit-rate control, the scheme is suitable to code SHD video in multimedia applications.
The proceedings contain 21 papers. The special focus in this conference is on Algebraic Coding. The topics include: The algebraic structure of codes invariant under a permutation;a method of combining algebraic geomet...
ISBN:
(纸本)9783540617488
The proceedings contain 21 papers. The special focus in this conference is on Algebraic Coding. The topics include: The algebraic structure of codes invariant under a permutation;a method of combining algebraic geometric goppa codes;some best rate 1/p quasi-cyclic codes over GF(5);cryptography and secure communications information leakage of a randomly selected boolean function;on the use of periodic timebase companding in the scrambling of stationary processes;a novel approach to spread spectrum communication using linear periodic time-varying filters;on random-like codes (invited paper);an alternative approach to the design of interleavers for block “turbo” codes;improved VLSI design for decoding concatenated codes comprising an irreducible cyclic code and a reed-solomon code;non-minimal trellises for linear block codes;trellis complexity of linear block codes via atomic codewords;error corrections for channels with substitutions, insertions, and deletions;reduced complexity soft-output maximum likelihood sequence estimation of 4-ary CPM signals transmitted over rayleigh flat-fading channels;a novel receiver structure for MPSK in the presence of rapidly changing phase;finite-field wavelet transforms (invited paper);choice of wavelets for image compression;information in Markov random fields and image redundancy;coding of image data via correlation filters for invariant pattern recognition;improving myoelectric signal classifier generalization by preprocessing with exploratory projections;Chinese character recognition via orthogonal moments.
We describe two low-complexity entropy coding structures for compression of quantized wavelet coefficients for image compression applications. The coders operate independently within each subband and represent zero ru...
详细信息
We describe two low-complexity entropy coding structures for compression of quantized wavelet coefficients for image compression applications. The coders operate independently within each subband and represent zero runs and levels. The first coder uses a parameterized, structured coding tree in which the parameters are selected on an image- or subband-specific basis. The second coder uses a set of non-adaptive, non-structured coding trees. In both of the methods the coefficients are considered in raster order on an intrasubband basis. This leads to a simpler structure relative to zerotree algorithms, though in contrast with zerotree, the technique we use does not produce an embedded bitstream. The main advantage lies in the ability of this approach to provide good performance (typically within 1 dB of the best PSNR results reported in the literature) at a cost which is significantly lower than other algorithms providing comparable PSNR results.
In this paper, a fingerprint recognition algorithm is suggested. The algorithm is developed based on the wavelet transform, the dominant local orientation (DLO) and coherence that derived from the gradient of Gaussian...
详细信息
ISBN:
(纸本)0780337026
In this paper, a fingerprint recognition algorithm is suggested. The algorithm is developed based on the wavelet transform, the dominant local orientation (DLO) and coherence that derived from the gradient of Gaussian. Computer simulation results show that while the rate of Type ii error Incorrect recognition of two different fingerprints as identical fingerprints-is held at 0.0%, the rate of Type I error-Incorrect recognition of two identical fingerprints as different ones-is 2.5%.
Synthetic Aperture Radar images are the representation in range and azimuth coordinates of the signal received by a radar system exploring a portion of the earth surface. The speckle reduction technique presented in t...
详细信息
Synthetic Aperture Radar images are the representation in range and azimuth coordinates of the signal received by a radar system exploring a portion of the earth surface. The speckle reduction technique presented in this paper takes advantage of the knowledge of the s-tatistical model of the backscattered signal to design a wavelet thresholding scheme, appropriate for this particular type of noise. Before the application to actual images, the algorithm validity has been tested by comparison with the Wiener filter, performed on random sequences generated according to the backscattering s-tatistical model.
A new compression algorithm for fingerprint images is introduced. A modified wavelet packet scheme which uses a fixed decomposition structure, matched to the statistics of fingerprint images, is presented. A technique...
详细信息
A new compression algorithm for fingerprint images is introduced. A modified wavelet packet scheme which uses a fixed decomposition structure, matched to the statistics of fingerprint images, is presented. A technique for determining the most important coefficients is introduced. The algorithm uses both hard and soft thresholding schemes to make the procedure fast and efficient. The bit allocation for each subimage of the modified coefficients is determined. Each subimage uses a different quantization technique based on its entropy. Then, a lossless compression technique, Huffman, is used to obtain further compression. The algorithm results in a high compression ratio and a high reconstructed image quality with a low computational cost, compared to other existing algorithms. The performance of the proposed algorithm is compared to that of other decomposition techniques: ordinary wavelet transform (OWT), entropy-based best basis selection (E-BBB), wavelet/scalar quantization (WSQ) and JPEG.
暂无评论