{"title":"Efficient video similarity measurement with video signature","authors":"S. Cheung, A. Zakhor","doi":"10.1109/ICIP.2002.1038101","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1038101","url":null,"abstract":"The video signature method has previously been proposed as a technique to summarize video efficiently for visual similarity measurements (see Cheung, S.-C. and Zakhor, A., Proc. SPIE, vol.3964, p.34-6, 2000; ICIP2000, vol.1, p.85-9, 2000; ICIP2001, vol.1, p.649-52, 2001). We now develop the necessary theoretical framework to analyze this method. We define our target video similarity measure based on the fraction of similar clusters shared between two video sequences. This measure is too computationally complex to be deployed in database applications. By considering this measure geometrically on the image feature space, we find that it can be approximated by the volume of the intersection between Voronoi cells of similar clusters. In the video signature method, sampling is used to estimate this volume. By choosing an appropriate distribution to generate samples, and ranking the samples based upon their distances to the boundary between Voronoi cells, we demonstrate that our target measure can be well approximated by the video signature method. Experimental results on a large dataset of Web video and a set of MPEG-7 test sequences with artificially generated similar versions are used to demonstrate the retrieval performance of our proposed techniques.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"40 1","pages":"I-I"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86221937","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":"Adaptive histograms and dissimilarity measure for texture retrieval and classification","authors":"F. S. Lim, W. Leow","doi":"10.1109/ICIP.2002.1040078","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1040078","url":null,"abstract":"Histogram-based dissimilarity measures are extensively used for content-based image retrieval. In an earlier paper, we proposed an efficient weighted correlation dissimilarity measure for adaptive-binning color histograms. Compared to existing fixed-binning histograms and dissimilarity measures, adaptive histograms together with weighted correlation produce the best overall performance in terms of high accuracy, small number of bins, no empty bin, and efficient computation for image classification and retrieval. This paper follows up on the study of adaptive histograms by applying them to texture classification, retrieval, and clustering. Adaptive histograms are generated from the amplitude of the discrete Fourier transform of images. Extensive comparisons with well-known texture features and dissimilarity measures show that, again, adaptive histograms and weighted correlation produce good overall performance.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"19 1","pages":"II-II"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83933699","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":"Feature-guided painterly image rendering","authors":"Nan Li, Zhiyong Huang","doi":"10.1109/ICIP.2002.1038109","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1038109","url":null,"abstract":"Non-photo-realistic rendering (NPR) refers to any technique which can produce a non-photo-realistic image. We present a method for automatically generating a stroke-based painting from a digital image. The rendering process generates rectangular brush strokes with suitable location, orientation and size. Inspired by the real painting process, where a painter always observes the distinctive features and decides the shape and orientation of the stroke, we apply techniques of image moment functions and texture analysis, from which features are extracted and used to guide the stroke generation. Techniques are also developed for dynamic determination of cropped image size and edge enhancement. The main features in the source image are well preserved.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"189 1","pages":"I-I"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89006908","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":"Learning user-specific parameters in a multibiometric system","authors":"Anil K. Jain, A. Ross","doi":"10.1109/ICIP.2002.1037958","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1037958","url":null,"abstract":"Biometric systems that use a single biometric trait have to contend with noisy data, restricted degrees of freedom, failure-to-enroll problems, spoof attacks, and unacceptable error rates. Multibiometric systems that use multiple traits of an individual for authentication, alleviate some of these problems while improving verification performance. We demonstrate that the performance of multibiometric systems can be further improved by learning user-specific parameters. Two types of parameters are considered here. (i) Thresholds that are used to decide if a matching score indicates a genuine user or an impostor, and (ii) weights that are used to indicate the importance of matching scores output by each biometric trait. User-specific thresholds are computed using the cumulative histogram of impostor matching scores corresponding to each user. The user-specific weights associated with each biometric are estimated by searching for that set of weights which minimizes the total verification error. The tests were conducted on a database of 50 users who provided fingerprint, face and hand geometry data, with 10 of these users providing data over a period of two months. We observed that user-specific thresholds improved system performance by /spl sim/ 2%, while user-specific weights improved performance by /spl sim/ 3%.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"303 1","pages":"I-I"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89045454","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":"Power efficient H.263 video transmission over wireless channels","authors":"X. Lu, Yao Wang, E. Erkip","doi":"10.1109/ICIP.2002.1038078","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1038078","url":null,"abstract":"We introduce an approach for adaptive minimization of the total power consumption of wireless video communications subject to a given level of quality of service. Our approach exploits tradeoffs between the power consumption of the H.263 encoder, the Reed-Solomon channel encoder and the transmitter. Simulation results show that source and channel coding parameters and transmit energy per bit should vary based on channel conditions. Optimized settings can reduce the total power consumption by a significant factor compared to fixed parameter settings which do not match with the channel conditions.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"10 1","pages":"I-I"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80554128","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 compressed domain video object segmentation system","authors":"M. Hayes, M. Jamrozik","doi":"10.1109/ICIP.2002.1037972","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1037972","url":null,"abstract":"A fast means of object segmentation in a video sequence using low-level features existing in the compressed video stream is presented. These features include the DCT coefficient values of I-frames and motion vectors. The work described here is the foundation of a spatial segmentation system that approaches real time. Potential applications for the system include the separation of foreground and background objects and video database searching.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"12 1","pages":"I-I"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81051543","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":"Performance comparisons of multi-modal medical image registration algorithms","authors":"A. Chihoub, R. Bansal, A. Bani-Hashemi","doi":"10.1109/ICIP.2002.1038920","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1038920","url":null,"abstract":"In this paper we study the performance of the maximization of mutual information (MMI) based registration algorithm using a select number of medical image data sets. Where appropriate, we present a comparison of the MMI based algorithm with surface based and centerline (medial axes) based registration algorithms. In the paper we first show that the MMI based registration algorithm can accurately estimate the registration parameters using real patient image data sets. We then present a data set where the MMI based estimates are not as accurate. For this image data set, the MMI based algorithm requires sufficiently close initialization to the true parameters. Also, we show that for such image data sets feature based algorithms, such as, surface based and the centerline based methods, can accurately estimate the registration parameters. The paper also discusses the effects of the optimization method (Powell's versus Simplex) on the quality and computation time of the MMI based and correlation based registration algorithms.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"864 1","pages":"III-III"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90556894","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":"Multigrid image reconstruction from arbitrarily spaced samples","authors":"M. Arigovindan, M. Sühling, P. Hunziker, M. Unser","doi":"10.1109/ICIP.2002.1038985","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1038985","url":null,"abstract":"We propose a novel multiresolution-multigrid based signal reconstruction method from arbitrarily spaced samples. The signal is reconstructed on a uniform grid using B-splines basis functions. The computation of spline weights is formulated as a variational problem. Specifically, we minimize a cost that is a weighted sum of two terms: (i) the sum of squared errors at the specified points; (ii) a quadratic functional that penalizes the lack of smoothness. The problem is equivalent to solving a very large system of linear equations, with the dimension equal to the number of grid points. We develop a computationally efficient multiresolution-multigrid scheme for solving the system. We demonstrate the method with image reconstruction from contour points.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"186 1","pages":"III-III"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80616915","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":"Hidden semi-Markov event sequence models: application to brain functional MRI sequence analysis","authors":"S. Faisan, L. Thoraval, J. Armspach, F. Heitz","doi":"10.1109/ICIP.2002.1038166","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1038166","url":null,"abstract":"Due to the piecewise stationarity assumption required for the observable process of a hidden Markov chain, the application of hidden Markov models (HMMs) to the analysis of event-based random processes remains intricate. For such processes, a new class of HMMs is proposed: the hidden semi-Markov event sequence model (HSMESM). In a HSMESM, the observable process is no more considered as segmental in nature but issued from a detection-characterization preprocessing step. The standard markovian formalism is adapted accordingly. Results obtained in functional MRI sequence analysis validate this novel statistical modeling approach while opening new perspectives in detection-recognition of event-based random processes.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"64 1","pages":"I-I"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85295801","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":"Combined endoscopic video tracking and virtual 3D CT registration for surgical guidance","authors":"W. Higgins, J. P. Helferty","doi":"10.1109/ICIP.2002.1040112","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1040112","url":null,"abstract":"Bronchoscopic needle biopsy is a common step for early lung-cancer detection. This procedure uses two steps: (1) 3D computed-tomography (CT) chest image analysis, to choose a biopsy site; (2) live bronchoscopy, to perform the biopsy. CT-based virtual endoscopic analysis can improve the results of biopsies, yet errors can still occur. We describe a procedure to combine the endoscopic video tracking (the \"real\" world) and CT-based virtual endoscopic registration (the \"virtual\" world). By bringing both sources of information together, a more robust surgical guidance system is realizable. Both the endoscope's video and the thoracic CT scan are used as data sources in the tracking. An optical flow algorithm estimates the endoscope motion between successive video frames. The virtual CT rendering creates a range map for the optical flow equation. This simplifies the endoscope movement calculation into a straightforward linear system. We demonstrate this method for a phantom human airway-tree example.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"23 1","pages":"II-II"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91161787","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}