{"title":"低访问延迟图像索引和检索的分层方法","authors":"E. Izquierdo, Jun Feng","doi":"10.1109/ICIP.2001.958947","DOIUrl":null,"url":null,"abstract":"A major problem to be faced when efficient schemas for image indexing and retrieval are envisaged is the large workload and high complexity of underlying image-processing algorithms. The research leading to this paper focused on this problem, i.e. efficiency and scalability. A novel representation of color histograms is presented. The introduced model is based on hierarchical image adaptive color histograms. One important aspect of the envisaged hierarchic definition is that details at various levels of scale can be obtained. For fast search of similar features in large databases large sets of non-similar images are discriminated at very low computational cost using low detailed descriptions. The search is then progressively refined until only a few very similar objects or images are found and ranked using higher levels of detail. To assess the performance of the approach several experiments have been conducted. Selected results are reported.","PeriodicalId":291827,"journal":{"name":"Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A hierarchical approach for low-access latency image indexing and retrieval\",\"authors\":\"E. Izquierdo, Jun Feng\",\"doi\":\"10.1109/ICIP.2001.958947\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A major problem to be faced when efficient schemas for image indexing and retrieval are envisaged is the large workload and high complexity of underlying image-processing algorithms. The research leading to this paper focused on this problem, i.e. efficiency and scalability. A novel representation of color histograms is presented. The introduced model is based on hierarchical image adaptive color histograms. One important aspect of the envisaged hierarchic definition is that details at various levels of scale can be obtained. For fast search of similar features in large databases large sets of non-similar images are discriminated at very low computational cost using low detailed descriptions. The search is then progressively refined until only a few very similar objects or images are found and ranked using higher levels of detail. To assess the performance of the approach several experiments have been conducted. Selected results are reported.\",\"PeriodicalId\":291827,\"journal\":{\"name\":\"Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIP.2001.958947\",\"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 2001 International Conference on Image Processing (Cat. No.01CH37205)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIP.2001.958947","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A hierarchical approach for low-access latency image indexing and retrieval
A major problem to be faced when efficient schemas for image indexing and retrieval are envisaged is the large workload and high complexity of underlying image-processing algorithms. The research leading to this paper focused on this problem, i.e. efficiency and scalability. A novel representation of color histograms is presented. The introduced model is based on hierarchical image adaptive color histograms. One important aspect of the envisaged hierarchic definition is that details at various levels of scale can be obtained. For fast search of similar features in large databases large sets of non-similar images are discriminated at very low computational cost using low detailed descriptions. The search is then progressively refined until only a few very similar objects or images are found and ranked using higher levels of detail. To assess the performance of the approach several experiments have been conducted. Selected results are reported.