Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)最新文献

筛选
英文 中文
Stochastic modeling and entropy constrained estimation of motion from image sequences 图像序列运动的随机建模和熵约束估计
S. Servetto, C. Podilchuk
{"title":"Stochastic modeling and entropy constrained estimation of motion from image sequences","authors":"S. Servetto, C. Podilchuk","doi":"10.1109/ICIP.1998.999045","DOIUrl":"https://doi.org/10.1109/ICIP.1998.999045","url":null,"abstract":"We consider the problem of coding video signals using motion compensation and a forward coded dense motion field. First, we develop a motion estimation technique that yields dense estimates suitable for the coding application; next, we develop a prototype of a video coder, which we use to verify that high coding performance is attainable within our framework. To find our sought motion estimates, we assume motion in an observed image sequence to be a stochastic process, modeled as a Markov random field (MRF). The standard maximum a posteriori (MAP) estimation problem with MRF priors is formulated as a constrained optimization problem (where the constraint is on the entropy of the sought estimate), but then transformed into a classical MAP estimation problem, and solved using standard techniques. A key advantage of the constrained formalization is that, in the process of transforming it back to the classical framework, parameters which in the classical framework are left unspecified (and often tweaked in an experimental stage) become now uniquely determined by the introduced entropy constraint. To verify that our motion estimates are indeed useful for coding, we compare the performance of a prototype video coder with that of an equivalent coder based on block-matching motion estimates. Experimental results reveal, for various types of video signals and at various rates, that: (a) in terms of PSNR, our system equals or improves upon the performance of full search block matching; and (b) in terms of visual quality our improvements are significant, since our images are completely free of blocking artifacts.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"148 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130036836","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}
引用次数: 4
A GenLOT-based progressive image coder for low resolution images 基于genlot的低分辨率渐进式图像编码器
M. Helsingius, T. Tran, Truong Q. Nguyen
{"title":"A GenLOT-based progressive image coder for low resolution images","authors":"M. Helsingius, T. Tran, Truong Q. Nguyen","doi":"10.1109/ICIP.1998.723371","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723371","url":null,"abstract":"The popular EZW (embedded zerotree wavelet) and its improved version SPIHT (set partitioning in hierarchical trees) are high-performance progressive transmission image coders based on the wavelet transform which gives excellent compression results for images with significant low-frequency content. For images with high texture contents, the GenLOT-based coder outperforms SPIHT in PSNR measure by a wide margin. On the other hand, low bit rate video finds applications in videophone and surveillance systems, where smaller size image in QCIF format is often transmitted. We show that using the conventional zero-tree algorithm for the QCIF image is suboptimal and we propose several progressive algorithms with modified zero-tree structures. The extensive coding results using both the DCT and GenLOT transform confirms that our proposed modified zero-tree algorithm outperforms the conventional zerotree algorithm for QCIF-sized images.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123735507","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
Transcoding of MPEG video using lattice vector quantization 基于点阵矢量量化的MPEG视频转码
László Lois, S. Bozóki
{"title":"Transcoding of MPEG video using lattice vector quantization","authors":"László Lois, S. Bozóki","doi":"10.1109/ICIP.1998.723377","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723377","url":null,"abstract":"We propose a new transcoding method for MPEG video bit-streams. In our implementation, instead of using scalar quantization in the transcoder, a lattice vector quantizer (LVQ) is applied to exceed the MPEG compression capabilities while providing acceptable quality. In this way, the transcoded video is not MPEG-compatible anymore, hence a low cost user interface is needed prior to the MPEG decoding. However, the decoded pictures have higher subjective quality compared to those transcoded by an MPEG-compatible transcoder at the same bit-rate. Due to the LVQ the quantization noise is more uniform on the pictures, and less artifacts are visible around the edges. Beside this, a slight improvement in the PSNR was also experienced by using certain LVQ parameters.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132775045","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
Segmentation of a head into face, ears, neck and hair for knowledge-based analysis-synthesis coding of videophone sequences 将头部分割为脸、耳、颈和头发,用于视频电话序列的基于知识的分析合成编码
M. Kampmann
{"title":"Segmentation of a head into face, ears, neck and hair for knowledge-based analysis-synthesis coding of videophone sequences","authors":"M. Kampmann","doi":"10.1109/ICIP.1998.723696","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723696","url":null,"abstract":"Since in video telephony the image quality in the face is subjectively more important for a human observer than the image quality in other head parts like the hair, the neck and the ears, a knowledge-based analysis-synthesis coder should code different head parts with different qualities. For this, an automatic segmentation of a head into different head parts is necessary. An algorithm for automatic segmentation of a head into face, ears, neck and hair is presented. This segmentation is carried out using estimates for eye and mouth centers, chin and cheek contours, head silhouette and areas with the skin color of the person. The proposed algorithm has been applied to the videophone sequences \"Claire\" and \"Miss America\". The segmentation of the heads into head parts is carried out with subjectively high accuracy.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132088563","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}
引用次数: 15
Proposal for an integrated video analysis framework 一个综合视频分析框架的建议
P. Correia, F. Pereira
{"title":"Proposal for an integrated video analysis framework","authors":"P. Correia, F. Pereira","doi":"10.1109/ICIP.1998.723436","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723436","url":null,"abstract":"The analysis of video data targeting the identification of relevant objects and the extraction of associated descriptive characteristics will be the enabling factor for a number of multimedia applications. This process has intrinsic difficulties, and since semantic criteria are difficult to express, usually only a part of the desired analysis results can be automatically achieved. For many applications, the automatic tools can be complemented with user guidance to improve performance. This paper proposes an integrated framework for video analysis, addressing the video segmentation and feature extraction problems. The framework includes a set of modules that can be combined following specific application needs. It includes both automatic (more objective) and user interaction (more semantic) analysis modules. The paper also proposes a specific segmentation solution to one of the most relevant application scenarios considered-off-line applications requiring precise segmentation.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132090634","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
Optimal hierarchical partitions for fractal image compression 分形图像压缩的最优分层分区
D. Saupe, M. Ruhl, R. Hamzaoui, L. Grandi, D. Marini
{"title":"Optimal hierarchical partitions for fractal image compression","authors":"D. Saupe, M. Ruhl, R. Hamzaoui, L. Grandi, D. Marini","doi":"10.1109/ICIP.1998.723601","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723601","url":null,"abstract":"In fractal image compression a partitioning of the image is required. In this paper we discuss the construction of rate-distortion optimal partitions. We begin with a fine scale partition which gives a fractal encoding with a high bit rate and a low distortion. The partition is hierarchical, thus, corresponds to a tree. We employ a pruning strategy based on the generalized BFOS algorithm. It extracts subtrees corresponding to partitions and fractal encodings which are optimal in the rate-distortion sense. First results are included for the case of fractal encodings based on rectangular (HV) partitions. We also provide a comparison with greedy partitions based on the traditional collage error criterion or just using block variance.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130225207","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}
引用次数: 30
Reconstruction problems in 3D for viral cryo electron microscopy 病毒低温电子显微镜三维重建问题
Wen Gao, P. Doerschuk
{"title":"Reconstruction problems in 3D for viral cryo electron microscopy","authors":"Wen Gao, P. Doerschuk","doi":"10.1109/ICIP.1998.723625","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723625","url":null,"abstract":"Cryo electron microscopy of viruses provides 2D projections of the scattering intensity of the viral particle but the orientation of the projections is not known. We describe an approach to reconstructing the 3D scattering intensity in spite of the unknown projection orientations using nonlinear least squares ideas where the reconstruction is guaranteed to have the icosahedral symmetry known to be present in the viral particle.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130399871","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
On the robust transmission technique for H.263 video data stream over wireless networks 无线网络中H.263视频数据流的鲁棒传输技术
Han-Seung Jung, R. Kim, Sang-Uk Lee
{"title":"On the robust transmission technique for H.263 video data stream over wireless networks","authors":"Han-Seung Jung, R. Kim, Sang-Uk Lee","doi":"10.1109/ICIP.1998.999034","DOIUrl":"https://doi.org/10.1109/ICIP.1998.999034","url":null,"abstract":"We propose an error-resilient transmission technique for the H.263 compatible video data stream, based on the data partitioning technique. The proposed algorithm employs the bit rearrangement technique in each layer, which provides unequal error protection against the channel errors, without requiring additional side information. In addition, we propose a recovery algorithm for the lost or erroneous motion vectors. The proposed algorithm is implemented, based on the H.263 standard, and evaluated through intensive computer simulation. The experimental results demonstrate that the proposed algorithm provides acceptable performance both subjectively and objectively at various bit error rates and burst lengths.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127837949","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}
引用次数: 2
Super-resolution inducing of an image 图像的超分辨率诱导
Didier Calle, A. Montanvert
{"title":"Super-resolution inducing of an image","authors":"Didier Calle, A. Montanvert","doi":"10.1109/ICIP.1998.727173","DOIUrl":"https://doi.org/10.1109/ICIP.1998.727173","url":null,"abstract":"The problem of increasing the resolution of an image I/sub k/ is stated as an inverse problem of image reduction. The enlarged image must belong to the set of images which best approximates I/sub k/ after reducing. A projection of any image onto this set provides one of the possible enlarged images of I/sub k/. This is what we call an induction of I/sub k/ onto a set of acceptable super-resolutions. Different projection methods are proposed and illustrated with experimental results.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127957681","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}
引用次数: 25
Flexible shapes for segmentation and tracking of cardiovascular data 用于分割和跟踪心血管数据的灵活形状
A. Amini, Jiantao Huang, A. K. Klein, P. Radeva, Mohamed Elayyadi
{"title":"Flexible shapes for segmentation and tracking of cardiovascular data","authors":"A. Amini, Jiantao Huang, A. K. Klein, P. Radeva, Mohamed Elayyadi","doi":"10.1109/ICIP.1998.723306","DOIUrl":"https://doi.org/10.1109/ICIP.1998.723306","url":null,"abstract":"In this invited paper, an overview of techniques developed at the Cardiovascular Image Analysis Laboratory at Washington University is discussed. At the core of the authors' methodologies lie flexible shape models, which are employed in automated as well as semi-automated analysis of cardiac MRI and X-ray angiography images. The mathematical bases used for the flexible templates are of the B-spline variety, providing compact representation and interactive capabilities for manipulation of curves, surfaces, and volumes.","PeriodicalId":220168,"journal":{"name":"Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131716579","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}
引用次数: 4
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学术文献互助群
群 号:481959085
Book学术官方微信