Search results for "Segmentation-based object categorization"
showing 10 items of 30 documents
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…
Image Segmentation based on Genetic Algorithms Combination
2005
The paper describes a new image segmentation algorithm called Combined Genetic segmentation which is based on a genetic algorithm. Here, the segmentation is considered as a clustering of pixels and a similarity function based on spatial and intensity pixel features is used. The proposed methodology starts from the assumption that an image segmentation problem can be treated as a Global Optimization Problem. The results of the image segmentations algorithm has been compared with recent existing techniques. Several experiments, performed on real images, show good performances of our approach compared to other existing methods.
A Coupled Schema of Probabilistic Atlas and Statistical Shape and Appearance Model for 3D Prostate Segmentation in MR Images
2012
International audience; A hybrid framework of probabilistic atlas and statistical shape and appearance model (SSAM) is proposed to achieve 3D prostate segmentation. An initial 3D segmentation of the prostate is obtained by registering the probabilistic atlas to the test dataset with deformable Demons registration. The initial results obtained are used to initialize multiple SSAMs corresponding to the apex, central and base regions of the prostate gland to incorporate local variabilities. Multiple mean parametric models of shape and appearance are derived from principal component analysis of prior shape and intensity information of the prostate from the training data. The parameters are then…
A novel active contour model for unsupervised low-key image segmentation
2013
Published version of an article in the journal: Central European Journal of Engineering. Also available from the publisher at: http://dx.doi.org/10.2478/s13531-012-0050-0 Unsupervised image segmentation is greatly useful in many vision-based applications. In this paper, we aim at the unsupervised low-key image segmentation. In low-key images, dark tone dominates the background, and gray level distribution of the foreground is heterogeneous. They widely exist in the areas of space exploration, machine vision, medical imaging, etc. In our algorithm, a novel active contour model with the probability density function of gamma distribution is proposed. The flexible gamma distribution gives a bet…
An Image Segmentation Algorithm based on Community Detection
2016
International audience; With the recent advances in complex networks, image segmentation becomes one of the most appropriate application areas. In this context, we propose in this paper a new perspective of image segmentation by applying two efficient community detection algorithms. By considering regions as communities, these methods can give an over-segmented image that has many small regions. So, the proposed algorithms are improved to automatically merge those neighboring regions agglomerative to achieve the highest modularity/stability. To produce sizable regions and detect homogeneous communities, we use the combination of a feature based on the Histogram of Oriented Gradients of the …
Manufactured object sub-segmentation based on reflection motion estimation
2015
International audience; In computer vision, reflection is a long-standing problem, it covers image textures, makes original color difficult to recognize, complicates the understanding of the scene. Most of the time, it is considered as “noise”. Many methods are proposed in order to reduce or delete the reflection effects in the image, but generally, the performances are not quite satisfactory. While instead of working on “de-noising”, we propose a method to take advantage of moving reflections that can be used for different computer vision applications. For instance, the segmentation of reflective manufactured objects is presented in this paper. We focus on tracking reflection components an…
Hidden Markov Random Field model and BFGS algorithm for Brain Image Segmentation
2016
Brain MR images segmentation has attracted a particular focus in medical imaging. The automatic image analysis and interpretation became a necessity. Segmentation is one of the key operations to provide a crucial decision support to physicians. Its goal is to simplify the representation of an image into items meaningful and easier to analyze. Hidden Markov Random Fields (HMRF) provide an elegant way to model the segmentation problem. This model leads to the minimization problem of a function. BFGS (Broyden-Fletcher-Goldfarb-Shanno algorithm) is one of the most powerful methods to solve unconstrained optimization problem. This paper presents how we combine HMRF and BFGS to achieve a good seg…
What makes segmentation good? A case study in boreal forest habitat mapping
2013
Segmentation goodness evaluation is a set of approaches meant for deciding which segmentation is good. In this study, we tested different supervised segmentation evaluation measures and visual interpretation in the case of boreal forest habitat mapping in Southern Finland. The data used were WorldView-2 satellite imagery, a lidar digital elevation model (DEM), and a canopy height model (CHM) in 2 m resolution. The segmentation methods tested were the fractal net evolution approach (FNEA) and IDRISI watershed segmentation. Overall, 252 different segmentation methods, layers, and parameter combinations were tested. We also used eight different habitat delineations as reference polygons agains…
Automatic dynamic texture segmentation using local descriptors and optical flow
2012
A dynamic texture (DT) is an extension of the texture to the temporal domain. How to segment a DT is a challenging problem. In this paper, we address the problem of segmenting a DT into disjoint regions. A DT might be different from its spatial mode (i.e., appearance) and/or temporal mode (i.e., motion field). To this end, we develop a framework based on the appearance and motion modes. For the appearance mode, we use a new local spatial texture descriptor to describe the spatial mode of the DT; for the motion mode, we use the optical flow and the local temporal texture descriptor to represent the temporal variations of the DT. In addition, for the optical flow, we use the histogram of orie…