Determining the branchings of 3D structures from respective 2D projections

J. Leandro, R. M. C. Junior, L. Costa
{"title":"Determining the branchings of 3D structures from respective 2D projections","authors":"J. Leandro, R. M. C. Junior, L. Costa","doi":"10.1109/SIBGRAPI.2006.12","DOIUrl":null,"url":null,"abstract":"This work describes a new framework for automatic extraction of 2D branching structures images obtained from 3D shapes, such as neurons and retinopathy images. The majority of methods for neuronal cell shape analysis that are based on the 2D contours of cells fall short of properly characterizing such cells because crossings among neuronal processes constrain the access of contour following algorithms to the innermost regions of the cell. The framework presented in this article addresses, possibly for the first time, the problem of determining the continuity along crossings, therefore granting to the contour following algorithm full access to all processes of the neuronal cell under analysis. First, the raw image is preprocessed so as to obtain an 8-connected, one-pixel wide skeleton as well as a set of seed pixels for each subtree and all the branching/crossing regions. Then, for each seed pixel, the algorithm labels all valid neighbors, until a branching/crossing region is reached, when a decision about the proper continuation is taken based on the tangent continuity. The algorithm has shown robustness for images with parallel segments and low densities of branching/crossing densities. The problem of too high densities of branching/crossing regions can be addressed by using a suitable data structure. Successful experimental results using real data (neural cell images) are presented","PeriodicalId":253871,"journal":{"name":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","volume":" 40","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 19th Brazilian Symposium on Computer Graphics and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBGRAPI.2006.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This work describes a new framework for automatic extraction of 2D branching structures images obtained from 3D shapes, such as neurons and retinopathy images. The majority of methods for neuronal cell shape analysis that are based on the 2D contours of cells fall short of properly characterizing such cells because crossings among neuronal processes constrain the access of contour following algorithms to the innermost regions of the cell. The framework presented in this article addresses, possibly for the first time, the problem of determining the continuity along crossings, therefore granting to the contour following algorithm full access to all processes of the neuronal cell under analysis. First, the raw image is preprocessed so as to obtain an 8-connected, one-pixel wide skeleton as well as a set of seed pixels for each subtree and all the branching/crossing regions. Then, for each seed pixel, the algorithm labels all valid neighbors, until a branching/crossing region is reached, when a decision about the proper continuation is taken based on the tangent continuity. The algorithm has shown robustness for images with parallel segments and low densities of branching/crossing densities. The problem of too high densities of branching/crossing regions can be addressed by using a suitable data structure. Successful experimental results using real data (neural cell images) are presented
从各自的2D投影确定3D结构的分支
这项工作描述了一个新的框架,用于自动提取从3D形状获得的2D分支结构图像,如神经元和视网膜病变图像。大多数基于细胞二维轮廓的神经元细胞形状分析方法都无法正确表征这些细胞,因为神经元过程之间的交叉限制了轮廓跟踪算法对细胞最内层区域的访问。本文提出的框架可能是第一次解决沿交叉点确定连续性的问题,从而允许轮廓跟踪算法完全访问所分析的神经元细胞的所有过程。首先,对原始图像进行预处理,得到一个8连通的1像素宽的骨架,以及每个子树和所有分支/交叉区域的一组种子像素。然后,对于每个种子像素,算法标记所有有效的邻居,直到到达分支/交叉区域,此时根据切线连续性决定适当的延拓。该算法对具有平行段和低分支/交叉密度的图像具有较好的鲁棒性。分支/交叉区域密度过高的问题可以通过使用合适的数据结构来解决。利用真实数据(神经细胞图像),给出了成功的实验结果
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信