Fast unsupervised multiresolution color image segmentation using adaptive gradient thresholding and progressive region growing

In this thesis, we propose a fast unsupervised multiresolution color image segmentation algorithm which takes advantage of gradient information in an adaptive and progressive framework. This gradient-based segmentation method is initialized by a vector gradient calculation on the full resolution input image in the CIE L*a*b* color space. The resultant edge map is used to adaptively generate thresholds for classifying regions of varying gradient densities at different levels of the input image pyramid, obtained through a dyadic wavelet decomposition scheme. At each level, the classification obtained by a progressively thresholded growth procedure is combined with an entropy-based texture model in a statistical merging procedure to obtain an interim segmentation. Utilizing an association of a gradient quantized confidence map and non-linear spatial filtering techniques, regions of high confidence are passed from one level to another until the full resolution segmentation is achieved. Evaluation of our results on several hundred images using the Normalized Probabilistic Rand (NPR) Index shows that our algorithm outperforms state-of the art segmentation techniques and is much more computationally efficient than its single scale counterpart, with comparable segmentation quality

Color graph based wavelet transform with perceptual information

International audienceIn this paper, we propose a numerical strategy to define a multiscale analysis for color and multicomponent images based on the representation of data on a graph. Our approach consists in computing the graph of an image using the psychovisual information and analysing it by using the spectral graph wavelet transform. We suggest introducing color dimension into the computation of the weights of the graph and using the geodesic distance as a means of distance measurement. We thus have defined a wavelet transform based on a graph with perceptual information by using the CIELab color distance. This new representation is illustrated with denoising and inpainting applications. Overall, by introducing psychovisual information in the graph computation for the graph wavelet transform we obtain very promising results. Therefore results in image restoration highlight the interest of the appropriate use of color information

Multiscale entropy-based analyses of soil transect data

A deeper understanding of the spatial variability of soil properties and the relationships between them is needed to scale up measured soil properties and to model soil processes. The object of this study was to describe the spatial scaling properties of a set of soil physical properties measured on a common 1024-m transect across arable fields at Silsoe in Bedfordshire, east-central England. Properties studied were volumetric water content ({theta}), total porosity ({pi}), pH, and N2O flux. We applied entropy as a means of quantifying the scaling behavior of each transect. Finally, we examined the spatial intrascaling behavior of the correlations between {theta} and the other soil variables. Relative entropies and increments in relative entropy calculated for {theta}, {pi}, and pH showed maximum structure at the 128-m scale, while N2O flux presented a more complex scale dependency at large and small scales. The intrascale-dependent correlation between {theta} and {pi} was negative at small scales up to 8 m. The rest of the intrascale-dependent correlation functions between {theta} with N2O fluxes and pH were in agreement with previous studies. These techniques allow research on scale effects localized in scale and provide the information that is complementary to the information about scale dependencies found across a range of scale

Semi-automatic algorithm for construction of the left ventricular area variation curve over a complete cardiac cycle

<p>Abstract</p> <p>Background</p> <p>Two-dimensional echocardiography (2D-echo) allows the evaluation of cardiac structures and their movements. A wide range of clinical diagnoses are based on the performance of the left ventricle. The evaluation of myocardial function is typically performed by manual segmentation of the ventricular cavity in a series of dynamic images. This process is laborious and operator dependent. The automatic segmentation of the left ventricle in 4-chamber long-axis images during diastole is troublesome, because of the opening of the mitral valve.</p> <p>Methods</p> <p>This work presents a method for segmentation of the left ventricle in dynamic 2D-echo 4-chamber long-axis images over the complete cardiac cycle. The proposed algorithm is based on classic image processing techniques, including time-averaging and wavelet-based denoising, edge enhancement filtering, morphological operations, homotopy modification, and watershed segmentation. The proposed method is semi-automatic, requiring a single user intervention for identification of the position of the mitral valve in the first temporal frame of the video sequence. Image segmentation is performed on a set of dynamic 2D-echo images collected from an examination covering two consecutive cardiac cycles.</p> <p>Results</p> <p>The proposed method is demonstrated and evaluated on twelve healthy volunteers. The results are quantitatively evaluated using four different metrics, in a comparison with contours manually segmented by a specialist, and with four alternative methods from the literature. The method's intra- and inter-operator variabilities are also evaluated.</p> <p>Conclusions</p> <p>The proposed method allows the automatic construction of the area variation curve of the left ventricle corresponding to a complete cardiac cycle. This may potentially be used for the identification of several clinical parameters, including the area variation fraction. This parameter could potentially be used for evaluating the global systolic function of the left ventricle.</p

