Cargando…

Automatic 3D neuron tracing using all-path pruning

Motivation: Digital reconstruction, or tracing, of 3D neuron structures is critical toward reverse engineering the wiring and functions of a brain. However, despite a number of existing studies, this task is still challenging, especially when a 3D microscopic image has low signal-to-noise ratio (SNR...

Descripción completa

Detalles Bibliográficos
Autores principales: Peng, Hanchuan, Long, Fuhui, Myers, Gene
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Oxford University Press 2011
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3117353/
https://www.ncbi.nlm.nih.gov/pubmed/21685076
http://dx.doi.org/10.1093/bioinformatics/btr237
_version_ 1782206320985767936
author Peng, Hanchuan
Long, Fuhui
Myers, Gene
author_facet Peng, Hanchuan
Long, Fuhui
Myers, Gene
author_sort Peng, Hanchuan
collection PubMed
description Motivation: Digital reconstruction, or tracing, of 3D neuron structures is critical toward reverse engineering the wiring and functions of a brain. However, despite a number of existing studies, this task is still challenging, especially when a 3D microscopic image has low signal-to-noise ratio (SNR) and fragmented neuron segments. Published work can handle these hard situations only by introducing global prior information, such as where a neurite segment starts and terminates. However, manual incorporation of such global information can be very time consuming. Thus, a completely automatic approach for these hard situations is highly desirable. Results: We have developed an automatic graph algorithm, called the all-path pruning (APP), to trace the 3D structure of a neuron. To avoid potential mis-tracing of some parts of a neuron, an APP first produces an initial over-reconstruction, by tracing the optimal geodesic shortest path from the seed location to every possible destination voxel/pixel location in the image. Since the initial reconstruction contains all the possible paths and thus could contain redundant structural components (SC), we simplify the entire reconstruction without compromising its connectedness by pruning the redundant structural elements, using a new maximal-covering minimal-redundant (MCMR) subgraph algorithm. We show that MCMR has a linear computational complexity and will converge. We examined the performance of our method using challenging 3D neuronal image datasets of model organisms (e.g. fruit fly). Availability: The software is available upon request. We plan to eventually release the software as a plugin of the V3D-Neuron package at http://penglab.janelia.org/proj/v3d. Contact: pengh@janelia.hhmi.org
format Online
Article
Text
id pubmed-3117353
institution National Center for Biotechnology Information
language English
publishDate 2011
publisher Oxford University Press
record_format MEDLINE/PubMed
spelling pubmed-31173532011-06-17 Automatic 3D neuron tracing using all-path pruning Peng, Hanchuan Long, Fuhui Myers, Gene Bioinformatics Ismb/Eccb 2011 Proceedings Papers Committee July 17 to July 19, 2011, Vienna, Austria Motivation: Digital reconstruction, or tracing, of 3D neuron structures is critical toward reverse engineering the wiring and functions of a brain. However, despite a number of existing studies, this task is still challenging, especially when a 3D microscopic image has low signal-to-noise ratio (SNR) and fragmented neuron segments. Published work can handle these hard situations only by introducing global prior information, such as where a neurite segment starts and terminates. However, manual incorporation of such global information can be very time consuming. Thus, a completely automatic approach for these hard situations is highly desirable. Results: We have developed an automatic graph algorithm, called the all-path pruning (APP), to trace the 3D structure of a neuron. To avoid potential mis-tracing of some parts of a neuron, an APP first produces an initial over-reconstruction, by tracing the optimal geodesic shortest path from the seed location to every possible destination voxel/pixel location in the image. Since the initial reconstruction contains all the possible paths and thus could contain redundant structural components (SC), we simplify the entire reconstruction without compromising its connectedness by pruning the redundant structural elements, using a new maximal-covering minimal-redundant (MCMR) subgraph algorithm. We show that MCMR has a linear computational complexity and will converge. We examined the performance of our method using challenging 3D neuronal image datasets of model organisms (e.g. fruit fly). Availability: The software is available upon request. We plan to eventually release the software as a plugin of the V3D-Neuron package at http://penglab.janelia.org/proj/v3d. Contact: pengh@janelia.hhmi.org Oxford University Press 2011-07-01 2011-06-14 /pmc/articles/PMC3117353/ /pubmed/21685076 http://dx.doi.org/10.1093/bioinformatics/btr237 Text en © The Author(s) 2011. Published by Oxford University Press. http://creativecommons.org/licenses/by-nc/2.5 This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/2.5), which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.
spellingShingle Ismb/Eccb 2011 Proceedings Papers Committee July 17 to July 19, 2011, Vienna, Austria
Peng, Hanchuan
Long, Fuhui
Myers, Gene
Automatic 3D neuron tracing using all-path pruning
title Automatic 3D neuron tracing using all-path pruning
title_full Automatic 3D neuron tracing using all-path pruning
title_fullStr Automatic 3D neuron tracing using all-path pruning
title_full_unstemmed Automatic 3D neuron tracing using all-path pruning
title_short Automatic 3D neuron tracing using all-path pruning
title_sort automatic 3d neuron tracing using all-path pruning
topic Ismb/Eccb 2011 Proceedings Papers Committee July 17 to July 19, 2011, Vienna, Austria
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3117353/
https://www.ncbi.nlm.nih.gov/pubmed/21685076
http://dx.doi.org/10.1093/bioinformatics/btr237
work_keys_str_mv AT penghanchuan automatic3dneurontracingusingallpathpruning
AT longfuhui automatic3dneurontracingusingallpathpruning
AT myersgene automatic3dneurontracingusingallpathpruning