On Computational Complexity of Non-Reducible Descriptors.
Ventzeslav ValevAsai AsaithambiPublished in: IRI (2003)
Keyphrases
- computational complexity
- high computational complexity
- np complete
- keypoints
- storage requirements
- shape descriptors
- image descriptors
- bit rate
- memory requirements
- decision problems
- information systems
- rotationally invariant
- texture descriptors
- computational efficiency
- low complexity
- rate distortion
- hidden markov models
- special case
- feature vectors
- object recognition
- website
- real time