Sub-Image Histogram Equalization using Coot Optimization Algorithm for Segmentation and Parameter Selection

• URL: http://arxiv.org/abs/2205.15565v1
• Date: Tue, 31 May 2022 06:51:45 GMT
• Title: Sub-Image Histogram Equalization using Coot Optimization Algorithm for Segmentation and Parameter Selection
• Authors: Emre Can Kuran, Umut Kuran and Mehmet Bilal Er
• Abstract summary: Mean and variance based sub-image histogram equalization (MVSIHE) algorithm is one of these contrast enhancements methods proposed in the literature. In this study, we employed one of the most recent optimization algorithms, namely, coot optimization algorithm (COA) for selecting appropriate parameters for the MVSIHE algorithm. The results show that the proposed method can be used in the field of biomedical image processing.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Contrast enhancement is very important in terms of assessing images in an objective way. Contrast enhancement is also significant for various algorithms including supervised and unsupervised algorithms for accurate classification of samples. Some contrast enhancement algorithms solve this problem by addressing the low contrast issue. Mean and variance based sub-image histogram equalization (MVSIHE) algorithm is one of these contrast enhancements methods proposed in the literature. It has different parameters which need to be tuned in order to achieve optimum results. With this motivation, in this study, we employed one of the most recent optimization algorithms, namely, coot optimization algorithm (COA) for selecting appropriate parameters for the MVSIHE algorithm. Blind/referenceless image spatial quality evaluator (BRISQUE) and natural image quality evaluator (NIQE) metrics are used for evaluating fitness of the coot swarm population. The results show that the proposed method can be used in the field of biomedical image processing.

Related papers

• Machine learning based biomedical image processing for echocardiographic images [0.0]
  The proposed method uses K-Nearest Neighbor (KNN) algorithm for segmentation of medical images. The trained neural network has been tested successfully on a group of echocardiographic images.
  arXiv  Detail & Related papers  (2023-03-16T06:23:43Z)
• Optimizing CT Scan Geometries With and Without Gradients [7.788823739816626]
  We show that gradient-based optimization algorithms are a possible alternative to gradient-free algorithms. gradient-based algorithms converge substantially faster while being comparable to gradient-free algorithms in terms of capture range and robustness to the number of free parameters.
  arXiv  Detail & Related papers  (2023-02-13T10:44:41Z)
• An Empirical Evaluation of Zeroth-Order Optimization Methods on AI-driven Molecule Optimization [78.36413169647408]
  We study the effectiveness of various ZO optimization methods for optimizing molecular objectives. We show the advantages of ZO sign-based gradient descent (ZO-signGD) We demonstrate the potential effectiveness of ZO optimization methods on widely used benchmark tasks from the Guacamol suite.
  arXiv  Detail & Related papers  (2022-10-27T01:58:10Z)
• 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)
• Provable Stochastic Optimization for Global Contrastive Learning: Small Batch Does Not Harm Performance [53.49803579981569]
  We consider a global objective for contrastive learning, which contrasts each positive pair with all negative pairs for an anchor point. Existing methods such as SimCLR requires a large batch size in order to achieve a satisfactory result. We propose a memory-efficient optimization algorithm for solving the Global Contrastive Learning of Representations, named SogCLR.
  arXiv  Detail & Related papers  (2022-02-24T22:16:53Z)
• Towards a Unified Approach to Homography Estimation Using Image Features and Pixel Intensities [0.0]
  The homography matrix is a key component in various vision-based robotic tasks. Traditionally, homography estimation algorithms are classified into feature- or intensity-based. This paper proposes a new hybrid method that unifies both classes into a single nonlinear optimization procedure.
  arXiv  Detail & Related papers  (2022-02-20T02:47:05Z)
• Segmentation of Brain MRI using an Altruistic Harris Hawks' Optimization algorithm [29.895517914678816]
  An efficient segmentation of brain Magnetic Resonance Images (MRIs) is of prime concern to radiologists. Thresholding is a popular method for segmentation that uses the histogram of an image to label different homogeneous groups of pixels into different classes. In this paper, we perform the multi-level thresholding using an evolutionary metaheuristic.
  arXiv  Detail & Related papers  (2021-09-17T17:51:34Z)
• Learned Block Iterative Shrinkage Thresholding Algorithm for Photothermal Super Resolution Imaging [52.42007686600479]
  We propose a learned block-sparse optimization approach using an iterative algorithm unfolded into a deep neural network. We show the benefits of using a learned block iterative shrinkage thresholding algorithm that is able to learn the choice of regularization parameters.
  arXiv  Detail & Related papers  (2020-12-07T09:27:16Z)
• Discovering Representations for Black-box Optimization [73.59962178534361]
  We show that black-box optimization encodings can be automatically learned, rather than hand designed. We show that learned representations make it possible to solve high-dimensional problems with orders of magnitude fewer evaluations than the standard MAP-Elites.
  arXiv  Detail & Related papers  (2020-03-09T20:06:20Z)
• Adaptivity of Stochastic Gradient Methods for Nonconvex Optimization [71.03797261151605]
  Adaptivity is an important yet under-studied property in modern optimization theory. Our algorithm is proved to achieve the best-available convergence for non-PL objectives simultaneously while outperforming existing algorithms for PL objectives.
  arXiv  Detail & Related papers  (2020-02-13T05:42:27Z)
• Extreme Algorithm Selection With Dyadic Feature Representation [78.13985819417974]
  We propose the setting of extreme algorithm selection (XAS) where we consider fixed sets of thousands of candidate algorithms. We assess the applicability of state-of-the-art AS techniques to the XAS setting and propose approaches leveraging a dyadic feature representation.
  arXiv  Detail & Related papers  (2020-01-29T09:40:58Z)

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.