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

2002 IEEE Workshop on Multimedia Signal Processing.最新文献

筛选
英文 中文
Entropy- and complexity-constrained classified quantizer design for distributed image classification 基于熵和复杂度约束的分布式图像分类量化器设计
2002 IEEE Workshop on Multimedia Signal Processing. Pub Date : 2002-12-09 DOI: 10.1109/MMSP.2002.1203252
H. Xie, Antonio Ortega
{"title":"Entropy- and complexity-constrained classified quantizer design for distributed image classification","authors":"H. Xie, Antonio Ortega","doi":"10.1109/MMSP.2002.1203252","DOIUrl":"https://doi.org/10.1109/MMSP.2002.1203252","url":null,"abstract":"In this paper, we address the issue of feature encoding for distributed image classification systems. Such systems often extract a set of features such as color, texture and shape from the raw multimedia data automatically and store them as content descriptors. This content-based metadata supports a wider variety of queries than text-based metadata and thus provides a promising approach for efficient database access and management. When the size of the database becomes large and the number of clients connected to the server increases, the feature data requires a significant amount of storage space and transmission bandwidth. Thus it is useful to devise techniques to compress the features. In this paper, we propose an optimal design of a classified quantizer in a rate-distortion-complexity optimization framework. A decision tree classifier (DTC) is applied to classify the compressed data. We employ the generalized Breiman, Freidman, Olshen, and Stone (G-BFOS) algorithm to design the optimal pre-classifier, which is a pruned sub-tree of the decision tree, and to perform the optimal bit allocation among classes. The optimization is carried out based not only on a rate budget, but also on a coding complexity constraint. We illustrate this framework by showing a texture classification example. Our results show that by using a classified quantizer to encode the features, we are able to improve the percentage of correct classification also leads to a reduction of the number of images transmitted between server and client.","PeriodicalId":398813,"journal":{"name":"2002 IEEE Workshop on Multimedia Signal Processing.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121392156","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
Flexible disk scheduling for multimedia presentation servers 多媒体演示服务器的灵活磁盘调度
2002 IEEE Workshop on Multimedia Signal Processing. Pub Date : 2002-12-09 DOI: 10.1109/MMSP.2002.1203343
Sindhu Emilda, L. Jacob, O. Daescu, B. Prabhakaran
{"title":"Flexible disk scheduling for multimedia presentation servers","authors":"Sindhu Emilda, L. Jacob, O. Daescu, B. Prabhakaran","doi":"10.1109/MMSP.2002.1203343","DOIUrl":"https://doi.org/10.1109/MMSP.2002.1203343","url":null,"abstract":"Objects composing a multimedia presentation need to be delivered based on the temporal relationships specified by the author or authors. Depending on the composition of multimedia presentations, disk access for retrieval may not be needed in every round. A presentation can skip a certain number of disk scheduling rounds before retrieving the next required chunk of data. In this paper, we present a min-max skip round disk access algorithm for the retrieval of multimedia presentations in a flexible manner depending on the presentation composition, client/server buffer, and server-disk/network bandwidths. The proposed min-max skip round disk scheduling algorithm can be used for push, pull, as well as hybrid approaches for delivering multimedia presentations. We consider storage of presentations on an array of disks as well as on multi-zone recording disks. A few simulation results are provided.","PeriodicalId":398813,"journal":{"name":"2002 IEEE Workshop on Multimedia Signal Processing.","volume":"83 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132520527","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}
引用次数: 1
Two novel schemes for opportunistic multi-access 机会多址的两种新方案
2002 IEEE Workshop on Multimedia Signal Processing. Pub Date : 2002-12-09 DOI: 10.1109/MMSP.2002.1203333
Ming-Xin Hu, Junshan Zhang
{"title":"Two novel schemes for opportunistic multi-access","authors":"Ming-Xin Hu, Junshan Zhang","doi":"10.1109/MMSP.2002.1203333","DOIUrl":"https://doi.org/10.1109/MMSP.2002.1203333","url":null,"abstract":"We study opportunistic multiuser communications, and propose two novel schemes to address scheduling in asymmetric channels and admission control in such systems, respectively. We first device a relay-aided multiuser diversity (RAMD) scheme, in which a user can choose to communicate with the base station either directly or using relay transmission. We show that the RAMD scheme performs significantly better than Qualcomm's HDR scheme. Next, we propose a traffic-aided \"smooth\" admission control (SAC) scheme that guarantees the quality-of-service (QoS) provisioning. Specifically, building on the weighted proportional fair (WPF) scheduling, we devise a QoS driven weight adaptation algorithm. The weights assigned to new users are increased in a guarded manner. An admission decision is made based on the measured throughput within a time-out window. Our results show that the SAC scheme works well in opportunistic communication systems.","PeriodicalId":398813,"journal":{"name":"2002 IEEE Workshop on Multimedia Signal Processing.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132524013","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
Watermark embedding in DC components of DCT for binary images 二值图像DCT直流分量中的水印嵌入
2002 IEEE Workshop on Multimedia Signal Processing. Pub Date : 2002-12-09 DOI: 10.1109/MMSP.2002.1203305
Haiping Lu, Xuxia Shi, Y. Shi, A. Kot, Lihui Chen
{"title":"Watermark embedding in DC components of DCT for binary images","authors":"Haiping Lu, Xuxia Shi, Y. Shi, A. Kot, Lihui Chen","doi":"10.1109/MMSP.2002.1203305","DOIUrl":"https://doi.org/10.1109/MMSP.2002.1203305","url":null,"abstract":"This paper investigates the feasibility of watermark embedding in the discrete cosine transform (DCT) domain for binary images. Watermark embedding is known to be difficult for binary images due to their binary nature. For frequency domain approach to binary image watermarking, a post-embedding binarization is a necessary step to ensure that the watermarked image is still a binary image. This step disturbs the watermark embedded and is likely to remove the watermark. We have succeeded in combating this interference by embedding watermarks in the DC components of DCT and employing a biased binarization threshold. This algorithm can be applied to binary images in general and experiments show that the embedding algorithm proposed can not only survive binarization, but also provide some degree of robustness against common image processing.","PeriodicalId":398813,"journal":{"name":"2002 IEEE Workshop on Multimedia Signal Processing.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131393987","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
Vector quantization-based automatic shot boundary detection 基于矢量量化的镜头边界自动检测
2002 IEEE Workshop on Multimedia Signal Processing. Pub Date : 2002-12-09 DOI: 10.1109/MMSP.2002.1203285
J. Gomes, M. Carli, S. Mitra, A. Neri
{"title":"Vector quantization-based automatic shot boundary detection","authors":"J. Gomes, M. Carli, S. Mitra, A. Neri","doi":"10.1109/MMSP.2002.1203285","DOIUrl":"https://doi.org/10.1109/MMSP.2002.1203285","url":null,"abstract":"A compact video description is required to efficiently browse a multimedia database. A possible solution is the creation of a summary by using a set of frames (key frames) representing the content of each part of the video. To this end, a novel shot boundary detection method, based on a vector quantization approach, is presented. Experimental results show the effectiveness, in terms of computational cost and performance, of the proposed system.","PeriodicalId":398813,"journal":{"name":"2002 IEEE Workshop on Multimedia Signal Processing.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126649689","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
Fast DCT-domain filtering using frequency division processing 快速dct域滤波使用频分处理
2002 IEEE Workshop on Multimedia Signal Processing. Pub Date : 2002-12-09 DOI: 10.1109/MMSP.2002.1203244
Dongge Li, I. Sethi, N. Dimitrova
{"title":"Fast DCT-domain filtering using frequency division processing","authors":"Dongge Li, I. Sethi, N. Dimitrova","doi":"10.1109/MMSP.2002.1203244","DOIUrl":"https://doi.org/10.1109/MMSP.2002.1203244","url":null,"abstract":"This paper presents a new scheme for the development of efficient DCT-domain algorithms based on frequency division processing (FDP). In this scheme, a manipulation in the DCT domain is decomposed into multiple simple operations, each of which is performed independently on certain sets of DCT coefficients. Using FDP we designed a fast DCT-domain algorithm for two-dimensional convolution. The algorithm, according to both theoretical analysis of computational complexity and experimental results, is more efficient than traditional spatial-domain convolution algorithms as well as other compressed-domain convolution algorithms. The performance is several times higher for kernel size beyond 5 and comparable for smaller kernel size. In addition, convolution performed directly in the compressed domain can achieve a slightly higher precision due to the removal of decompression artifacts.","PeriodicalId":398813,"journal":{"name":"2002 IEEE Workshop on Multimedia Signal Processing.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126669480","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
A review of algorithms for audio fingerprinting 音频指纹识别算法综述
2002 IEEE Workshop on Multimedia Signal Processing. Pub Date : 2002-12-09 DOI: 10.1109/MMSP.2002.1203274
P. Cano, E. Batlle, T. Kalker, J. Haitsma
{"title":"A review of algorithms for audio fingerprinting","authors":"P. Cano, E. Batlle, T. Kalker, J. Haitsma","doi":"10.1109/MMSP.2002.1203274","DOIUrl":"https://doi.org/10.1109/MMSP.2002.1203274","url":null,"abstract":"An audio fingerprint is a content-based compact signature that summarizes an audio recording. Audio fingerprinting technologies have recently attracted attention since they allow the monitoring of audio independently of its format and without the need of meta-data or watermark embedding. The different approaches to fingerprinting are usually described with different rationales and terminology depending on the background: pattern matching, multimedia (music) information retrieval or cryptography (robust hashing). In this paper, we review different techniques mapping functional parts to blocks of a unified framework.","PeriodicalId":398813,"journal":{"name":"2002 IEEE Workshop on Multimedia Signal Processing.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121694065","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}
引用次数: 330
Semi-regular mesh representation of 3D dynamic objects based on correspondence matching 基于对应匹配的三维动态物体的半规则网格表示
2002 IEEE Workshop on Multimedia Signal Processing. Pub Date : 2002-12-09 DOI: 10.1109/MMSP.2002.1203238
Jeong-Hyu Yang, Chang-Su Kim, Sang Uk Lee
{"title":"Semi-regular mesh representation of 3D dynamic objects based on correspondence matching","authors":"Jeong-Hyu Yang, Chang-Su Kim, Sang Uk Lee","doi":"10.1109/MMSP.2002.1203238","DOIUrl":"https://doi.org/10.1109/MMSP.2002.1203238","url":null,"abstract":"In this paper, we propose a novel method to represent 3D dynamic objects, which are captured with a laser scanner in successive time instances. The objective is to convert an input mesh sequence into a semi-regular mesh sequence with time-invariant topology information, since it enables the easier manipulation of 3D data using many signal processing techniques. We achieve this objective by performing global motion estimation, local deformation estimation, and correspondence optimization subsequently. Simulation results show that the proposed algorithm reconstructs the original geometry faithfully. Furthermore, the resulting semi-regular mesh sequences can be effectively compressed by adopting wavelet coding schemes.","PeriodicalId":398813,"journal":{"name":"2002 IEEE Workshop on Multimedia Signal Processing.","volume":"225 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123034623","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}
引用次数: 1
Object based video watermarking scheme using inertia ellipse and shape adaptive DCT 基于惯量椭圆和形状自适应DCT的目标视频水印方案
2002 IEEE Workshop on Multimedia Signal Processing. Pub Date : 2002-12-09 DOI: 10.1109/MMSP.2002.1203307
Guo Jie, Shi Peng-fei, Fang Tao
{"title":"Object based video watermarking scheme using inertia ellipse and shape adaptive DCT","authors":"Guo Jie, Shi Peng-fei, Fang Tao","doi":"10.1109/MMSP.2002.1203307","DOIUrl":"https://doi.org/10.1109/MMSP.2002.1203307","url":null,"abstract":"Video object (VO) is an important concept in MPEG-4. For objects can be easily manipulated without visible distortion, the copyright protection of video objects becomes an important issue. This paper presents a watermarking scheme for video objects. Different from other methods, the proposed scheme employed inertia ellipse to achieve fast synchronization recovery in case the object was manipulated. Shape adaptive DCT and visual mask were combined to embed the watermark into the arbitrarily shaped object, which was designed to achieve the trade-off between the invisibility and the robustness. Experiments show that our algorithm is robust to object manipulations such as rotations, translations, scaling and lossy compression. Our scheme can be easily incorporated into the object-based coding framework of MPEG-4.","PeriodicalId":398813,"journal":{"name":"2002 IEEE Workshop on Multimedia Signal Processing.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123657125","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
On the performance of multiplicative spread spectrum watermarking 乘法扩频水印的性能研究
2002 IEEE Workshop on Multimedia Signal Processing. Pub Date : 2002-12-09 DOI: 10.1109/MMSP.2002.1203311
M. Barni, F. Bartolini, A. D. Rosa
{"title":"On the performance of multiplicative spread spectrum watermarking","authors":"M. Barni, F. Bartolini, A. D. Rosa","doi":"10.1109/MMSP.2002.1203311","DOIUrl":"https://doi.org/10.1109/MMSP.2002.1203311","url":null,"abstract":"The performance of multiplicative spread spectrum watermarking algorithms are investigated under the simplifying assumption that host features are normally distributed, and attacks take the form of normally distributed additive noise. By relying on the obtained results, multiplicative spread spectrum watermarking is compared to its additive counterpart and to quantization based schemes.","PeriodicalId":398813,"journal":{"name":"2002 IEEE Workshop on Multimedia Signal Processing.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122799158","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
首页 上一页 下一页 尾页
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学术官方微信