Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Stochastic Processes”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,153 records · Page 64Linked to original sources
PubMed2004

Nonlinear prediction for Gaussian mixture image models.

Prediction is an essential operation in many image processing applications, such as object detection and image and video compression. When the images are modeled as Gaussian, the optimal predictor is linear and easy to obtain. However, image texture and clutter are often non-Gaussian, and, in such cases, optimal predictors are difficult to obtain. In this paper, we derive an optimal predictor for an important class of non-Gaussian image models, the block-based multivariate Gaussian mixture model. This predictor has a special nonlinear structure: it is a linear combination of the neighboring pixels, but the combination coefficients are also functions of the neighboring pixels, not constants. The efficacy of this predictor is demonstrated in object detection experiments where the prediction error image is used to identify "hidden" objects. Experimental results indicate that when the background texture is nonlinear, i.e., with fast-switching gray-level patches, it performs significantly better than the optimal linear predictor.

Algorithms↗
PubMed2004

Noise removal using smoothed normals and surface fitting.

In this work, we use partial differential equation techniques to remove noise from digital images. The removal is done in two steps. We first use a total-variation filter to smooth the normal vectors of the level curves of a noise image. After this, we try to find a surface to fit the smoothed normal vectors. For each of these two stages, the problem is reduced to a nonlinear partial differential equation. Finite difference schemes are used to solve these equations. A broad range of numerical examples are given in the paper.

Algorithms↗
PubMed2005

Pixelwise-adaptive blind optical flow assuming nonstationary statistics.

In this paper, we address some of the major issues in optical flow within a new framework assuming nonstationary statistics for the motion field and for the errors. Problems addressed include the preservation of discontinuities, model/data errors, outliers, confidence measures, and performance evaluation. In solving these problems, we assume that the statistics of the motion field and the errors are not only spatially varying, but also unknown. We, thus, derive a blind adaptive technique based on generalized cross validation for estimating an independent regularization parameter for each pixel. Our formulation is pixelwise and combines existing first- and second-order constraints with a new second-order temporal constraint. We derive a new confidence measure for an adaptive rejection of erroneous and outlying motion vectors, and compare our results to other techniques in the literature. A new performance measure is also derived for estimating the signal-to-noise ratio for real sequences when the ground truth is unknown.

Algorithms↗
PubMed2005

A steerable complex wavelet construction and its application to image denoising.

This work addresses the design of a novel complex steerable wavelet construction, the generation of transform-space feature measurements associated with corner and edge presence and orientation properties, and the application of these measurements directly to image denoising. The decomposition uses pairs of bandpass filters that display symmetry and antisymmetry about a steerable axis of orientation. While the angular characterization of the bandpass filters is similar to those previously described, the radial characteristic is new, as is the manner of constructing the interpolation functions for steering. The complex filters have been engineered into a multirate system, providing a synthesis and analysis subband filtering system with good reconstruction properties. Although the performance of our proposed denoising strategy is currently below that of recently reported state-of-the-art techniques in denoising, it does compare favorably with wavelet coring approaches employing global thresholds and with an "Oracle" shrinkage technique, and presents a very promising avenue for exploring structure-based denoising in the wavelet domain.

Algorithms↗
PubMed2005

Image denoising based on wavelets and multifractals for singularity detection.

This paper presents a very efficient algorithm for image denoising based on wavelets and multifractals for singularity detection. A challenge of image denoising is how to preserve the edges of an image when reducing noise. By modeling the intensity surface of a noisy image as statistically self-similar multifractal processes and taking advantage of the multiresolution analysis with wavelet transform to exploit the local statistical self-similarity at different scales, the pointwise singularity strength value characterizing the local singularity at each scale was calculated. By thresholding the singularity strength, wavelet coefficients at each scale were classified into two categories: the edge-related and regular wavelet coefficients and the irregular coefficients. The irregular coefficients were denoised using an approximate minimum mean-squared error (MMSE) estimation method, while the edge-related and regular wavelet coefficients were smoothed using the fuzzy weighted mean (FWM) filter aiming at preserving the edges and details when reducing noise. Furthermore, to make the FWM-based filtering more efficient for noise reduction at the lowest decomposition level, the MMSE-based filtering was performed as the first pass of denoising followed by performing the FWM-based filtering. Experimental results demonstrated that this algorithm could achieve both good visual quality and high PSNR for the denoised images.

