• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

用于稀疏形状骨架化的自组织映射。

Self-organizing maps for the skeletonization of sparse shapes.

作者信息

Singh R, Cherkassky V, Papanikolopoulos N

机构信息

Artificial Intelligence, Robotics, and Vision Laboratory, Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN 55455, USA.

出版信息

IEEE Trans Neural Netw. 2000;11(1):241-8. doi: 10.1109/72.822527.

DOI:10.1109/72.822527
PMID:18249756
Abstract

This paper presents a method for computing the skeleton of planar shapes and objects which exhibit sparseness (lack of connectivity), within their image regions. Such sparseness in images may occur due to poor lighting conditions, incorrect thresholding or image subsampling. Furthermore, in document image analysis, sparse shapes are characteristic of texts faded due to aging and/or poor ink quality. Due to the lack of pixel level connectivity, conventional skeletonization techniques perform poorly on such (sparse) shapes. Given the pixel distribution for a shape, the proposed method involves an iterative evolution of a piecewise-linear approximation of the shape skeleton by using a minimum spanning tree-based self-organizing map (SOM). By constraining the SOM to lie on the edges of the Delaunay triangulation of the shape distribution, the adjacency relationships between regions in the shape are detected and used in the evolution of the skeleton. The SOM, on convergence, gives the final skeletal shape. The skeletonization is invariant to Euclidean transformations. The potential of the method is demonstrated on a variety of sparse shapes from different application domains.

摘要

本文提出了一种计算平面形状和物体骨架的方法,这些形状和物体在其图像区域内呈现稀疏性(缺乏连通性)。图像中的这种稀疏性可能是由于光照条件差、阈值设置不正确或图像子采样导致的。此外,在文档图像分析中,稀疏形状是由于老化和/或墨水质量差而褪色的文本的特征。由于缺乏像素级连通性,传统的骨架化技术在处理此类(稀疏)形状时效果不佳。给定一个形状的像素分布,该方法通过使用基于最小生成树的自组织映射(SOM)对形状骨架的分段线性近似进行迭代演化。通过约束SOM位于形状分布的德劳内三角剖分的边上,检测形状中区域之间的邻接关系并将其用于骨架的演化。SOM收敛时给出最终的骨架形状。骨架化对欧几里得变换具有不变性。该方法的潜力在来自不同应用领域的各种稀疏形状上得到了证明。

相似文献

1
Self-organizing maps for the skeletonization of sparse shapes.用于稀疏形状骨架化的自组织映射。
IEEE Trans Neural Netw. 2000;11(1):241-8. doi: 10.1109/72.822527.
2
Shape indexing using self-organizing maps.使用自组织映射的形状索引
IEEE Trans Neural Netw. 2002;13(4):835-40. doi: 10.1109/TNN.2002.1021884.
3
Skeletonization of ribbon-like shapes based on regularity and singularity analyses.基于规则性和奇异性分析的带状形状骨架化
IEEE Trans Syst Man Cybern B Cybern. 2001;31(3):401-7. doi: 10.1109/3477.931528.
4
Exploiting data topology in visualization and clustering of self-organizing maps.在自组织映射的可视化与聚类中利用数据拓扑结构。
IEEE Trans Neural Netw. 2009 Apr;20(4):549-62. doi: 10.1109/TNN.2008.2005409. Epub 2009 Feb 18.
5
Topology-based hierarchical clustering of self-organizing maps.基于拓扑结构的自组织映射分层聚类
IEEE Trans Neural Netw. 2011 Mar;22(3):474-85. doi: 10.1109/TNN.2011.2107527.
6
New adaptive color quantization method based on self-organizing maps.基于自组织映射的新型自适应颜色量化方法。
IEEE Trans Neural Netw. 2005 Jan;16(1):237-49. doi: 10.1109/TNN.2004.836543.
7
MToS: A Tree of Shapes for Multivariate Images.MToS:一种用于多元图像的形状树。
IEEE Trans Image Process. 2015 Dec;24(12):5330-42. doi: 10.1109/TIP.2015.2480599. Epub 2015 Sep 22.
8
Perceptually stable regions for arbitrary polygons.任意多边形的感知稳定区域。
IEEE Trans Syst Man Cybern B Cybern. 2003;33(1):165-71. doi: 10.1109/TSMCB.2003.808189.
9
Analysis of neoplastic lesions in magnetic resonance imaging using self-organizing maps.使用自组织映射对磁共振成像中的肿瘤性病变进行分析。
J Neurol Sci. 2015 Dec 15;359(1-2):78-83. doi: 10.1016/j.jns.2015.10.032. Epub 2015 Oct 23.
10
TASOM: a new time adaptive self-organizing map.TASOM:一种新的时间自适应自组织映射
IEEE Trans Syst Man Cybern B Cybern. 2003;33(2):271-82. doi: 10.1109/TSMCB.2003.810442.

引用本文的文献

1
An efficient and straightforward online vector quantization method for a data stream through remove-birth updating.一种通过移除-诞生更新实现的高效且直接的数据流在线矢量量化方法。
PeerJ Comput Sci. 2024 Jan 8;10:e1789. doi: 10.7717/peerj-cs.1789. eCollection 2024.
2
Reconstructing the Temporal Progression of Biological Data Using Cluster Spanning Trees.使用聚类生成树重建生物数据的时间进程
IEEE Trans Nanobioscience. 2017 Mar;16(2):140-147. doi: 10.1109/TNB.2017.2667402. Epub 2017 Feb 9.