A Novel Falling-Ball Algorithm for Image Segmentation

• URL: http://arxiv.org/abs/2105.02615v1
• Date: Thu, 6 May 2021 12:41:10 GMT
• Title: A Novel Falling-Ball Algorithm for Image Segmentation
• Authors: Asra Aslam, Ekram Khan, Mohammad Samar Ansari, M.M. Sufyan Beg
• Abstract summary: 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.
• Score: 0.14337588659482517
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Image segmentation refers to the separation of objects from the background, and has been one of the most challenging aspects of digital image processing. Practically it is impossible to design a segmentation algorithm which has 100% accuracy, and therefore numerous segmentation techniques have been proposed in the literature, each with certain limitations. In this paper, a novel Falling-Ball algorithm is presented, which is a region-based segmentation algorithm, and an alternative to watershed transform (based on waterfall model). The proposed algorithm detects the catchment basins by assuming that a ball falling from hilly terrains will stop in a catchment basin. Once catchment basins are identified, the association of each pixel with one of the catchment basin is obtained using multi-criterion fuzzy logic. Edges are constructed by dividing image into different catchment basins with the help of a membership function. Finally closed contour algorithm is applied to find closed regions and objects within closed regions are segmented using intensity information. The performance of the proposed algorithm is evaluated both objectively as well as subjectively. Simulation results show that the proposed algorithms gives superior performance over conventional Sobel edge detection methods and the watershed segmentation algorithm. For comparative analysis, various comparison methods are used for demonstrating the superiority of proposed methods over existing segmentation methods.

Related papers

• Otsu based Differential Evolution Method for Image Segmentation [0.0]
  This paper proposes an OTSU based differential evolution method for satellite image segmentation. It is compared with four other methods such as Artificial Bee Colony (MABC), Artificial Bee Colony (ABC), Genetic Algorithm (GA), and Particle Swarm Optimization (PSO)
  arXiv  Detail & Related papers  (2022-10-18T17:21:24Z)
• Copy-Move Image Forgery Detection Based on Evolving Circular Domains Coverage [5.716030416222748]
  The proposed scheme integrates both block-based and keypoint-based forgery detection methods. The experimental results indicate that the proposed CMFD scheme can achieve better detection performance under various attacks.
  arXiv  Detail & Related papers  (2021-09-09T16:08:03Z)
• BoundarySqueeze: Image Segmentation as Boundary Squeezing [104.43159799559464]
  We propose a novel method for fine-grained high-quality image segmentation of both objects and scenes. Inspired by dilation and erosion from morphological image processing techniques, we treat the pixel level segmentation problems as squeezing object boundary. Our method yields large gains on COCO, Cityscapes, for both instance and semantic segmentation and outperforms previous state-of-the-art PointRend in both accuracy and speed under the same setting.
  arXiv  Detail & Related papers  (2021-05-25T04:58:51Z)
• PointFlow: Flowing Semantics Through Points for Aerial Image Segmentation [96.76882806139251]
  We propose a point-wise affinity propagation module based on the Feature Pyramid Network (FPN) framework, named PointFlow. Rather than dense affinity learning, a sparse affinity map is generated upon selected points between the adjacent features. Experimental results on three different aerial segmentation datasets suggest that the proposed method is more effective and efficient than state-of-the-art general semantic segmentation methods.
  arXiv  Detail & Related papers  (2021-03-11T09:42:32Z)
• Contour Integration using Graph-Cut and Non-Classical Receptive Field [4.935491924643742]
  We propose a novel method to detect image contours from the extracted edge segments of other algorithms. The proposed energy functions are inspired by the surround modulation in the primary visual cortex that help suppressing texture noise.
  arXiv  Detail & Related papers  (2020-10-27T19:07:13Z)
• Contrastive Rendering for Ultrasound Image Segmentation [59.23915581079123]
  The lack of sharp boundaries in US images remains an inherent challenge for segmentation. We propose a novel and effective framework to improve boundary estimation in US images. Our proposed method outperforms state-of-the-art methods and has the potential to be used in clinical practice.
  arXiv  Detail & Related papers  (2020-10-10T07:14:03Z)
• 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)
• Refined Plane Segmentation for Cuboid-Shaped Objects by Leveraging Edge Detection [63.942632088208505]
  We propose a post-processing algorithm to align the segmented plane masks with edges detected in the image. This allows us to increase the accuracy of state-of-the-art approaches, while limiting ourselves to cuboid-shaped objects.
  arXiv  Detail & Related papers  (2020-03-28T18:51:43Z)
• GeoDA: a geometric framework for black-box adversarial attacks [79.52980486689287]
  We propose a framework to generate adversarial examples in one of the most challenging black-box settings. Our framework is based on the observation that the decision boundary of deep networks usually has a small mean curvature in the vicinity of data samples.
  arXiv  Detail & Related papers  (2020-03-13T20:03:01Z)
• Towards Interpretable Semantic Segmentation via Gradient-weighted Class Activation Mapping [71.91734471596432]
  We propose SEG-GRAD-CAM, a gradient-based method for interpreting semantic segmentation. Our method is an extension of the widely-used Grad-CAM method, applied locally to produce heatmaps showing the relevance of individual pixels for semantic segmentation.
  arXiv  Detail & Related papers  (2020-02-26T12:32:40Z)
• 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.