The emergence of fast, embeddable parallel processors such as SIMD meshes and networked multiprocessors has motivated increased parallel algorithm development for image and signal processing (ISP) and automated target...
详细信息
ISBN:
(纸本)0819429112
The emergence of fast, embeddable parallel processors such as SIMD meshes and networked multiprocessors has motivated increased parallel algorithm development for image and signal processing (ISP) and automated target recognition (ATR). Among such applications are real-time video compression for Internet communication, videotelephony, and videoteleconferencing. In general, image or signal compression transforms tend to be attractive candidates for parallel implementation. For example, due to a rectangular, non-overlapping partition structure, block-oriented transforms such as JPEG can be processed in pipeline fashion. In contrast, implementational challenges accrue as a result of between-brock data and control dependencies encountered in various pyramid-structured or hierarchical compression transforms such as wavelet-based coding. This paper summarizes ongoing research in the mapping of imagecompression transforms to SIMD-parallel computers. Three classes of algorithms are considered: (I) streaming, (2) block-oriented, and (3) hierarchically structured. It is shown that Classes 1 and 2 are suitable for SIMD computation, particularly where mesh segments can be connected to form a pipeline. Computation is facilitated by modifying a SIMD mesh to form a brute-force synchronous MIMD processor, which is called a multi-SIMD or MSIMD architecture. Several designs for pipelined compression transform implementation on an MSIMD mesh are analyzed in terms of critical computational complexity and error. Analysis also emphasizes theory, software, and parallelism required to support resolution of data and control dependencies encountered in ISP/ATR practice.
Recent studies have shown that chaotic processes provide an appropriate mechanism for the encryption of sensitive signal information. Thus, a Volterra nonlinear integral equation is used to generate such chaotic proce...
详细信息
ISBN:
(纸本)0819429112
Recent studies have shown that chaotic processes provide an appropriate mechanism for the encryption of sensitive signal information. Thus, a Volterra nonlinear integral equation is used to generate such chaotic processes as solutions of an initial-value problem.
In the paper we present the method that improves lossy compression of the true color or other multispectral images. The essence of the method is to project initial color planes into Karhunen-Loeve (KL) basis that give...
详细信息
ISBN:
(纸本)0819429112
In the paper we present the method that improves lossy compression of the true color or other multispectral images. The essence of the method is to project initial color planes into Karhunen-Loeve (KL) basis that gives completely decorrelated representation for the image and to compress basis functions instead of the planes. To do that the new fast algorithm of true KL basis construction with low memory consumption is suggested and our recently proposed scheme for finding optimal losses of KL functions while compression is used. Compare to standard JPEG compression of the CMYK images the method provides the PSNR gain from 0.2 to 2 dB for the convenient compression ratios. Experimental results are obtained for high resolution CMYK images. It is demonstrated that presented scheme could work on common hardware.
A novel method for reversible compression of 2D and 3D data is presented. An adaptive spatial prediction is followed by a context-based classification with arithmetic coding.of the outcome residuals. Prediction of a p...
详细信息
ISBN:
(纸本)0819429112
A novel method for reversible compression of 2D and 3D data is presented. An adaptive spatial prediction is followed by a context-based classification with arithmetic coding.of the outcome residuals. Prediction of a pixel to be encoded is obtained from the fuzzy-switching of a set of linear predictors. The coefficients of each predictor are calculated to minimize prediction MSE for pixels belonging to a cluster in the hyperspace of graylevel patterns lying on a preset causal neighborhood. In the 3D case, pixels both on the current slice and on previously encoded slices may be wed. The size and shape of the causal neighborhood, as well as the number of predictors to be switched, may be chosen before running the algorithm and determine the trade-off between coding.performances and computational cost. The method exhibits impressive performances, for both 2D and 3D data, mainly thanks to the optimality of predictors, due to their skill in fitting data patterns.
We present some initial study results on image representation and compression using multi-Gabor representations. Two dimensional multi-Gabor representations (MGR) are a technique of Gabor representations incorporating...
详细信息
ISBN:
(纸本)0819429112
We present some initial study results on image representation and compression using multi-Gabor representations. Two dimensional multi-Gabor representations (MGR) are a technique of Gabor representations incorporating a set of nonseparable 2-D window waveforms in a basis-like (frame) system. Windows used in a MGR can be customized to have different spatial and frequency orientations and different spatial and frequency localizations. MGRs have obvious values in efficient image representations and/or compression since an image signal typically has a variety of spatial and frequency contents and orientations. An image could also have textures of different orintations. A multi-Gabor representation that incorporates a set of windows of different localizations and orientations has a build-in adaptive potential, which can provide the most concise representation.
This work presents algorithmic methods of errors reduction and 2-D signals compression in a combined PCM-DM formats. Also methods of defining Delta Modulation (DM) sampling rate and maximum and minimum DM step size in...
详细信息
This work presents algorithmic methods of errors reduction and 2-D signals compression in a combined PCM-DM formats. Also methods of defining Delta Modulation (DM) sampling rate and maximum and minimum DM step size in real time, basing on maximum derivative apriori estimate, are presented. This estimate is proposed to be defined by a spectrum of the previous signal realization, which is known. Further datacompression in real time is achieved with help of Extremal Analysis (EA). EA of pictures is based on the 2-D differences - in rows (columns) or in diagonals. This type of datacompression is based only on the definition the extreme signal, and distance between these extremes. The algorithm of rigorous, unrigorous, and unclear extreme defining is universal, and independently from any method of digitalization of pixels is presented. Also methods of errors analysis and their decrease are described. After compression with EA, the image is reconstructed in real time.
The paper presents a low bit-rate video compression algorithm for digital monochrome image sequence transmission. Presented method is based on Wavelet Transform and an original image segmentation algorithm for intra- ...
详细信息
ISBN:
(纸本)0819429112
The paper presents a low bit-rate video compression algorithm for digital monochrome image sequence transmission. Presented method is based on Wavelet Transform and an original image segmentation algorithm for intra- and inter-frames. The proposed algorithm divides an image into rectangular blocks, which may overlap. The width and height of these blocks are set independently and can have optimal values from a preset range. Blocks are filled with a mean value of pixels from original image and their sizes are increased until the mean square error value for the block is smaller than the preset value. The algorithm is strongly parameterized, so it can be used for compressing the subimages created by the Discrete Wavelet Transform. In two-dimensional wavelet transform, an image is interpreted as a sum of details that appear at different resolutions. As the result each subimage produced by WT can be compressed and transmitted separately to decrease the sensitivity to errors that may occur in the channel. The paper also presents the results obtained during off-line imagecompression. These results show better quality (in PSNR ratio) of restored images in compare to H.261 and H.263 algorithms. The presented algorithm achieves good restored image quality with high compression ratio and ability of simple hardware implementation.
Developers of the UF Distributed Conferencing System, version 2 (DCS.v2) have proposed a protocol that involves the distribution of a session key by a trusted server to a principal with whom it will communicate. The p...
详细信息
ISBN:
(纸本)0819429112
Developers of the UF Distributed Conferencing System, version 2 (DCS.v2) have proposed a protocol that involves the distribution of a session key by a trusted server to a principal with whom it will communicate. The protocol differs from standard key exchange protocols in that it attempts to address the issue of the delivery of a private key as well as the desired session key in a secure fashion. Because of the complexity of asymmetric keys, it is necessary for human principals to store their private keys until needed. The DCS.v2 protocol assumes that principals encrypt their private keys and store them on a network. When they seek to communicate with other principals, they must request that the appropriate encrypted key be issued to them by the server which will in turn be used to decrypt the session key. This paper presents the protocol and analyses it using BAN logic.
This work mainly deal with the compression of Remote Sensed images gathered from a radiometer flown aboard an environmental satellite. In this work some NOAA/AVHRR images have been used with focus on the southern Euro...
详细信息
ISBN:
(纸本)0819429112
This work mainly deal with the compression of Remote Sensed images gathered from a radiometer flown aboard an environmental satellite. In this work some NOAA/AVHRR images have been used with focus on the southern Europe and the Mediterranean Basin. It is possible to find out a relationship between pixels close one each other. In such a way it is possible to say that there is a certain degree of correlation within pixels belonging to the same band in a close neighbourhood. Based upon this observation, a simple compression scheme was used to compress single band images. The coefficients of this relationship are, in turn, quite probably, similar to the ones calculated in one of the other bands. Based upon this second observation, an algorithm was developed, able to reduce the number of bit/pixel from 16 to 4 in multispectral images. A comparison was carried out between these different methods about their speed and compression ratio. As reference it was taken the behaviour of two commonly used programs: PKZIP and LHA. The presented methods have similar results in both speed and compression ratio to the commonly used programs and are to be preferred when the decompression must be carried out on line, inside st main program or when there is the need of a custom made compression algorithm.
暂无评论