Graph of Primitives Matching Problem in the World Wide Web CBIR Searching Using Query by Approximate Shapes
| Autor: | Roman Stanisław Deniziak, Tomasz Michno |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
World Wide Web
0209 industrial biotechnology Random search 020901 industrial engineering & automation Mutual position Computer science Multimedia database 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing 02 engineering and technology Graph |
| Zdroj: | Advances in Intelligent Systems and Computing ISBN: 9783030239459 DCAI (Special Sessions) |
| DOI: | 10.1007/978-3-030-23946-6_9 |
| Popis: | The problem of matching two graphs has been considered by many researchers. Our research, the WWW CBIR searching using Query by Approximate Shapes is based on decomposing a query into a graph of primitives, which stores in nodes the type of a primitive with its attributes and in edges the mutual position relations of connected nodes. When the graphs of primitives are stored in a multimedia database used for World Wide Web CBIR searching, the methods of comparisons should be effective because of a very huge number of stored data. Finding such methods was a motivation for this research. In this initial research only the simplest methods are examined: NEH-based, random search-based and Greedy. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|