{"title":"一种改进的度量空间相似性搜索结构:在图像数据库中的应用","authors":"Y. Hanyf, H. Silkan, H. Labani","doi":"10.1109/CGIV.2016.22","DOIUrl":null,"url":null,"abstract":"In last decades, the similarity search is very required in various fields such as pattern recognition, security, and multimedia databases. Although the metric approach usefulness for speeding similarity search in complex databases, the searching cost optimization still an open problem. In this paper we propose an improvable pivot-based method which can improve its research efficiency based on the past users' queries. Because images are the most data type which are concerned by the similarity search, the proposed method is tested on a real images database. The experiments show that the proposed method can significantly improve its searching efficiency relying on queries resolution.","PeriodicalId":351561,"journal":{"name":"2016 13th International Conference on Computer Graphics, Imaging and Visualization (CGiV)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Improvable Structure for Similarity Searching in Metric Spaces: Application on Image Databases\",\"authors\":\"Y. Hanyf, H. Silkan, H. Labani\",\"doi\":\"10.1109/CGIV.2016.22\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In last decades, the similarity search is very required in various fields such as pattern recognition, security, and multimedia databases. Although the metric approach usefulness for speeding similarity search in complex databases, the searching cost optimization still an open problem. In this paper we propose an improvable pivot-based method which can improve its research efficiency based on the past users' queries. Because images are the most data type which are concerned by the similarity search, the proposed method is tested on a real images database. The experiments show that the proposed method can significantly improve its searching efficiency relying on queries resolution.\",\"PeriodicalId\":351561,\"journal\":{\"name\":\"2016 13th International Conference on Computer Graphics, Imaging and Visualization (CGiV)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 13th International Conference on Computer Graphics, Imaging and Visualization (CGiV)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CGIV.2016.22\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 13th International Conference on Computer Graphics, Imaging and Visualization (CGiV)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CGIV.2016.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Improvable Structure for Similarity Searching in Metric Spaces: Application on Image Databases
In last decades, the similarity search is very required in various fields such as pattern recognition, security, and multimedia databases. Although the metric approach usefulness for speeding similarity search in complex databases, the searching cost optimization still an open problem. In this paper we propose an improvable pivot-based method which can improve its research efficiency based on the past users' queries. Because images are the most data type which are concerned by the similarity search, the proposed method is tested on a real images database. The experiments show that the proposed method can significantly improve its searching efficiency relying on queries resolution.