Combi Carlo, G. Foresti, Massimo Franceschet, A. Montanari
{"title":"基于扩展网格文件的图像数据库形状索引","authors":"Combi Carlo, G. Foresti, Massimo Franceschet, A. Montanari","doi":"10.1109/MMCS.1999.778291","DOIUrl":null,"url":null,"abstract":"We propose an original indexing by shape of image databases based on extended grid files. We first introduce a recently developed shape description method and tailor it to obtain suitable representation structures for image databases. Then, in order to efficiently support image retrieval, we define an indexing structure based on grid files, since grid files were originally developed to speed up point (exact match) and range (nearest neighbors within a threshold) queries on multidimensional data with a fired number of attributes, we extend them to cope with data provided with a varying number of attributes and to deal with a new class of queries relevant to image databases, namely, nearest neighbor queries. We give a detailed description of the proposed search algorithms and a systematic analysis of their complexity, and discuss the outcomes of some experimental tests on sample image databases.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Indexing by shape of image databases based on extended grid files\",\"authors\":\"Combi Carlo, G. Foresti, Massimo Franceschet, A. Montanari\",\"doi\":\"10.1109/MMCS.1999.778291\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose an original indexing by shape of image databases based on extended grid files. We first introduce a recently developed shape description method and tailor it to obtain suitable representation structures for image databases. Then, in order to efficiently support image retrieval, we define an indexing structure based on grid files, since grid files were originally developed to speed up point (exact match) and range (nearest neighbors within a threshold) queries on multidimensional data with a fired number of attributes, we extend them to cope with data provided with a varying number of attributes and to deal with a new class of queries relevant to image databases, namely, nearest neighbor queries. We give a detailed description of the proposed search algorithms and a systematic analysis of their complexity, and discuss the outcomes of some experimental tests on sample image databases.\",\"PeriodicalId\":408680,\"journal\":{\"name\":\"Proceedings IEEE International Conference on Multimedia Computing and Systems\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE International Conference on Multimedia Computing and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MMCS.1999.778291\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE International Conference on Multimedia Computing and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMCS.1999.778291","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Indexing by shape of image databases based on extended grid files
We propose an original indexing by shape of image databases based on extended grid files. We first introduce a recently developed shape description method and tailor it to obtain suitable representation structures for image databases. Then, in order to efficiently support image retrieval, we define an indexing structure based on grid files, since grid files were originally developed to speed up point (exact match) and range (nearest neighbors within a threshold) queries on multidimensional data with a fired number of attributes, we extend them to cope with data provided with a varying number of attributes and to deal with a new class of queries relevant to image databases, namely, nearest neighbor queries. We give a detailed description of the proposed search algorithms and a systematic analysis of their complexity, and discuss the outcomes of some experimental tests on sample image databases.