{"version":1,"kind":"Article","sha256":"","slug":"661","location":"","dependencies":[],"doi":"10.54294/mtnmn6","thumbnail":"https://pub.desci.com/ipfs/bafkreiaezo4vwrcqp2yjcldu2uwhbdvkqzxhvzspbdplt4cwctfywyjuo4","frontmatter":{"title":"Nearly automatic vessels segmentation using graph-based energy minimization","abstract":"We present a nearly automatic tool for the accurate segmentation\nof vascular structures in volumetric CTA images. Its inputs are a start\nand an end seed points inside the vessel. The two-step graph-based energy\nminimization method starts by computing the weighted shortest path between\nthe vessel seed endpoints based on local image and seed intensities and\nvessel path geometric characteristics. It then automatically defines a\nVessel Region Of Interest (VROI) from the shortest path and the estimated\nvessel radius, and extracts the vessels boundaries by minimize the energy\non a corresponding graph cut.\n\nWe evaluate our method within the 2009 MICCAI 3D Segmentation Challenge for\nClinical Applications Workshop. Experimental results on the 46 carotid\nbifurcations from clinical CTAs, compared to ground-truth genrated by\naveraging three manual annotations, \nyield an average symmetric surface distance of\n0.83mm and a Dice similarity of 81.8%, with only three input seeds.\nThese results indicates that our method is easy to use, produces accurate\nsegmentations of vessels lumen, and is robust to intensity variations\ninside the vessels, radius changes, bifurcations, and nearby anatomical\nstructures with similar intensity values.","license":"You are licensing your work to Kitware Inc. under the\nCreative Commons Attribution License Version 3.0.\n\nKitware Inc. agrees to the following:\n\nKitware is free\n * to copy, distribute, display, and perform the work\n * to make derivative works\n * to make commercial use of the work\n\nUnder the following conditions:\n\\\"by Attribution\\\" - Kitware must attribute the work in the manner specified by the author or licensor.\n\n * For any reuse or distribution, they must make clear to others the license terms of this work.\n * Any of these conditions can be waived if they get permission from the copyright holder.\n\nYour fair use and other rights are in no way affected by the above.\n\nThis is a human-readable summary of the Legal Code (the full license) available at\nhttp://creativecommons.org/licenses/by/3.0/legalcode","keywords":["Carotid arteries","Shortest path","graph-cut","Segmentation","CTA"],"authors":[{"name":"Freiman, Moti","email":"freiman@cs.huji.ac.il","affiliations":["Hebrew University"],"corresponding":true},{"name":"Frank, Judith","affiliations":[]},{"name":"Weizman, Lior","email":"lweizm45@cs.huji.ac.il","affiliations":[]},{"name":"Nammer, Einav","affiliations":[]},{"name":"Shilon, Ofek","affiliations":[]},{"name":"Joskowicz, Leo","email":"josko@cs.huji.ac.il","affiliations":[]},{"name":"Sosna, Jacob","affiliations":[]}],"date_submitted":"2009-08-03 00:40:55","external_publication_id":661,"revision_cids":["bafkreiaaibiidwlf7xgfijqkty6weuqiwkpqqcsgixh62urmx22drkec24"],"thumbnail":"https://pub.desci.com/ipfs/bafkreiaezo4vwrcqp2yjcldu2uwhbdvkqzxhvzspbdplt4cwctfywyjuo4"},"mdast":{"type":"root"},"downloads":[{"url":"https://ipfs.desci.com/ipfs/bafkreifnuylrsalzdy5fwravsnlmjfkdbbuuebcvubrsogzvwqydgdhgey","title":"root/insight-journal-metadata.json","filename":"insight-journal-metadata.json","extra":{"size_bytes":7658,"type":"file"}},{"url":"https://dweb.link/ipfs/bafybeicdx3d6xx5otferdru47x42lgcwzjfluhmrsgnaze6drid2tlyizu","title":"root/article.pdf","filename":"article.pdf","extra":{"size_bytes":1052203,"type":"file"}}],"references":{"cite":{"order":["ref1","ref2","ref3","ref4","ref5","ref6","ref7","ref8","ref9","ref10","ref11","ref12"]},"data":{"ref1":{"label":"ref1","enumerator":"1","html":"Computer-Aided Diagnosis+In Med. Imaging+2008+6915+S. Bock+H.O. Peitgen"},"ref2":{"label":"ref2","enumerator":"2","url":"https://doi.org/10.1007/s11263-006-7934-5","html":"Graph cuts and efficient n-d image segmentation+Int. J. of Comp. Vision+70+2+109+131+2006+Y. Boykov+G. Funka-Lea"},"ref3":{"label":"ref3","enumerator":"3","html":"2009+3D segmentation in the clinic: Carotid lumen segmentation and stenosis grading challenge+nl. 3+R. Hameeteman+M. Zuluaga+L. Joskowicz+M. Freiman+T."},"ref4":{"label":"ref4","enumerator":"4","url":"https://doi.org/10.1109/tpami.2006.19","html":"Optimal surface segmentation in volumetric imagesa graph-theoretic approach+IEEE Trans. Patt. Anal. and Mach+28+1+119+134+2006+L. Kang+W. Xiaodong+D.Z. Chen+M. Sonka"},"ref5":{"label":"ref5","enumerator":"5","url":"https://doi.org/10.1145/1031120.1031121","html":"A review of vessel extraction techniques and algorithms+ACM Comput. Surv.+36+2+81+121+2004+C. Kirbas+F.K.H. Quek"},"ref6":{"label":"ref6","enumerator":"6","url":"https://doi.org/10.1109/tmi.2006.891503","html":"Vessel axis tracking using topology constrained surface evolution+IEEE Trans. Med+26+3+309+316+2007+R. Manniesing+M.A. Viergever+W.J. Niessen"},"ref7":{"label":"ref7","enumerator":"7","url":"https://doi.org/10.1016/j.cviu.2006.11.004","html":"Object segmentation using graph cuts based active contours+Comp. Vision and Image Understanding+1+2+2+224+2007+X. Ning+A Narendra+B. Ravi"},"ref8":{"label":"ref8","enumerator":"8","url":"https://doi.org/10.1145/1015706.1015720","html":"Grabcut: interactive foreground extraction using iterated graph cuts+ACM Trans. Graph+23+3+309+314+2004+C. Rother+V. Kolmogorov+A. Blake"},"ref9":{"label":"ref9","enumerator":"9","url":"https://doi.org/10.1007/978-3-540-75759-7_68","html":"Bayesian tracking of tubular structures and its application to carotid arteries in CTA+of LNCS+4792+562+570+2007+M. Schaap+R. Manniesing+T. Van Walsum+A. Van Der Lugt+W.J. Niessen"},"ref10":{"label":"ref10","enumerator":"10","url":"https://doi.org/10.1007/11866763_110","html":"Accurate banded graph cut segmentation of thin structures using laplacian pyramids+of LNCS+4191+896+903+2006+A.K. Sinop+L. Grady"},"ref11":{"label":"ref11","enumerator":"11","url":"https://doi.org/10.1109/icip.2005.1530282","html":"Graph cuts segmentation using an elliptical shape prior+In Proc. of the 2005 IEEE Int. Conf. on Image Processing, ICIP'05+2+1222+5+2005+G. Slabaugh+G. Unal"},"ref12":{"label":"ref12","enumerator":"12","url":"https://doi.org/10.1007/3-540-45787-9_5","html":"Level-set based carotid artery segmentation for stenosis grading+of LNCS+2489+36+43+2002+L.J. C.M. Van Bemmel+M.A. Spreeuwers+W.J Viergever+Niessen"}}}}