{"title":"二维对象的高效检索和空间查询","authors":"C. Shahabi, Maytham Safar","doi":"10.1109/MMCS.1999.779270","DOIUrl":null,"url":null,"abstract":"Besides traditional applications (e.g., CAD/CAM and Trademark registry), new multimedia applications such as structured video, animation and MPEG-4 standard require the storage and management of well-defined objects. For efficient retrieval of 2D objects by shape, we propose three index structures on features that are extracted from the objects' minimum bounding circles (MBC). A major observation is that those features are unique per object and can be utilized to filter out non-similar candidates. To evaluate our techniques, we conducted a simulation study on a database of 2D objects. The results show the superiority of our techniques as compared to a naive indexing (at least 40% improvement in I/O cost). We also identify one of the indexing structures as the superior one, independent of the size of the database and the number of vertices of the objects.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Efficient retrieval and spatial querying of 2D objects\",\"authors\":\"C. Shahabi, Maytham Safar\",\"doi\":\"10.1109/MMCS.1999.779270\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Besides traditional applications (e.g., CAD/CAM and Trademark registry), new multimedia applications such as structured video, animation and MPEG-4 standard require the storage and management of well-defined objects. For efficient retrieval of 2D objects by shape, we propose three index structures on features that are extracted from the objects' minimum bounding circles (MBC). A major observation is that those features are unique per object and can be utilized to filter out non-similar candidates. To evaluate our techniques, we conducted a simulation study on a database of 2D objects. The results show the superiority of our techniques as compared to a naive indexing (at least 40% improvement in I/O cost). We also identify one of the indexing structures as the superior one, independent of the size of the database and the number of vertices of the objects.\",\"PeriodicalId\":408680,\"journal\":{\"name\":\"Proceedings IEEE International Conference on Multimedia Computing and Systems\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"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.779270\",\"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.779270","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient retrieval and spatial querying of 2D objects
Besides traditional applications (e.g., CAD/CAM and Trademark registry), new multimedia applications such as structured video, animation and MPEG-4 standard require the storage and management of well-defined objects. For efficient retrieval of 2D objects by shape, we propose three index structures on features that are extracted from the objects' minimum bounding circles (MBC). A major observation is that those features are unique per object and can be utilized to filter out non-similar candidates. To evaluate our techniques, we conducted a simulation study on a database of 2D objects. The results show the superiority of our techniques as compared to a naive indexing (at least 40% improvement in I/O cost). We also identify one of the indexing structures as the superior one, independent of the size of the database and the number of vertices of the objects.