{"title":"医学图像中甜甜圈形状物体的同时边界分割。","authors":"Xiaodong Wu, Michael Merickel","doi":"10.7155/jgaa.00143","DOIUrl":null,"url":null,"abstract":"<p><p>Image segmentation with specific constraints has found applications in several areas such as biomedical image analysis and data mining. In this paper, we study the problem of simultaneous detection of both borders of a doughnut-shaped and smooth objects in 2-D medical images. Image objects of that shape are often studied in medical applications. We present an O(IJU(U-L)logJUlog(U-L)) time algorithm, where the size of the input 2-D image is I x J, M is the smoothness parameter with 1 </= M </= J, and L and U are the thickness parameters specifying the thickness between two border contours of a doughnut-shaped object. Previous approaches for solving this segmentation problem are computationally expensive and/or need a lot of user interference. Our algorithm improves the straightforward dynamic programming algorithm by a factor of O(J(U-L)M2UlogJUlog(U-L)). We explore some interesting observations, which make possible to apply the divide-and-conquer strategy combined with dynamic programming. Our algorithm is also based on computing optimal paths in an implicitly represented graph.</p>","PeriodicalId":35667,"journal":{"name":"Journal of Graph Algorithms and Applications","volume":"11 1","pages":"215-237"},"PeriodicalIF":0.0000,"publicationDate":"2007-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2768307/pdf/nihms75919.pdf","citationCount":"3","resultStr":"{\"title\":\"Simultaneous Border Segmentation of Doughnut-Shaped Objects in Medical Images.\",\"authors\":\"Xiaodong Wu, Michael Merickel\",\"doi\":\"10.7155/jgaa.00143\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Image segmentation with specific constraints has found applications in several areas such as biomedical image analysis and data mining. In this paper, we study the problem of simultaneous detection of both borders of a doughnut-shaped and smooth objects in 2-D medical images. Image objects of that shape are often studied in medical applications. We present an O(IJU(U-L)logJUlog(U-L)) time algorithm, where the size of the input 2-D image is I x J, M is the smoothness parameter with 1 </= M </= J, and L and U are the thickness parameters specifying the thickness between two border contours of a doughnut-shaped object. Previous approaches for solving this segmentation problem are computationally expensive and/or need a lot of user interference. Our algorithm improves the straightforward dynamic programming algorithm by a factor of O(J(U-L)M2UlogJUlog(U-L)). We explore some interesting observations, which make possible to apply the divide-and-conquer strategy combined with dynamic programming. Our algorithm is also based on computing optimal paths in an implicitly represented graph.</p>\",\"PeriodicalId\":35667,\"journal\":{\"name\":\"Journal of Graph Algorithms and Applications\",\"volume\":\"11 1\",\"pages\":\"215-237\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2768307/pdf/nihms75919.pdf\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graph Algorithms and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.7155/jgaa.00143\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Algorithms and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7155/jgaa.00143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 3
摘要
具有特定约束的图像分割在生物医学图像分析和数据挖掘等多个领域都有应用。本文研究了二维医学图像中甜甜圈形状和光滑物体边界的同时检测问题。这种形状的图像对象经常在医学应用中进行研究。我们提出了一种O(IJU(U-L)logJUlog(U-L))时间算法，其中输入二维图像的大小为I x J, M为平滑参数1
Simultaneous Border Segmentation of Doughnut-Shaped Objects in Medical Images.
Image segmentation with specific constraints has found applications in several areas such as biomedical image analysis and data mining. In this paper, we study the problem of simultaneous detection of both borders of a doughnut-shaped and smooth objects in 2-D medical images. Image objects of that shape are often studied in medical applications. We present an O(IJU(U-L)logJUlog(U-L)) time algorithm, where the size of the input 2-D image is I x J, M is the smoothness parameter with 1
期刊介绍：
The Journal of Graph Algorithms and Applications (JGAA) is a peer-reviewed scientific journal devoted to the publication of high-quality research papers on the analysis, design, implementation, and applications of graph algorithms. JGAA is supported by distinguished advisory and editorial boards, has high scientific standards and is distributed in electronic form. JGAA is a gold open access journal that charges no author fees. Topics of interest for JGAA include but are not limited to: Design and analysis of graph algorithms: exact and approximation graph algorithms; centralized and distributed graph algorithms; static and dynamic graph algorithms; internal- and external-memory graph algorithms; sequential and parallel graph algorithms; deterministic and randomized graph algorithms. Experiences with graph and network algorithms: animations; experimentations; implementations. Applications of graph and network algorithms: biomedical informatics; computational biology; computational geometry; computer graphics; computer-aided design; computer and interconnection networks; constraint systems; databases; economic networks; graph drawing; graph embedding and layout; knowledge representation; multimedia; social networks; software engineering; telecommunication networks; user interfaces and visualization; VLSI circuits.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
