发布求助
文献互助 智能选刊 最新文献

Proceedings. International Conference on Image Processing最新文献

筛选
英文 中文
Error drifting reduction in enhanced fine granularity scalability 在增强的细粒度可伸缩性中减少误差漂移
Proceedings. International Conference on Image Processing Pub Date : 2002-12-10 DOI: 10.1109/ICIP.2002.1039887
Wen-Hsiao Peng, Yen-kuang Chen
{"title":"Error drifting reduction in enhanced fine granularity scalability","authors":"Wen-Hsiao Peng, Yen-kuang Chen","doi":"10.1109/ICIP.2002.1039887","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1039887","url":null,"abstract":"We incorporate fading and reset mechanisms in an enhanced fine granularity scalability algorithm to reduce the drifting error at low bit rate while still maintaining 1.5dB PSNR gain at high bit rate over the current MPEG-4 fine granularity scalability. Many previous works use enhancement layers to predict enhancement layers so as to increase the compression efficiency. Drifting error occurs because the enhancement layer, the predictor, is not received as expected. Our fading mechanism linearly combines the current reconstructed base layer and previously reconstructed enhancement layer with fading factors between 0 and 1. Our reset mechanism sets the reference frame for prediction to be the base layer periodically. Our theoretical formulation and experimental results show that drifting error can be distributed more uniformly and maximum accumulated mismatch error is significantly reduced while our mechanisms are turned on. Around 1dB can be improved at low bit rate comparing to the one without any drifting reduction mechanism.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"6 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":"84445369","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}
引用次数: 12
Gait recognition based on Procrustes shape analysis 基于Procrustes形状分析的步态识别
Proceedings. International Conference on Image Processing Pub Date : 2002-12-10 DOI: 10.1109/ICIP.2002.1038998
Liang Wang, Huazhong Ning, Weiming Hu, T. Tan
{"title":"Gait recognition based on Procrustes shape analysis","authors":"Liang Wang, Huazhong Ning, Weiming Hu, T. Tan","doi":"10.1109/ICIP.2002.1038998","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1038998","url":null,"abstract":"Gait recognition has recently attracted increasing attention, especially in vision-based human identification-at-a-distance in visual surveillance. The paper proposes a simple but efficient gait recognition algorithm, based on statistical shape analysis. For each gait sequence, a background subtraction procedure is used to segment spatial silhouettes of the walking figures from the background. Static pose changes of these silhouettes over time are represented as a sequence of associated complex configurations in a common coordinate, and are then analyzed using the Procrustes shape analysis method to obtain a gait signature. The k-nearest neighbor classifier and the nearest exemplar classifier based on the full Procrustes distance measure are adopted for recognition. Experimental results demonstrate that the proposed algorithm has an encouraging recognition performance.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"19 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":"84510423","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}
引用次数: 79
Efficient contour shape description by using fractal interpolation functions 利用分形插值函数高效描述轮廓形状
Proceedings. International Conference on Image Processing Pub Date : 2002-12-10 DOI: 10.1109/ICIP.2002.1038066
S. Uemura, M. Haseyama, H. Kitajima
{"title":"Efficient contour shape description by using fractal interpolation functions","authors":"S. Uemura, M. Haseyama, H. Kitajima","doi":"10.1109/ICIP.2002.1038066","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1038066","url":null,"abstract":"This paper presents a novel representation method for contour shape using fractal interpolation functions (FIF). In the traditional idea of the FIF, the scope of its application has been limited to the case where the signal is represented by a single-valued function. Therefore, the traditional FIF cannot be applicable to multiple-valued signals. The proposed method can model a multiple-valued signal with an extended FIF derived by introducing new parameters to the traditional one. Furthermore, the proposed method utilizes the fractal dimension known as a measure of complexity to determine the parameters in the FIF and thereby can model the signal based on its complexity. Experimental results show the validity of the proposed method.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"27 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":"84536774","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}
引用次数: 8
An introduction to MPEG-4 animation framework extension (AFX) MPEG-4动画框架扩展(AFX)简介
Proceedings. International Conference on Image Processing Pub Date : 2002-12-10 DOI: 10.1109/ICIP.2002.1038888
M. Bourges-Sévenier
{"title":"An introduction to MPEG-4 animation framework extension (AFX)","authors":"M. Bourges-Sévenier","doi":"10.1109/ICIP.2002.1038888","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1038888","url":null,"abstract":"The document presents MPEG-4 animation framework extension (AFX), a recent amendment to the MPEG-4 systems specification. AFX defines high-level geometry, texture, volume, and animation components for enhanced interactive multimedia applications.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"9 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":"85143594","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}
引用次数: 3
A window-based color quantization technique and its embedded implementation 一种基于窗口的颜色量化技术及其嵌入式实现
Proceedings. International Conference on Image Processing Pub Date : 2002-12-10 DOI: 10.1109/ICIP.2002.1039963
A. Atsalakis, N. Papamarkos, D. Soudris, N. Kroupis
{"title":"A window-based color quantization technique and its embedded implementation","authors":"A. Atsalakis, N. Papamarkos, D. Soudris, N. Kroupis","doi":"10.1109/ICIP.2002.1039963","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1039963","url":null,"abstract":"A new color quantization (CQ) technique and its VLSI implementation is introduced. It is based on image split into windows and uses Kohonen self organized neural network classifier (SONNC). Initially, the dominant colors of each window are extracted through the SONNC and then are used for the quantization of the colors of the entire image. The image split in windows offers reduction of the memory requirements and feasibility of suitable VLSI implementation of the most time consuming part of the technique. Applying a systematic design methodology into the developed CQ algorithm, an efficient system-on-chip based on the ARM processor, which achieves high speed processing and less energy consumption, is derived.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"10 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":"85866760","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}
引用次数: 6
Extract highlights from baseball game video with hidden Markov models 用隐马尔可夫模型从棒球比赛视频中提取亮点
Proceedings. International Conference on Image Processing Pub Date : 2002-12-10 DOI: 10.1109/ICIP.2002.1038097
Peng Chang, Mei Han, Yihong Gong
{"title":"Extract highlights from baseball game video with hidden Markov models","authors":"Peng Chang, Mei Han, Yihong Gong","doi":"10.1109/ICIP.2002.1038097","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1038097","url":null,"abstract":"We describe a statistical method to detect highlights in a baseball game video. The input video is first segmented into scene shots, within which the camera motion is continuous. Our approach is based on the observations that (1) most highlights in baseball games are composed of certain types of scene shots and (2) those scene shots exhibit special transition context in time. To exploit those two observations, we first build statistical models for each type of scene shots with products of histograms, and then for each type of highlight a hidden Markov model is learned to represent the context of transition in the time domain. A probabilistic model can be obtained by combining the two, which is used for highlight detection and classification. Satisfactory results have been achieved on initial experimental results.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"24 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":"85926024","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}
引用次数: 165
Scene sampling for the concentric mosaics technique [virtual reality] 同心拼接技术的场景采样[虚拟现实]
Proceedings. International Conference on Image Processing Pub Date : 2002-12-10 DOI: 10.1109/ICIP.2002.1038061
Xiaoyong Sun, E. Dubois
{"title":"Scene sampling for the concentric mosaics technique [virtual reality]","authors":"Xiaoyong Sun, E. Dubois","doi":"10.1109/ICIP.2002.1038061","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1038061","url":null,"abstract":"Sufficient sampling for scene representation is an important topic in Image-Based Rendering (IBR). It determines both the rendered image quality and the quantity of image data that must be recorded, and it depends on the method by which the image samples are taken. The Concentric Mosaics technique is one way to get image samples of a scene, to which the sampling theory of the plenoptic function is applied in this paper to determine the required number of image samples at the different lengths of the rotation beam. The general spectral filtering model of image based rendering techniques is analyzed based on the Concentric Mosaics technique to provide a frequency domain interpretation. Simulations on both a numerical design example for a typical scene and the illustration of the different rendered image qualities with different number of image samples per rotation circle are provided.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"37 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":"85933001","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}
引用次数: 0
Role of scale in partitioning shape 尺度在分区形状中的作用
Proceedings. International Conference on Image Processing Pub Date : 2002-12-10 DOI: 10.1109/ICIP.2002.1040013
R. Dhandapani, B. Kimia
{"title":"Role of scale in partitioning shape","authors":"R. Dhandapani, B. Kimia","doi":"10.1109/ICIP.2002.1040013","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1040013","url":null,"abstract":"We present three distinct improvements to the neck and limb-based approach to partitioning of visual form, where pairs of negative curvature minima with good continuation of their respective tangents constitute limbs, and locally shortest lines through the shape constitute necks. The numerous conflicting limb and neck hypotheses are resolved through a notion of salience, leading to intuitive parts for smooth shapes. We improve on this approach in three ways. First a significant difficulty is dealing with scale, e.g., in partitioning noisy shapes where some perceptually valid limbs are not marked by salient negative curvature minima, and where numerous hypotheses arise due to noise. We present an approach which can reliably construct and detect coarse-scale negative curvature extremas. Second, we devise a multiscale partitioning scheme, thus minimizing the coarse-scale interaction of part-lines arising from features at different scales. Third, we employ an Euler spiral as the part-curve instead of a straight part-line for partitioning shape thus improving the partitioning results.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"83 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":"85973755","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}
引用次数: 7
Efficient partial streaming of compressed video 高效的部分流压缩视频
Proceedings. International Conference on Image Processing Pub Date : 2002-12-10 DOI: 10.1109/ICIP.2002.1038939
K. Ratakonda
{"title":"Efficient partial streaming of compressed video","authors":"K. Ratakonda","doi":"10.1109/ICIP.2002.1038939","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1038939","url":null,"abstract":"Given a high resolution compressed video stream this paper looks at the problem of extracting video from a small window at an arbitrary, but static location, in compressed form, without having to either decode the high resolution video stream or encode the window stream. Since state of the art video compression algorithms use motion compensation in one form or the other, the compressed video stream cannot be parsed to obtain the window stream without decoding the high resolution stream to some extent and subsequent re-encoding. On the other hand storing all possible windows as separate streams on the server is clearly infeasible, at least as of today, as it would lead to an explosion of the storage space requirement. It is shown that with a comparatively small increment in the server's storage requirement, it is possible to obtain compressed window streams out of the high resolution stream with minimal parsing, no decoding or re-encoding and little quality loss. Furthermore, methods to trade off the space required on the server with the compression efficiency of the window stream are shown. Experimental results obtained from applying the proposed method on MPEG-2 compressed video sequences are also provided.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"19 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":"80895554","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}
引用次数: 0
Adaptive two-pass median filter to remove impulsive noise 自适应双通中值滤波去除脉冲噪声
Proceedings. International Conference on Image Processing Pub Date : 2002-12-10 DOI: 10.1109/ICIP.2002.1038148
Xiaoyin Xu, E. Miller
{"title":"Adaptive two-pass median filter to remove impulsive noise","authors":"Xiaoyin Xu, E. Miller","doi":"10.1109/ICIP.2002.1038148","DOIUrl":"https://doi.org/10.1109/ICIP.2002.1038148","url":null,"abstract":"In this paper, we present an adaptive two-pass median filter to remove impulsive noise. In two-pass median filtering, an image contaminated by impulsive noise is processed by a median filter twice. Median filtering is a non-reversible process, i.e., useful information discarded by the filter cannot be recovered. This behavior becomes more apparent in two-pass median filtering. To correct this problem, between the two filtering processes we introduce an adaptive process to selectively replace some pixels by their original values based on the spatial distribution of estimated impulsive noise. Compared with standard median filtering and two-pass median filtering, better results are obtained in terms of visual appreciation and mean squared error. We use examples to demonstrate the performance of the method.","PeriodicalId":74572,"journal":{"name":"Proceedings. International Conference on Image Processing","volume":"1 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":"83583466","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}
引用次数: 38
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信