Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Hierachical random graph representation of handwritten characters and its application to Hangul recognition

From MaRDI portal
Publication:5957579
Jump to:navigation, search

DOI10.1016/S0031-3203(99)00222-8zbMath1012.68878MaRDI QIDQ5957579

No author found.

Publication date: 3 June 2003

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


zbMATH Keywords

hierarchical random graph


Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)


Related Items (3)

First order Gaussian graphs for efficient structure classification ⋮ Bayesian network modeling of strokes and their relationships for on-line handwriting recognition. ⋮ Pair-wise discrimination based on a stroke importance measure



Cites Work

  • Unnamed Item
  • Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
  • Random Graphs: Structural-Contextual Dichotomy


This page was built for publication: Hierachical random graph representation of handwritten characters and its application to Hangul recognition

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5957579&oldid=12126219"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 02:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki