{"title":"Modeling spatial relationships between color sets","authors":"Berretti, Del Bimbo, Vicario","doi":"10.1109/IVL.2000.853843","DOIUrl":"https://doi.org/10.1109/IVL.2000.853843","url":null,"abstract":"Modeling of image content based on chromatic arrangement includes representation of the spatial relationship between complex sets of pixels. We propose a model of spatial directional relationship between extended sets. This involves the same computational and programming complexity as that of conventional representations based on centroids, but it is able to account for the overall sets of pixels without reducing them to a single representative point or to a bounding rectangle. The gain in effectiveness is evaluated in a user-based comparison with a representation based on mutual centroid orientation.","PeriodicalId":333664,"journal":{"name":"2000 Proceedings Workshop on Content-based Access of Image and Video Libraries","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121249978","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":"Toward perception-based image retrieval","authors":"Edward Y Chang, Beitao Li, Chen Li","doi":"10.1109/IVL.2000.853848","DOIUrl":"https://doi.org/10.1109/IVL.2000.853848","url":null,"abstract":"Since a content based image retrieval (CBIR) system services people, its image characterization and similarity measure must closely follow perceptual characteristics. The authors enumerate a few psychological and physiological invariants and show how they can be considered by a CBIR system. They propose distance functions to measure perceptual similarity for color, shape and spatial distribution. In addition, the authors believe that an image search engine should model after their visual system, which adjusts to the environment and adapts to the visual goals. They show that they can decompose the visual front-end into filters of different functions and resolutions. A pipeline of filters can be dynamically constructed to meet the requirement of a search task and to adapt to an individual's search objectives.","PeriodicalId":333664,"journal":{"name":"2000 Proceedings Workshop on Content-based Access of Image and Video Libraries","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114786913","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":"Mathematical modeling of image database complexity","authors":"A. Rao, R. Srihari, L. Zhu, A. Zhang","doi":"10.1109/IVL.2000.853849","DOIUrl":"https://doi.org/10.1109/IVL.2000.853849","url":null,"abstract":"The performance of a content based image retrieval system strongly depends on its testbed. A theoretical framework is proposed for modeling image database complexity. The goal is to investigate the relationship between a given indexing technique and a given image database. As an analogy to the concept of perplexity of a text corpus, the complexity of an image database is introduced. This is a quantitative measure of the quality of an image database for the task of content access to the database. The complexity of an image database is an intrinsic property of the database and can be used to distinguish the difficulty of image retrieval on different databases. On the other hand, the measure can be used to compare the effectiveness of different indexing techniques.","PeriodicalId":333664,"journal":{"name":"2000 Proceedings Workshop on Content-based Access of Image and Video Libraries","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126633496","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":"Image retrieval: feature primitives, feature representation, and relevance feedback","authors":"Xiang Sean Zhou, Thomas S. Huang","doi":"10.1109/IVL.2000.853832","DOIUrl":"https://doi.org/10.1109/IVL.2000.853832","url":null,"abstract":"In this paper feature selection and representation techniques in CBIR systems are reviewed and interpreted in a unified feature representation paradigm. We revise our previously proposed water-filling edge features with newly proposed primitives and present them using this unified feature formation paradigm. Experiments and comparisons are performed to illustrate the characteristics of the new features. Also proposed is sub-image feature extraction for regional matching. Relevance feedback as an on-line learning mechanism is adopted for feature and tile selection and weighting during the retrieval.","PeriodicalId":333664,"journal":{"name":"2000 Proceedings Workshop on Content-based Access of Image and Video Libraries","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128834500","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":"Interval hash tree: an efficient index structure for searching object queries in large image databases","authors":"T. Syeda-Mahmood, P. Raghaan, N. Megiddo","doi":"10.1109/IVL.2000.853844","DOIUrl":"https://doi.org/10.1109/IVL.2000.853844","url":null,"abstract":"As image databases grow large in size, index structures for fast navigation become important. In particular, when the goal is to locate object queries in image databases under changes in pose, occlusions and spurious data, traditional index structures used in database become unsuitable. This paper presents a novel index structure called the interval hash tree, for locating multi-region object queries in image databases. The utility of the index structure is demonstrated for query localization in a large image database.","PeriodicalId":333664,"journal":{"name":"2000 Proceedings Workshop on Content-based Access of Image and Video Libraries","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121386164","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":"AutoAlbum: clustering digital photographs using probabilistic model merging","authors":"Microsoft Way Redmond","doi":"10.1109/IVL.2000.853847","DOIUrl":"https://doi.org/10.1109/IVL.2000.853847","url":null,"abstract":"Consumers need help finding digital photographs in their personal collections. AutoAlbum helps users find their photos by automatically clustering photos into an album. The albums are presented in an easy-to-use browsing user interface. AutoAlbum uses the time and order of photo creation to assist in clustering: albums consist of temporally contiguous photos. The content based clustering algorithm is best-first probabilistic model merging, which is fast and yields clusters that are often semantically meaningful.","PeriodicalId":333664,"journal":{"name":"2000 Proceedings Workshop on Content-based Access of Image and Video Libraries","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114673050","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}
M. Naphade, I. Kozintsev, T. Huang, K. Ramchandran
{"title":"A factor graph framework for semantic indexing and retrieval in video","authors":"M. Naphade, I. Kozintsev, T. Huang, K. Ramchandran","doi":"10.1109/IVL.2000.853836","DOIUrl":"https://doi.org/10.1109/IVL.2000.853836","url":null,"abstract":"This paper proposes a novel framework for semantic indexing and retrieval in digital video. The components of the framework are probabilistic multimedia objects (multijects) and a network of such objects (multinets). The main contribution of this paper is a novel application of a factor graph framework to model the interactions in a network of multijects (multinet) at a semantic level. Factor graphs are statistical graphical models that provide an efficient framework for exact and approximate inference via the sum-product algorithm. Incorporating the statistical interactions between the concepts using factor graphs enhances the detection probability of individual multijects and provides a unified framework for integrating multiple modalities and supports inference of unobservable concepts based on their relation with observable concepts. Our experiments reveal significant performance improvement using the inference on the factor graph models.","PeriodicalId":333664,"journal":{"name":"2000 Proceedings Workshop on Content-based Access of Image and Video Libraries","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125976888","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":"Matching with shape contexts","authors":"Serge J. Belongie, J. Malik","doi":"10.1109/IVL.2000.853834","DOIUrl":"https://doi.org/10.1109/IVL.2000.853834","url":null,"abstract":"We introduce a new shape descriptor, the shape context, for measuring shape similarity and recovering point correspondences. The shape context describes the coarse arrangement of the shape with respect to a point inside or on the boundary of the shape. We use the shape context as a vector-valued attribute in a bipartite graph matching framework. Our proposed method makes use of a relatively small number of sample points selected from the set of detected edges; no special landmarks or keypoints are necessary. Tolerance and/or invariance to common image transformations are available within our framework. Using examples involving both silhouettes and edge images, we demonstrate how the solution to the graph matching problem provides us with correspondences and a dissimilarity score that can be used for object recognition and similarity-based retrieval.","PeriodicalId":333664,"journal":{"name":"2000 Proceedings Workshop on Content-based Access of Image and Video Libraries","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132022943","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":"Using artificial queries to evaluate image retrieval","authors":"N. Howe","doi":"10.1109/IVL.2000.853831","DOIUrl":"https://doi.org/10.1109/IVL.2000.853831","url":null,"abstract":"This paper addresses the evaluation and comparison of algorithms for generalized image retrieval. The forms of evaluation currently in vogue are not calibrated with each other and thus do not allow the comparison of results reported by different research groups. We address the problem by proposing a class of tests that are algorithmically defined and relatively independent of the image test set. The proposed tests can be tailored to investigate retrieval performance under specific sets of adverse conditions, allowing additional insight into the strengths and weaknesses of different retrieval mechanisms.","PeriodicalId":333664,"journal":{"name":"2000 Proceedings Workshop on Content-based Access of Image and Video Libraries","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123786877","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":"Region correspondence for image matching via EMD flow","authors":"H. Greenspan, G. Dvir, Y. Rubner","doi":"10.1109/IVL.2000.853835","DOIUrl":"https://doi.org/10.1109/IVL.2000.853835","url":null,"abstract":"The content of an image can be summarized by a set of homogeneous regions in an appropriate feature space. When exact shape is not important, the regions can be represented by simple \"blobs\". Even for similar images, the blobs in the two images might vary in shape, position, and the represented features. In addition, separate blobs in one image might get merged together in the other image. We present a novel method to compute the dissimilarity of two sets of blobs. Gaussian mixture modeling is used to represent the input images. The Earth Mover's Distance (EMD) is utilized to compute both the dissimilarity of the images and the flow matrix of the blobs between the images. The flow is used to merge blobs such that the dissimilarity between the images gets smaller. Examples are shown on synthetic and natural images.","PeriodicalId":333664,"journal":{"name":"2000 Proceedings Workshop on Content-based Access of Image and Video Libraries","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122646036","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}