CFP last date
20 August 2024
Call for Paper
September Edition
IJCA solicits high quality original research papers for the upcoming September edition of the journal. The last date of research paper submission is 20 August 2024

Submit your paper
Know more
Reseach Article

Binary Image Segmentation through the Carl Friedrich Gauss Equation

by Oppong-Twum Francis, Frimpong Twum, J. B. Hayfron Acquah
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 179 - Number 41
Year of Publication: 2018
Authors: Oppong-Twum Francis, Frimpong Twum, J. B. Hayfron Acquah

Oppong-Twum Francis, Frimpong Twum, J. B. Hayfron Acquah . Binary Image Segmentation through the Carl Friedrich Gauss Equation. International Journal of Computer Applications. 179, 41 ( May 2018), 1-9. DOI=10.5120/ijca2018916969

@article{ 10.5120/ijca2018916969,
author = { Oppong-Twum Francis, Frimpong Twum, J. B. Hayfron Acquah },
title = { Binary Image Segmentation through the Carl Friedrich Gauss Equation },
journal = { International Journal of Computer Applications },
issue_date = { May 2018 },
volume = { 179 },
number = { 41 },
month = { May },
year = { 2018 },
issn = { 0975-8887 },
pages = { 1-9 },
numpages = {9},
url = { },
doi = { 10.5120/ijca2018916969 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
%0 Journal Article
%1 2024-02-07T00:58:01.683949+05:30
%A Oppong-Twum Francis
%A Frimpong Twum
%A J. B. Hayfron Acquah
%T Binary Image Segmentation through the Carl Friedrich Gauss Equation
%J International Journal of Computer Applications
%@ 0975-8887
%V 179
%N 41
%P 1-9
%D 2018
%I Foundation of Computer Science (FCS), NY, USA

Binary image segmentation is a technique that enables an image to be divided into several related portions. In this research, the iterative, Otsu, multiple, adaptive and global algorithms were reviewed to evaluate the importance of the techniques and challenges that limit their usage. The study utilized the Carl Friedrich Gauss equation to suppress the impact of noisy pixels. The matrix generated was converted into integers to generate a histogram. An arbitrary pixel is selected from the histogram as a threshold to partition the image into two classes. The threshold that generates the minimum variance from the classes is then multiplied by the optimization constant which ranges from 0.1 to 1, and the computed value is used for the segmentation process. An improved Otsu Algorithm based on the Carl’s Friedrich Gauss equation was evaluated with the Otsu, multiple, adaptive, and global algorithms. The signal to noise ratio that defines the sensitivity of a segmentation algorithm, and the running time that specifies the quantum of time required by an algorithm to execute were used as the metrics of performance. The experiments conducted using MATLAB and the Berkeley Image Segmentation Dataset was as follows: The first experiment consisted of five noise free images. In the experiment, the adaptive obtained the highest sensitivity rating of 8.890dB. This was followed by this studies proposed Twum-Acquah algorithm at 5.623dB. The worst performance was recorded in the global at 2.367dB. In the second experiment that consisted of noisy images, the proposed Twum-Acquah algorithm obtained the highest performance rating of 4.444dB, while the Adaptive which was at the bottom of the evaluation scored 0.851dB. In terms of the running time, the fastest algorithms were observed in the global, Otsu and the multiple with a rating of 1.103, 1.264 and 1.392 seconds respectively, while the slowest was recorded in the Adaptive at 129.479 seconds.

  1. Acharya, T., & Ray, A. K. (2005). Image Processing: Principles and Applications (Vol.15).
  2. Bonsar, K. (2008). How Facial Recognition Systems Work. Retrieved April 28, 2017, from
  3. Kanhere, N. (2006). Vehicle Segmentation and Tracking in The Presence of Occlusions. Transportation Research Record, 1944(1944), 89–97.
  4. Barghout, L., & Sheynin, J. (2013). Real-world scene perception and perceptual organization: Lessons from Computer Vision. Journal of Vision, 13(9), 700–710.
  5. Jain, A. (1986). Fundamentals of Digital Image Processing. New Jersey: Prentice-Hall Publisher.
  6. Rohankar, J. (2013). Survey of the Various Noises and Techniques for Denoising the Colour Image. International Journal of Application or Innovation in Engineering & Managemen, 2(11), 257–289.
  7. Shapiro, L. G., & Stockman, C. G. (2001). Computer Vision. New Jersey: Prentice-Hall Publisher.
  8. Sipser, M. (2006). Introduction to the Theory of Computation. Boston MA, USA: Course Technology Publisher.
  9. Rafael C. Gonzalez, R. E. W. (2001). Digital Image Processing (3rd ed.). Upper Saddle River, New Jersey 07458: Prentice Hall. Retrieved from
  10. Bansal, S., & Maini, R. (2013). A Comparative Analysis of Iterative and Ostu ’ s Thresholding Techniques. International Journal of Computer Applications, 66(12), 45–47.
  11. Chow, C. K., & Kaneko, T. (1972). Automatic boundary detection of the left ventricle from cineangiograms. Computers and Biomedical Research, 5(4), 388–410.
  12. Vala, M. H. J., & Baxi, A. (2013). A review on Otsu image segmentation algorithm. International Journal of Advanced Research in Computer Engineering and Technology, 2(2), 387–389.
  13. Chandrasekar, G. . S. and D. C. (2012). A Compariso n of Various Edge Detection Techniques used in Image Processing. International Journal of Computer Science& I.T(IJCSIT), Vol9,No 1.
  14. Martin, D., Fowlkes, C., Tal, D., & Malik, J. (2001). A Database of Human Segmented Images and its Application to Evaluate Segmentation Algorithms and Measuring Ecological Statistics. Proceedings of 8th International Conference on Computer Vision (pp. 416--423).
Index Terms

Computer Science
Information Sciences


Twum-Acquah algorithm  Carl Friedrich Gauss equation thresholding techniques.