{"title":"模糊区域完全有向图间比较的图像检索","authors":"A. Gallas, W. Barhoumi, E. Zagrouba","doi":"10.1109/ICCP.2012.6356182","DOIUrl":null,"url":null,"abstract":"Images comparison is the most critical step in the content-based image retrieval process. Therefore, we propose in this paper our approach of comparison based on image modeling by complete oriented graph. This structure encompasses low-level region descriptors in nodes and coarse spatial disposition in edges. Each node is characterized by its wavelet transformation high frequency sub-band weighted by the region importance. Similarity degree between two images is identified thereafter by comparing their graphs using heuristics to guarantee low computational overhead and to resolve the NP-hard matching problem between graphs. The experimental results and comparison made with similar image retrieval engines indicate the robustness of the proposed approach for Wang dataset and prove the applied heuristics.","PeriodicalId":406461,"journal":{"name":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Image retrieval by comparison between complete oriented graphs of fuzzy regions\",\"authors\":\"A. Gallas, W. Barhoumi, E. Zagrouba\",\"doi\":\"10.1109/ICCP.2012.6356182\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Images comparison is the most critical step in the content-based image retrieval process. Therefore, we propose in this paper our approach of comparison based on image modeling by complete oriented graph. This structure encompasses low-level region descriptors in nodes and coarse spatial disposition in edges. Each node is characterized by its wavelet transformation high frequency sub-band weighted by the region importance. Similarity degree between two images is identified thereafter by comparing their graphs using heuristics to guarantee low computational overhead and to resolve the NP-hard matching problem between graphs. The experimental results and comparison made with similar image retrieval engines indicate the robustness of the proposed approach for Wang dataset and prove the applied heuristics.\",\"PeriodicalId\":406461,\"journal\":{\"name\":\"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCP.2012.6356182\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 8th International Conference on Intelligent Computer Communication and Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCP.2012.6356182","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Image retrieval by comparison between complete oriented graphs of fuzzy regions
Images comparison is the most critical step in the content-based image retrieval process. Therefore, we propose in this paper our approach of comparison based on image modeling by complete oriented graph. This structure encompasses low-level region descriptors in nodes and coarse spatial disposition in edges. Each node is characterized by its wavelet transformation high frequency sub-band weighted by the region importance. Similarity degree between two images is identified thereafter by comparing their graphs using heuristics to guarantee low computational overhead and to resolve the NP-hard matching problem between graphs. The experimental results and comparison made with similar image retrieval engines indicate the robustness of the proposed approach for Wang dataset and prove the applied heuristics.