26,363 research outputs found
Recommended from our members
Fuzzy image segmentation of generic shaped clusters
The segmentation performance of any clustering algorithm is very sensitive to the features in an image, which ultimately restricts their generalisation capability. This limitation was the primary motivation in our investigation into using shape information to improve the generality of these algorithms. Fuzzy shape-based clustering techniques already consider ring and elliptical profiles in segmentation, though most real objects are neither ring nor elliptically shaped. This paper addresses this issue by introducing a new shape-based algorithm called fuzzy image segmentation of generic shaped clusters (FISG) that incorporates generic shape information into the framework of the fuzzy c-means (FCM) algorithm. Both qualitative and quantitative analyses confirm the superiority of FISG compared to other shape-based fuzzy clustering methods including, Gustafson-Kessel algorithm, ring-shaped, circular shell, c-ellipsoidal shells and elliptic ring-shaped clusters. The new algorithm has also been shown to be application independent so it can be applied in areas such as video object plane segmentation in MPEG-4 based coding
Fuzzy image segmentation using shape information
Results of any clustering algorithm are highly sensitive to features that limit their generalization and hence provide a strong motivation to integrate shape information into the algorithm. Existing fuzzy shape-based clustering algorithms consider only circular and elliptical shape information and consequently do not segment well, arbitrary shaped objects. To address this issue, this paper introduces a new shape-based algorithm, called fuzzy image segmentation using shape information (FISS) by incorporating general shape information. Both qualitative and quantitative analysis proves the superiority of the new FISS algorithm compared to other well-established shape-based fuzzy clustering algorithms, including Gustafson-Kessel, ring-shaped, circular shell, c-ellipsoidal shells and elliptic ring-shaped clusters
Fuzzy Clustering for Image Segmentation Using Generic Shape Information
The performance of clustering algorithms for image segmentation are highly sensitive to the features used and types of objects in the image, which ultimately limits their generalization capability. This provides strong motivation to investigate integrating shape information into the clustering framework to improve the generality of these algorithms. Existing shape-based clustering techniques mainly focus on circular and elliptical clusters and so are unable to segment arbitrarily-shaped objects. To address this limitation, this paper presents a new shape-based algorithm called fuzzy clustering for image segmentation using generic shape information (FCGS), which exploits the B-spline representation of an object's shape in combination with the Gustafson-Kessel clustering algorithm. Qualitative and quantitative results for FCGS confirm its superior segmentation performance consistently compared to well-established shape-based clustering techniques, for a wide range of test images comprising various regular and arbitrary-shaped objects
Recommended from our members
Fuzzy Image Segmentation using Suppressed Fuzzy C-Means Clustering
Clustering algorithms are highly dependent on the features used and the type of the objects in a particular image. By considering object similar surface variations (SSV) as well as the arbitrariness of the fuzzy c-means (FCM) algorithm for pixellocation, a fuzzy image segmentation considering object surface similarity (FSOS) algorithm was developed, but it was unable to segment objects having SSV satisfactorily. To improve the effectiveness of FSOS in segmenting objects with SSV, thispaper introduces a new fuzzy image segmentation using suppressed fuzzy c-means clustering (FSSC) algorithm, which directly considers object SSV and incorporates the use of suppressed-FCM (SFCM) using pixel location. The algorithmalso perceptually selects the threshold within the range of human visual perception. Both qualitative and quantitative resultsconfirm the improved segmentation performance of FSSC compared with other algorithms including FSOS, FCM,possibilistic c-means (PCM) and SFCM for many different images
Fuzzy-based Propagation of Prior Knowledge to Improve Large-Scale Image Analysis Pipelines
Many automatically analyzable scientific questions are well-posed and offer a
variety of information about the expected outcome a priori. Although often
being neglected, this prior knowledge can be systematically exploited to make
automated analysis operations sensitive to a desired phenomenon or to evaluate
extracted content with respect to this prior knowledge. For instance, the
performance of processing operators can be greatly enhanced by a more focused
detection strategy and the direct information about the ambiguity inherent in
the extracted data. We present a new concept for the estimation and propagation
of uncertainty involved in image analysis operators. This allows using simple
processing operators that are suitable for analyzing large-scale 3D+t
microscopy images without compromising the result quality. On the foundation of
fuzzy set theory, we transform available prior knowledge into a mathematical
representation and extensively use it enhance the result quality of various
processing operators. All presented concepts are illustrated on a typical
bioimage analysis pipeline comprised of seed point detection, segmentation,
multiview fusion and tracking. Furthermore, the functionality of the proposed
approach is validated on a comprehensive simulated 3D+t benchmark data set that
mimics embryonic development and on large-scale light-sheet microscopy data of
a zebrafish embryo. The general concept introduced in this contribution
represents a new approach to efficiently exploit prior knowledge to improve the
result quality of image analysis pipelines. Especially, the automated analysis
of terabyte-scale microscopy data will benefit from sophisticated and efficient
algorithms that enable a quantitative and fast readout. The generality of the
concept, however, makes it also applicable to practically any other field with
processing strategies that are arranged as linear pipelines.Comment: 39 pages, 12 figure
Segmentation and classification of individual tree crowns
By segmentation and classification of individual tree crowns in high spatial resolution aerial images, information about the forest can be automatically extracted. Segmentation is about finding the individual tree crowns and giving each of them a unique label. Classification, on the other hand, is about recognising the species of the tree. The information of each individual tree in the forest increases the knowledge about the forest which can be useful for managements, biodiversity assessment, etc. Different algorithms for segmenting individual tree crowns are presented and also compared to each other in order to find their strengths and weaknesses. All segmentation algorithms developed in this thesis focus on preserving the shape of the tree crown. Regions, representing the segmented tree crowns, grow according to certain rules from seed points. One method starts from many regions for each tree crown and searches for the region that fits the tree crown best. The other methods start from a set of seed points, representing the locations of the tree crowns, to create the regions. The segmentation result varies from 73 to 95 % correctly segmented visual tree crowns depending on the type of forest and the method. The former value is for a naturally generated mixed forest and the latter for a non-mixed forest. The classification method presented uses shape information of the segments and colour information of the corresponding tree crown in order to decide the species. The classification method classifies 77 % of the visual trees correctly in a naturally generated mixed forest, but on a forest stand level the classification is over 90 %
- …