{"version":1,"kind":"Article","sha256":"","slug":"600","location":"","dependencies":[],"doi":"10.54294/nb6onk","frontmatter":{"title":"Automatic Coronary Tree Modeling","abstract":"In this paper, we present an automatic method for extracting center axis representations (centerlines) \r\nof coronary arteries in contrast enhanced (CE)-CT angiography scans. \r\nThe algorithm first detects the aorta which is used as an initial mask for ostia\r\ndetection~cite{grady2006:fast}. Second, the ostia locations are detected via a vessel centerline extraction method~cite{Gulsun:Tek:008} which\r\ntracks the center axis of the coronaries starting from the aorta surface. The full centerline tree of the coronary arteries are\r\ncomputed via the multi-scale medialness-based vessel tree extraction algorithm which starts a tracking process from\r\nthe ostia locations until all the braches are reached. The centerline extraction algorithm is a \r\ngraph-based optimization algorithm using multi-scale medialness filters.","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":["segmentation"],"authors":[{"name":"Tek, Huseyin","email":"huseyin.tek@gmail.com","affiliations":[]}],"date_submitted":"2008-07-07T23:11:35Z","external_publication_id":600,"revision_cids":["bafkreibhmrcaihoqogkes3zrsgtb4cg3i2lxogmpz4fgjq2qkiqapt7db4"]},"mdast":{"type":"root"},"downloads":[{"url":"https://ipfs.desci.com/ipfs/bafkreifrwoeahijv4ga6naxgiuwumjdr4tvryt5txxl7om6opni7soqwlu","title":"root/insight-journal-metadata.json","filename":"insight-journal-metadata.json","extra":{"size_bytes":3565,"type":"file"}},{"url":"https://dweb.link/ipfs/bafybeig7hslownkjq7kkcjgv3r7tloyzsol2jrmtlugrxf3p7ymxoaziwa","title":"root/article.pdf","filename":"article.pdf","extra":{"size_bytes":1448727,"type":"file"}}],"references":{"cite":{"order":["ref1","ref2","ref3"]},"data":{"ref1":{"label":"ref1","enumerator":"1","url":"https://doi.org/10.1016/s1361-8415(01)00046-9","html":"Fast extraction of minimal paths in 3d images and applications to virtual endoscopy+Medical Image Analysis+5+4+281+299+2001+T. Deschamps+L.D. Cohen"},"ref2":{"label":"ref2","enumerator":"2","html":"A note on two problems in connections with graphs+Numerische Mathematic+1+269+E. W. Dijkstra"},"ref3":{"label":"ref3","enumerator":"3","html":"Leo Grady"}}}}