Algorithms↗
PubMed2005

Ergodic chaotic parameter modulation with application to digital image watermarking.

This paper presents a novel technique for image watermarking based on chaos theory. Chaotic parameter modulation (CPM) is employed to modulate the copyright information into the bifurcating parameter of a chaotic system. The system output is a wideband signal and is used as a watermark to be inserted into the host image. In the detection, a novel method based on the ergodic property of chaotic signal is developed to demodulate the embedded copyright information. Compared to previous works on blind watermarking, the proposed technique can effectively remove the interference from the host image and, thus, improve the detection performance dramatically. Simulation results show that the ergodic CPM approach is effective for image watermarking in terms of noise performance, robustness against attacks, and payload. In addition, its implementation is very simple and the computation speed is fast. Compared to holographic transform domain method and the conventional spread spectrum watermarking scheme, the proposed technique is shown to be superior.

Algorithms↗
PubMed2005

Building robust wavelet estimators for multicomponent images using Stein's principle.

Multichannel imaging systems provide several observations of the same scene which are often corrupted by noise. In this paper, we are interested in multispectral image denoising in the wavelet domain. We adopt a multivariate statistical approach in order to exploit the correlations existing between the different spectral components. Our main contribution is the application of Stein's principle to build a new estimator for arbitrary multichannel images embedded in additive Gaussian noise. Simulation tests carried out on optical satellite images show that the proposed method outperforms conventional wavelet shrinkage techniques.

Algorithms↗
PubMed2005

A universal noise removal algorithm with an impulse detector.

We introduce a local image statistic for identifying noise pixels in images corrupted with impulse noise of random values. The statistical values quantify how different in intensity the particular pixels are from their most similar neighbors. We continue to demonstrate how this statistic may be incorporated into a filter designed to remove additive Gaussian noise. The result is a new filter capable of reducing both Gaussian and impulse noises from noisy images effectively, which performs remarkably well, both in terms of quantitative measures of signal restoration and qualitative judgements of image quality. Our approach is extended to automatically remove any mix of Gaussian and impulse noise.

Algorithms↗
PubMed2005

The Rician inverse Gaussian distribution: a new model for non-Rayleigh signal amplitude statistics.

In this paper, we introduce a new statistical distribution for modeling non-Rayleigh amplitude statistics, which we have called the Rician inverse Gaussian (RiIG) distribution. It is a mixture of the Rice distribution and the inverse Gaussian distribution. The probability density function (pdf) is given in closed form as a function of three parameters. This makes the pdf very flexible in the sense that it may be fitted to a variety of shapes, ranging from the Rayleigh-shaped pdf to a noncentral chi2-shaped pdf. The theoretical basis of the new model is quite thoroughly discussed, and we also give two iterative algorithms for estimating its parameters from data. Finally, we include some modeling examples, where we have tested the ability of the distribution to represent locale amplitude histograms of linear medical ultrasound data and single-look synthetic aperture radar data. We compare the goodness of fit of the RiIG model with that of the K model, and, in most cases, the new model turns out as a better statistical model for the data. We also include a series of log-likelihood tests to evaluate the predictive performance of the proposed model.

Algorithms↗
PubMed2006

A hybrid neuro-fuzzy filter for edge preserving restoration of images corrupted by impulse noise.

A new operator for restoring digital images corrupted by impulse noise is presented. The proposed operator is a hybrid filter obtained by appropriately combining a median filter, an edge detector, and a neuro-fuzzy network. The internal parameters of the neuro-fuzzy network are adaptively optimized by training. The training is easily accomplished by using simple artificial images that can be generated in a computer. The most distinctive feature of the proposed operator over most other operators is that it offers excellent line, edge, detail, and texture preservation performance while, at the same time, effectively removing noise from the input image. Extensive simulation experiments show that the proposed operator may be used for efficient restoration of digital images corrupted by impulse noise without distorting the useful information in the image.

Algorithms↗
PubMed2006

Optimization of partition-based Weighted Sum filters and their application to image denoising.

