Your browser doesn't support javascript.
loading
Show: 20 | 50 | 100
Results 1 - 13 de 13
Filter
Add more filters










Publication year range
1.
IEEE Trans Med Imaging ; 24(7): 901-9, 2005 Jul.
Article in English | MEDLINE | ID: mdl-16011320

ABSTRACT

In this paper, we propose a new methodology for analysis of microarray images. First, a new gridding algorithm is proposed for determining the individual spots and their borders. Then, a Gaussian mixture model (GMM) approach is presented for the analysis of the individual spot images. The main advantages of the proposed methodology are modeling flexibility and adaptability to the data, which are well-known strengths of GMM. The maximum likelihood and maximum a posteriori approaches are used to estimate the GMM parameters via the expectation maximization algorithm. The proposed approach has the ability to detect and compensate for artifacts that might occur in microarray images. This is accomplished by a model-based criterion that selects the number of the mixture components. We present numerical experiments with artificial and real data where we compare the proposed approach with previous ones and existing software tools for microarray image analysis and demonstrate its advantages.


Subject(s)
Algorithms , Artificial Intelligence , Gene Expression Profiling/methods , Image Interpretation, Computer-Assisted/methods , Microscopy, Fluorescence/methods , Models, Genetic , Oligonucleotide Array Sequence Analysis/methods , Animals , Computer Simulation , Humans , In Situ Hybridization/methods , Models, Statistical
2.
IEEE Trans Neural Netw ; 16(2): 494-8, 2005 Mar.
Article in English | MEDLINE | ID: mdl-15787156

ABSTRACT

Gaussian mixture models (GMMs) constitute a well-known type of probabilistic neural networks. One of their many successful applications is in image segmentation, where spatially constrained mixture models have been trained using the expectation-maximization (EM) framework. In this letter, we elaborate on this method and propose a new methodology for the M-step of the EM algorithm that is based on a novel constrained optimization formulation. Numerical experiments using simulated images illustrate the superior performance of our method in terms of the attained maximum value of the objective function and segmentation accuracy compared to previous implementations of this approach.


Subject(s)
Neural Networks, Computer
3.
J Opt Soc Am A Opt Image Sci Vis ; 17(4): 711-23, 2000 Apr.
Article in English | MEDLINE | ID: mdl-10757178

ABSTRACT

We address the problem of space-invariant image restoration when the blurring operator is not known exactly, a situation that arises regularly in practice. To account for this uncertainty, we model the point-spread function as the sum of a known deterministic component and an unknown random one. Such an approach has been studied before, but the problem of estimating the parameters of the restoration filter to our knowledge has not been addressed systematically. We propose an approach based on a Gaussian statistical assumption and derive an iterative, expectation-maximization algorithm that simultaneously restores the image and estimates the required filter parameters. We obtain two versions of the algorithm based on two different models for the statistics of the image. The computations are performed in the discrete Fourier transform domain; thus they are computationally efficient even for large images. We examine the convergence properties of the resulting estimators and evaluate their performance experimentally.


Subject(s)
Image Processing, Computer-Assisted , Models, Theoretical , Algorithms , Fourier Analysis , Humans , Scattering, Radiation
4.
IEEE Trans Image Process ; 9(10): 1784-97, 2000.
Article in English | MEDLINE | ID: mdl-18262916

ABSTRACT

In this paper, we examine the restoration problem when the point-spread function (PSF) of the degradation system is partially known. For this problem, the PSF is assumed to be the sum of a known deterministic and an unknown random component. This problem has been examined before; however, in most previous works the problem of estimating the parameters that define the restoration filters was not addressed. In this paper, two iterative algorithms that simultaneously restore the image and estimate the parameters of the restoration filter are proposed using evidence analysis (EA) within the hierarchical Bayesian framework. We show that the restoration step of the first of these algorithms is in effect almost identical to the regularized constrained total least-squares (RCTLS) filter, while the restoration step of the second is identical to the linear minimum mean square-error (LMMSE) filter for this problem. Therefore, in this paper we provide a solution to the parameter estimation problem of the RCTLS filter. We further provide an alternative approach to the expectation-maximization (EM) framework to derive a parameter estimation algorithm for the LMMSE filter. These iterative algorithms are derived in the discrete Fourier transform (DFT) domain; therefore, they are computationally efficient even for large images. Numerical experiments are presented that test and compare the proposed algorithms.