Segmentation and Grading of Sinus Images

This report discusses the research done and basic understanding of the proposed topic, which is Segementation and Grading of Sinus Images. The objective of the project is to experiment and explore the usage of wavelets to improve the flaws of the existing techniques. In this project, a trajectory-learning algorithm using contourlets is proposed to enhance the CT sinus image without sacrificing accuracy. The challenge in this project is to find the most favorable contourlets that will result in high accuracy

Image Automatic Categorisation using Selected Features Attained from Integrated Non-Subsampled Contourlet with Multiphase Level Sets

A framework of automatic detection and categorization of Breast Cancer (BC) biopsy images utilizing significant interpretable features is initially considered in discussed work. Appropriate efficient techniques are engaged in layout steps of the discussed framework. Different steps include 1.To emphasize the edge particulars of tissue structure; the distinguished Non-Subsampled Contourlet (NSC) transform is implemented. 2. For the demarcation of cells from background, k-means, Adaptive Size Marker Controlled Watershed, two proposed integrated methodologies were discussed. Proposed Method-II, an integrated approach of NSC and Multiphase Level Sets is preferred to other segmentation practices as it proves better performance 3. In feature extraction phase, extracted 13 shape morphology, 33 textural (includes 6 histogram, 22 Haralick’s, 3 Tamura’s, 2 Graylevel Run-Length Matrix,) and 2 intensity features from partitioned tissue images for 96 trained image

Uma abordagem multi-escala para segmentação de imagens

Orientador : Neucimar Jeronimo LeiteDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de ComputaçãoResumo: Neste trabalho abordamos o problema de segmentação de imagens através da sua representação multi-escala. Para tanto, consideramos a teoria do espaço-escala morfológico, recentemente introduzida na literatura, denominada MMDE (Multiscale Morphological DilationErosion). Este método, associado à LDA, reduz monotonicamente o número de extremos de uma imagem e, consequentemente, o número de regiões segmentadas, a partir de uma suavização da imagem original. No entanto, quando associado à segmentação de imagens, o espaço-escala MMDE apresenta dois grandes problemas: o deslocamento espacial da LDA ao longo das escalas e a dificuldade de se caracterizar o conjunto de extremos presente nos diferentes níveis de representação. O primeiro problema é abordado em nosso trabalho a partir de uma modificação homotópica da imagem. Para o espaço-escala MMDE é garantido que a posição e a altura dos mínimos (para escalas negativas) e dos máximos (para escalas positivas) são mantidas ao longo das escalas. Assim, esta propriedade permite que o conjunto de mínimos (máximos) obtidos em uma determinada escala seja utilizado como marcador num processo de reconstrução geodésica e segmentação. Garantida a preservação das estruturas da imagem, consideramos uma análise do modo como os seus extremos se fundem ao longo das escalas, e definimos um novo espaço-escala morfológico no qual a suavização é dada por uma operação idempotente. Para este espaço-escala, apresentamos critérios de controle monotônico da fusão dos extremos, obtendo um melhor conjunto de marcadores para a segmentação. Estes métodos consistem em definir, a partir de informações estritamente locais, pontos da imagem original que não devem ser transformados durante a suavização, evitando, assim, que extremos significativos se fundamAbstract: ln this work we consider the problem of image segmentation by means of a multiscale representation. This multiscale representation is based on a recently proposed morphological scale-space theory, the Multiscale Morphological Dilation-Erosion - MMDE, which associated to the watershed transform, reduces monotonicly the number of extrema of an image and, consequently, the number of its segmented regions. This method has two basic problems concerning image segmentation: the spatial shifting of the watershed lines throughout the scales and the di:fficulty to characterize the set of the image extrema across these different scales. The first problem is considered here by means of a homotopic modification of the original image. The MMDE approach states that the position and the amplitude of the extrema in the original and transformed images do not change across scales. This property allows us to use a set of these extrema, present at a certain scale, as marker in a homotopic modification and segmentation of the original image. Also, we consider an analysis of the way the image extrema merge across scales and introduce a new morphological scale-space in which the monotonic reduction of the image extrema is given by an idempotent operation. For this scale-space, We consider some monotonic-preserving merging criteria, taking into account only local information, which can be used to prevent significant image extrema from merging and to define better sets of markers for segmentationMestradoMestre em Ciência da Computaçã

Data mining based learning algorithms for semi-supervised object identification and tracking

