On the Computational Complexity of Ordered Subgraph Recognition.
Dwight DuffusMark GinnVojtech RödlPublished in: Random Struct. Algorithms (1995)
Keyphrases
- document images
- document analysis
- computational complexity
- recognition rate
- np hard
- object recognition
- feature extraction
- recognition algorithm
- recognition accuracy
- pattern recognition
- automatic recognition
- computationally efficient
- recognition process
- gesture recognition
- image recognition
- action recognition
- high computational complexity
- visual recognition
- graph mining
- character recognition
- special case
- np complete
- rate distortion
- partial occlusion
- low complexity
- face recognition
- computational efficiency
- shape recognition
- handwritten characters