On estimating the local entropy of an image in a sliding window

The paper considers a number of issues related to the calculation of the local entropy in a sliding window for image processing tasks. A new algorithm for entropy estimation is proposed, which has several times lower computational complexity than the known ones. The algorithm is based on the approximate representation of the histogram in the form of a truncated series expansion over some system of orthogonal basis functions, recursive calculation of the coefficients of this expansion in a sliding window and subsequent recalculation of the coefficients into the entropy estimate. Questions of an orthogonal basis selection for representing the local histogram as a truncated series are considered and the appropriateness of using the Haar basis is shown. A technique of constructing hierarchical approximator, which realizes fast recalculation of histogram decomposition coefficients into entropy value, is described. The theoretical statements of the paper are verified by experiments on the Earth remote sensing images.

Authors

Publication Details

Journal
Computer Optics
Published
2024-10-01
DOI
https://doi.org/10.18287/2412-6179-co-1509
Citations
1
Primary Topic
Advanced Computational Techniques in Science and Engineering
Type
article
Field-Weighted Citation Impact
0.78

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On estimating the local entropy of an image in a sliding window

Alina Bavrina, D.A. Shapiro, Ivan Zaitsev, Vladislav Sergeyev et al.
1 citations
Computer Optics
Advanced Computational Techniques in Science and Engineering
0.78
article

On estimating the local entropy of an image in a sliding window

Alina Bavrina, D.A. Shapiro, Ivan Zaitsev, Vladislav Sergeyev, M.Y. Lazutov
article en
1 citations

Abstract

The paper considers a number of issues related to the calculation of the local entropy in a sliding window for image processing tasks. A new algorithm for entropy estimation is proposed, which has several times lower computational complexity than the known ones. The algorithm is based on the approximate representation of the histogram in the form of a truncated series expansion over some system of orthogonal basis functions, recursive calculation of the coefficients of this expansion in a sliding window and subsequent recalculation of the coefficients into the entropy estimate. Questions of an orthogonal basis selection for representing the local histogram as a truncated series are considered and the appropriateness of using the Haar basis is shown. A technique of constructing hierarchical approximator, which realizes fast recalculation of histogram decomposition coefficients into entropy value, is described. The theoretical statements of the paper are verified by experiments on the Earth remote sensing images.

Computer OpticsVol. 48(5)
Russian Science Foundation
Openalex Percentile: Top 19%
Advanced Computational Techniques in Science and Engineering
0.78
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

On estimating the local entropy of an image in a sliding window — Alina Bavrina, D.A. Shapiro, et al. · Computer Optics (2024) | TGRS Research Map | TGRS