Browsing by Subject "Morphological operations"
Now showing 1 - 3 of 3
Results Per Page
Sort Options
Item Open Access Automatic detection of geospatial objects using multiple hierarchical segmentations(Institute of Electrical and Electronics Engineers, 2008-07) Akçay, H. G.; Aksoy, S.The object-based analysis of remotely sensed imagery provides valuable spatial and structural information that is complementary to pixel-based spectral information in classification. In this paper, we present novel methods for automatic object detection in high-resolution images by combining spectral information with structural information exploited by using image segmentation. The proposed segmentation algorithm uses morphological operations applied to individual spectral bands using structuring elements in increasing sizes. These operations produce a set of connected components forming a hierarchy of segments for each band. A generic algorithm is designed to select meaningful segments that maximize a measure consisting of spectral homogeneity and neighborhood connectivity. Given the observation that different structures appear more clearly at different scales in different spectral bands, we describe a new algorithm for unsupervised grouping of candidate segments belonging to multiple hierarchical segmentations to find coherent sets of segments that correspond to actual objects. The segments are modeled by using their spectral and textural content, and the grouping problem is solved by using the probabilistic latent semantic analysis algorithm that builds object models by learning the object-conditional probability distributions. The automatic labeling of a segment is done by computing the similarity of its feature distribution to the distribution of the learned object models using the Kullback-Leibler divergence. The performances of the unsupervised segmentation and object detection algorithms are evaluated qualitatively and quantitatively using three different data sets with comparative experiments, and the results show that the proposed methods are able to automatically detect, group, and label segments belonging to the same object classes. © 2008 IEEE.Item Open Access Canlı hücre bölütlemesi için gözeticili öğrenme modeli(IEEE Computer Society, 2014-04) Koyuncu, Can Fahrettin; Durmaz, İrem; Çetin-Atalay, Rengül; Gündüz-Demir, ÇiğdemAutomated cell imaging systems have been proposed for faster and more reliable analysis of biological events at the cellular level. The first step of these systems is usually cell segmentation whose success affects the other system steps. Thus, it is critical to implement robust and efficient segmentation algorithms for the design of successful systems. In the literature, the most commonly used methods for cell segmentation are marker controlled watersheds. These watershed algorithms assume that markers one-to-one correspond to cells and identify their boundaries by growing these markers. Thus, it is very important to correctly define the markers for these algorithms. The markers are usually defined by finding local minima/maxima on intensity or gradient values or by applying morphological operations on the corresponding binary image. In this work, we propose a new marker controlled watershed algorithm for live cell segmentation. The main contributions of this algorithm are twofold. First, different than the approaches in the literature, it implements a new supervised learning model for marker detection. In this model, it has been proposed to extract features for each pixel considering its neighbors' intensities and gradients and to decide whether this pixel is a marker pixel or not by a classifier using these extracted features. Second, it has been proposed to group the neighboring pixels based on the direction information and to extract features according to these groups. The experiments on 1954 cells show that the proposed algorithm leads to higher segmentation results compared to other watersheds. © 2014 IEEE.Item Open Access A novel hierarchical coding scheme based on polar mass distribution(IEEE, 1994) Öktem, Levent; Onural, LeventA novel method for coding arbitrarily shaped binary objects is presented. The main idea is expressing the binary object in terms of radial closed curves, that is, closed curves for which radius versus angle is a function. These functions and the simple rules for combining them uniquely represent the object. The data compaction property of the method and the flexibility of the introduced loss are shown. Experimental results are presented, with a comparison to G3 fax standard. Possible application areas are discussed.