{"title":"Multiscale asymmetry signatures for texture analysis","authors":"G. V. D. Wouwer, B. Weyn, D. Dyck","doi":"10.1109/ICIP.2004.1421353","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421353","url":null,"abstract":"This paper investigates model-based texture feature extraction from image multiscale representations. This approach offers a better texture characterization compared to using the classical energy output of a multiscale filterbank. The existing models assume symmetric density functions and we observe that this assumption is violated for some texture classes. This property is exploited to obtain improved texture characterization which can be used for texture classification, segmentation and retrieval.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115884422","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 novel two-steps strategy for automatic GIS-image registration","authors":"Zhanwu Yu, V. Prinet, Chunhong Pan","doi":"10.1109/ICIP.2004.1421402","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421402","url":null,"abstract":"In this paper, we propose a registration method between GIS data and high-resolution satellite images of urban scenes. Our approach consists of two steps: firstly, the urban straight main road features in images are extracted by combining their spectral information with a geometric constraint. Then, by exploiting the frequency spectrum property of linear stripe regions, we perform matching of the road layer of geographic information data and feature images using a new FFT-based algorithm. The significant advantage of the approach is its capability to match the rotated and scaled images robustly even when they have a large scale change or obvious geometric differences. Experimental results demonstrate the robustness and efficiency of the method.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124329920","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 supervised nonlinear local embedding for face recognition","authors":"Jian Cheng, Qingshan Liu, Hanqing Lu, Yenwei Chen","doi":"10.1109/ICIP.2004.1418695","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1418695","url":null,"abstract":"Many recent works demonstrated that subspace analysis is a good method for face recognition. How to find the subspace is a key issue. In this paper, a supervised nonlinear local embedding (SNLE) method is proposed to construct a subspace for face recognition, in which we combine the idea of nonlinear kernel mapping and preserving local geometric relations of the samples belonging to same class. SNLE can not only gain a perfect approximation of the nonlinear face manifold, but also enhance within-class local information. Moreover, it is also equivalent to solving a generalized eigenvalue problem in mathematics. Our experiments are performed on two benchmarks, and experimental results show that the proposed method has an encouraging performance.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114306140","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}
D. Mukherjee, Geraldine Kuo, Shih-Ta Hsiang, Sam Liu, A. Said
{"title":"Format-independent scalable bit-stream adaptation using MPEG-21 DIA","authors":"D. Mukherjee, Geraldine Kuo, Shih-Ta Hsiang, Sam Liu, A. Said","doi":"10.1109/ICIP.2004.1421684","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421684","url":null,"abstract":"Part 7 of MPEG-21 entitled digital item adaptation (DIA), is an emerging metadata standard defining protocols and descriptions enabling content adaptation for a wide variety of networks and terminals, with emphasis on format-independent mechanisms. The DIA descriptions provide a standardized interface not only to a variety of format-specific adaptation engines, but also to a fully format-independent adaptation engine for scalable bit-streams. A format-independent engine contains a decision-taking module operating in a semantics-independent manner, cascaded with a bit-stream adaptation module that uses an XML transformation to model the bit-stream adaptation process using parameters derived from decisions made. In this paper, we describe the DIA descriptions that enable such fully format-independent bit-stream adaptation. Universal adaptation engines substantially reduce the adoption costs because the same infrastructure can be used for different types of scalable media, including proprietary and encrypted.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114309484","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}
A. Smolic, K. Müller, P. Merkle, Tobias Rein, M. Kautzner, P. Eisert, T. Wiegand
{"title":"Free viewpoint video extraction, representation, coding, and rendering","authors":"A. Smolic, K. Müller, P. Merkle, Tobias Rein, M. Kautzner, P. Eisert, T. Wiegand","doi":"10.1109/ICIP.2004.1421816","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421816","url":null,"abstract":"Free viewpoint video provides the possibility to freely navigate within dynamic real world video scenes by choosing arbitrary viewpoints and view directions. So far, related work only considered free viewpoint video extraction, representation, and rendering methods. Compression and transmission has not yet been studied in detail and combined with the other components into one complete system. In this paper, we present such a complete system for efficient free viewpoint video extraction, representation, coding, and interactive rendering. Data representation is based on 3D mesh models and view-dependent texture mapping using video textures. The geometry extraction is based on a shape-from-silhouette algorithm. The resulting voxel models are converted into 3D meshes that are coded using MPEG-4 SNHC tools. The corresponding video textures are coded using an H.264/AVC codec. Our algorithms for view-dependent texture mapping have been adopted as an extension of MPEG-4 AFX. The presented results illustrate that based on the proposed methods a complete transmission system for efficient free viewpoint video can be built.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114830027","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":"Document image rectification using fuzzy sets and morphological operators","authors":"Shijian Lu, Ben M. Chen, C. Ko","doi":"10.1109/ICIP.2004.1421713","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421713","url":null,"abstract":"In this paper, we deal with the problem of document image rectification from images captured by digital cameras. The improvement on the resolution of digital camera sensors has brought more and more applications for non-contact text capture. Unfortunately, perspective distortion coupled with resulting images makes it harder to properly identify the contents of captured texts using the traditional optical character recognition (OCR) system. We propose in this work a new technique, which is capable of removing distortion and recovering the fronto-parallel view of text with a single image. Different from reported approaches in the literature, the image rectification is carried out using character boundary and tip point, which are extracted from character strokes based on multiple fuzzy sets and morphological operators. The algorithm needs neither camera calibration nor high-contrast document boundary. Experimental results show our rectification process is fast and robust.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114646770","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":"Estimate large motions using reliability-based dynamic programming","authors":"Minglun Gong, Herbert Yang","doi":"10.1109/ICIP.2004.1421625","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421625","url":null,"abstract":"Detecting and estimating motions of fast moving objects has many important applications. However, most existing motion estimation techniques have difficulties in handling large motions in the scene. In this paper, the reliability-based dynamic programming technique proposed by Gong and Yang is extended and applied to large motion estimation problem. Compared with the Gong and Yang approach, the extended algorithm removes the constant penalty assumption and also explicitly enforces the inter-scanline consistency constraint. The experimental results indicate that the new algorithm can effectively estimate velocities for fast moving objects. The algorithm can also be configured to produce sparse but reliable flow fields.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115069997","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}
A. Matsumura, S. Naito, Ryoichi Kawada, A. Koike, S. Matsumoto
{"title":"Effective interpolation for free viewpoint images using multilayered dynamic background buffers","authors":"A. Matsumura, S. Naito, Ryoichi Kawada, A. Koike, S. Matsumoto","doi":"10.1109/ICIP.2004.1419758","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1419758","url":null,"abstract":"Presenting images from a free viewpoint is a promising interactive video application. Though reference images from one viewpoint and their depth maps are often used to render free viewpoint images, picture quality degradation may occur because of lack of information in background regions that are occluded by foreground regions. In this paper an interpolation method for free viewpoint images using multilayered dynamic background buffers is proposed. In the proposed method, the buffers, updated using the reference images divided in each frame, are used to store the background regions and the output images are interpolated by the background buffers. Since the background buffers are created and updated using only the reference images and their depth maps, additional information on the background buffers is not required for the interpolation. The effectiveness of the proposed method was evaluated by several simulation experiments.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"4 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116826278","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":"Geometrical image denoising using quadtree segmentation","authors":"R. Shukla, M. Vetterli","doi":"10.1109/ICIP.2004.1419523","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1419523","url":null,"abstract":"We propose a quadtree segmentation based denoising algorithm, which attempts to capture the underlying geometrical structure hidden in real images corrupted by random noise. The algorithm is based on the quadtree coding scheme proposed in our earlier work and on the key insight that the lossy compression of a noisy signal can provide the filtered/denoised signal. The key idea is to treat the denoising problem as the compression problem at low rates. The intuition is that, at low rates, the coding scheme captures the smooth features only, which basically belong to the original signal. We present simulation results for the proposed scheme and compare these results with the performance of wavelet based schemes. Our simulations show that the proposed denoising scheme is competitive with wavelet based schemes and achieves improved visual quality due to better representation for edges.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123223007","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 multistage fast motion estimation scheme for video compression","authors":"Jiancong Luo, I. Ahmad, Y. Sun, Y. Liang","doi":"10.1109/ICIP.2004.1421334","DOIUrl":"https://doi.org/10.1109/ICIP.2004.1421334","url":null,"abstract":"This paper presents a novel multistage motion estimation (ME) scheme called content adaptive search technique (CAST). The proposed scheme consists of four stages: motion vector field (MVF) prediction, block-based segmentation, motion parameter extraction, and adaptive search strategy. Through pre-processing the MVF of the previous reference frame in the first three stages, CAST extracts the motion parameters for each region. The 4th stage is a combination of various techniques including MV prediction, search area decision and an adaptive fast search algorithm that is adjusted by a mathematical model for the block distortion surface (BDS). Experiment shows that the proposed scheme improves the visual quality, while yielding a faster speed, comparing with the other predictive ME algorithms.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121952498","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}