Boundary Extraction in Images Using Hierarchical Clustering-based Segmentation

Hierarchical organization is one of the main characteristics of human segmentation. A human subject segments a natural image by identifying physical objects and marking their boundaries up to a certain level of detail [1]. Hierarchical clustering based segmentation (HCS) process mimics this capability of the human vision. The HCS process automatically generates a hierarchy of segmented images. The hierarchy represents the continuous merging of similar, spatially adjacent or disjoint, regions as the allowable threshold value of dissimilarity between regions, for merging, is gradually increased. HCS process is unsupervised and is completely data driven. This ensures that the segmentation process can be applied to any image, without any prior information about the image data and without any need for prior training of the segmentation process with the relevant image data. The implementation details of HCS process have been described elsewhere in the author's work [2]. The purpose of the current study is to demonstrate the performance of the HCS process in outlining boundaries in images and its possible application in processing medical images. [1] P. Arbelaez. Boundary Extraction in Natural Images Using Ultrametric Contour Maps. Proceedings 5th IEEE Workshop on Perceptual Organization in Computer Vision (POCV'06). June 2006. New York, USA. [2] A. N. Selvan. Highlighting Dissimilarity in Medical Images Using Hierarchical Clustering Based Segmentation (HCS). M. Phil. dissertation, Faculty of Arts Computing Engineering and Sciences Sheffield Hallam Univ., Sheffield, UK, 2007.</p

Multiscale combinatorial grouping

We propose a unified approach for bottom-up hierarchical image segmentation and object candidate generation for recognition, called Multiscale Combinatorial Grouping (MCG). For this purpose, we first develop a fast normalized cuts algorithm. We then propose a high-performance hierarchical segmenter that makes effective use of multiscale information. Finally, we propose a grouping strategy that combines our multiscale regions into highly-accurate object candidates by exploring efficiently their combinatorial space. We conduct extensive experiments on both the BSDS500 and on the PASCAL 2012 segmentation datasets, showing that MCG produces state-of-the-art contours, hierarchical regions and object candidates. 1

Multivariate texture-based segmentation of remotely sensed imagery for extraction of objects and their uncertainty

In this study, a segmentation procedure is proposed, based on grey-level and multivariate texture to extract spatial objects from an image scene. Object uncertainty was quantified to identify transitions zones of objects with indeterminate boundaries. The Local Binary Pattern (LBP) operator, modelling texture, was integrated into a hierarchical splitting segmentation to identify homogeneous texture regions in an image. We proposed a multivariate extension of the standard univariate LBP operator to describe colour texture. The paper is illustrated with two case studies. The first considers an image with a composite of texture regions. The two LBP operators provided good segmentation results on both grey-scale and colour textures, depicted by accuracy values of 96% and 98%, respectively. The second case study involved segmentation of coastal land cover objects from a multi-spectral Compact Airborne Spectral Imager (CASI) image, of a coastal area in the UK. Segmentation based on the univariate LBP measure provided unsatisfactory segmentation results from a single CASI band (70% accuracy). A multivariate LBP-based segmentation of three CASI bands improved segmentation results considerably (77% accuracy). Uncertainty values for object building blocks provided valuable information for identification of object transition zones. We conclude that the (multivariate) LBP texture model in combination with a hierarchical splitting segmentation framework is suitable for identifying objects and for quantifying their uncertainty

MULTI-CLASS REGION MERGING FOR INTERACTIVE IMAGE SEGMENTATION USING HIERARCHICAL CLUSTERING ANALYSIS

In interactive image segmentation, distance calculation between regions and sequence of region merging is being an important thing that needs to be considered to obtain accurate segmentation results. Region merging without regard to label in Hierarchical Clustering Analysis causes the possibility of two different labels merged into a cluster and resulting errors in segmentation. This study proposes a new multi-class region merging strategy for interactive image segmentation using the Hierarchical Clustering Analysis. Marking is given to regions that are considered as objects and background, which are then referred as classes. A different label for each class is given to prevent any classes with different label merged into a cluster. Based on experiment, the mean value of ME and RAE for the results of segmentation using the proposed method are 0.035 and 0.083, respectively. Experimental results show that giving the label on each class is effectively used in multi-class region merging

Hierarchical morphological segmentation for image sequence coding

This paper deals with a hierarchical morphological segmentation algorithm for image sequence coding. Mathematical morphology is very attractive for this purpose because it efficiently deals with geometrical features such as size, shape, contrast, or connectivity that can be considered as segmentation-oriented features. The algorithm follows a top-down procedure. It first takes into account the global information and produces a coarse segmentation, that is, with a small number of regions. Then, the segmentation quality is improved by introducing regions corresponding to more local information. The algorithm, considering sequences as being functions on a 3-D space, directly segments 3-D regions. A 3-D approach is used to get a segmentation that is stable in time and to directly solve the region correspondence problem. Each segmentation stage relies on four basic steps: simplification, marker extraction, decision, and quality estimation. The simplification removes information from the sequence to make it easier to segment. Morphological filters based on partial reconstruction are proven to be very efficient for this purpose, especially in the case of sequences. The marker extraction identifies the presence of homogeneous 3-D regions. It is based on constrained flat region labeling and morphological contrast extraction. The goal of the decision is to precisely locate the contours of regions detected by the marker extraction. This decision is performed by a modified watershed algorithm. Finally, the quality estimation concentrates on the coding residue, all the information about the 3-D regions that have not been properly segmented and therefore coded. The procedure allows the introduction of the texture and contour coding schemes within the segmentation algorithm. The coding residue is transmitted to the next segmentation stage to improve the segmentation and coding quality. Finally, segmentation and coding examples are presented to show the validity and interest of the coding approach.Peer ReviewedPostprint (published version

Discovering Class-Specific Pixels for Weakly-Supervised Semantic Segmentation

We propose an approach to discover class-specific pixels for the weakly-supervised semantic segmentation task. We show that properly combining saliency and attention maps allows us to obtain reliable cues capable of significantly boosting the performance. First, we propose a simple yet powerful hierarchical approach to discover the class-agnostic salient regions, obtained using a salient object detector, which otherwise would be ignored. Second, we use fully convolutional attention maps to reliably localize the class-specific regions in a given image. We combine these two cues to discover class-specific pixels which are then used as an approximate ground truth for training a CNN. While solving the weakly supervised semantic segmentation task, we ensure that the image-level classification task is also solved in order to enforce the CNN to assign at least one pixel to each object present in the image. Experimentally, on the PASCAL VOC12 val and test sets, we obtain the mIoU of 60.8% and 61.9%, achieving the performance gains of 5.1% and 5.2% compared to the published state-of-the-art results. The code is made publicly available