5.
IEEE Trans Image Process ; 8(11): 1657-61, 1999.
Article in English | MEDLINE | ID: mdl-18267442

ABSTRACT

In this correspondence, a solution is developed for the regularized total least squares (RTLS) estimate in linear inverse problems where the linear operator is nonconvolutional. Our approach is based on a Rayleigh quotient (RQ) formulation of the TLS problem, and we accomplish regularization by modifying the RQ function to enforce a smooth solution. A conjugate gradient algorithm is used to minimize the modified RQ function. As an example, the proposed approach has been applied to the perturbation equation encountered in optical tomography. Simulation results show that this method provides more stable and accurate solutions than the regularized least squares and a previously reported total least squares approach, also based on the RQ formulation.

6.
J Acoust Soc Am ; 103(6): 3627-41, 1998 Jun.
Article in English | MEDLINE | ID: mdl-9637044

ABSTRACT

Videostroboscopy is an examination which yields a permanent record of the moving vocal folds. Thus, it allows the diagnosis of abnormalities which contribute to voice disorders. In this paper, in order to find and quantify the deformation of the vocal folds in videostroboscopic recordings, an active contours- (snakes) based approach is used to delineate the vocal folds in each frame of the videostroboscopic image sequence. After this delineation, a new elastic registration algorithm is used to register the vocal fold contours between adjacent frames of the video sequence. This algorithm is based on the regularization principle and is very effective when large deformations are present. A least-squares approach is used to fit an affine model to the displacement vectors found by elastic registration. The parameters of this model, rotation, translation, and deformation along two principle axes, quantify the deformation and allow the succinct characterization of the videostroboscopic recordings based on the deformations that occurred. Experiments are shown with synthetic and real videostroboscopic data that demonstrate the value of the proposed approach.


Subject(s)
Larynx/physiopathology , Vocal Cords/physiopathology , Voice Disorders/diagnosis , Voice Disorders/physiopathology , Humans , Models, Biological
7.
IEEE Trans Image Process ; 6(10): 1345-57, 1997.
Article in English | MEDLINE | ID: mdl-18282890

ABSTRACT

We present a new image recovery algorithm to remove, in addition to blocking, ringing artifacts from compressed images and video. This new algorithm is based on the theory of projections onto convex sets (POCS). A new family of directional smoothness constraint sets is defined based on line processes modeling of the image edge structure. The definition of these smoothness sets also takes into account the fact that the visibility of compression artifacts in an image is spatially varying. To overcome the numerical difficulty in computing the projections onto these sets, a divide-and-conquer (DAC) strategy is introduced. According to this strategy, new smoothness sets are derived such that their projections are easier to compute. The effectiveness of the proposed algorithm is demonstrated through numerical experiments using Motion Picture Expert Group based (MPEG-based) coders-decoders (codecs).

8.
IEEE Trans Image Process ; 4(7): 896-908, 1995.
Article in English | MEDLINE | ID: mdl-18290041

ABSTRACT

At the present time, block-transform coding is probably the most popular approach for image compression. For this approach, the compressed images are decoded using only the transmitted transform data. We formulate image decoding as an image recovery problem. According to this approach, the decoded image is reconstructed using not only the transmitted data but, in addition, the prior knowledge that images before compression do not display between-block discontinuities. A spatially adaptive image recovery algorithm is proposed based on the theory of projections onto convex sets. Apart from the data constraint set, this algorithm uses another new constraint set that enforces between-block smoothness. The novelty of this set is that it captures both the local statistical properties of the image and the human perceptual characteristics. A simplified spatially adaptive recovery algorithm is also proposed, and the analysis of its computational complexity is presented. Numerical experiments are shown that demonstrate that the proposed algorithms work better than both the JPEG deblocking recommendation and our previous projection-based image decoding approach.

9.
IEEE Trans Image Process ; 4(8): 1096-108, 1995.
Article in English | MEDLINE | ID: mdl-18292003

ABSTRACT

