Joint Dense-Point Representation for Contour-Aware Graph Segmentation
- URL: http://arxiv.org/abs/2306.12155v1
- Date: Wed, 21 Jun 2023 10:07:17 GMT
- Title: Joint Dense-Point Representation for Contour-Aware Graph Segmentation
- Authors: Kit Mills Bransby, Greg Slabaugh, Christos Bourantas, Qianni Zhang
- Abstract summary: We present a novel methodology that combines graph and dense segmentation techniques by jointly learning both point and pixel contour representations.
This addresses deficiencies in typical graph segmentation methods where misaligned objectives restrict the network from learning discriminative and contour features.
Our approach is validated on several Chest X-ray datasets, demonstrating clear improvements in segmentation stability and accuracy.
- Score: 2.138299283227551
- License: http://creativecommons.org/licenses/by/4.0/
- 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
Related papers
- Deep Manifold Graph Auto-Encoder for Attributed Graph Embedding [51.75091298017941]
This paper proposes a novel Deep Manifold (Variational) Graph Auto-Encoder (DMVGAE/DMGAE) for attributed graph data.
The proposed method surpasses state-of-the-art baseline algorithms by a significant margin on different downstream tasks across popular datasets.
arXiv Detail & Related papers (2024-01-12T17:57:07Z) - gcDLSeg: Integrating Graph-cut into Deep Learning for Binary Semantic
Segmentation [14.643505343450897]
We propose to integrate the graph-cut approach into a deep learning network for end-to-end learning.
In the inference phase, globally optimal segmentation is achieved with respect to the graph-cut energy defined on the optimized image features.
arXiv Detail & Related papers (2023-12-07T21:43:43Z) - GraphFit: Learning Multi-scale Graph-Convolutional Representation for
Point Cloud Normal Estimation [31.40738037512243]
We propose a precise and efficient normal estimation method for unstructured 3D point clouds.
We learn graph convolutional feature representation for normal estimation, which emphasizes more local neighborhood geometry.
Our method outperforms competitors with the state-of-the-art accuracy on various benchmark datasets.
arXiv Detail & Related papers (2022-07-23T10:29:26Z) - Learning Graph Regularisation for Guided Super-Resolution [77.7568596501908]
We introduce a novel formulation for guided super-resolution.
Its core is a differentiable optimisation layer that operates on a learned affinity graph.
We extensively evaluate our method on several datasets, and consistently outperform recent baselines in terms of quantitative reconstruction errors.
arXiv Detail & Related papers (2022-03-27T13:12:18Z) - Bayesian Graph Contrastive Learning [55.36652660268726]
We propose a novel perspective of graph contrastive learning methods showing random augmentations leads to encoders.
Our proposed method represents each node by a distribution in the latent space in contrast to existing techniques which embed each node to a deterministic vector.
We show a considerable improvement in performance compared to existing state-of-the-art methods on several benchmark datasets.
arXiv Detail & Related papers (2021-12-15T01:45:32Z) - Uncertainty-Based Dynamic Graph Neighborhoods For Medical Segmentation [0.0]
Post-processing and refining the results of segmentation is a common practice to decrease the misclassifications originating from the segmentation network.
A graph-based approach makes use of certain and uncertain points in a graph and refines the segmentation according to a small graph convolutional network (GCN)
We propose a new neighbor-selection mechanism according to feature distances and combine the two networks in the training procedure.
arXiv Detail & Related papers (2021-08-06T13:39:35Z) - Polygonal Point Set Tracking [50.445151155209246]
We propose a novel learning-based polygonal point set tracking method.
Our goal is to track corresponding points on the target contour.
We present visual-effects applications of our method on part distortion and text mapping.
arXiv Detail & Related papers (2021-05-30T17:12:36Z) - Spatial-spectral Hyperspectral Image Classification via Multiple Random
Anchor Graphs Ensemble Learning [88.60285937702304]
This paper proposes a novel spatial-spectral HSI classification method via multiple random anchor graphs ensemble learning (RAGE)
Firstly, the local binary pattern is adopted to extract the more descriptive features on each selected band, which preserves local structures and subtle changes of a region.
Secondly, the adaptive neighbors assignment is introduced in the construction of anchor graph, to reduce the computational complexity.
arXiv Detail & Related papers (2021-03-25T09:31:41Z) - Semantic Graph Based Place Recognition for 3D Point Clouds [22.608115489674653]
This paper presents a novel semantic graph based approach for place recognition.
First, we propose a novel semantic graph representation for the point cloud scenes.
We then design a fast and effective graph similarity network to compute the similarity.
arXiv Detail & Related papers (2020-08-26T09:27:26Z) - Weakly-Supervised Semantic Segmentation by Iterative Affinity Learning [86.45526827323954]
Weakly-supervised semantic segmentation is a challenging task as no pixel-wise label information is provided for training.
We propose an iterative algorithm to learn such pairwise relations.
We show that the proposed algorithm performs favorably against the state-of-the-art methods.
arXiv Detail & Related papers (2020-02-19T10:32:03Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.