Name
Abstract | ||
|---|---|---|
The quantity of information in images can be evaluated by means of the Shannon entropy. When dealing with natural images with a large scale of gray levels, as well as with images containing textures or suffering some degradation such as noise or blurring, this measure tends to saturate. That is, it reaches high values due to a large amount of irrelevant information, making it useless for measuring significant information. In this paper we present a new information measure, the clustered entropy. This information measure, based on clustering local histograms, has a zero value for quasi-homogeneous regions and reaches high values for regions containing edges. The clustered entropy is used in this paper as an edge detector, by centering a sliding window on every pixel of an image, and calculating the clustered entropy of the corresponding histogram. A search for local maxima throughout the resulting matrix of entropies provides the final image of edges. The mathematical properties of clustered entropy are studied, a comparison between the clustered and the normal entropy is done, and some comparative experiments of edge detection are shown in this paper. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.matcom.2020.11.021 | Mathematics and Computers in Simulation |
Keywords | DocType | Volume |
Image segmentation,Histogram clustering,Entropic edge detection,Shannon entropy,Clustered entropy,Gray level quantization | Journal | 182 |
ISSN | Citations | PageRank |
0378-4754 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Martínez-Aroza | 1 | 0 | 0.34 |
| J.F. Gómez-Lopera | 2 | 0 | 0.34 |
| D. Blanco-Navarro | 3 | 0 | 0.34 |
| J. Rodríguez-Camacho | 4 | 0 | 0.34 |