Results 1 - 10
of
24
A fuzzy, nonparametric segmentation framework for
- DTI and MRI analysis,” in Proc. Inf. Process. Med. Imag. (IPMl), 2007
"... Abstract—This paper presents a novel fuzzy-segmentation method for diffusion tensor (DT) and magnetic resonance (MR) images. Typical fuzzy-segmentation schemes, e.g., those based on fuzzy C means (FCM), incorporate Gaussian class models that are inherently biased towards ellipsoidal clusters charact ..."
Abstract
-
Cited by 22 (2 self)
- Add to MetaCart
(Show Context)
Abstract—This paper presents a novel fuzzy-segmentation method for diffusion tensor (DT) and magnetic resonance (MR) images. Typical fuzzy-segmentation schemes, e.g., those based on fuzzy C means (FCM), incorporate Gaussian class models that are inherently biased towards ellipsoidal clusters characterized by a mean element and a covariance matrix. Tensors in fiber bundles, however, inherently lie on specific manifolds in Riemannian spaces. Unlike FCM-based schemes, the proposed method represents these manifolds using nonparametric data-driven statistical models. The paper describes a statistically-sound (consistent) technique for nonparametric modeling in Riemannian DT spaces. The proposed method produces an optimal fuzzy segmentation by maximizing a novel information-theoretic energy in a Markov-random-field framework. Results on synthetic and real, DT and MR images, show that the proposed method provides information about the uncertainties in the segmentation decisions, which stem from imaging artifacts including noise, partial voluming, and inhomogeneity. By enhancing the nonparametric model to capture the spatial continuity and structure of the fiber bundle, we exploit the framework to extract the cingulum fiber bundle. Typical tractography methods for tract delineation, incorporating thresholds on fractional anisotropy and fiber curvature to terminate tracking, can face serious problems arising from partial voluming and noise. For these reasons, tractography often fails to extract thin tracts with sharp changes in orientation, such as the cingulum. The results demonstrate that the proposed method extracts this structure significantly more accurately as compared to tractography. Index Terms—Diffusion tensor imaging (DTI), fuzzy sets, image segmentation, information theory, magnetic resonance imaging (MRI), Markov random fields, nonparametric modeling, Riemannian statistics.
Detection of neuron membranes in electron microscopy images using a serial . . .
- MEDICAL IMAGE ANALYSIS
"... ..."
Principal neighborhood dictionaries for Non-local Means image denoising,” Trans
- Imag. Proc
, 2009
"... Abstract—We present an in-depth analysis of a variation of the Non-local Means (NLM) image denoising algorithm that uses principal component analysis (PCA) to achieve a higher accuracy while reducing computational load. Image neighborhood vectors are first projected onto a lower-dimensional subspace ..."
Abstract
-
Cited by 20 (1 self)
- Add to MetaCart
(Show Context)
Abstract—We present an in-depth analysis of a variation of the Non-local Means (NLM) image denoising algorithm that uses principal component analysis (PCA) to achieve a higher accuracy while reducing computational load. Image neighborhood vectors are first projected onto a lower-dimensional subspace using PCA. The dimensionality of this subspace is chosen automatically using parallel analysis. Consequently, neighborhood similarity weights for denoising are computed using distances in this subspace rather than the full space. The resulting algorithm is referred to as Principal Neighborhood Dictionary (PND) Nonlocal Means. We investigate PND’s accuracy as a function of the dimensionality of the projection subspace and demonstrate that denoising accuracy peaks at a relatively low number of dimensions. The accuracy of NLM and PND are also examined with respect to the choice of image neighborhood and search window sizes. Finally, we present a quantitative and qualitative comparison of PND vs. NLM and another image neighborhood PCA-based state-of-the-art image denoising algorithm. Index Terms—Principal neighborhood, non-local means, principal component analysis, image denoising, parallel analysis. I.
Principal components for non-local means image denoising
- In IEEE Int. Conf. on Image Processing
, 2008
"... This paper presents an image denoising algorithm that uses principal component analysis (PCA) in conjunction with the non-local means image denoising. Image neighborhood vectors used in the non-local means algorithm are first projected onto a lower-dimensional subspace using PCA. Consequently, neigh ..."
Abstract
-
Cited by 13 (1 self)
- Add to MetaCart
(Show Context)
This paper presents an image denoising algorithm that uses principal component analysis (PCA) in conjunction with the non-local means image denoising. Image neighborhood vectors used in the non-local means algorithm are first projected onto a lower-dimensional subspace using PCA. Consequently, neighborhood similarity weights for denoising are computed using distances in this subspace rather than the full space. This modification to the non-local means algorithm results in improved accuracy and computational performance. We present an analysis of the proposed method’s accuracy as a function of the dimensionality of the projection subspace and demonstrate that denoising accuracy peaks at a relatively low number of dimensions. Index Terms — Non-local means, principal component analysis, image denoising, image neighborhoods.
A Statistical Overlap Prior for Variational Image Segmentation
, 2009
"... This study investigates variational image segmentation with an original data term, referred to as statistical overlap prior, which measures the conformity of overlap between the nonparametric distributions of image data within the segmentation regions to a learned statistical description. This leads ..."
Abstract
-
Cited by 13 (6 self)
- Add to MetaCart
This study investigates variational image segmentation with an original data term, referred to as statistical overlap prior, which measures the conformity of overlap between the nonparametric distributions of image data within the segmentation regions to a learned statistical description. This leads to image segmentation and distribution tracking algorithms that relax the assumption of minimal overlap and, as such, are more widely applicable than existing algorithms. We propose to minimize active curve functionals containing the proposed overlap prior, compute the corresponding Euler-Lagrange curve evolution equations, and give an interpretation of how the overlap prior controls such evolution. We model the overlap, measured via the Bhat-tacharyya coefficient, with a Gaussian prior whose parame-ters are estimated from a set of relevant training images. Quantitative and comparative performance evaluations of the proposed algorithms over several experiments demonstrate the positive effects of the overlap prior in regard to segmentation accuracy and convergence speed.
Highthroughput detection of prostate cancer in histological sections using probabilistic pairwise Markov models.
- Med. Image Anal.
, 2010
"... a b s t r a c t In this paper we present a high-throughput system for detecting regions of carcinoma of the prostate (CaP) in HSs from radical prostatectomies (RPs) using probabilistic pairwise Markov models (PPMMs), a novel type of Markov random field (MRF). At diagnostic resolution a digitized HS ..."
Abstract
-
Cited by 11 (2 self)
- Add to MetaCart
(Show Context)
a b s t r a c t In this paper we present a high-throughput system for detecting regions of carcinoma of the prostate (CaP) in HSs from radical prostatectomies (RPs) using probabilistic pairwise Markov models (PPMMs), a novel type of Markov random field (MRF). At diagnostic resolution a digitized HS can contain 80 K Â 70 K pixels -far too many for current automated Gleason grading algorithms to process. However, grading can be separated into two distinct steps: (1) detecting cancerous regions and (2) then grading these regions. The detection step does not require diagnostic resolution and can be performed much more quickly. Thus, we introduce a CaP detection system capable of analyzing an entire digitized wholemount HS (2 Â 1.75 cm 2 ) in under three minutes (on a desktop computer) while achieving a CaP detection sensitivity and specificity of 0.87 and 0.90, respectively. We obtain this high-throughput by tailoring the system to analyze the HSs at low resolution (8 lm per pixel). This motivates the following algorithm: (Step 1) glands are segmented, (Step 2) the segmented glands are classified as malignant or benign, and (Step 3) the malignant glands are consolidated into continuous regions. The classification of individual glands leverages two features: gland size and the tendency for proximate glands to share the same class. The latter feature describes a spatial dependency which we model using a Markov prior. Typically, Markov priors are expressed as the product of potential functions. Unfortunately, potential functions are mathematical abstractions, and constructing priors through their selection becomes an ad hoc procedure, resulting in simplistic models such as the Potts. Addressing this problem, we introduce PPMMs which formulate priors in terms of probability density functions, allowing the creation of more sophisticated models. To demonstrate the efficacy of our CaP detection system and assess the advantages of using a PPMM prior instead of the Potts, we alternately incorporate both priors into our algorithm and rigorously evaluate system performance, extracting statistics from over 6000 simulations run across 40 RP specimens. Perhaps the most indicative result is as follows: at a CaP sensitivity of 0.87 the accompanying false positive rates of the system when alternately employing the PPMM and Potts priors are 0.10 and 0.20, respectively.
Variational Segmentation using Fuzzy Region Competition and Local Non-Parametric Probability Density Functions
"... We describe a novel variational segmentation algorithm designed to split an image in two regions based on their intensity distributions. A functional is proposed to integrate the unknown probability density functions of both regions within the optimization process. The method simultaneously performs ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
(Show Context)
We describe a novel variational segmentation algorithm designed to split an image in two regions based on their intensity distributions. A functional is proposed to integrate the unknown probability density functions of both regions within the optimization process. The method simultaneously performs segmentation and non-parametric density estimation. It does not make any assumption on the underlying distributions, hence it is flexible and can be applied to a wide range of applications. Although a boundary evolution scheme may be used to minimize the functional, we choose to consider an alternative formulation with a membership function. The latter has the advantage of being convex in each variable, so that the minimization is faster and less sensitive to initial conditions. Finally, to improve the accuracy and the robustness to low-frequency artifacts, we present an extension for the more general case of local space-varying probability densities. The approach readily extends to vectorial images and 3D volumes, and we show several results on synthetic and photographic images, as well as on 3D medical data. 1.
Variational region-based segmentation using multiple texture statistics
- IEEE Trans. Image Process
, 2010
"... Abstract—This paper investigates variational region-level crite-rion for supervised and unsupervised texture-based image segmen-tation. The focus is given to the demonstration of the effective-ness and robustness of this region-based formulation compared to most common variational approaches. The ma ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
(Show Context)
Abstract—This paper investigates variational region-level crite-rion for supervised and unsupervised texture-based image segmen-tation. The focus is given to the demonstration of the effective-ness and robustness of this region-based formulation compared to most common variational approaches. The main contributions of this global criterion are twofold. First, the proposed methods cir-cumvent a major problem related to classical texture based seg-mentation approaches. Existing methods, even if they use different and various texture features, are mainly stated as the optimiza-tion of a criterion evaluating punctual pixel likelihoods or simi-larity measure computed within a local neighborhood. These ap-proaches require sufficient dissimilarity between the considered texture features. An additional limitation is the choice of the neigh-borhood size and shape. These two parameters and especially the neighborhood size significantly influence the classification perfor-