Active Learning and Proofreading for Delineation of Curvilinear Structures

Many state-of-the-art delineation methods rely on supervised machine learning algorithms. As a result, they require manually annotated training data, which is tedious to obtain. Furthermore, even minor classification errors may significantly affect the topology of the final result. In this paper we propose a generic approach to addressing both of these problems by taking into account the influence of a potential misclassification on the resulting delineation. In an Active Learning context, we identify parts of linear structures that should be annotated first in order to train a classifier effectively. In a proofreading context, we similarly find regions of the resulting reconstruction that should be verified in priority to obtain a nearly-perfect result. In both cases, by focusing the attention of the human expert on potential classification mistakes which are the most critical parts of the delineation, we reduce the amount of required supervision. We demonstrate the effectiveness of our approach on microscopy images depicting blood vessels and neurons

Improved Automatic Centerline Tracing for Dendritic and Axonal Structures

Centerline tracing in dendritic structures acquired from confocal images of neurons is an essential tool for the construction of geometrical representations of a neuronal network from its coarse scale up to its fine scale structures. In this paper, we propose an algorithm for centerline extraction that is both highly accurate and computationally efficient. The main novelties of the proposed method are (1) the use of a small set of Multiscale Isotropic Laplacian filters, acting as self-steerable filters, for a quick and efficient binary segmentation of dendritic arbors and axons; (2) an automated centerline seed points detection method based on the application of a simple 3D finite-length filter. The performance of this algorithm, which is validated on data from the DIADEM set appears to be very competitive when compared with other state-of-the-art algorithms.National Science Foundation/[1320910]/NSF-DMS/Estados UnidosNational Science Foundation/[1008900]/NSF-DMS/Estados UnidosNational Science Foundation/[1005799]/NSF-DMS/Estados UnidosNorman Hackerman Advanced Research Program/[003652-0136-2009]/NHARP/Estados UnidosUCR::Vicerrectoría de Docencia::Ciencias Básicas::Facultad de Ciencias::Escuela de Matemátic