On intractability of spatial relationships in content-based image database systems
From MaRDI portal
Recommendations
- A remark on NP-completeness of picture matching
- Efficient access methods for image databases
- A stepwise approximation of intractable spatial constraints in image queries
- On consistency checking of spatial relationships in content-based image database systems
- Computational complexity of similarity retrieval in a pictorial database
Cited in
(8)- Geombinatoric aspects of processing large images and large spatial databases
- Computational complexity of similarity retrieval in a pictorial database
- The consistency problem on content-based pictorial description in pictorial database systems
- Elastic image matching is NP-complete
- A remark on NP-completeness of picture matching
- On consistency checking of spatial relationships in content-based image database systems
- A stepwise approximation of intractable spatial constraints in image queries
- Finding minimal and maximal sets of spatial relationships in pictorial retrieval systems
This page was built for publication: On intractability of spatial relationships in content-based image database systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2493523)