In this paper, the problem of restoring an image distorted by a linear space-invariant (LSI) point-spread function (PSF) that is not exactly known is formulated as the solution of a perturbed set of linear equations. The regularized constrained total least-squares (RCTLS) method is used to solve this set of equations. Using the diagonalization properties of the discrete Fourier transform (DFT) for circulant matrices, the RCTLS estimate is computed in the DFT domain. This significantly reduces the computational cost of this approach and makes its implementation possible even for large images. An error analysis of the RCTLS estimate, based on the mean-squared-error (MSE) criterion, is performed to verify its superiority over the constrained total least-squares (CTLS) estimate. Numerical experiments for different errors in the PSF are performed to test the RCTLS estimator. Objective and visual comparisons are presented with the linear minimum mean-squared-error (LMMSE) and the regularized least-squares (RLS) estimator. Our experiments show that the RCTLS estimator reduces significantly ringing artifacts around edges as compared to the two other approaches.

10.
IEEE Trans Image Process ; 3(6): 821-33, 1994.
Article in English | MEDLINE | ID: mdl-18296249

ABSTRACT

We present a new matrix vector formulation of a wavelet-based subband decomposition. This formulation allows for the decomposition of both the convolution operator and the signal in the subband domain. With this approach, any single channel linear space-invariant filtering problem can be cast into a multichannel framework. We apply this decomposition to the linear space-invariant image restoration problem and propose a family of multichannel linear minimum mean square error (LMMSE) restoration filters. These filters explicitly incorporate both within and between subband (channel) relations of the decomposed image. Since only within channel stationarity is assumed in the image model, this approach presents a new method for modeling the nonstationarity of images. Experimental results are presented which test the proposed multichannel LMMSE filters. These experiments show that if accurate estimates of the subband statistics are available, the proposed multichannel filters provide major improvements over the traditional single channel filters.

11.
IEEE Trans Image Process ; 2(3): 417-20, 1993.
Article in English | MEDLINE | ID: mdl-18296227

ABSTRACT

The authors provide a general framework for performing processing of stationary multichannel (MC) signals that is linear shift-invariant within channel and shift varying across channels. Emphasis is given to the restoration of degraded signals. It is shown that, by utilizing the special structure of semiblock circulant and block diagonal matrices, MC signal processing can be easily carried out in the frequency domain. The generalization of many frequency-domain single-channel (SC) signal processing techniques to the MC case is presented. It is shown that in MC signal processing each frequency component of a signal and system is presented, respectively, by a small vector and a matrix (of size equal to the number of channels), while in SC signal processing each frequency component in both cases is a scalar.

12.
IEEE Trans Image Process ; 1(3): 322-36, 1992.
Article in English | MEDLINE | ID: mdl-18296166

ABSTRACT

The application of regularization to ill-conditioned problems necessitates the choice of a regularization parameter which trades fidelity to the data with smoothness of the solution. The value of the regularization parameter depends on the variance of the noise in the data. The problem of choosing the regularization parameter and estimating the noise variance in image restoration is examined. An error analysis based on an objective mean-square-error (MSE) criterion is used to motivate regularization. Two approaches for choosing the regularization parameter and estimating the noise variance are proposed. The proposed and existing methods are compared and their relationship to linear minimum-mean-square-error filtering is examined. Experiments are presented that verify the theoretical results.

13.
IEEE Trans Image Process ; 1(4): 477-87, 1992.
Article in English | MEDLINE | ID: mdl-18296180

ABSTRACT

An approach is based on the block discrete cosine transform (DCT). The novelty of this approach is that the transform coefficients of all image blocks are coded and transmitted in absolute magnitude order. The resulting ordered-by-magnitude transmission is accomplished without sacrificing coding efficiency by using partition priority coding. Coding and transmission are adaptive to the characteristics of each individual image. and therefore, very efficient. Another advantage of this approach is its high progression effectiveness. Since the largest transform coefficients that capture the most important characteristics of images are coded and transmitted first, this method is well suited for progressive image transmission. Further compression of the image-data is achieved by multiple distribution entropy coding, a technique based on arithmetic coding. Experiments show that the approach compares favorably with previously reported DCT and subband image codecs.

SELECTION OF CITATIONS
SEARCH DETAIL
...