5 research outputs found
A Comparative Study of Different Blood Vessel Detection on Retinal Images
Detection of blood vessel plays an important stage in different medical areas, such as ophthalmology, oncology, neurosurgery, and laryngology. The significance of the vessel analysis was helped by the continuous overview in clinical studies of new medical technologies intended for improving the visualization of vessels. In this paper, several local segmentation techniques which include such as Vascular Tree Extraction, Tyler L. Coye and Line tracking, Kirsch’s Template and Fuzzy C Mean methods were studied. The main objective is to determine the best approaches in order to detect the blood vessel on the degraded retinal input image (DRIVE dataset). A few Image Quality Assessment (IQA) was obtained to prove the effectiveness of each detection methods. Overall, the result of sensitivity highest came from Kirsch Templates (96.928), while specificity from Fuzzy C means (77.573). However, in term of accuracy average, the Line Tracking method is more successful compared to the other methods
Flexible learning-free segmentation and reconstruction of neural volumes
Imaging is a dominant strategy for data collection in neuroscience, yielding stacks of images that often scale to gigabytes of data for a single experiment. Machine learning algorithms from computer vision can serve as a pair of virtual eyes that tirelessly processes these images, automatically detecting and identifying microstructures. Unlike learning methods, our Flexible Learning-free Reconstruction of Imaged Neural volumes (FLoRIN) pipeline exploits structure-specific contextual clues and requires no training. This approach generalizes across different modalities, including serially-sectioned scanning electron microscopy (sSEM) of genetically labeled and contrast enhanced processes, spectral confocal reflectance (SCoRe) microscopy, and high-energy synchrotron X-ray microtomography (μCT) of large tissue volumes. We deploy the FLoRIN pipeline on newly published and novel mouse datasets, demonstrating the high biological fidelity of the pipeline’s reconstructions. FLoRIN reconstructions are of sufficient quality for preliminary biological study, for example examining the distribution and morphology of cells or extracting single axons from functional data. Compared to existing supervised learning methods, FLoRIN is one to two orders of magnitude faster and produces high-quality reconstructions that are tolerant to noise and artifacts, as is shown qualitatively and quantitatively
A Generalized Framework for Agglomerative Clustering of Signed Graphs applied to Instance Segmentation
We propose a novel theoretical framework that generalizes algorithms for
hierarchical agglomerative clustering to weighted graphs with both attractive
and repulsive interactions between the nodes. This framework defines GASP, a
Generalized Algorithm for Signed graph Partitioning, and allows us to explore
many combinations of different linkage criteria and cannot-link constraints. We
prove the equivalence of existing clustering methods to some of those
combinations, and introduce new algorithms for combinations which have not been
studied. An extensive comparison is performed to evaluate properties of the
clustering algorithms in the context of instance segmentation in images,
including robustness to noise and efficiency. We show how one of the new
algorithms proposed in our framework outperforms all previously known
agglomerative methods for signed graphs, both on the competitive CREMI 2016 EM
segmentation benchmark and on the CityScapes dataset.Comment: 19 pages, 8 figures, 6 table
Doctor of Philosophy in Computing
dissertationImage segmentation is the problem of partitioning an image into disjoint segments that are perceptually or semantically homogeneous. As one of the most fundamental computer vision problems, image segmentation is used as a primary step for high-level vision tasks, such as object recognition and image understanding, and has even wider applications in interdisciplinary areas, such as longitudinal brain image analysis. Hierarchical models have gained popularity as a key component in image segmentation frameworks. By imposing structures, a hierarchical model can efficiently utilize features from larger image regions and make optimal inference for final segmentation feasible. We develop a hierarchical merge tree (HMT) model for image segmentation. Motivated by the application in large-scale segmentation of neuronal structures in electron microscopy (EM) images, our model provides a compact representation of region merging hypotheses and utilizes higher order information for efficient segmentation inference. Taking advantage of supervised learning, our model is free from parameter tuning and outperforms previous state-of-the-art methods on both two-dimensional (2D) and three-dimensional EM image data sets without any change. We also extend HMT to the hierarchical merge forest (HMF) model. By identifying region correspondences, HMF utilizes inter-section information to correct intra-section errors and improves 2D EM segmentation accuracy. HMT is a generic segmentation model. We demonstrate this by applying it to natural image segmentation problems. We propose a constrained conditional model formulation with a globally optimal inference algorithm for HMT and an iterative merge tree sampling algorithm that significantly improves its performance. Experimental results show our approach achieves state-of-the-art accuracy for object-independent image segmentation. Finally, we propose a semi-supervised HMT (SSHMT) model to reduce the high demand for labeled data by supervised learning. We introduce a differentiable unsupervised loss term that enforces consistent boundary predictions and develop a Bayesian learning model that combines supervised and unsupervised information. We show that with a very small amount of labeled data, SSHMT consistently performs close to the supervised HMT with full labeled data sets and significantly outperforms HMT trained with the same labeled subsets