Assuming that welding data among structural parts including positions and directions of their contact points and lines can be easily obtained from CAD data, we have proposed imageprocessing algorithms to reliably det...
详细信息
ISBN:
(纸本)188065332X
Assuming that welding data among structural parts including positions and directions of their contact points and lines can be easily obtained from CAD data, we have proposed imageprocessing algorithms to reliably detect only the terminal points for the welding, and to precisely detect the welding line for the torch position control. The proposed algorithms have been applied to a test piece model of large scale steel tube structures, and the continuous tracking along the welding line measuring its welding gap has been presented.
Methods of near-lossless image compression based on the criterion of maximum allowable deviation of pixel values are described in this paper. Predictive and multiresolution techniques for performing near-lossless comp...
详细信息
ISBN:
(纸本)0819427497
Methods of near-lossless image compression based on the criterion of maximum allowable deviation of pixel values are described in this paper. Predictive and multiresolution techniques for performing near-lossless compression are investigated. A procedure for near-lossless compression using a modification of lossless predictive coding techniques to satisfy the specified tolerance is described. Simulation results with modified versions of two of the best lossless predictive coding techniques known, CALIC and JPEG-LS, are provided. It is shown that the application of lossless coding based on reversible transforms in conjunction with pre-quantization is inferior to predictive techniques for near-lossless compression. A partial embedding two-layer scheme is proposed in which an embedded multiresolution coder generates a lossy base layer, and a simple but effective context-based lossless coder codes the difference between the original image and the lossy reconstruction. Simulation results show that this lossy plus near-lossless technique yields compression ratios very close to those obtained with predictive techniques, while providing the feature of a partially embedded bit-stream.
This paper presents a simple and effective method to determine global camera motion using raw MPEG-1 motion vectors information obtained straight from real MPEG-1 streams such as those of the new HITACHI MP-EG1A digit...
详细信息
ISBN:
(纸本)0819427497
This paper presents a simple and effective method to determine global camera motion using raw MPEG-1 motion vectors information obtained straight from real MPEG-1 streams such as those of the new HITACHI MP-EG1A digital camcorder. The simple approach we have experimented with robustly fits a global affine optic flow model to the motion vectors. Other more robust methods are also proposed. In order to cope with the Group-of-Frames (GOF) discontinuity of the MPEG stream, B frames are used backward to determine the "missing link" to a previous GOF thereby ensuring continuity of the motion estimation across a reasonable number of frames. As a testbed, we have applied the method to the image mosaicing problem, for which interesting results have been obtained. Although several other methods exists to perform camera motion estimation. the approach presented here is particularly interesting because exploits "free" information present in MPEG streams and bypass the highly expensive correlation process.
This paper describes a new vector indexing algorithm for Lattice Vector Quantization, (LVQ). The technique applies to a large class of lattices such as Z(n), A(n), D-n or E-8, widely used in signal compression. Relyin...
详细信息
ISBN:
(纸本)0819427497
This paper describes a new vector indexing algorithm for Lattice Vector Quantization, (LVQ). The technique applies to a large class of lattices such as Z(n), A(n), D-n or E-8, widely used in signal compression. Relying on a partitioning of the events sources, based on a notion of leaders as proposed in,(1) it allows to trade vector look-up table size for arithmetic operations. At the cost of a very small number of integer arithmetic operations, the algorithm leads to a very significant reduction of the vector look-up tables. This in turn leads to reduced encoder and decoder complexities. The introduction of the concept elf 'absolute' leaders, and of the corresponding coding and decoding algorithms, provides additional flexibility in trading table size for arithmetic operations. The association of these vector indexing techniques with product codes, in the framework of Lattice Vector Quantization, leads to increased compression performances.
Source coding of multi-view image sequences is investigated. Two different frameworks are considered. The first one is a bidirectional predictive coding scheme, in which the displayed (intermediate) frames can be inst...
详细信息
ISBN:
(纸本)0819424358
Source coding of multi-view image sequences is investigated. Two different frameworks are considered. The first one is a bidirectional predictive coding scheme, in which the displayed (intermediate) frames can be instantaneously decoded given the coded furthest right and left images (I-frames). The second one is a unidirectional predictive coding scheme, in which the central frame is an I-frame and the remaining frames are coded based on this frame. Both frameworks can overcome problems related to occlusion, are compatible with current and proposed image and video coding standards, consider the special indexing characteristics of multi-view sequences, and can be implemented in applications where the display device has a small buffer. The actual coding is performed using the subspace projection technique (SPT), a locally adaptive incomplete transform approach, which incorporates disparity compensation and residual coding in a unified adaptive transform approach. The transformation matrix is equivalent to a projection operation and is determined using the local cross-correlation characteristics. Several design issues in generating the adaptive transforms and experimental results are presented.
Matching pursuit, introduced by Mallat and Zhang,(1) is an algorithm for decomposing a signal into a linear combination of functions chosen from possibly redundant dictionary of functions. (A similar greedy algorithm ...
详细信息
ISBN:
(纸本)0819424358
Matching pursuit, introduced by Mallat and Zhang,(1) is an algorithm for decomposing a signal into a linear combination of functions chosen from possibly redundant dictionary of functions. (A similar greedy algorithm is well known for finding sparse approximate solutions to underdetermined linear systems of equations.(2,3)) A variant which we call. quantized matching pursuit (QMP) has been proposed for various lossy compression problems. Here a simple dependent coding scheme is introduced to code the coefficients and indices in a quantized matching pursuit representation. The improvement in rate-distortion performance is shown through simulations on synthetic sources. The resulting system is used to code still images and motion-compensated video residual images. Since a DCT-basis dictionary is used, the multiplicative computational complexity is equal to that of traditional transform coding. The image coding results are ambiguous, with a very slight increase in PSNR but no discernible subjective improvement. The video coding results are more promising, with bit rate reductions of up to 20% comparing at constant SNR. The competitive performance and design flexibility indicate that the method warrants further investigation.
We have developed an advanced segmentation algorithm using color information as well as intensity information. Combining both kinds of information yields robust and better segmentation results in terms of perception. ...
详细信息
ISBN:
(纸本)0819427497
We have developed an advanced segmentation algorithm using color information as well as intensity information. Combining both kinds of information yields robust and better segmentation results in terms of perception. Our segmentation algorithm consists of joint marker extraction, region growing and region merging. We have introduced a new algorithm for extracting markers out of images using both color and intensity information. Morphological open-close by reconstruction filters are applied for intensity based marker extraction. In color based marker extraction, quantized HSV color values are employed. Joint markers are defined as the sum of both kinds of markers. The region growing process is applied after the marker extraction process until all of the uncertain pixels belong to either of the marker regions. Our proposed process is based on a watershed algorithm which is a powerful morphological decision tool. After the region growing process, region merging using color information is employed. This process is applied in order to reduce segmented regions while preserving meaningful information. Finally, our experimental results are shown using "akiyo" and "foreman" sequences.
This paper presents a Wavelet based image compression algorithm specifically tailored for facial photographs. The proposed method dramatically reduces memory requirements for facial image databases. The algorithm make...
详细信息
This paper presents a Wavelet based image compression algorithm specifically tailored for facial photographs. The proposed method dramatically reduces memory requirements for facial image databases. The algorithm makes it possible to reach compression rates of 0.25 to 0.1 bpp without compromising the visual quality of facial features used for identification purposes. This is made possible by utilizing a novel strategy for quantizing the Wavelet coefficients, where the spatial content and the frequency distribution of each input image are combined to produce a quantization scheme which is spatially and frequency dependent and different for each being processed. The main steps of the algorithm are as follows: detection of more and less important spacial areas in the photograph;discrete Wavelet transform;space and frequency dependent quantization customized for a specific frequency distribution of each image;entropy encoding.
A region-adaptive subband coding-algorithm is studied. The shape of the regions is not given beforehand, but is the result of a joint optimization with the set of coding operators. A simple space-varying M x M-band su...
详细信息
ISBN:
(纸本)0819427497
A region-adaptive subband coding-algorithm is studied. The shape of the regions is not given beforehand, but is the result of a joint optimization with the set of coding operators. A simple space-varying M x M-band subband decomposition technique with instantaneous switching is utilized so that each M by M image block can be allocated to one of N concurrent encoders. The joint optimization is iterative and switches back and forth between optimization of the region shapes and of the coding operators defined by a set of subband filters and entropy coding tables (quantization is uniform and constant). From an information theoretic viewpoint, this procedure corresponds to the modeling of higher order redundancy by means of finite multidimensional mixtures. The algorithm is tested on natural images and several conclusions are drawn. Reg-ion-adaptive coding presents a significant advantage compared to the equivalent single coder system. Although the optimal regions exhibit a distinctive structure, it is very different from any high level object-bared segmentation. Finally, the efficiency of the approach lies mainly in its region-adaptive entropy coding capability. Adaptation of the transform operator itself appears to be less important.
This paper proposes a new methodology to deal with videoconference applications in which several different sites can be involved. In such applications, it should be interesting for each user to watch only one image wh...
详细信息
ISBN:
(纸本)0819424358
This paper proposes a new methodology to deal with videoconference applications in which several different sites can be involved. In such applications, it should be interesting for each user to watch only one image which gives him the impression that everybody is in the same virtual room. Furthermore, since it can be expected that only a very limited transmission bandwidth is available, it is important to transmit only useful information. For these reasons, we have developed a technique which consists in the creation of an hybrid synthetic/natural scene. This hybrid scene contains the real images of each interlocutor of the multi-sites videoconference. This permits to reduce the bitrate since only the regions of interest contained in the real video data must be coded and transmitted. In practice, the background of the scene, which has generally no interest for users, is not coded. The extraction of these regions of interest is performed by a new detection algorithm based on a reference image. In order to manage occlusion and collision problems in the hybrid images, a 3-D positioning strategy of 2-D real objects has been developed. Experimental results are presented on real videoconference-like image sequences.
暂无评论