An optimal binary image filter is an operator defined on an observed random set (image) and the output random set estimates some ideal (uncorrupted) random set with minimal error. Assuming the probability law of the i...
详细信息
ISBN:
(纸本)0819425893
An optimal binary image filter is an operator defined on an observed random set (image) and the output random set estimates some ideal (uncorrupted) random set with minimal error. Assuming the probability law of the ideal process is determined by a parameter vector, the output law is also determined by a parameter vector, and this latter law is a function of the input law and a degradation operator producing the observed image from the ideal image. The robustness question regards the degree to which performance of an optimal filter degrades when it is applied to an image process whose law differs (not too greatly) form the law of the process for which it is optimal. The present paper examines robustness of the optimal translation-invariant binary filter for restoring images degraded by sparse salt-and-pepper noise. An analytic model is developed in terms of prior probabilities of the signal and this model is used to a compute a robustness surface.
Distributed arithmetic (DA) based implementation of linear filters relies on the linear nature of this operation and has been suggested as a multiplication free solution. In this work we introduce a nonlinear extensio...
详细信息
ISBN:
(纸本)0819425893
Distributed arithmetic (DA) based implementation of linear filters relies on the linear nature of this operation and has been suggested as a multiplication free solution. In this work we introduce a nonlinear extension of linear filters optimizing under MSE criterion the memory function (MF, multivariate Boolean function with not only binary output) which is in the core of DA based implementation. Such an extension will improve the filtering of noise which can contain non Gaussian components without increasing the complexity of implementation. Experiments on real images have shown the superiority of the proposed filter over the optimal linear filters. Different versions of these filters are also considered for the removal of impulsive noise, processing with the large input data windows and fast processing.
This paper describes new feature extraction methods which can be used very effectively in combination with statistical methods for image sequence recognition. Although these feature extraction methods can be used for ...
详细信息
ISBN:
(纸本)0818679204
This paper describes new feature extraction methods which can be used very effectively in combination with statistical methods for image sequence recognition. Although these feature extraction methods can be used for a wide variety of image sequence processing applications, the target application presented in this paper is gesture recognition. The novel feature extraction methods have been integrated into an HMM-based gesture recognition system and led to substantial improvements for this system. It turned out that the new features are not only able to describe the gesture characteristics much better than the old features, but additionally they also led to a dramatic reduction in dimensionality of the feature vector used for representing each frame of the image sequence. This resulted in the fact that it was possible to use the novel features in Combination with a new architecture for statistical image sequence recognition. The result of this investigation is a high performance gesture recognition system with significantly improved recognition rates and real-time capabilities.
In this paper a general and efficient approach for representing and classifying image sequences by Hidden Markov Models (HMMs) is presented. A consistent modeling of spatial and temporal information is achieved by ext...
详细信息
ISBN:
(纸本)0818679204
In this paper a general and efficient approach for representing and classifying image sequences by Hidden Markov Models (HMMs) is presented. A consistent modeling of spatial and temporal information is achieved by extracting different low level image features, These implicitly convert the image intensities into probability density values, while preserving the geometry of the image. The resulting so called image density functions are contained in the states of the HMM. First results of applying the approach to the classification of dynamic hand gestures demonstrate the performance of the modeling.
This paper develops new algorithms belonging to the class of context modeling methods, with direct application to lossless coding of gray level images. The prediction stage and the context modeling stage are performed...
详细信息
Current developments in digital image coding tend to involve more and more complex algorithms, and require therefore an increasing amount of computation. To improve the overall system performance, some schemes apply a...
详细信息
ISBN:
(纸本)0818679204
Current developments in digital image coding tend to involve more and more complex algorithms, and require therefore an increasing amount of computation. To improve the overall system performance, some schemes apply a different coding algorithms to separate parts of an image according to the content of this subimage. Such schemes are referred to as dynamic coding schemes. Applying the best suited coding algorithm to a part of an image will lead to an improved coding quality, but implies an algorithm selection phase. Current selection methods require the computation of the reconstructed image after coding and decoding with all the selected algorithms in order to choose the best method. Some other schemes use ways of pruning the search in the algorithm space. Both approaches suffer from a heavy computational load. Furthermore, the computational complexity is increased even more if the parameters have to be adjusted for a given algorithm during the search. This paper describes a way to predict the coding quality of a region of the input image for any given coding method. The system will then be able to select the best suited coding algorithm for each region according to the predicted quality. This prediction scheme has low complexity, and also enables the adjustment of algorithm specific parameters during the search.
The information in a color image is always a function of the illuminating source, the geometry, the reflectance properties of the object and the characteristic of the camera. Separating the influence of the spectral d...
详细信息
ISBN:
(纸本)0818679204
The information in a color image is always a function of the illuminating source, the geometry, the reflectance properties of the object and the characteristic of the camera. Separating the influence of the spectral distribution of the illumination and the reflectance properties of the object is known as the color constancy problem. Successful separation is important for vision and pattern recognition tasks, quality control in the graphic arts and image database applications. We describe an approach to the color constancy problem which is based on statistical assumptions about the distribution of colors. It uses the eigenvector system of the logarithmic spectra in a large database of color samples and employs methods from robust statistics to recover the illumination spectrum. We illustrate the performance of the algorithm with a simulation in which the effect of the illumination by the standard A-source-is eliminated.
We present an efficient method for segmenting colour-images, which may be utilised in several robotic vision tasks. It categorises pixels according to their perceptual colour by exploiting the chromaticity contained i...
详细信息
ISBN:
(纸本)0818679204
We present an efficient method for segmenting colour-images, which may be utilised in several robotic vision tasks. It categorises pixels according to their perceptual colour by exploiting the chromaticity contained in the signal of a standard colour camera as an index into a pre-clustered chromaticity plane. A technique called perceptual colour grouping is introduced to prevent oversegmentation. Experimental data demonstrate the performance of the proposed approach;computation time is reduced by a factor of 8..30 over previously known methods.
The performance of any block based image coder can be improved by applying fractal terms to selected blocks. Two novel methods are used to achieve this. Firstly the coder determines whether a local fractal term will i...
详细信息
ISBN:
(纸本)0818679204
The performance of any block based image coder can be improved by applying fractal terms to selected blocks. Two novel methods are used to achieve this. Firstly the coder determines whether a local fractal term will improve each image block by examining its rate/distortion contribution, so that only beneficial fractal terms are used. Secondly, the decoder deduces the offset parameters for the local fractal transform from the basis functions alone, by inferring the dominant edge position, so that no offset information is required. To illustrate the method, we use a quadtree decomposed image with a truncated DCT basis. Using a standard test image, the proportion of the picture area enhanced by fractals decreases from 16.1% at 0.6 bpp to 8.1% at a high compression ratio of 80:1 (0.1 bpp). The fractal terms contribute less than 5% of the compressed code in all cases. The PSNR is improved slightly, and edge detail is visually enhanced.
We evaluate two schemes for significance switching of DCT coefficients for block-based embedded DCT image compression. Both schemes deliver their best compression at any PSNR or vice versa, within a data stream that c...
详细信息
ISBN:
(纸本)0818679204
We evaluate two schemes for significance switching of DCT coefficients for block-based embedded DCT image compression. Both schemes deliver their best compression at any PSNR or vice versa, within a data stream that can be terminated within a few bits of any point. An image is partitioned into equal sized blocks, and a fixed point DCT of each block is calculated. The coefficients are then passed through successive 'significance sweeps' of the whole image from the most significant down to the least significant coefficient bitplanes. The coded data stream includes bits to refine only the significant coefficients at each sweep. With each new sweep, newly significant coefficients may appear within a block, and the two switching schemes evaluated are efficient methods based on block addressing and block masking. Both methods give good compression when used losslessly to the fixed point DCT precision. The best coder outperforms the baseline JPEG method in PSNR at any compression, and is similar to state of the art wavelet coders.
暂无评论