Proposed heuristic procedures to preprocess character patterns using line adjacency graphs.
Serban IliescuRaman ShinghalRaymund Yee-Mian TeoPublished in: Pattern Recognit. (1996)
Keyphrases
- surprising patterns
- line segments
- preprocessing
- graph theory
- power laws
- preprocessing step
- dynamic graph
- tabu search
- pattern mining
- pattern discovery
- search algorithm
- np hard
- graph matching
- optimal solution
- weighted graph
- graph model
- graph theoretic
- optical character recognition
- minimum spanning tree
- random graphs
- evolutionary algorithm