Information-theoretic active contour model for microscopy image segmentation using texture

High throughput technologies have increased the need for automated image analysis in a wide variety of microscopy techniques. Geometric active contour models provide a solution to automated image segmentation by incorporating statistical information in the detection of object boundaries. A statistical active contour may be defined by taking into account the optimisation of an information-theoretic measure between object and background. We focus on a product-type measure of divergence known as Cauchy-Schwartz distance which has numerical advantages over ratio-type measures. By using accurate shape derivation techniques, we define a new geometric active contour model for image segmentation combining Cauchy-Schwartz distance and Gabor energy texture filters. We demonstrate the versatility of this approach on images from the Brodatz dataset and phase-contrast microscopy images of cells

Shape and data driven texture segmentation using local binary patterns

Image segmentation is a fundamental step in image analysis. Segmentation can be done by isolating homogeneous regions within an image or finding the boundaries between such regions. There are several cases that intensity values, color, mean or variance of image intensity distributions and edge information cannot play a discriminative role in image segmentation. While other features are not sufficient to discriminate regions, texture might be a good feature to handle the segmentation problem. Texture analysis and texture segmentation are still challenging problems; there is no method which can clearly identify and discriminate all kind of textures. Especially identifying nonumform textures and discriminating from other textures are still difficult problems in texture analysis. For this reason texture segmentation approaches may give unsatisfactory segmentation results with missing data or with corrupted boundaries of regions. Using prior information about the shape of the object can aid segmentation which can also obtain a solution to occlusion problems. In this thesis, we propose a shape and data driven texture segmentation method using local binary pattern (LBP). In particular, we train our LBP based texture filter with the texture which belongs to the region that we want to segment. We input the textured image into our filter to produce a "filtered image" which has been eluded from the structural properties of texture. Then by an energy functional, which combines the data term produced from the filtered image and shape prior term under a Bayesian framework, we evolve our level set based active contour for segmentation

Real-time automated road, lane and car detection for autonomous driving

In this paper, we discuss a vision based system for autonomous guidance of vehicles. An autonomous intelligent vehicle has to perform a number of functionalities. Segmentation of the road, determining the boundaries to drive in and recognizing the vehicles and obstacles around are the main tasks for vision guided vehicle navigation. In this article we propose a set of algorithms which lead to the solution of road and vehicle segmentation using data from a color camera. The algorithms described here combine gray value difference and texture analysis techniques to segment the road from the image, several geometric transformations and contour processing algorithms are used to segment lanes, and moving cars are extracted with the help of background modeling and estimation. The techniques developed have been tested in real road images and the results are presented

Hybrid SPF and KD Operator-Based Active Contour Model for Image Segmentation

Image segmentation is a crucial stage of image analysis systems because it detects and extracts regions of interest for further processing, such as image recognition and the image description. However, segmenting images is not always easy because segmentation accuracy depends significantly on image characteristics, such as color, texture, and intensity. Image inhomogeneity profoundly degrades the segmentation performance of segmentation models. This article contributes to image segmentation literature by presenting a hybrid Active Contour Model (ACM) based on a Signed Pressure Force (SPF) function parameterized with a Kernel Difference (KD) operator. An SPF function includes information from both the local and global regions, making the proposed model independent of the initial contour position. The proposed model uses an optimal KD operator parameterized with weight coefficients to capture weak and blurred boundaries of inhomogeneous objects in images. Combined global and local image statistics were computed and added to the proposed energy function to increase the proposed model's sensitivity. The segmentation time complexity of the proposed model was calculated and compared with previous state-of-the-art active contour methods. The results demonstrated the significant superiority of the proposed model over other methods. Furthermore, a quantitative analysis was performed using the mini-MIAS database. Despite the presence of complex inhomogeneity, the proposed model demonstrated the highest segmentation accuracy when compared to other methods

Active Contour Models for Manifold Valued Image Segmentation

Image segmentation is the process of partitioning a image into different regions or groups based on some characteristics like color, texture, motion or shape etc. Active contours is a popular variational method for object segmentation in images, in which the user initializes a contour which evolves in order to optimize an objective function designed such that the desired object boundary is the optimal solution. Recently, imaging modalities that produce Manifold valued images have come up, for example, DT-MRI images, vector fields. The traditional active contour model does not work on such images. In this paper, we generalize the active contour model to work on Manifold valued images. As expected, our algorithm detects regions with similar Manifold values in the image. Our algorithm also produces expected results on usual gray-scale images, since these are nothing but trivial examples of Manifold valued images. As another application of our general active contour model, we perform texture segmentation on gray-scale images by first creating an appropriate Manifold valued image. We demonstrate segmentation results for manifold valued images and texture images

Deep Learning of Unified Region, Edge, and Contour Models for Automated Image Segmentation

Image segmentation is a fundamental and challenging problem in computer vision with applications spanning multiple areas, such as medical imaging, remote sensing, and autonomous vehicles. Recently, convolutional neural networks (CNNs) have gained traction in the design of automated segmentation pipelines. Although CNN-based models are adept at learning abstract features from raw image data, their performance is dependent on the availability and size of suitable training datasets. Additionally, these models are often unable to capture the details of object boundaries and generalize poorly to unseen classes. In this thesis, we devise novel methodologies that address these issues and establish robust representation learning frameworks for fully-automatic semantic segmentation in medical imaging and mainstream computer vision. In particular, our contributions include (1) state-of-the-art 2D and 3D image segmentation networks for computer vision and medical image analysis, (2) an end-to-end trainable image segmentation framework that unifies CNNs and active contour models with learnable parameters for fast and robust object delineation, (3) a novel approach for disentangling edge and texture processing in segmentation networks, and (4) a novel few-shot learning model in both supervised settings and semi-supervised settings where synergies between latent and image spaces are leveraged to learn to segment images given limited training data.Comment: PhD dissertation, UCLA, 202

Plant image retrieval using color, shape and texture features

We present a content-based image retrieval system for plant image retrieval, intended especially for the house plant identification problem. A plant image consists of a collection of overlapping leaves and possibly flowers, which makes the problem challenging.We studied the suitability of various well-known color, shape and texture features for this problem, as well as introducing some new texture matching techniques and shape features. Feature extraction is applied after segmenting the plant region from the background using the max-flow min-cut technique. Results on a database of 380 plant images belonging to 78 different types of plants show promise of the proposed new techniques and the overall system: in 55% of the queries, the correct plant image is retrieved among the top-15 results. Furthermore, the accuracy goes up to 73% when a 132-image subset of well-segmented plant images are considered

A Novel Active Contour Model for Texture Segmentation

Texture is intuitively defined as a repeated arrangement of a basic pattern or object in an image. There is no mathematical definition of a texture though. The human visual system is able to identify and segment different textures in a given image. Automating this task for a computer is far from trivial. There are three major components of any texture segmentation algorithm: (a) The features used to represent a texture, (b) the metric induced on this representation space and (c) the clustering algorithm that runs over these features in order to segment a given image into different textures. In this paper, we propose an active contour based novel unsupervised algorithm for texture segmentation. We use intensity covariance matrices of regions as the defining feature of textures and find regions that have the most inter-region dissimilar covariance matrices using active contours. Since covariance matrices are symmetric positive definite, we use geodesic distance defined on the manifold of symmetric positive definite matrices PD(n) as a measure of dissimlarity between such matrices. We demonstrate performance of our algorithm on both artificial and real texture images

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