A Novel Algorithm for Exact Concave Hull Extraction

• URL: http://arxiv.org/abs/2206.11481v1
• Date: Thu, 23 Jun 2022 05:26:48 GMT
• Title: A Novel Algorithm for Exact Concave Hull Extraction
• Authors: Kevin Christopher VanHorn, Murat Can \c{C}obano\u{g}lu
• Abstract summary: Region extraction is necessary in a wide range of applications, from object detection in autonomous driving to analysis of subcellular morphology in cell biology. There exist two main approaches: convex hull extraction, for which exact and efficient algorithms exist and concave hulls, which are better at capturing real-world shapes but do not have a single solution. In this study, we present a novel algorithm that can provide concave hulls with maximal (i.e. pixel-perfect) resolution and is tunable for speed-efficiency tradeoffs.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Region extraction is necessary in a wide range of applications, from object detection in autonomous driving to analysis of subcellular morphology in cell biology. There exist two main approaches: convex hull extraction, for which exact and efficient algorithms exist and concave hulls, which are better at capturing real-world shapes but do not have a single solution. Especially in the context of a uniform grid, concave hull algorithms are largely approximate, sacrificing region integrity for spatial and temporal efficiency. In this study, we present a novel algorithm that can provide vertex-minimized concave hulls with maximal (i.e. pixel-perfect) resolution and is tunable for speed-efficiency tradeoffs. Our method provides advantages in multiple downstream applications including data compression, retrieval, visualization, and analysis. To demonstrate the practical utility of our approach, we focus on image compression. We demonstrate significant improvements through context-dependent compression on disparate regions within a single image (entropy encoding for noisy and predictive encoding for the structured regions). We show that these improvements range from biomedical images to natural images. Beyond image compression, our algorithm can be applied more broadly to aid in a wide range of practical applications for data retrieval, visualization, and analysis.

Related papers

• Deep Convolutional Neural Networks Meet Variational Shape Compactness Priors for Image Segmentation [7.314877483509877]
  Shape compactness is a key geometrical property to describe interesting regions in many image segmentation tasks. We propose two novel algorithms to solve the introduced image segmentation problem that incorporates a shape-compactness prior. The proposed algorithms significantly improve IoU by 20% training on a highly noisy image dataset.
  arXiv  Detail & Related papers  (2024-05-23T11:05:35Z)
• Advancements in Feature Extraction Recognition of Medical Imaging Systems Through Deep Learning Technique [0.36651088217486427]
  An objective function based on weight is proposed to achieve the purpose of fast image recognition. A technique for threshold optimization utilizing a simplex algorithm is presented. It is found that different types of objects are independent of each other and compact in image processing.
  arXiv  Detail & Related papers  (2024-05-23T04:46:51Z)
• Real-Time Image Segmentation via Hybrid Convolutional-Transformer Architecture Search [49.81353382211113]
  We address the challenge of integrating multi-head self-attention into high resolution representation CNNs efficiently. We develop a multi-target multi-branch supernet method, which fully utilizes the advantages of high-resolution features. We present a series of model via Hybrid Convolutional-Transformer Architecture Search (HyCTAS) method that searched for the best hybrid combination of light-weight convolution layers and memory-efficient self-attention layers.
  arXiv  Detail & Related papers  (2024-03-15T15:47:54Z)
• 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)
• Neural Space-filling Curves [47.852964985588486]
  We present a data-driven approach to infer a context-based scan order for a set of images. Our work learns a spatially coherent linear ordering of pixels from the dataset of images using a graph-based neural network. We show the advantage of using Neural SFCs in downstream applications such as image compression.
  arXiv  Detail & Related papers  (2022-04-18T17:59:01Z)
• Spatially-Adaptive Image Restoration using Distortion-Guided Networks [51.89245800461537]
  We present a learning-based solution for restoring images suffering from spatially-varying degradations. We propose SPAIR, a network design that harnesses distortion-localization information and dynamically adjusts to difficult regions in the image.
  arXiv  Detail & Related papers  (2021-08-19T11:02:25Z)
• OSLO: On-the-Sphere Learning for Omnidirectional images and its application to 360-degree image compression [59.58879331876508]
  We study the learning of representation models for omnidirectional images and propose to use the properties of HEALPix uniform sampling of the sphere to redefine the mathematical tools used in deep learning models for omnidirectional images. Our proposed on-the-sphere solution leads to a better compression gain that can save 13.7% of the bit rate compared to similar learned models applied to equirectangular images.
  arXiv  Detail & Related papers  (2021-07-19T22:14:30Z)
• A Novel Upsampling and Context Convolution for Image Semantic Segmentation [0.966840768820136]
  Recent methods for semantic segmentation often employ an encoder-decoder structure using deep convolutional neural networks. We propose a dense upsampling convolution method based on guided filtering to effectively preserve the spatial information of the image in the network. We report a new record of 82.86% and 81.62% of pixel accuracy on ADE20K and Pascal-Context benchmark datasets, respectively.
  arXiv  Detail & Related papers  (2021-03-20T06:16:42Z)
• 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)
• The Power of Triply Complementary Priors for Image Compressive Sensing [89.14144796591685]
  We propose a joint low-rank deep (LRD) image model, which contains a pair of complementaryly trip priors. We then propose a novel hybrid plug-and-play framework based on the LRD model for image CS. To make the optimization tractable, a simple yet effective algorithm is proposed to solve the proposed H-based image CS problem.
  arXiv  Detail & Related papers  (2020-05-16T08:17:44Z)
• The Semantic Mutex Watershed for Efficient Bottom-Up Semantic Instance Segmentation [15.768804877756384]
  We propose a greedy algorithm for joint graph partitioning and labeling. Due to the algorithm's efficiency it can operate directly on pixels without prior over-segmentation of the image into superpixels.
  arXiv  Detail & Related papers  (2019-12-29T19:48:39Z)

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.