Relaxation labelling and the entropy of neighbourhood information

DOI10.1016/0167-8655(87)90081-XzbMATH Open0642.94022OpenAlexW2029899685MaRDI QIDQ3783951

Author name not available (Why is that?)

Publication date: 1987

Published in: Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8655(87)90081-x

zbMATH Keywords

relaxation algorithmrelaxation labellingstationary pointsentropy of neighbourhood informationnodes of a labelled graphtriangle labelling

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Measures of information, entropy (94A17)

Recommendations

• Title not available (Why is that?) 👍 👎
• Nearest-neighbor entropy estimators with weak metrics 👍 👎
• \(k_n\)-nearest neighbor estimators of entropy 👍 👎
• Probabilistic relaxation labelling using the Fokker-Planck equation 👍 👎
• Entropy inequalities for a relaxation scheme 👍 👎
• Relaxation Labeling Using an Improved Hopfield Neural Network 👍 👎
• Geometric k-nearest neighbor estimation of entropy and mutual information 👍 👎
• Probabilistic Relaxation Labeling by Fokker-Planck Diffusion on a Graph 👍 👎
• Nearest neighbor estimates of Kaniadakis entropy 👍 👎

This page was built for publication: Relaxation labelling and the entropy of neighbourhood information

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