Watershed segmentation with boundary curvature ratio based merging criterion

This paper proposes to incorporate boundary curvature ratio, region homogeneity and boundary smoothness into a single new merging criterion to improve the oversegmentation of marker-controlled watershed segmentation algorithm. The result is a more refined segmentation result with smooth boundaries and regular shapes. To pursue a final segmentation result with higher inter-variance and lower intra-variance, an optimal number of segments could be self-determined by a proposed formula. Experimental results are presented to demonstrate the merits of this method.postprintThe 9th IASTED International Conference on Signal and Image Processing (SIP 2007), Honolulu, HI., 20-22 August 2007. In Proceedings of SIP, 2007, p. 7-1

Merging toward natural clusters

To findout how many clusters exist in a sample set is an old yet unsolved problem in unsupervised clustering. This problem inevitably occurs in region merging/growing, a well studied and popular technique in image segmentation. Region merging usually needs a stop criterion. The stop criterion is not automatically determined and often has to be set manually to arrive at a sensible segmentation, which is rather difficult for natural images. To address this problem, we present a robust stop criterion that is based on a novel distinctness predicate for adjacent regions. The predicate discerns distinct regions by examining the evidence of the boundary between neighboring regions. Requiring that every region should be distinct from each other, the proposed method is able to choose a stop point where a natural partition is most likely. Under a region merging framework, we demonstrate the effectiveness of the stop criterion using two merging criterion: one based on optimizing a global functional, and another based on a local criterion. Experimental results and comparison are given at the end. © 2009 Society of Photo-Optical Instrumentation Engineers.published_or_final_versio

Detection algorithms for spatial data

This dissertation addresses the problem of anomaly detection in spatial data. The problem of landmine detection in airborne spatial data is chosen as the specific detection scenario. The first part of the dissertation deals with the development of a fast algorithm for kernel-based non-linear anomaly detection in the airborne spatial data. The original Kernel RX algorithm, proposed by Kwon et al. [2005a], suffers from the problem of high computational complexity, and has seen limited application. With the aim to reduce the computational complexity, a reformulated version of the Kernel RX, termed the Spatially Weighted Kernel RX (SW-KRX), is presented. It is shown that under this reformulation, the detector statistics can be obtained directly as a function of the centered kernel Gram matrix. Subsequently, a methodology for the fast computation of the centered kernel Gram matrix is proposed. The key idea behind the proposed methodology is to decompose the set of image pixels into clusters, and expediting the computations by approximating the effect of each cluster as a whole. The SW-KRX algorithm is implemented for a special case, and comparative results are compiled for the SW-KRX vis-à-vis the RX anomaly detector. In the second part of the dissertation, a detection methodology for buried mine detection is presented. The methodology is based on extraction of color texture information using cross-co-occurrence features. A feature selection methodology based on Bhattacharya coefficients and principal feature analysis is proposed and detection results with different feature-based detectors are presented, to demonstrate the effectiveness of the proposed methodology in the extraction of useful discriminatory information --Abstract, page iii

Development of a High-Resolution Land Cover Dataset to Support Integrated Water Resources Planning and Management in Northern Utah

Integrated planning and management approaches, including bioregional planning and integrated water resources planning, are comprehensive strategies that strive to balance the sustainability of natural resources and the integrity of ecosystem processes with human development and activities. Implementation of integrated plans and programs remains complicated. However, geospatial technologies, such as geographic information systems and remote sensing, can significantly enhance planning and management processes. Through a United States Environmental Protection Agency Region 8 Wetland Program Development Grant, a high-resolution land cover dataset, with a primary emphasis on mapping and quantifying impervious surfaces, was developed for three watershed sub-basins in northern Utah - Lower Bear-Malad, Lower Weber, and Jordan - to support integrated water resources planning and management. This high-resolution land cover dataset can serve as an indicator of cumulative stress from urbanization; it can support the development of ecologically relevant metrics that can be integrated into watershed health and wetland condition assessments; it can provide general assessments of watershed condition; and it can support the identification of sites in need of restoration and protection

Nephroblastoma in MRI Data

