Parallel Watershed Partitioning: GPU-Based Hierarchical Image Segmentation

• URL: http://arxiv.org/abs/2410.08946v1
• Date: Fri, 11 Oct 2024 16:15:43 GMT
• Title: Parallel Watershed Partitioning: GPU-Based Hierarchical Image Segmentation
• Authors: Varduhi Yeghiazaryan, Yeva Gabrielyan, Irina Voiculescu,
• Abstract summary: Many image processing applications rely on partitioning an image into disjoint regions whose pixels are'similar' We show how to use this fully deterministic image partitioning as a pre-processing step to machine learning based semantic segmentation.
• Score: 4.560718678349679
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many image processing applications rely on partitioning an image into disjoint regions whose pixels are 'similar.' The watershed and waterfall transforms are established mathematical morphology pixel clustering techniques. They are both relevant to modern applications where groups of pixels are to be decided upon in one go, or where adjacency information is relevant. We introduce three new parallel partitioning algorithms for GPUs. By repeatedly applying watershed algorithms, we produce waterfall results which form a hierarchy of partition regions over an input image. Our watershed algorithms attain competitive execution times in both 2D and 3D, processing an 800 megavoxel image in less than 1.4 sec. We also show how to use this fully deterministic image partitioning as a pre-processing step to machine learning based semantic segmentation. This replaces the role of superpixel algorithms, and results in comparable accuracy and faster training times.

Related papers

• 3D Gaussian Ray Tracing: Fast Tracing of Particle Scenes [50.36933474990516]
  This work considers ray tracing the particles, building a bounding volume hierarchy and casting a ray for each pixel using high-performance ray tracing hardware. To efficiently handle large numbers of semi-transparent particles, we describe a specialized algorithm which encapsulates particles with bounding meshes. Experiments demonstrate the speed and accuracy of our approach, as well as several applications in computer graphics and vision.
  arXiv  Detail & Related papers  (2024-07-09T17:59:30Z)
• Saliency Enhancement using Superpixel Similarity [77.34726150561087]
  Saliency Object Detection (SOD) has several applications in image analysis. Deep-learning-based SOD methods are among the most effective, but they may miss foreground parts with similar colors. We introduce a post-processing method, named textitSaliency Enhancement over Superpixel Similarity (SESS) We demonstrate that SESS can consistently and considerably improve the results of three deep-learning-based SOD methods on five image datasets.
  arXiv  Detail & Related papers  (2021-12-01T17:22:54Z)
• Large-scale image segmentation based on distributed clustering algorithms [70.8481702473572]
  Many approaches to 3D image segmentation are based on hierarchical clustering of supervoxels into image regions. Here we describe a distributed algorithm capable of handling a tremendous number of supervoxels. We demonstrate the algorithm by clustering an affinity graph with over 1.5 trillion edges between 135 billion supervoxels derived from a 3D electron microscopic brain image.
  arXiv  Detail & Related papers  (2021-06-21T01:11:49Z)
• Semantic Distribution-aware Contrastive Adaptation for Semantic Segmentation [50.621269117524925]
  Domain adaptive semantic segmentation refers to making predictions on a certain target domain with only annotations of a specific source domain. We present a semantic distribution-aware contrastive adaptation algorithm that enables pixel-wise representation alignment. We evaluate SDCA on multiple benchmarks, achieving considerable improvements over existing algorithms.
  arXiv  Detail & Related papers  (2021-05-11T13:21:25Z)
• A Novel Falling-Ball Algorithm for Image Segmentation [0.14337588659482517]
  Region-based Falling-Ball algorithm is presented, which is a region-based segmentation algorithm. The proposed algorithm detects the catchment basins by assuming that a ball falling from hilly terrains will stop in a catchment basin.
  arXiv  Detail & Related papers  (2021-05-06T12:41:10Z)
• Deep Superpixel Cut for Unsupervised Image Segmentation [0.9281671380673306]
  We propose a deep unsupervised method for image segmentation, which contains the following two stages. First, a Superpixelwise Autoencoder (SuperAE) is designed to learn the deep embedding and reconstruct a smoothed image, then the smoothed image is passed to generate superpixels. Second, we present a novel clustering algorithm called Deep Superpixel Cut (DSC), which measures the deep similarity between superpixels and formulates image segmentation as a soft partitioning problem.
  arXiv  Detail & Related papers  (2021-03-10T13:07:41Z)
• Exploring Cross-Image Pixel Contrast for Semantic Segmentation [130.22216825377618]
  We propose a pixel-wise contrastive framework for semantic segmentation in the fully supervised setting. The core idea is to enforce pixel embeddings belonging to a same semantic class to be more similar than embeddings from different classes. Our method can be effortlessly incorporated into existing segmentation frameworks without extra overhead during testing.
  arXiv  Detail & Related papers  (2021-01-28T11:35:32Z)
• A Survey on Patch-based Synthesis: GPU Implementation and Optimization [0.0]
  This thesis surveys the research in patch-based synthesis and algorithms for finding correspondences between small local regions of images. One of the algorithms we have studied is PatchMatch, can find similar regions or "patches" of an image one to two orders of magnitude faster than previous techniques. In computer graphics, we have explored removing unwanted objects from images, seamlessly moving objects in images, changing image aspect ratios, and video summarization.
  arXiv  Detail & Related papers  (2020-05-11T19:25:28Z)
• 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)
• Efficient Video Semantic Segmentation with Labels Propagation and Refinement [138.55845680523908]
  This paper tackles the problem of real-time semantic segmentation of high definition videos using a hybrid GPU / CPU approach. We propose an Efficient Video(EVS) pipeline that combines: (i) On the CPU, a very fast optical flow method, that is used to exploit the temporal aspect of the video and propagate semantic information from one frame to the next. On the popular Cityscapes dataset with high resolution frames (2048 x 1024), the proposed operating points range from 80 to 1000 Hz on a single GPU and CPU.
  arXiv  Detail & Related papers  (2019-12-26T11:45:15Z)

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.