2016
DOI: 10.1016/j.chaos.2016.09.005
|View full text |Cite
|
Sign up to set email alerts
|

Discriminating image textures with the multiscale two-dimensional complexity-entropy causality plane

Abstract: The aim of this paper is to further explore the usefulness of the two-dimensional complexityentropy causality plane as a texture image descriptor. A multiscale generalization is introduced in order to distinguish between different roughness features of images at small and large spatial scales. Numerically generated two-dimensional structures are initially considered for illustrating basic concepts in a controlled framework. Then, more realistic situations are studied. Obtained results allow us to confirm that … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
52
0
1

Year Published

2017
2017
2020
2020

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 64 publications
(54 citation statements)
references
References 42 publications
(54 reference statements)
1
52
0
1
Order By: Relevance
“…Due to this underlying simplicity and also because our approach is very fast and scalable from the computational point of view, we believe it can be easily implemented and adapted for other more complex experimental situations involving the study of liquid crystals and perhaps for probing physical properties of different materials. The normalized permutation entropy H [25] and statistical complexity C [33] are two complexity measures originally proposed for characterizing time series [26], and that were more recently generalized for considering higher dimensional data such as images [27,28]. We refer the more detail-oriented reader to the previouslycited references, where a complete description of these techniques can be found.…”
Section: Discussionmentioning
confidence: 99%
“…Due to this underlying simplicity and also because our approach is very fast and scalable from the computational point of view, we believe it can be easily implemented and adapted for other more complex experimental situations involving the study of liquid crystals and perhaps for probing physical properties of different materials. The normalized permutation entropy H [25] and statistical complexity C [33] are two complexity measures originally proposed for characterizing time series [26], and that were more recently generalized for considering higher dimensional data such as images [27,28]. We refer the more detail-oriented reader to the previouslycited references, where a complete description of these techniques can be found.…”
Section: Discussionmentioning
confidence: 99%
“…This is not surprising, since the number of images and thus the ground area increase with the number of GCPs, and, hence, automatically include a stronger horizontal and vertical distribution and thus higher elevation ranges. The Shannon entropy is a measure of image texture [14] and only shows a small, non-significant correlation with the RMSE; disregarding one outlier DTM (14 September 1977), the correlation becomes much stronger (R 2 = 0.55 (p ≤ 0.05); see Figure 3c,d). Image overlap is also expected to have an effect on DTM quality [3].…”
Section: Bundle Adjustmentmentioning
confidence: 99%
“…The interpretation of these diagrams is based on the following intuitive considerations: zero entropy and complexity correspond to a completely regular structure, and high entropy and zero complexity correspond to a completely random spatially independent noise [19,20].…”
Section: "Complexity-entropy" Diagramsmentioning
confidence: 99%