In this paper we study a scheme to segment images. The scheme consists of two steps: image enhancement based on anisotropic diiusion and watershed segmentation. In both steps an activity image plays a central role; to drive the diiusion in the enhancement step and as a topographic surface in the watershed segmentation. In this paper we extend this segmentation scheme to images in true color. Th...

In this work, we extend a common framework for graph-based image segmentation that includes the graph cuts, random walker, and shortest path optimization algorithms. Viewing an image as a weighted graph, these algorithms can be expressed by means of a common energy function with differing choices of a parameter q acting as an exponent on the differences between neighboring nodes. Introducing a ...

Image segmentation is a fundamental approach in the field of image processing and based on user’s application .This paper propose an original and simple segmentation strategy based on the EM approach that resolves many informatics problems about hyperspectral images which are observed by airborne sensors. In a first step, to simplify the input color textured image into a color image without tex...

This paper focuses on marker based watershed segmentation algorithms. As marker based watershed segmentation algorithm causes over segmentation and cause noise in the image produced. So to reduce these problem different researchers has proposed different solutions, but the best solution is to use bilateral filter. The main objective of this paper is to find the gaps in existing literature. The ...

Segmentation of adjoining objects in a noisy image is a challenging task in image processing. Natural images often get corrupted by noise during acquisition and transmission. Segmentation of these noisy images does not provide desired results, hence de-noising is required. In this paper, we tried to address a very effective technique called Wavelet thresholding for denoising, as it can arrest t...

This paper discusses the inverse problem of the watershed. From a partition obtained by the watershed from markers, find the minimal set of markers that reproduces the same watershed partition. We present a solution based on the minimum spanning tree and introduce the concept of marker receptive region. We also review the watershed transform based on the minimum spanning forest problem. Two app...

− An accurate and standard techniques for breast tumor segmentation plays a pivotal role in detecting and quantifying breast cancers. Segmentation of breast tumor in mammograms presents many challenges related to selection of optimal threshold in various segmentation techniques. In this paper, a mean based region growing segmentation (MRGS) is presented that automatically finds the seed pixel a...

The morphological approach to image segmentation is based on the watershed transform. It is a very powerful tool which presents many advantages: it is not parametric, computationally efficient... However, in comparison with energy-based methods as active contours, it does not allow to control the smoothness of the result. In order to introduce geometrical regularization constraints in the morph...

The watershed transform is widely used for image segmentation on computer vision applications. However, sequential watershed algorithms are not suitable for real-time applications, once they are one demanding part of several tasks. This paper proposes a new parallel algorithm for the watershed transform focused on real-time image segmentation using off-the-shelf GPUs. In this sense, this algori...

This paper presents an efficient method for image segmentation based on a multiresolution application of a wavelet transform and watershed segmentation algorithm. The procedure toward complete segmentation consists of four steps: pyramid representation, image segmentation, region merging and region projection. First, pyramid representation creates multiresolution images using a wavelet transfor...