We have located links that may give you full text access.
Evaluation Studies
Journal Article
Accurate banded graph cut segmentation of thin structures using laplacian pyramids.
The Graph Cuts method of interactive segmentation has become very popular in recent years. This method performs at interactive speeds for smaller images/volumes, but an unacceptable amount of storage and computation time is required for the large images/volumes common in medical applications. The Banded Graph Cut (BGC) algorithm was proposed to drastically increase the computational speed of Graph Cuts, but is limited to the segmentation of large, roundish objects. In this paper, we propose a modification of BGC that uses the information from a Laplacian pyramid to include thin structures into the band. Therefore, we retain the computational efficiency of BGC while providing quality segmentations on thin structures. We make quantitative and qualitative comparisons with BGC on images containing thin objects. Additionally, we show that the new parameter introduced in our modification provides a smooth transition from BGC to traditional Graph Guts.
Full text links
Related Resources
Get seemless 1-tap access through your institution/university
For the best experience, use the Read mobile app
All material on this website is protected by copyright, Copyright © 1994-2024 by WebMD LLC.
This website also contains material copyrighted by 3rd parties.
By using this service, you agree to our terms of use and privacy policy.
Your Privacy Choices
You can now claim free CME credits for this literature searchClaim now
Get seemless 1-tap access through your institution/university
For the best experience, use the Read mobile app