Search results for "segmentation"
showing 10 items of 674 documents
Segmentation Integrating Texture and Shape A Priori Applied to Cardiac MR Images
2017
International audience; Cardiovascular diseases are the first cause of death worldwide. Early and accurate diagnosisof cardiovascular diseases plays an important role in improving life of population afflicted heartdiseases. Delayed Enhencement Magnetic Resonance Imaging (DE-MRI) is a highly valuablebut non-specific imaging technique that is ancillary in the diagnosis of a variety of myocardialdiseases. This papper presents a novel segmentation technique of DE-MRI based on watershedand region growing algorithm with application of myocardium shape.
Voxel-Based Morphomerty study in patients with amnestic Mild Cognitive Impairment and Alzheimer's Disease: population-based data from the Zabùt Aging…
2017
Aims and objectives Methods and materials Results Conclusion Personal information References
Ad-Hoc Segmentation Pipeline for Microarray Image Analysis
2006
Microarray is a new class of biotechnologies able to help biologist researches to extrapolate new knowledge from biological experiments. Image Analysis is devoted to extrapolate, process and visualize image information. For this reason it has found application also in Microarray, where it is a crucial step of this technology (e.g. segmentation). In this paper we describe MISP (Microarray Image Segmentation Pipeline), a new segmentation pipeline for Microarray Image Analysis. The pipeline uses a recent segmentation algorithm based on statistical analysis coupled with K-Means algorithm. The Spot masks produced by MISP are used to determinate spots information and quality measures. A software …
Chaotic multiagent system approach for MRF-based image segmentation
2005
In this paper, we propose a new chaotic approach for image segmentation based on multiagent system (MAS). We consider a set of segmentation agents organized around a coordinator agent. Each segmentation agent performs iterated conditional modes (ICM) starting from its own initial image created using a chaotic mapping. The coordinator agent diversifies the initial images using a crossover and a chaotic mutation operators. The efficiency of our chaotic MAS approach is shown through some experimental results.
Hidden Markov Random Fields and Direct Search Methods for Medical Image Segmentation
2016
The goal of image segmentation is to simplify the representation of an image to items meaningful and easier to analyze. Medical image segmentation is one of the fundamental problems in image processing field. It aims to provide a crucial decision support to physicians. There is no one way to perform the segmentation. There are several methods based on HMRF. Hidden Markov Random Fields (HMRF) constitute an elegant way to model the problem of segmentation. This modelling leads to the minimization of an energy function. In this paper we investigate direct search methods that are Nelder-Mead and Torczon methods to solve this optimization problem. The quality of segmentation is evaluated on grou…
Informal employment in developing countries
2012
There is an ongoing debate among researchers and policy makers, whether informal sector employment is a result of competitive market forces or labor market segmentation. More recently it has been argued that none of the two theories sufficiently explains informal employment, but that the informal sector shows a heterogenous structure. For some workers the informal sector is an attractive employment opportunity, whereas for others – rationed out of the formal sector – the informal sector is a strategy of last resort. To test the empirical relevance of this hypothesis we formulate an econometric model which allows for several unobserved segments within the informal sector and apply it to the …
Stable Automatic Unsupervised Segmentation of Retinal Vessels Using Self-Organizing Maps and a Modified Fuzzy C-Means Clustering
2011
In this paper an automatic unsupervised method for the segmentation of retinal vessels is proposed. Three features are extracted from the tested image. The features are scaled down by a factor of 2 and mapped into a Self-Organizing Map. A modified Fuzzy C-Means clustering algorithm is used to divide the neuron units of the map in 2 classes. The entire image is again input for the Self-Organizing Map and the class of each pixel will be the class of its best matching unit in the Self-Organizing Map. Finally, the vessel network is post-processed using a hill climbing strategy on the connected components of the segmented image. The experimental evaluation on the DRIVE database shows accurate ex…
Automatic Unsupervised Segmentation of Retinal Vessels Using Self-Organizing Maps and K-Means Clustering
2011
In this paper an automatic unsupervised method for the segmentation of retinal vessels is proposed. A Self-Organizing Map is trained on a portion of the same image that is tested and K-means clustering algorithm is used to divide the map units in 2 classes. The entire image is again input for the Self-Organizing Map, and the class of each pixel will be the class of the best matching unit on the Self-Organizing Map. Finally, the vessel network is post-processed using a hill climbing strategy on the connected components of the segmented image. The experimental evaluation on the publicly available DRIVE database shows accurate extraction of vessels network and a good agreement between our segm…
A multiscale approach to automatic and unsupervised retinal vessel segmentation using Self-Organizing Maps
2016
In this paper an automatic unsupervised method for retinal vessel segmentation is described. Self-Organizing Map, modified Fuzzy C-Means, STAPLE algorithms and majority voting strategy were adopted to identify a segmentation of the retinal vessels. The performance of the proposed method was evaluated on the DRIVE database.
Semi-automatic registration of retinal images based on line matching approach
2013
Accurate retinal image registration is essential to track the evolution of eye-related diseases. We propose a semiautomatic method based on features relying upon retinal graphs for temporal registration of retinal images. The features represent straight lines connecting vascular landmarks on the retina vascular tree: bifurcations, branchings, crossings, end points. In the built retinal graph, one straight line between two vascular landmarks indicates that they are connected by a vascular segment in the original retinal image. The locations of the landmarks are manually extracted to avoid the information loss due to errors in a retinal vessels segmentation algorithms. A straight line model i…