Several algorithms that have been implemented as possible candidates for a hybrid video compression system to be used for remote driving of a ground vehicle are described. The algorithms have been implemented on the p...
详细信息
Several algorithms that have been implemented as possible candidates for a hybrid video compression system to be used for remote driving of a ground vehicle are described. The algorithms have been implemented on the pipelined image processing engine (PIPE) real-time image processing machine. The PIPE has been integrated with a remote control vehicle system, and the algorithms were evaluated by means of real-world remote driving experiments. These experiments have shown that remote vehicle driving is difficult enough without degrading the imagery through compression algorithms. The degraded imagery makes driving even more difficult. The following difficulties were found in driving in cross country terrain using either the full video or the compressed video: global relative vehicle location is very difficult for the driver to obtain; the orientation of the local ground surface is very difficult to obtain; ditches, gullies, and other obstacles are difficult to distinguish; and the range of objects from the vehicle is difficult to determine. It appears that performing compression by transmitting images at a rate of, at most, a few per second and then providing a realistic video simulation to the operator may be one of the most effective ways of performing video compression.< >
Data from statistically unknown sources is generally difficult to compress with significant ratios. The compression scheme should have the ability to gather context information of the source in an adaptive manner. Ari...
详细信息
Data from statistically unknown sources is generally difficult to compress with significant ratios. The compression scheme should have the ability to gather context information of the source in an adaptive manner. Arithmetic coding has that capability and can be made to outperform many other compression schemes known. The sliding dictionary, on the other hand, is a compression algorithm which is best suitable for hardware implementation on systolic-array parallel processors, but due to the statistical properties of its information context, it results in inferior compression ratios. A string dictionary structure is proposed that combines the advantages of both algorithms, offering the possibility of hardware implementation on VLSI, avoidance of encoding almost random information, and encoding with arithmetic codes.< >
Future video services in the loop plant may be based on digital transmission through optical fibers. A small and inexpensive codec is required for a variety of services based on digital television. We have demonstrate...
详细信息
Future video services in the loop plant may be based on digital transmission through optical fibers. A small and inexpensive codec is required for a variety of services based on digital television. We have demonstrated a compression algorithm for transmission of NTSC color television over a DS3 channel (44.736 Mbits/s). This predictive coding algorithm has been implemented using circuits built with conventional TTL logic. The resulting picture is visually unimpaired, but may not have network quality. The major portion of the compression or reconstruction circuit has also been implemented in one CMOS VLSI chip. compression is accomplished using this chip with two small ROM chips. Reconstruction is done with the same VLSI chip and one ROM chip.
Speech level measurements were made for a collection of Diagnostic Rhyme Test (DRT) word lists as used for intelligibility testing of voice communications systems. These measurements were used in the generation of a s...
详细信息
Speech level measurements were made for a collection of Diagnostic Rhyme Test (DRT) word lists as used for intelligibility testing of voice communications systems. These measurements were used in the generation of a subsequent set of DRT source tapes for which all DRT list segments on the tapes were equalized with respect to speech level. The effects of this equalization on intelligibility scores was evaluated for unprocessed and processed speech (both parametric and waveform coding algorithms). The manipulation of the speech levels for the DRT lists did not result in significant, predictable, and replicable effects on either system mean scores or on the DRT score variability across lists. The absence of effects was noted for all speech processing conditions and for both male and female speakers. Practical advantages in the use of the equalized word lists are discussed.
In this paper a simple predictive transform coder is proposed for the processing of images. The coder is intrafield and predicts the coefficients of a two-dimensional Hadamard transform based on the past pels immediat...
详细信息
In this paper a simple predictive transform coder is proposed for the processing of images. The coder is intrafield and predicts the coefficients of a two-dimensional Hadamard transform based on the past pels immediately surrounding the transformed block. The cost and performance of the new coder compares well with that of other techniques. For example, a predictive transform coder acting on 2×2 picture blocks and operating at an average bit rate of 2 bits/pel is found to yield significantly better picture quality than that derived from a 2×2 or even a 4×4 Hadamard coder. Also, just as important, the physical implementation of this coder requires from two to three times the number of on-line operations required by a 2×2 Hadamard coder and 1/4 to 1/3 that of a 4×4 Hadamard coder.
In previous descriptions of the step transform SAR azimuth compression algorithm, it has been assumed that the azimuth signal is linear FM and is strictly confined within a single range cell. These conditions do not a...
详细信息
In previous descriptions of the step transform SAR azimuth compression algorithm, it has been assumed that the azimuth signal is linear FM and is strictly confined within a single range cell. These conditions do not always hold. Under stringent imaging conditions range curvature occurs, i.e., a nonlinear range migration of the energy associated with a point target takes place. If the system must also operate at a high squint angle, the azimuth signal becomes nonlinear FM. This paper describes extensions to the basic step transform algorithm that allow these imaging situations to be accommodated.
Component coding of the NTSC color TV signal is investigated. This coding involves digital demodulation of the composite signal sampled at three times the color subcarrier frequency, the implementation of the compress...
详细信息
The Least Mean Squares (LMS) Algorithm may be used to adapt the coefficients of an adaptive prediction filter for image source encoding. It is shown that if one allows a small amount of distortion in the received imag...
详细信息
The Least Mean Squares (LMS) Algorithm may be used to adapt the coefficients of an adaptive prediction filter for image source encoding. It is shown that if one allows a small amount of distortion in the received image, then the LMS algorithm allows a dramatic reduction in the required channel transmission bandwidth. Results are presented which show LMS provides up to a 1-2 bits per symbol reduction in transmitted bit rate (compared to DPCM) when distortion levels are approximately the same in both cases. Further, LMS can equivalently be used in fixed channel bandwidth environments to decrease the image distortion. When compared to results for fixed coefficient DPCM, one is able to reduce reconstructed image distortion by as much as 7-10 dB using LMS.
We describe a one-pass compression scheme which presumes no statistical properties of the data being compressed. The model structure adaptively selects a subset of first-order Markov contexts, based on an estimate of ...
详细信息
We describe a one-pass compression scheme which presumes no statistical properties of the data being compressed. The model structure adaptively selects a subset of first-order Markov contexts, based on an estimate of the candidate context's popularity. The probability distributions for the unselected (lumped) first-order contexts are made the same, reducing cost over a full first-order Markov model. Symbol repetitions are handled in special secondorder Markov contexts. The statistics for each symbol are adaptively determined by an extension of earlier work.
暂无评论