Presents a new algorithm for segmentation of noisy or textured images using the expectation-maximization (EM) algorithm for estimating parameters of the probability mass function of the pixel class labels and the maxi...
详细信息
Presents a new algorithm for segmentation of noisy or textured images using the expectation-maximization (EM) algorithm for estimating parameters of the probability mass function of the pixel class labels and the maximization of the posterior marginals (MPM) criterion for the segmentation operation. A Markov random field (MRF) model is used for the pixel class labels. The authors present experimental results demonstrating the use of the new algorithm on synthetic images and medical imagery.< >
The problem inherent with any digital image (or digital video) system is the large amount of bandwidth required for transmission or storage. This has driven the research area of image compression to develop more compl...
详细信息
The problem inherent with any digital image (or digital video) system is the large amount of bandwidth required for transmission or storage. This has driven the research area of image compression to develop more complex algorithms that compress images to lower data rates with better fidelity. One approach that can be used to increase the execution speed of these complex algorithms is through the use of parallelprocessing. In this paper we address one aspect of the parallel implementation of the JPEG still image compression standard on the MasPar MP-1, a massively parallel SIMD computer. We develop a novel byte alignment algorithm used to efficiently output compressed data from the parallel system.< >
An extension of entropy-constrained residual vector quantization is presented where inter-vector dependencies are exploited. The method, which the authors call conditional entropy-constrained residual vector quantizat...
详细信息
An extension of entropy-constrained residual vector quantization is presented where inter-vector dependencies are exploited. The method, which the authors call conditional entropy-constrained residual vector quantization, employs a high-order entropy conditioning strategy that captures local information in the neighboring vectors. The complexity of the proposed design algorithm is relatively low, due mainly to the efficiency of the multistage structure of the residual vector quantizer, but also to the effectiveness of the searching techniques used to locate the best conditioning spatial-stage region of support. Experimental results show that the new method outperforms standard entropy-constrained residual vector quantization while also requiring lower encoding complexity and memory requirements.< >
Perfect reconstruction (PR) time-varying analysis-synthesis filter banks are those in which the filters are allowed to change from one set of PR filter banks to another as the input signal is being processed. Such sys...
详细信息
Perfect reconstruction (PR) time-varying analysis-synthesis filter banks are those in which the filters are allowed to change from one set of PR filter banks to another as the input signal is being processed. Such systems have the property that, in the absence of coding, they faithfully reconstruct every sample of the input. This paper introduces a new structure for exact reconstructing time-varying analysis-synthesis filter banks. This structure consists of the conventional filter bank followed by a time-varying post filter. The new method requires neither the redesign of the analysis sections, nor the use of any intermediate analysis filters during transition periods. It provides a simple procedure for designing time-varying filter banks without the disadvantages of the previous methods.< >
Existing algorithms for filtering noise from contaminated chaotic signals require relatively high signal-to-noise ratios (SNRs). A preprocessing method is proposed for initial noise reduction in severe SNRs. This meth...
详细信息
ISBN:
(纸本)0780319486
Existing algorithms for filtering noise from contaminated chaotic signals require relatively high signal-to-noise ratios (SNRs). A preprocessing method is proposed for initial noise reduction in severe SNRs. This method uses all the difference vectors between the points in a small neighborhood of the point of interest to estimate more accurately the tangent surface described by Cawley and Hsu (1992). This preprocessing method is applicable to noisy data from any nonlinear dynamical system, because it does not require knowledge of the system dynamics.< >
This paper describes a novel method for detecting nonstationary signals in colored noise. A first order complex autoregressive, or AR(1), signal model is used which restricts the application of the detector to low ord...
详细信息
This paper describes a novel method for detecting nonstationary signals in colored noise. A first order complex autoregressive, or AR(1), signal model is used which restricts the application of the detector to low order signals, i.e., those which are well modeled by a low order AR process and have only a single spectral peak. The detector assumes the noise covariance is stationary and known. The likelihood function is estimated in the frequency domain because the model simplifies, and the nonstationary frequency estimate can be obtained by an algorithm which approximates the Viterbi algorithm. The AR model parameters are then used to form the appropriate covariance matrix and the approximate likelihood is calculated. Therefore, the detector uses efficient approximations to approximate the generalized likelihood ratio test (GLRT). Simulation results are shown to compare the detector with the known signal likelihood ratio test.< >
The alternation theorem is at the core of the efficient real Chebyshev approximation algorithms. In this paper, the alternation theorem is extended from the real-only to the complex case. A new efficient algorithm is ...
详细信息
The alternation theorem is at the core of the efficient real Chebyshev approximation algorithms. In this paper, the alternation theorem is extended from the real-only to the complex case. A new efficient algorithm is described for designing FIR filters that best approximate in the Chebyshev sense a desired complex-valued function. This algorithm is based on an ascent Remez exchange method applied to a transformation of the complex Chebyshev error, and is basically a generalization of the Parks-McClellan algorithm to the complex case. Numerical examples are presented to illustrate the performance of the proposed algorithm.< >
The paper extends Kosravi and Schafer (1994) which introduced the notion of normalized min correlation (NMC) as a new criterion for template matching applications. The NMC features low complexity and robustness with r...
详细信息
The paper extends Kosravi and Schafer (1994) which introduced the notion of normalized min correlation (NMC) as a new criterion for template matching applications. The NMC features low complexity and robustness with respect to Gaussian noise. It is also independent of the local average of the image, which is a desired property in many template matching applications. However, its sensitivity to impulsive noise increases with the size of the template. The paper introduces two different modifications of the NMC which are robust with respect to both Gaussian and impulsive noise. The performance of the new modifications are examined in motion estimation applications. As a different way of looking at the NMC, the notion of grayscale hit-or-miss transform is introduced. This is an extension of the binary hit-or-miss transform to grayscale.< >
The paper is concerned with the analysis and design of statistically optimum FIR filter banks. In such systems, the analysis/synthesis system and the subband quantizers are designed jointly to provide the minimum dist...
详细信息
The paper is concerned with the analysis and design of statistically optimum FIR filter banks. In such systems, the analysis/synthesis system and the subband quantizers are designed jointly to provide the minimum distortion in the reconstructed signal. In the paper, a new approach to this problem is introduced. Using the time-domain formulation of Nayebi et al. [1992], the present authors derive a formula for the mean square error (MSE) of the output signal. The resulting formulation provides a general framework for the optimum filter bank design problem and includes previous reported formulations. This approach can be used to design the optimal filter bank and quantizers for a given wide sense stationary signal.< >
暂无评论