Coding of details in very low bit-rate video systems

In this paper, the importance of including small image features at the initial levels of a progressive second generation video coding scheme is presented. It is shown that a number of meaningful small features called details should be coded, even at very low data bit-rates, in order to match their perceptual significance to the human visual system. We propose a method for extracting, perceptually selecting and coding of visual details in a video sequence using morphological techniques. Its application in the framework of a multiresolution segmentation-based coding algorithm yields better results than pure segmentation techniques at higher compression ratios, if the selection step fits some main subjective requirements. Details are extracted and coded separately from the region structure and included in the reconstructed images in a later stage. The bet of considering the local background of a given detail for its perceptual selection breaks the concept ofPeer ReviewedPostprint (published version

Recursive image sequence segmentation by hierarchical models

This paper addresses the problem of image sequence segmentation. A technique using a sequence model based on compound random fields is presented. This technique is recursive in the sense that frames are processed in the same cadency as they are produced. New regions appearing in the sequence are detected by a morphological procedure.Peer ReviewedPostprint (published version

Morphological Segmentation on Learned Boundaries

International audienceColour information is usually not enough to segment natural complex scenes. Texture contains relevant information that segmentation approaches should consider. Martin et al. [Learning to detect natural image boundaries using local brightness, color, and texture cues, IEEE Transactions on Pattern Analysis and Machine Intelligence 26 (5) (2004) 530-549] proposed a particularly interesting colour-texture gradient. This gradient is not suitable for Watershed-based approaches because it contains gaps. In this paper, we propose a method based on the distance function to fill these gaps. Then, two hierarchical Watershed-based approaches, the Watershed using volume extinction values and the Waterfall, are used to segment natural complex scenes. Resulting segmentations are thoroughly evaluated and compared to segmentations produced by the Normalised Cuts algorithm using the Berkeley segmentation dataset and benchmark. Evaluations based on both the area overlap and boundary agreement with manual segmentations are performed

Image Segmentation Using Weak Shape Priors

The problem of image segmentation is known to become particularly challenging in the case of partial occlusion of the object(s) of interest, background clutter, and the presence of strong noise. To overcome this problem, the present paper introduces a novel approach segmentation through the use of "weak" shape priors. Specifically, in the proposed method, an segmenting active contour is constrained to converge to a configuration at which its geometric parameters attain their empirical probability densities closely matching the corresponding model densities that are learned based on training samples. It is shown through numerical experiments that the proposed shape modeling can be regarded as "weak" in the sense that it minimally influences the segmentation, which is allowed to be dominated by data-related forces. On the other hand, the priors provide sufficient constraints to regularize the convergence of segmentation, while requiring substantially smaller training sets to yield less biased results as compared to the case of PCA-based regularization methods. The main advantages of the proposed technique over some existing alternatives is demonstrated in a series of experiments.Comment: 27 pages, 8 figure

Hyperspectral image representation and processing with binary partition trees

The optimal exploitation of the information provided by hyperspectral images requires the development of advanced image processing tools. Therefore, under the title Hyperspectral image representation and Processing with Binary Partition Trees, this PhD thesis proposes the construction and the processing of a new region-based hierarchical hyperspectral image representation: the Binary Partition Tree (BPT). This hierarchical region-based representation can be interpreted as a set of hierarchical regions stored in a tree structure. Hence, the Binary Partition Tree succeeds in presenting: (i) the decomposition of the image in terms of coherent regions and (ii) the inclusion relations of the regions in the scene. Based on region-merging techniques, the construction of BPT is investigated in this work by studying hyperspectral region models and the associated similarity metrics. As a matter of fact, the very high dimensionality and the complexity of the data require the definition of specific region models and similarity measures. Once the BPT is constructed, the fixed tree structure allows implementing efficient and advanced application-dependent techniques on it. The application-dependent processing of BPT is generally implemented through a specific pruning of the tree. Accordingly, some pruning techniques are proposed and discussed according to different applications. This Ph.D is focused in particular on segmentation, object detection and classification of hyperspectral imagery. Experimental results on various hyperspectral data sets demonstrate the interest and the good performances of the BPT representatio

Semiautomatic contour detection of breast lesions in ultrasonic images with morphological operators and average radial derivative function

AbstractThis work presents a computerized lesion segmentation technique on breast ultrasound images. There were applied known techniques such as morphological filtering, Watershed transformation and average radial derivative function. To evaluate the performance of the proposed method, two protocols were established. For the first, the resulting segmentation contours were compared with those of 24 gold standard simulated ultrasound-like images, and, for second, with 36 breast US images manually delineated by two senior radiologists. Further, two evaluation parameters were used: the percentage of coincidence (CP) and the proportional distance (PD). The former indicates the similarity between contours, while the latter express the dissimilarity. The accuracy of the proposed method was evaluated by considering images with CP>80% and PD<10% as adequately delineated. It was higher than 80% for real images and higher than 88% for simulated images

Image processing by region extraction using a clustering approach based on color

This thesis describes an image segmentation technique based on watersheds, a clustering technique which does not use spatial information, but relies on multispectral images. These are captured using a monochrome camera and narrow-band filters; we call this color segmentation, although it does not use color in a physiological sense. A major part of the work is testing the method developed using different color images. Starting with a general discussion of image processing, the different techniques used in image segmentation are reviewed, and the application of mathematical morphology to image processing is discussed. The use of watersheds as a clustering technique in two- dimensional color space is discussed, and system performance illustrated. The method can be improved for industrial applications by using normalized color to eliminate the problem of shadows. These methods are extended to segment the image into regions recursively. Different types of color images including both man made color images, and natural color images have been used to illustrate performance. There is a brief discussion and a simple illustration showing how segmentation can be used in image compression, and of the application of pyramidal data structures in clustering for coarse segmentation. The thesis concludes with an investigation of the methods which can be used to improve these segmentation results. This includes edge extraction, texture extraction, and recursive merging