image signature is a signal that is significantly shorter and simpler than the image signal and can be used to efficiently identify the original image. Generating an image signature that accurately represents an image...
详细信息
image signature is a signal that is significantly shorter and simpler than the image signal and can be used to efficiently identify the original image. Generating an image signature that accurately represents an image can only be done by means of extracting specific features of the image and express it in an efficient way. In this paper, a new wavelet-packets-based (WP) image signature that can be used for image indexing and fast retrieval is proposed. This signature is generated via encoding the position of specific points of the signal that represents some statistics of the wavelet packets coefficients in the various frequency bands. computer simulation results using nearly 7500 image signatures show that the targeted image signature was identified with a very high accuracy in a very short period of time. Also, it showed that the proposed signature is robust against geometric transformation
In this paper an approach for reconstructing the position of an object from a pair of stereo images that allows for a fast and effective hand tracking and 3D gesture reconstruction is presented. The algorithm will ser...
详细信息
A visualization scheme as a tool to find the solution of any 3D-linear programming problem is introduced. The presented approach is highly suitable to draw and visualize interactively the feasible region of a given 3D...
详细信息
A visualization scheme as a tool to find the solution of any 3D-linear programming problem is introduced. The presented approach is highly suitable to draw and visualize interactively the feasible region of a given 3D-linear programming problem. It can be used for a better understanding of the solution process when different methods devoted to solve the underlying problem are applied, e.g., the simplex method. The proposed technique comprises sensitive analysis during the solution process and interactive visualization of the feasible region. The analysis leading to the introduced schema also shows that the design of an appropriate and simple vertex representation is crucial to manage any order of degeneracy. To deal with this paradigm and to some extent to formalize it, the concept of adjacency invariance is introduced. Several experiments have been conducted to test and assess the performance of the introduced concepts and techniques.
The draft international standard ITU-T H.263 is closely related to the well known and widely used ITU-T Recommendation H.261. However, H.263 does provide the same subjective image quality at less than half the bit-rat...
The draft international standard ITU-T H.263 is closely related to the well known and widely used ITU-T Recommendation H.261. However, H.263 does provide the same subjective image quality at less than half the bit-rate. In this paper we investigate to what extend single enhancements of H.263 contribute to this performance gain, and consider the trade-off quality vs. complexity. Based on typical test sequences, H.263 with its various modes is compared to H.261 on the basis of rate distortion curves at bit-rates up to 128 kbps. At 64 kbps, the performance gain of H.263 in its default mode compared to H.261 is approximately 2 dB. This improvement is achieved with only little increase of complexity, and is mainly due to more accurate motion compensation with half-pel accuracy. Considering the trade-off quality vs. complexity, the combination of the optional coding-modes "Advanced prediction mode" and "PB-frames mode" is a good compromise, resulting in an additional performance gain of 1.5 dB PSNR at 64 kbps. The "Syntax-based arithmetic coding mode" on the other hand, offers only a very small performance gain (0.1 dB at 64 kbps) for its increased computational complexity. Results from profiling an H.263 software codec are presented in order to support complexity considerations of the optional coding-modes.
The authors carry out tests with two readily available automated matching algorithms in their application to (a) Magellan SAR stereo images, and (b) ERS-1 and X-SAR real-simulated images. The match points are examined...
详细信息
The authors carry out tests with two readily available automated matching algorithms in their application to (a) Magellan SAR stereo images, and (b) ERS-1 and X-SAR real-simulated images. The match points are examined visually, and an accuracy analysis on Magellan data is performed by comparison with manual measurements.
作者：
Creutzburg, ReinerAcademy of Sciences of the G.D.R
Central Institute of Cybernetics and Information Processes International Basic Laboratory for Image Processing and Computer Graphics Kurstrasse 33 P.O.Box 1298 BerlinDDR-1086 Germany
In this paper we investigate the parallel conflict-free access to complete extended q-ary subtrees of complete q-ary trees. Thereby the memory module assignment function S is supposed to be recursively linear and nonl...
详细信息
An approach for applying a structural texture analysis method to automatic visual inspection of fabric samples in the textile industry is presented. The main steps (image preprocessing, image segmentation, model descr...
详细信息
In this paper the parallel conflict-free access to complete extended binary subtrees of complete binary trees is investigated. Thereby linear and also nonlinear memory module assignment functions S are considered. Fur...
详细信息
暂无评论