MEASURING COMPLEXITY: A RELATIVE ASPECT OF PATTERN RECOGNITION

DOI10.1142/S0129183192000312MaRDI QIDQ4488291zbMATH OpenOpenAlexFDO

Authors Takashi Ikegami, Ichiro Tsuda

Publication date 5 July 2000

Published in International Journal of Modern Physics C (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129183192000312

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• Measuring static complexity
• Toward a quantitative theory of self-generated complexity
• Information measures, effective complexity, and total information
• A kind of new information measure of complexity
• scientific article; zbMATH DE number 1797893

Cited in

(11)

• Measuring static complexity
• What is complexity?
• Sensing as a complexity measure
• GeoEntropy: a measure of complexity and similarity
• A kind of new information measure of complexity
• scientific article; zbMATH DE number 1330644 (Why is no real title available?)
• Multiscale structural complexity of natural patterns
• Measuring complexity through average symmetry
• A NEW TWO-DIMENSIONAL COMPLEXITY MEASURE
• Templets and the Explanation of Complex Patterns
• Information measures, effective complexity, and total information

This page was built for publication: MEASURING COMPLEXITY: A RELATIVE ASPECT OF PATTERN RECOGNITION

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4488291)