Sensor exploitation (SE) is the crucial step in surveillance applications such as airport security and search and rescue operations. It allows localization and identification of movement in urban settings and can significantly boost knowledge gathering, interpretation and action. Data mining techniques offer the promise of precise and accurate knowledge acquisition techniques in high-dimensional data domains (and diminishing the “curse of dimensionality” prevalent in such datasets), coupled by algorithmic design in feature extraction, discriminative ranking, feature fusion and supervised learning (classification). Consequently, data mining techniques and algorithms can be used to refine and process captured data and to detect, recognize, classify, and track objects with predictable high degrees of specificity and sensitivity. Automatic object detection and tracking algorithms face several obstacles, such as large and incomplete datasets, ill-defined regions of interest (ROIs), variable scalability, lack of compactness, angular regions, partial occlusions, environmental variables, and unknown potential object classes, which work against their ability to achieve accurate real-time results. Methods must produce fast and accurate results by streamlining image processing, data compression and reduction, feature extraction, classification, and tracking algorithms. Data mining techniques can sufficiently address these challenges by implementing efficient and accurate dimensionality reduction with feature extraction to refine incomplete (ill-partitioning) data-space and addressing challenges related to object classification, intra-class variability, and inter-class dependencies. A series of methods have been developed to combat many of the challenges for the purpose of creating a sensor exploitation and tracking framework for real time image sensor inputs. The framework has been broken down into a series of sub-routines, which work in both series and parallel to accomplish tasks such as image pre-processing, data reduction, segmentation, object detection, tracking, and classification. These methods can be implemented either independently or together to form a synergistic solution to object detection and tracking. The main contributions to the SE field include novel feature extraction methods for highly discriminative object detection, classification, and tracking. Also, a new supervised classification scheme is presented for detecting objects in urban environments. This scheme incorporates both novel features and non-maximal suppression to reduce false alarms, which can be abundant in cluttered environments such as cities. Lastly, a performance evaluation of Graphical Processing Unit (GPU) implementations of the subtask algorithms is presented, which provides insight into speed-up gains throughout the SE framework to improve design for real time applications. The overall framework provides a comprehensive SE system, which can be tailored for integration into a layered sensing scheme to provide the war fighter with automated assistance and support. As more sensor technology and integration continues to advance, this SE framework can provide faster and more accurate decision support for both intelligence and civilian applications

General Adaptive Neighborhood Image Processing. Part I: Introduction and Theoretical Aspects

30 pagesInternational audienceThe so-called General Adaptive Neighborhood Image Processing (GANIP) approach is presented in a two parts paper dealing respectively with its theoretical and practical aspects. The Adaptive Neighborhood (AN) paradigm allows the building of new image processing transformations using context-dependent analysis. Such operators are no longer spatially invariant, but vary over the whole image with ANs as adaptive operational windows, taking intrinsically into account the local image features. This AN concept is here largely extended, using well-defined mathematical concepts, to that General Adaptive Neighborhood (GAN) in two main ways. Firstly, an analyzing criterion is added within the definition of the ANs in order to consider the radiometric, morphological or geometrical characteristics of the image, allowing a more significant spatial analysis to be addressed. Secondly, general linear image processing frameworks are introduced in the GAN approach, using concepts of abstract linear algebra, so as to develop operators that are consistent with the physical and/or physiological settings of the image to be processed. In this paper, the GANIP approach is more particularly studied in the context of Mathematical Morphology (MM). The structuring elements, required for MM, are substituted by GAN-based structuring elements, fitting to the local contextual details of the studied image. The resulting transforms perform a relevant spatially-adaptive image processing, in an intrinsic manner, that is to say without a priori knowledge needed about the image structures. Moreover, in several important and practical cases, the adaptive morphological operators are connected, which is an overwhelming advantage compared to the usual ones that fail to this property

Multiresolution signal decomposition schemes. Part 2: Morphological wavelets

In its original form, the wavelet transform is a linear tool. However, it has been increasingly recognized that nonlinear extensions are possible. A major impulse to the development of nonlinear wavelet transforms has been given by the introduction of the lifting scheme by Sweldens. The aim of this report, which is a sequel to a previous report devoted exclusively to the pyramid transform, is to present an axiomatic framework encompassing most existing linear and nonlinear wavelet decompositions. Furthermore, it introduces some, thus far unknown, wavelets based on mathematical morphology, such as the morphological Haar wavelet, both in one and two dimensions. A general and flexible approach for the construction of nonlinear (morphological) wavelets is provided by the lifting scheme. This paper discusses one example in considerable detail, the max-lifting scheme, which has the intriguing property that it preserves local maxima in a signal over a range of scales, depending on how local or global these maxima are