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

IEEE International Conference on Image Processing 2005最新文献

筛选
英文 中文
Distributed rate allocation for multi-stream video transmission over ad hoc networks 自组织网络中多流视频传输的分布式速率分配
IEEE International Conference on Image Processing 2005 Pub Date : 2005-11-14 DOI: 10.1109/ICIP.2005.1530015
Xiaoqing Zhu, B. Girod
{"title":"Distributed rate allocation for multi-stream video transmission over ad hoc networks","authors":"Xiaoqing Zhu, B. Girod","doi":"10.1109/ICIP.2005.1530015","DOIUrl":"https://doi.org/10.1109/ICIP.2005.1530015","url":null,"abstract":"When multiple video streams are present in an ad hoc network, they share and compete for the common network resources. A rate allocation algorithm must balance the available resources among the video streams in a fair and efficient manner. In addition, it is desirable to have a distributed solution so that nodes do not need to collect global information of the network and that the computational burden can be shared. We propose a distributed rate allocation algorithm which minimizes the total distortion of all video streams. Based on the subgradient method, the proposed scheme only requires link price updates at each relay node based on local observations and rate adaptations at each source node derived from rate-distortion (RD) models of the video. Simulation results show that the proposed scheme can achieve the same optimal rate allocation as that obtained from exhaustive search.","PeriodicalId":295452,"journal":{"name":"IEEE International Conference on Image Processing 2005","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134111456","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}
引用次数: 49
Medical image registration based on random line sampling 基于随机行抽样的医学图像配准
IEEE International Conference on Image Processing 2005 Pub Date : 2005-11-14 DOI: 10.1109/ICIP.2005.1529961
A. Bardera, M. Feixas, I. Boada, M. Sbert
{"title":"Medical image registration based on random line sampling","authors":"A. Bardera, M. Feixas, I. Boada, M. Sbert","doi":"10.1109/ICIP.2005.1529961","DOIUrl":"https://doi.org/10.1109/ICIP.2005.1529961","url":null,"abstract":"One of the key aspects in 3D-image registration is the computation of the joint intensity histogram. We propose a new approach to compute this histogram using uniformly distributed random lines to sample stochastically the overlapping volume between two 3D-images. The intensity values are captured from the lines at evenly spaced positions, taking an initial random offset different for each line. This method provides us with an accurate, robust and fast mutual information-based registration. The interpolation effects are drastically reduced, due to the stochastic nature of the line generation, and the alignment process is also accelerated. The results obtained show a better performance of the introduced method than the classic computation of the joint histogram.","PeriodicalId":295452,"journal":{"name":"IEEE International Conference on Image Processing 2005","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134403845","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
The Future-Viewer visual environment for semantic characterization of video sequences 用于视频序列语义表征的Future-Viewer视觉环境
IEEE International Conference on Image Processing 2005 Pub Date : 2005-11-14 DOI: 10.1109/ICIP.2005.1529974
M. Campanella, R. Leonardi, P. Migliorati
{"title":"The Future-Viewer visual environment for semantic characterization of video sequences","authors":"M. Campanella, R. Leonardi, P. Migliorati","doi":"10.1109/ICIP.2005.1529974","DOIUrl":"https://doi.org/10.1109/ICIP.2005.1529974","url":null,"abstract":"In this paper we address the problem of semi-automatic annotation of audio-visual sequences. Specifically, we propose the use of an innovative graphic framework, named Future-Viewer, to perform a quick and efficient annotation of a given multimedia document. The basic idea consists in visualising a 2-dimensional feature space in which the shots of the considered video sequence are located. In this window, shots with similar content fall near each other, and the proposed tool offers various functionalities for automatically and semi-automatically finding and annotating the shot clusters in such feature space. The proposed system has been used to analyze the content in terms of logical story units of few video sequences and the obtained results appear very interesting.","PeriodicalId":295452,"journal":{"name":"IEEE International Conference on Image Processing 2005","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134350182","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
Mesh modelling for sparse image data sets 稀疏图像数据集的网格建模
IEEE International Conference on Image Processing 2005 Pub Date : 2005-11-14 DOI: 10.1109/ICIP.2005.1530312
S. Coleman, B. Scotney
{"title":"Mesh modelling for sparse image data sets","authors":"S. Coleman, B. Scotney","doi":"10.1109/ICIP.2005.1530312","DOIUrl":"https://doi.org/10.1109/ICIP.2005.1530312","url":null,"abstract":"Incomplete image data sets are of interest in many domains and arise in a variety of applications, and in particular in applications that use remote sensor array data. Although recent developments in mesh modelling of images have provided algorithms that can achieve accurate and efficient image representations without the high computational cost associated with earlier optimisation-based methods, such techniques rely on the availability of the entire image data. These content-based mesh modelling techniques aim to provide a high sample density in regions of interest, such as feature neighbourhoods or around moving objects, whilst achieving efficiency by retaining a low overall image sampling density. The sampling density is determined by a feature map, such as local image curvature or local spatial-frequency content that is obtained from the underlying complete image data. As the requirement for the availability of complete image data makes such content-based mesh modelling techniques unsuitable for application to incomplete images, where an image consists of a sparse data set, we aim to address this issue by proposing an alternative approach to mesh modelling that is based on automatically adaptive feature detection directly applicable to sparsely sampled images.","PeriodicalId":295452,"journal":{"name":"IEEE International Conference on Image Processing 2005","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132947575","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}
引用次数: 5
Bounding box splitting for robust shape classification 基于边界框分割的鲁棒形状分类
IEEE International Conference on Image Processing 2005 Pub Date : 2005-11-14 DOI: 10.1109/ICIP.2005.1530096
C. Bauckhage, John K. Tsotsos
{"title":"Bounding box splitting for robust shape classification","authors":"C. Bauckhage, John K. Tsotsos","doi":"10.1109/ICIP.2005.1530096","DOIUrl":"https://doi.org/10.1109/ICIP.2005.1530096","url":null,"abstract":"This paper presents a fast method to compute homeomorphisms between 2D lattices and shapes found in binary images. Unlike many other methods, this mapping is not restricted to simply connected shapes but applies to arbitrary topologies. Moreover, it provides an avenue to the embedding of shapes in vectorspaces over R and C and thus enables robust shape recognition.","PeriodicalId":295452,"journal":{"name":"IEEE International Conference on Image Processing 2005","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130685287","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}
引用次数: 21
Embedded image coding with context partitioning and quantization 嵌入图像编码与上下文划分和量化
IEEE International Conference on Image Processing 2005 Pub Date : 2005-11-14 DOI: 10.1109/ICIP.2005.1530036
Hua Cai, X. San, Jiang Li
{"title":"Embedded image coding with context partitioning and quantization","authors":"Hua Cai, X. San, Jiang Li","doi":"10.1109/ICIP.2005.1530036","DOIUrl":"https://doi.org/10.1109/ICIP.2005.1530036","url":null,"abstract":"As a key part of universal source coding, context quantization is very important for improving compression performance. However, in most existing methods, the quantizer is trained offline and is fixed due to the complexity of finding a good quantizer and the significant overhead of representing the quantizer. This paper proposes a novel online context quantization approach that achieves high coding efficiency with low quantizer overhead and computational complexity. It first partitions the context into groups according to the number of significant context events. A layer-based context quantization is then applied on these groups. The proposed method is applied for embedded wavelet image coding. Compared with the JPEG2000 coder, up to 0.6 dB improvements can be achieved on the standard 512 /spl times/ 512 test images. And more improvements are observed on images at lower resolutions.","PeriodicalId":295452,"journal":{"name":"IEEE International Conference on Image Processing 2005","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131023242","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
Fast distortion-buffer optimized streaming of multimedia 快速失真缓冲优化的多媒体流
IEEE International Conference on Image Processing 2005 Pub Date : 2005-11-14 DOI: 10.1109/ICIP.2005.1530021
A. Sehgal, A. Jagmohan, O. Verscheure, P. Frossard
{"title":"Fast distortion-buffer optimized streaming of multimedia","authors":"A. Sehgal, A. Jagmohan, O. Verscheure, P. Frossard","doi":"10.1109/ICIP.2005.1530021","DOIUrl":"https://doi.org/10.1109/ICIP.2005.1530021","url":null,"abstract":"This paper presents a distortion optimized streaming algorithm for on-demand streaming of multimedia. Given the pre-encoded packets of a multimedia stream, we propose a fast algorithm for selecting an appropriate subset of these packets such that the overall client distortion is minimized. This minimization is performed within the rate constraints imposed by the communication channel. In particular, at each transmission opportunity, the proposed approach uses a linear-time algorithm to select the best packet to transmit through the minimization of the expected client distortion. The time complexity of the algorithm is reduced through a factorization of the streaming policy into simpler terms and performing a greedy optimization to select the packet. Inevitably, this in itself leads to sub-optimal results. To alleviate the adverse impact of the greedy optimization, the cost function is penalized with the expected buffer occupancy at the end of the epoch of the optimization. We pose this problem as a Lagrangian minimization. We demonstrate the efficacy of the proposed approach through empirical evaluation.","PeriodicalId":295452,"journal":{"name":"IEEE International Conference on Image Processing 2005","volume":"151 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131059126","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
Improved color filter array demosaicking by accurate luminance estimation 改进的彩色滤光片阵列去马赛克的精确亮度估计
IEEE International Conference on Image Processing 2005 Pub Date : 2005-11-14 DOI: 10.1109/ICIP.2005.1529682
Naixiang Lian, Lanlan Chang, Yap-Peng Tan
{"title":"Improved color filter array demosaicking by accurate luminance estimation","authors":"Naixiang Lian, Lanlan Chang, Yap-Peng Tan","doi":"10.1109/ICIP.2005.1529682","DOIUrl":"https://doi.org/10.1109/ICIP.2005.1529682","url":null,"abstract":"Luminance information plays an important role in dictating the quality of a color image, and some existing color filter array (CFA) demosaicking methods achieve superiority by first reconstructing a satisfactory luminance plane. It is however difficult to accurately estimate the luminance from CFA samples since their color spectra are generally aliased. Extending a state-of-the-art luminance-based demosaicking scheme, in this paper we propose an improved demosaicking method using an efficient filter to estimate the luminance at green pixels and employing an effective edge-adaptive interpolation scheme to obtain the luminance at red and blue pixels. Experimental results demonstrate that not only is the proposed method less complex, it also performs noticeably better, both visually and in terms of peak signal-to-noise ratio, comparing with several recent methods.","PeriodicalId":295452,"journal":{"name":"IEEE International Conference on Image Processing 2005","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133156073","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}
引用次数: 34
Redundant-wavelet watermarking with pixel-wise masking 具有像素级屏蔽的冗余小波水印
IEEE International Conference on Image Processing 2005 Pub Date : 2005-11-14 DOI: 10.1109/ICIP.2005.1529843
Kristen M. Parker, J. Fowler
{"title":"Redundant-wavelet watermarking with pixel-wise masking","authors":"Kristen M. Parker, J. Fowler","doi":"10.1109/ICIP.2005.1529843","DOIUrl":"https://doi.org/10.1109/ICIP.2005.1529843","url":null,"abstract":"An algorithm is presented which implements image watermarking in the domain of an overcomplete, or redundant, wavelet transform. This algorithm expands on a previous method which employs a traditional, critically sampled wavelet transform coupled with perceptually-based watermark casting and optimal Neyman-Pearson detection. Specifically, in the proposed method, the redundancy inherent in the transform facilitates detection of perceptually salient texture local to a given spatial location and guides the placement of watermarking energy so as to minimize the impact on perceptual image quality. Additionally, the optimal detection strategy is adjusted to account for the overcomplete ness of the transform. The performance of the proposed technique is compared to that of its critically sampled counterpart and greater robustness under attack by compression is observed.","PeriodicalId":295452,"journal":{"name":"IEEE International Conference on Image Processing 2005","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132270653","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
3D video segmentation using point distance histograms 使用点距离直方图的3D视频分割
IEEE International Conference on Image Processing 2005 Pub Date : 2005-11-14 DOI: 10.1109/ICIP.2005.1529847
Jianfeng Xu, T. Yamasaki, K. Aizawa
{"title":"3D video segmentation using point distance histograms","authors":"Jianfeng Xu, T. Yamasaki, K. Aizawa","doi":"10.1109/ICIP.2005.1529847","DOIUrl":"https://doi.org/10.1109/ICIP.2005.1529847","url":null,"abstract":"Similar to 2D video segmentation, 3D video segmentation is to divide the 3D video in temporal domain into a set of meaningful and manageable segments (shots) that are used as basic elements for indexing. This paper proposes a temporal segmentation method for 3D video for the first time as far as we know. Point distance histograms are used considering the tradeoff between computational cost and effectiveness. In order to reflect the real motion of 3D object, three fixed points are selected, which can avoid what we call \"the same sphere problem.\" And simulation results on total 285 frames, which are composed of four different sequences, show our method is very effective.","PeriodicalId":295452,"journal":{"name":"IEEE International Conference on Image Processing 2005","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132747375","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}
引用次数: 20
首页 上一页 下一页 尾页
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学术官方微信
小红书