Partition-based Weighted Sum (P-WS) filtering is an effective method for processing nonstationary signals, especially those with regularly occurring structures, such as images. P-WS filters were originally formulated as Hard-partition Weighted Sum (HP-WS) filters and were successfully applied to image denoising. This formulation relied on intuitive arguments to generate the filter class. Here we present a statistical analysis that justifies the use of weighted sum filters after observation space partitioning. Unfortunately, the HP-WS filters are nondifferentiable and an analytical solution for their global optimization is therefore difficult to obtain. A two-stage suboptimal training procedure has been reported in the literature, but prior to this research no evaluation on the optimality of this approach has been reported. Here, a Genetic Algorithm (GA) HP-WS optimization procedure is developed that, in simulations, shows that the simpler two-stage training procedure yields near optimal results. Also developed in this paper are Soft-partition Weighted Sum (SP-WS) filters. The SP-WS filters utilize soft, or fuzzy, partitions that yield a differentiable filtering operation, enabling the development of gradient-based optimization procedures. Image denoising simulation results are presented comparing HP-WS and SP-WS filters, their optimization procedures, and wavelet-based image denoising. These results show that P-WS filters, in general, outperform traditional and wavelet-based image filters, and SP-WS filters utilizing soft partitioning not only allow for simple optimization, but also yields improved performance.

Algorithms↗
PubMed2006

Strong-continuation, contrast-invariant inpainting with a third-order optimal PDE.

PDE-based image inpainting has become a very active area of research after the pioneering works of Masnou and Morel, Bertalmío et al., and Ballester et al. In this paper, we take a different approach, inspired by the excellent work of Caselles et al. We view the inpainting problem as a particular case of image interpolation in which we intend to propagate level lines. Expressing this in terms of local neighborhoods and using a Taylor expansion we derive a third-order PDE that performs inpainting. This PDE is optimal in the sense that it is the most accurate third-order PDE which can ensure continuation of level lines. The continuation is strong, allowing the restoration of thin structures occluded by a wide gap. The result is also contrast invariant. This is a novel PDE, which, in both its accuracy and contrast invariance, outperforms the approaches cited above.

Algorithms↗
PubMed2006

Hidden Markov models for wavelet-based blind source separation.

In this paper, we consider the problem of blind source separation in the wavelet domain. We propose a Bayesian estimation framework for the problem where different models of the wavelet coefficients are considered: the independent Gaussian mixture model, the hidden Markov tree model, and the contextual hidden Markov field model. For each of the three models, we give expressions of the posterior laws and propose appropriate Markov chain Monte Carlo algorithms in order to perform unsupervised joint blind separation of the sources and estimation of the mixing matrix and hyper parameters of the problem. Indeed, in order to achieve an efficient joint separation and denoising procedures in the case of high noise level in the data, a slight modification of the exposed models is presented: the Bernoulli-Gaussian mixture model, which is equivalent to a hard thresholding rule in denoising problems. A number of simulations are presented in order to highlight the performances of the aforementioned approach: 1) in both high and low signal-to-noise ratios and 2) comparing the results with respect to the choice of the wavelet basis decomposition.

Algorithms↗
PubMed2006

Directionlets: anisotropic multidirectional representation with separable filtering.

In spite of the success of the standard wavelet transform (WT) in image processing in recent years, the efficiency of its representation is limited by the spatial isotropy of its basis functions built in the horizontal and vertical directions. One-dimensional (1-D) discontinuities in images (edges and contours) that are very important elements in visual perception, intersect too many wavelet basis functions and lead to a nonsparse representation. To efficiently capture these anisotropic geometrical structures characterized by many more than the horizontal and vertical directions, a more complex multidirectional (M-DIR) and anisotropic transform is required. We present a new lattice-based perfect reconstruction and critically sampled anisotropic M-DIR WT. The transform retains the separable filtering and subsampling and the simplicity of computations and filter design from the standard two-dimensional WT, unlike in the case of some other directional transform constructions (e.g., curvelets, contourlets, or edgelets). The corresponding anisotropic basis unctions (directionlets) have directional vanishing moments along any two directions with rational slopes. Furthermore, we show that this novel transform provides an efficient tool for nonlinear approximation of images, achieving the approximation power O(N(-1.55)), which, while slower than the optimal rate O(N(-2)), is much better than O(N(-1)) achieved with wavelets, but at similar complexity.

