Binary Image Skeletonization Using 2-Stage U-Net

• URL: http://arxiv.org/abs/2112.11824v1
• Date: Wed, 22 Dec 2021 11:58:42 GMT
• Title: Binary Image Skeletonization Using 2-Stage U-Net
• Authors: Mohamed A. Ghanem, Alaa A. Anani
• Abstract summary: We propose a new metric, M-CCORR, based on normalized correlation coefficients as an alternative to F1 for this challenge. In this paper, we use a 2-stage variant of the famous U-Net architecture to split the problem space into two sub-problems: shape minimization and corrective skeleton thinning. Our model produces results that are visually much better than the baseline SkelNetOn model.
• Score: 0.0
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: Object Skeletonization is the process of extracting skeletal, line-like representations of shapes. It provides a very useful tool for geometric shape understanding and minimal shape representation. It also has a wide variety of applications, most notably in anatomical research and activity detection. Several mathematical algorithmic approaches have been developed to solve this problem, and some of them have been proven quite robust. However, a lesser amount of attention has been invested into deep learning solutions for it. In this paper, we use a 2-stage variant of the famous U-Net architecture to split the problem space into two sub-problems: shape minimization and corrective skeleton thinning. Our model produces results that are visually much better than the baseline SkelNetOn model. We propose a new metric, M-CCORR, based on normalized correlation coefficients as an alternative to F1 for this challenge as it solves the problem of class imbalance, managing to recognize skeleton similarity without suffering from F1's over-sensitivity to pixel-shifts.

Related papers

• Message-Passing Monte Carlo: Generating low-discrepancy point sets via Graph Neural Networks [64.39488944424095]
  We present the first machine learning approach to generate low-discrepancy point sets named Message-Passing Monte Carlo points. MPMC points are empirically shown to be either optimal or near-optimal with respect to the discrepancy for low dimension and small number of points.
  arXiv  Detail & Related papers  (2024-05-23T21:17:20Z)
• What to Do When Your Discrete Optimization Is the Size of a Neural Network? [24.546550334179486]
  Machine learning applications using neural networks involve solving discrete optimization problems. classical approaches used in discrete settings do not scale well to large neural networks. We take continuation path (CP) methods to represent using purely the former and Monte Carlo (MC) methods to represent the latter.
  arXiv  Detail & Related papers  (2024-02-15T21:57:43Z)
• A skeletonization algorithm for gradient-based optimization [13.2737105544687]
  The skeleton of a digital image is a compact representation of its topology, geometry, and scale. Most existing skeletonization algorithms are not differentiable, making it impossible to integrate them with gradient-based optimization. This work introduces the first three-dimensional skeletonization algorithm that is both compatible with gradient-based optimization and preserves an object's topology.
  arXiv  Detail & Related papers  (2023-09-05T18:40:14Z)
• Cascaded multitask U-Net using topological loss for vessel segmentation and centerline extraction [2.264332709661011]
  We propose to replace the soft-skeleton algorithm by a U-Net which computes the vascular skeleton directly from the segmentation. We build upon this network a cascaded U-Net trained with the clDice loss to embed topological constraints during the segmentation.
  arXiv  Detail & Related papers  (2023-07-21T14:12:28Z)
• Action Recognition with Domain Invariant Features of Skeleton Image [25.519217340328442]
  We propose a novel CNN-based method with adversarial training for action recognition. We introduce a two-level domain adversarial learning to align the features of skeleton images from different view angles or subjects. It achieves competitive results compared with state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-11-19T08:05:54Z)
• Self-supervised Geometric Perception [96.89966337518854]
  Self-supervised geometric perception is a framework to learn a feature descriptor for correspondence matching without any ground-truth geometric model labels. We show that SGP achieves state-of-the-art performance that is on-par or superior to the supervised oracles trained using ground-truth labels.
  arXiv  Detail & Related papers  (2021-03-04T15:34:43Z)
• Spatio-Temporal Inception Graph Convolutional Networks for Skeleton-Based Action Recognition [126.51241919472356]
  We design a simple and highly modularized graph convolutional network architecture for skeleton-based action recognition. Our network is constructed by repeating a building block that aggregates multi-granularity information from both the spatial and temporal paths.
  arXiv  Detail & Related papers  (2020-11-26T14:43:04Z)
• Generalized Intersection Algorithms with Fixpoints for Image Decomposition Learning [1.237556184089774]
  We formalize a general class of intersection point problems encompassing a wide range of (learned) image decomposition models. This class generalizes classical model-based variational problems, such as TV-l2 -model or the more general TV-Hilbert model.
  arXiv  Detail & Related papers  (2020-10-16T22:55:34Z)
• SkeletonNet: A Topology-Preserving Solution for Learning Mesh Reconstruction of Object Surfaces from RGB Images [85.66560542483286]
  This paper focuses on the challenging task of learning 3D object surface reconstructions from RGB images. We propose two models, the Skeleton-Based GraphConvolutional Neural Network (SkeGCNN) and the Skeleton-Regularized Deep Implicit Surface Network (SkeDISN) We conduct thorough experiments that verify the efficacy of our proposed SkeletonNet.
  arXiv  Detail & Related papers  (2020-08-13T07:59:25Z)
• A Flexible Framework for Designing Trainable Priors with Adaptive Smoothing and Game Encoding [57.1077544780653]
  We introduce a general framework for designing and training neural network layers whose forward passes can be interpreted as solving non-smooth convex optimization problems. We focus on convex games, solved by local agents represented by the nodes of a graph and interacting through regularization functions. This approach is appealing for solving imaging problems, as it allows the use of classical image priors within deep models that are trainable end to end.
  arXiv  Detail & Related papers  (2020-06-26T08:34:54Z)
• Dense Non-Rigid Structure from Motion: A Manifold Viewpoint [162.88686222340962]
  Non-Rigid Structure-from-Motion (NRSfM) problem aims to recover 3D geometry of a deforming object from its 2D feature correspondences across multiple frames. We show that our approach significantly improves accuracy, scalability, and robustness against noise.
  arXiv  Detail & Related papers  (2020-06-15T09:15:54Z)

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.