Joint Dense-Point Representation for Contour-Aware Graph Segmentation

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a novel methodology that combines graph and dense segmentation techniques by jointly learning both point and pixel contour representations, thereby leveraging the benefits of each approach. This addresses deficiencies in typical graph segmentation methods where misaligned objectives restrict the network from learning discriminative vertex and contour features. Our joint learning strategy allows for rich and diverse semantic features to be encoded, while alleviating common contour stability issues in dense-based approaches, where pixel-level objectives can lead to anatomically implausible topologies. In addition, we identify scenarios where correct predictions that fall on the contour boundary are penalised and address this with a novel hybrid contour distance loss. Our approach is validated on several Chest X-ray datasets, demonstrating clear improvements in segmentation stability and accuracy against a variety of dense- and point-based methods. Our source code is freely available at: www.github.com/kitbransby/Joint_Graph_Segmentation.

Cite

CITATION STYLE

APA

Bransby, K. M., Slabaugh, G., Bourantas, C., & Zhang, Q. (2023). Joint Dense-Point Representation for Contour-Aware Graph Segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 14222 LNCS, pp. 519–528). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-43898-1_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free