The main objective of this work is the mathematical analysis of nephroblastoma in MRI sequences. At the beginning we provide two different datasets for segmentation and classification. Based on the first dataset, we analyze the current clinical practice regarding therapy planning on the basis of annotations of a single radiologist. We can show with our benchmark that this approach is not optimal and that there may be significant differences between human annotators and even radiologists. In addition, we demonstrate that the approximation of the tumor shape currently used is too coarse granular and thus prone to errors. We address this problem and develop a method for interactive segmentation that allows an intuitive and accurate annotation of the tumor. While the first part of this thesis is mainly concerned with the segmentation of Wilms’ tumors, the second part deals with the reliability of diagnosis and the planning of the course of therapy. The second data set we compiled allows us to develop a method that dramatically improves the differential diagnosis between nephroblastoma and its precursor lesion nephroblastomatosis. Finally, we can show that even the standard MRI modality for Wilms’ tumors is sufficient to estimate the developmental tendencies of nephroblastoma under chemotherapy

Unsupervised learning for long-term autonomy

This thesis investigates methods to enable a robot to build and maintain an environment model in an automatic manner. Such capabilities are especially important in long-term autonomy, where robots operate for extended periods of time without human intervention. In such scenarios we can no longer assume that the environment and the models will remain static. Rather changes are expected and the robot needs to adapt to the new, unseen, circumstances automatically. The approach described in this thesis is based on clustering the robot’s sensing information. This provides a compact representation of the data which can be updated as more information becomes available. The work builds on affinity propagation (Frey and Dueck, 2007), a recent clustering method which obtains high quality clusters while only requiring similarities between pairs of points, and importantly, selecting the number of clusters automatically. This is essential for real autonomy as we typically do not know “a priori” how many clusters best represent the data. The contributions of this thesis a three fold. First a self-supervised method capable of learning a visual appearance model in long-term autonomy settings is presented. Secondly, affinity propagation is extended to handle multiple sensor modalities, often occurring in robotics, in a principle way. Third, a method for joint clustering and outlier selection is proposed which selects a user defined number of outlier while clustering the data. This is solved using an extension of affinity propagation as well as a Lagrangian duality approach which provides guarantees on the optimality of the solution

The Preferential Loss of Small Geographically Isolated Wetlands on Prairie Landscapes

Reliable estimates of wetland loss require improved wetland inventories and effective monitoring programs. To improve upon current wetland inventories, a novel method for mapping wetlands using an automated object-based approach was developed for a regional watershed located in central Alberta. This approach used digital terrain objects derived from Light Detection and Ranging (LiDAR) data for which 130,157 wetlands were identified. Using this LiDAR derived wetland inventory, wetland loss estimates (% number and % area) were obtained by applying a wetland area vs. frequency function to the wetland inventory for the watershed. Using this power law, it was found that historically, there has been a 69.3% number loss and a 9.96% area loss when we accounted for mixed pixels. When we removed any wetland less than the estimated minimum mapping unit (0.02 ha), a 16.17% number and a 2.56% area loss within the watershed was estimated. This wetland loss is a concern as it is concomitant with a loss of ecosystem services

Quantitative Analysis of Ultrasound Images of the Preterm Brain

In this PhD new algorithms are proposed to better understand and diagnose white matter damage in the preterm Brain. Since Ultrasound imaging is the most suited modality for the inspection of brain pathologies in very low birth weight infants we propose multiple techniques to assist in what is called Computer-Aided Diagnosis. As a main result we are able to increase the qualitative diagnosis from a 70% detectability to a 98% quantitative detectability

Superpixel lattices

Superpixels are small image segments that are used in popular approaches to object detection and recognition problems. The superpixel approach is motivated by the observation that pixels within small image segments can usually be attributed the same label. This allows a superpixel representation to produce discriminative features based on data dependent regions of support. The reduced set of image primitives produced by superpixels can also be exploited to improve the efficiency of subsequent processing steps. However, it is common for the superpixel representation to have a different graph structure from the original pixel representation of the image. The first part of the thesis argues that a number of desirable properties of the pixel representation should be maintained by superpixels and that this is not possible with existing methods. We propose a new representation, the superpixel lattice, and demonstrate its advantages. The second part of the thesis investigates incorporating a priori information into superpixel segmentations. We learn a probabilistic model that describes the spatial density of object boundaries in the image. We demonstrate our approach using road scene data and show that our algorithm successfully exploits the spatial distribution of object boundaries to improve the superpixel segmentation. The third part of the thesis presents a globally optimal solution to our superpixel lattice problem in either the horizontal or vertical direction. The solution makes use of a Markov Random Field formulation where the label field is guaranteed to be a set of ordered layers. We introduce an iterative algorithm that uses this framework to learn colour distributions across an image in an unsupervised manner. We conclude that our approach achieves comparable or better performance than competing methods and that it confers several additional advantages