{"title":"A retrieval pattern-based inter-query learning approach for content-based image retrieval","authors":"Adam D. Gilbert, Ran Chang, Xiaojun Qi","doi":"10.1109/ICIP.2010.5654156","DOIUrl":"https://doi.org/10.1109/ICIP.2010.5654156","url":null,"abstract":"This paper presents a retrieval pattern-based inter-query learning approach for image retrieval with relevance feedback. The proposed system combines SVM-based low-level learning and semantic correlation-based high-level learning to construct a semantic matrix to store retrieval patterns of a certain number of randomly chosen query sessions. User's relevance feedback is utilized for updating high-level semantic features of the query image and each database image. Extensive experiments demonstrate our system outperforms three peer systems in the context of both correct and erroneous feedback. Our retrieval system also achieves high retrieval accuracy after the first iteration.","PeriodicalId":228308,"journal":{"name":"2010 IEEE International Conference on Image Processing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123810860","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An adaptive clustering and chrominance-based merging approach for image segmentation and abstraction","authors":"Lulu He, T. Pappas","doi":"10.1109/ICIP.2010.5651905","DOIUrl":"https://doi.org/10.1109/ICIP.2010.5651905","url":null,"abstract":"We present a novel, computationally efficient approach for natural image segmentation that uses the adaptive clustering algorithm (ACA) to obtain an initial segmentation and chrominance-based region merging to consolidate regions of perceptually uniform texture. The combination of ACA and chrominance-based merging preserves salient edges and smooths out noise and edges within textured regions. It can thus be used for image abstraction. Experimental results with natural images indicate the effectiveness of the proposed approach.","PeriodicalId":228308,"journal":{"name":"2010 IEEE International Conference on Image Processing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123887802","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Filterbank-based universal demosaicking","authors":"Jing Gu, P. Wolfe, Keigo Hirakawa","doi":"10.1109/ICIP.2010.5649949","DOIUrl":"https://doi.org/10.1109/ICIP.2010.5649949","url":null,"abstract":"Recent advances in spatio-spectral sampling and panchromatic pixels have contributed to increased spatial resolution and enhanced noise performance. As such, it is necessary to consider the universality of demosaicking design principles—instead of CFA-specific optimization for signal recovery. In this article, we introduce a new universal demosaicking method that draws from the lessons learned in Bayer demosaicking designs, but can be applied to arbitrary array patterns. We recast the data-dependence of Bayer demosaicking as a parsimonious reconstruction of the underlying image signal that is inherently sparse in some representation. Using properties of filterbanks, we generalize this principle to yield a nonlinear recovery method that is consistent with the state-of-the-art Bayer demosaicking methods.","PeriodicalId":228308,"journal":{"name":"2010 IEEE International Conference on Image Processing","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123923518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Nicolas Hervé, A. Servais, E. Thervet, J. Olivo-Marin, V. Meas-Yedid
{"title":"Improving histology images segmentation through spatial constraints and supervision","authors":"Nicolas Hervé, A. Servais, E. Thervet, J. Olivo-Marin, V. Meas-Yedid","doi":"10.1109/ICIP.2010.5652083","DOIUrl":"https://doi.org/10.1109/ICIP.2010.5652083","url":null,"abstract":"We introduce two approaches to improve an existing color segmentation technique based on a Split and Merge quantization process for the study of stained histological images. We propose to modify the merge criterion : first, we include a spatial constraints heuristic; then we suggest the use of supervision and a more elaborated visual features representation. We tested these approaches on a renal biopsies dataset to automatically quantify interstitial fibrosis and show that supervision brings very significant improvements.","PeriodicalId":228308,"journal":{"name":"2010 IEEE International Conference on Image Processing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123386785","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Junchi Yan, Jian Liu, Yin Li, Zhibin Niu, Yuncai Liu
{"title":"Visual saliency detection via rank-sparsity decomposition","authors":"Junchi Yan, Jian Liu, Yin Li, Zhibin Niu, Yuncai Liu","doi":"10.1109/ICIP.2010.5652280","DOIUrl":"https://doi.org/10.1109/ICIP.2010.5652280","url":null,"abstract":"Saliency mechanism has been considered crucial in the human visual system and helpful to object detection and recognition. This paper addresses a novel feature-based model for visual saliency detection. It consists of two steps: first, using the learned overcomplete sparse bases to represent image patches; and then, estimating saliency information via direct low-rank and sparsity matrix decomposition. We compare our model with the previous methods on natural images. Experimental results show that our model performs competitively for visual saliency detection task, and suggest the potential application of matrix decomposition and convex optimization for image analysis.","PeriodicalId":228308,"journal":{"name":"2010 IEEE International Conference on Image Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123519058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"SIFT in perception-based color space","authors":"Yan Cui, A. Pagani, D. Stricker","doi":"10.1109/ICIP.2010.5651165","DOIUrl":"https://doi.org/10.1109/ICIP.2010.5651165","url":null,"abstract":"Scale Invariant Feature Transform (SIFT) has been proven to be the most robust local invariant feature descriptor. However, SIFT is designed mainly for grayscale images. Many local features can be misclassified if their color information is ignored. Motivated by perceptual principles, this paper addresses a new color space, called perception-based color space, in which the associated metric approximates perceived distances and color displacements and captures illumination invariant relationship. Instead of using grayscale values to represent the input image, the proposed approach builds the SIFT descriptors in the new color space, resulting in a descriptor that is more robust than the standard SIFT with respect to color and illumination variations. The evaluation results support the potential of the proposed approach.","PeriodicalId":228308,"journal":{"name":"2010 IEEE International Conference on Image Processing","volume":"11 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120918165","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Event tactic analysis in sports video using spatio-temporal pattern","authors":"Minh-Son Dao, Keita Masui, N. Babaguchi","doi":"10.1109/ICIP.2010.5652340","DOIUrl":"https://doi.org/10.1109/ICIP.2010.5652340","url":null,"abstract":"Recently, event detection in sports videos has been gaining some remarkable results. Unfortunately, there is a lack of useful tools for users to explore and exploit these event clips on their own demands. In this paper, a novel method using spatio-temporal patterns to analyze event tactics in sports videos is introduced. The proposed method aims to understand tactics of events such as distributions and speeds of players, or attacking/defensive formations throughout a time when such events happen without tracking objects. The major contribution of the proposed method is to model event tactics by using sequence of symbols. Each symbol represents a distribution of players in a certain period of time. Therefore, a sequence of symbols intrinsically is concerned as spatio-temporal patterns. By using these patterns, an event tactic is detected, explained, and integrated into an event video to create a visualizing abstract. This visualizing abstract is very useful to help users understand an event tactic without watching whole clip. Moreover, users could query by an example or by a text to find all events sharing the same tactic. Thorough testing with over 100 goal clips in soccer domain demonstrate the superiority of the proposed method in terms of precision recall ratios.","PeriodicalId":228308,"journal":{"name":"2010 IEEE International Conference on Image Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114309091","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A learning framework for robust hashing of face images","authors":"Kamil Senel, M. K. Mihçak, V. Monga","doi":"10.1109/ICIP.2010.5651070","DOIUrl":"https://doi.org/10.1109/ICIP.2010.5651070","url":null,"abstract":"Robust image hashing has been actively researched over the last decade with varied applications in image content authentication and identification under distortions. In the existing literature on robust image hashing, hash algorithms are ignorant of the class of images being hashed. There are however significant application domains such as that of face image hashing where apriori knowledge of the image class as well as permissible distortions can benefit hash algorithm design. In this paper, we present a two stage cascade of dimensionality reduction constructs for face image hashing. The first stage aims to project the face image to a space where geometric distortions manifest approximately as additive noise. For this purpose, we use the non-negative matrix approximations based hash vector developed by Monga et al. which is known to possess excellent geometric attack robustness. In the second stage, we employ oriented principal component analysis (OPCA) based on estimating signal as well as noise statistics in a learning phase and deriving a projection that mitigates the effect of noise. We obtain both experimentally based ROC curves as well as analytical ones via a detection theoretic analysis of the proposed framework. The ROC curves reveal clearly that incorporating such a learning phase greatly reduces error probabilities.","PeriodicalId":228308,"journal":{"name":"2010 IEEE International Conference on Image Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114628030","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yin Li, Yue Zhou, Junchi Yan, Jie Yang, Xiangjian He
{"title":"Tensor error correction for corrupted values in visual data","authors":"Yin Li, Yue Zhou, Junchi Yan, Jie Yang, Xiangjian He","doi":"10.1109/ICIP.2010.5654055","DOIUrl":"https://doi.org/10.1109/ICIP.2010.5654055","url":null,"abstract":"The multi-channel image or the video clip has the natural form of tensor. The values of the tensor can be corrupted due to noise in the acquisition process. We consider the problem of recovering a tensor L of visual data from its corrupted observations X = L + S, where the corrupted entries S are unknown and unbounded, but are assumed to be sparse. Our work is built on the recent studies about the recovery of corrupted low-rank matrix via trace norm minimization. We extend the matrix case to the tensor case by the definition of tensor trace norm in [6]. Furthermore, the problem of tensor is formulated as a convex optimization, which is much harder than its matrix form. Thus, we develop a high quality algorithm to efficiently solve the problem. Our experiments show potential applications of our method and indicate a robust and reliable solution.","PeriodicalId":228308,"journal":{"name":"2010 IEEE International Conference on Image Processing","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114837261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Non-linear optimization for robust estimation of vanishing points","authors":"M. Nieto, L. Salgado","doi":"10.1109/ICIP.2010.5652381","DOIUrl":"https://doi.org/10.1109/ICIP.2010.5652381","url":null,"abstract":"A new method for robust estimation of vanishing points is introduced in this paper. It is based on the MSAC (M-estimator Sample and Consensus) algorithm and on the definition of a new distance function between a vanishing point and a given orientation. Apart from the robustness, our method represents a flexible and efficient solution, since it allows to work with different type of image data, and its iterative nature makes better use of the available information to obtain more accurate estimates. The key issue of the work is the proposed distance function, that makes the error to be independent from the position of an hypothesized vanishing point, which allows to work with points at the infinity. Besides, the estimation process is guided by a non-linear optimization process that enhances the accuracy of the system. The robustness of our proposal, compared with other methods in the literature is shown with a set of tests carried out for both synthetic data and real images. The results show that our approach obtain excellent levels of accuracy and that is definitely robust against the presence of large amounts of outliers, outperforming other state of the art approaches.","PeriodicalId":228308,"journal":{"name":"2010 IEEE International Conference on Image Processing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124511504","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}