Question

Given the histogram of a 3-bit image is shown in the following table | Gray level | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | | :--- | :--- | :--- | :--- | :--- | :--- | :--- | :--- | :--- | | number of pixels | 2 | 3 | 2 | 1 | 2 | 3 | 2 | 1 | Find optimal threshold using Global thresholding.

          Given the histogram of a 3-bit image is shown in the following table

| Gray level | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
| :--- | :--- | :--- | :--- | :--- | :--- | :--- | :--- | :--- |
| number of pixels | 2 | 3 | 2 | 1 | 2 | 3 | 2 | 1 |

Find optimal threshold using Global thresholding.

Given the histogram of a 3-bit image is shown in the following table

| Gray level | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
| :— | :— | :— | :— | :— | :— | :— | :— | :— |
| number of pixels | 2 | 3 | 2 | 1 | 2 | 3 | 2 | 1 |

Find optimal threshold using Global thresholding.

Added by Mireia M.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Akash M

11/27/2023

Step 1

We are given a histogram of a 3-bit image, which means the image can have \(2^3 = 8\) different gray levels (from 0 to 7). Our task is to find an optimal threshold for binarizing the image using global thresholding. The histogram data is provided as follows: Gray Show more…

Show all steps