Algorithms↗
PubMed2006

CCD noise removal in digital images.

In this work, we propose a denoising scheme to restore images degraded by CCD noise. The CCD noise model, measured in the space of incident light values (light space), is a combination of signal-independent and signal-dependent noise terms. This model becomes more complex in image brightness space (normal camera output) due to the nonlinearity of the camera response function that transforms incoming data from light space to image space. We develop two adaptive restoration techniques, both accounting for this nonlinearity. One operates in light space, where the relationship between the incident light and light space values is linear, while the second method uses the transformed noise model to operate in image space. Both techniques apply multiple adaptive filters and merge their outputs to give the final restored image. Experimental results suggest that light space denoising is more efficient, since it enables the design of a simpler filter implementation. Results are given for real images with synthetic noise added, and for images with real noise.

Algorithms↗
PubMed2006

Fuzzy two-step filter for impulse noise reduction from color images.

A new framework for reducing impulse noise from digital color images is presented, in which a fuzzy detection phase is followed by an iterative fuzzy filtering technique. We call this filter the fuzzy two-step color filter. The fuzzy detection method is mainly based on the calculation of fuzzy gradient values and on fuzzy reasoning. This phase determines three separate membership functions that are passed to the filtering step. These membership functions will be used as a representation of the fuzzy set impulse noise (one function for each color component). Our proposed new fuzzy method is especially developed for reducing impulse noise from color images while preserving details and texture. Experiments show that the proposed filter can be used for efficient removal of impulse noise from color images without distorting the useful information in the image.

Algorithms↗
PubMed2006

Oriented wavelet transform for image compression and denoising.

In this paper, we introduce a new transform for image processing, based on wavelets and the lifting paradigm. The lifting steps of a unidimensional wavelet are applied along a local orientation defined on a quincunx sampling grid. To maximize energy compaction, the orientation minimizing the prediction error is chosen adaptively. A fine-grained multiscale analysis is provided by iterating the decomposition on the low-frequency band. In the context of image compression, the multiresolution orientation map is coded using a quad tree. The rate allocation between the orientation map and wavelet coefficients is jointly optimized in a rate-distortion sense. For image denoising, a Markov model is used to extract the orientations from the noisy image. As long as the map is sufficiently homogeneous, interesting properties of the original wavelet are preserved such as regularity and orthogonality. Perfect reconstruction is ensured by the reversibility of the lifting scheme. The mutual information between the wavelet coefficients is studied and compared to the one observed with a separable wavelet transform. The rate-distortion performance of this new transform is evaluated for image coding using state-of-the-art subband coders. Its performance in a denoising application is also assessed against the performance obtained with other transforms or denoising methods.

Algorithms↗
PubMed2003

Median-based robust algorithms for tracing neurons from noisy confocal microscope images.

This paper presents a method to exploit rank statistics to improve fully automatic tracing of neurons from noisy digital confocal microscope images. Previously proposed exploratory tracing (vectorization) algorithms work by recursively following the neuronal topology, guided by responses of multiple directional correlation kernels. These algorithms were found to fail when the data was of lower quality (noisier, less contrast, weak signal, or more discontinuous structures). This type of data is commonly encountered in the study of neuronal growth on microfabricated surfaces. We show that by partitioning the correlation kernels in the tracing algorithm into multiple subkernels, and using the median of their responses as the guiding criterion improves the tracing precision from 41% to 89% for low-quality data, with a 5% improvement in recall. Improved handling was observed for artifacts such as discontinuities and/or hollowness of structures. The new algorithms require slightly higher amounts of computation, but are still acceptably fast, typically consuming less than 2 seconds on a personal computer (Pentium III, 500 MHz, 128 MB). They produce labeling for all somas present in the field, and a graph-theoretic representation of all dendritic/axonal structures that can be edited. Topological and size measurements such as area, length, and tortuosity are derived readily. The efficiency, accuracy, and fully-automated nature of the proposed method makes it attractive for large-scale applications such as high-throughput assays in the pharmaceutical industry, and study of neuron growth on nano/micro-fabricated structures. A careful quantitative validation of the proposed algorithms is provided against manually derived tracing, using a performance measure that combines the precision and recall metrics.

Algorithms↗