Pub Date : 2006-07-09DOI: 10.1109/ICME.2006.262861
Jie Wang, K. Plataniotis, A. Venetsanopoulos
It is well-known that supervised learning techniques such as linear discriminant analysis (LDA) often suffer from the so called small sample size problem when apply to solve face recognition problems. This is due to the fact that in most cases, the number of training samples is much smaller than the dimensionality of the sample space. The problem becomes even more severe if only one training sample is available for each subject. In this paper, followed by the well-known unsupervised technique, kernel principal component analysis (KPCA), a novel feature selection scheme is proposed to establish a discriminant feature subspace in which the class separability is maximized. Extensive experiments performed on the FERET database indicate that the proposed scheme significantly boosts the recognition performance of the traditional KPCA solution
{"title":"Selecting Kernel Eigenfaces for Face Recognition with One Training Sample Per Subject","authors":"Jie Wang, K. Plataniotis, A. Venetsanopoulos","doi":"10.1109/ICME.2006.262861","DOIUrl":"https://doi.org/10.1109/ICME.2006.262861","url":null,"abstract":"It is well-known that supervised learning techniques such as linear discriminant analysis (LDA) often suffer from the so called small sample size problem when apply to solve face recognition problems. This is due to the fact that in most cases, the number of training samples is much smaller than the dimensionality of the sample space. The problem becomes even more severe if only one training sample is available for each subject. In this paper, followed by the well-known unsupervised technique, kernel principal component analysis (KPCA), a novel feature selection scheme is proposed to establish a discriminant feature subspace in which the class separability is maximized. Extensive experiments performed on the FERET database indicate that the proposed scheme significantly boosts the recognition performance of the traditional KPCA solution","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114202854","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}
Pub Date : 2006-07-09DOI: 10.1109/ICME.2006.262588
M. Prangl, H. Hellwagner, Tibor Szkaliczki
In order to enable transparent and convenient use of multimedia content across a wide range of networks and devices, content adaptation is an important issue within multimedia frameworks. The so called digital item adaptation (DIA) standard is one of the core concepts of the MPEG-21 framework that will support the adaptation of multimedia resources according to device capabilities, underlying network characteristics, and user preferences. Most multimedia adaptation engines for providing universal multimedia access (UMA) scale the content with respect to terminal capabilities and resource constraints. This paper focuses on the cross-modal adaptation decision taking process considering the user environment and terminal capabilities as well as resource limitations on the server, network, and client side. This approach represents a step toward increased universal multimedia experience (UME). Based on four different algorithms for solving this optimization process, we present an evaluation of results gained by running their implementations on different test networks
{"title":"Fast Adaptation Decision Taking for Cross-Modal Multimedia Content Adaptation","authors":"M. Prangl, H. Hellwagner, Tibor Szkaliczki","doi":"10.1109/ICME.2006.262588","DOIUrl":"https://doi.org/10.1109/ICME.2006.262588","url":null,"abstract":"In order to enable transparent and convenient use of multimedia content across a wide range of networks and devices, content adaptation is an important issue within multimedia frameworks. The so called digital item adaptation (DIA) standard is one of the core concepts of the MPEG-21 framework that will support the adaptation of multimedia resources according to device capabilities, underlying network characteristics, and user preferences. Most multimedia adaptation engines for providing universal multimedia access (UMA) scale the content with respect to terminal capabilities and resource constraints. This paper focuses on the cross-modal adaptation decision taking process considering the user environment and terminal capabilities as well as resource limitations on the server, network, and client side. This approach represents a step toward increased universal multimedia experience (UME). Based on four different algorithms for solving this optimization process, we present an evaluation of results gained by running their implementations on different test networks","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120963382","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}
Pub Date : 2006-07-09DOI: 10.1109/ICME.2006.262446
Zhi Li, Y. Lian, Qibin Sun, C. Chen
We propose in this paper a novel content-aware stream-level approach to authenticating multimedia data transmitted over wireless networks. The proposed approach is fundamentally different from conventional authentication methods and offers robust authentication for multimedia data in the presence of channel noise. The scheme is designed in such a way that it facilitates explicit capture and exploitation of channel condition as well as how the multimedia content is packetized and transmitted. The design allows the integration of authentication with the framework of joint source and channel coding (JSCC) to achieve adaptiveness to the content and efficient utilization of limited bandwidth. We have realized the proposed scheme through optimal resource allocation and authentication graph construction. Experiment results demonstrated the effectiveness of this novel approach
{"title":"Authenticating Multimedia Transmitted Over Wireless Networks: A Content-Aware Stream-Level Approach","authors":"Zhi Li, Y. Lian, Qibin Sun, C. Chen","doi":"10.1109/ICME.2006.262446","DOIUrl":"https://doi.org/10.1109/ICME.2006.262446","url":null,"abstract":"We propose in this paper a novel content-aware stream-level approach to authenticating multimedia data transmitted over wireless networks. The proposed approach is fundamentally different from conventional authentication methods and offers robust authentication for multimedia data in the presence of channel noise. The scheme is designed in such a way that it facilitates explicit capture and exploitation of channel condition as well as how the multimedia content is packetized and transmitted. The design allows the integration of authentication with the framework of joint source and channel coding (JSCC) to achieve adaptiveness to the content and efficient utilization of limited bandwidth. We have realized the proposed scheme through optimal resource allocation and authentication graph construction. Experiment results demonstrated the effectiveness of this novel approach","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121179116","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}
Pub Date : 2006-07-09DOI: 10.1109/ICME.2006.262863
Sarah Ali, P. Aarabi
In this paper a novel cyclic interface for searching through a song database is proposed. The method, which merges multiple audio streams on a server and broadcasts only a single merged stream, allows the user to hear different parts of each audio stream by cycling through all available streams. Experimental results on 21 users illustrate that the proposed interface requires less listening time as compared to traditional list-based interfaces when the desired song/audio clip is among one of the audio streams. The average search time for the proposed interface was 7.3 seconds, compared to 12.1 seconds for the traditional list-based interface when searching for a song which is included among the audio streams
{"title":"A Novel Interface for Audio Search","authors":"Sarah Ali, P. Aarabi","doi":"10.1109/ICME.2006.262863","DOIUrl":"https://doi.org/10.1109/ICME.2006.262863","url":null,"abstract":"In this paper a novel cyclic interface for searching through a song database is proposed. The method, which merges multiple audio streams on a server and broadcasts only a single merged stream, allows the user to hear different parts of each audio stream by cycling through all available streams. Experimental results on 21 users illustrate that the proposed interface requires less listening time as compared to traditional list-based interfaces when the desired song/audio clip is among one of the audio streams. The average search time for the proposed interface was 7.3 seconds, compared to 12.1 seconds for the traditional list-based interface when searching for a song which is included among the audio streams","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121805197","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}
Pub Date : 2006-07-09DOI: 10.1109/ICME.2006.262640
Fangwen Fu, A. Fattahi, M. Schaar
We propose a new way of architecting the wireless multimedia communications systems by jointly optimizing the protocol stack at each station and the resource exchanges among stations. We model wireless stations as rational players competing for available wireless resources in a dynamic repeated game. We investigate and quantify the system performance and the impact of different cross-layer strategies deployed by wireless stations onto their own performance as well as the competing station performance. We show through simulations that the proposed game-theoretic resource management outperforms alternative techniques such as air-fair time and equal time resource allocation in terms of the total system utility
{"title":"Game-Theoretic Paradigm for Resource Management in Spectrum Agile Wireless Networks","authors":"Fangwen Fu, A. Fattahi, M. Schaar","doi":"10.1109/ICME.2006.262640","DOIUrl":"https://doi.org/10.1109/ICME.2006.262640","url":null,"abstract":"We propose a new way of architecting the wireless multimedia communications systems by jointly optimizing the protocol stack at each station and the resource exchanges among stations. We model wireless stations as rational players competing for available wireless resources in a dynamic repeated game. We investigate and quantify the system performance and the impact of different cross-layer strategies deployed by wireless stations onto their own performance as well as the competing station performance. We show through simulations that the proposed game-theoretic resource management outperforms alternative techniques such as air-fair time and equal time resource allocation in terms of the total system utility","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125692999","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}
Pub Date : 2006-07-09DOI: 10.1109/ICME.2006.262616
M. Sinnathamby, S. Sudharsanan, N. Manjikian
This paper proposes a new architecture for efficient variable-length decoding (VLD) of entropy-coded data for multimedia applications on general-purpose processors. It improves on earlier proposals for low-complexity performance-enhancing hardware structures that exploit prefix/suffix properties of variable-length codes for common multimedia formats. The enhanced architecture is compared to the previous architectures in terms of complexity and operating speed for FPGA implementation, and also in terms of area requirements, power consumption, and operating speed for a 0.18-mum ASIC fabrication process. Simulation results are reported for a pipelined processor with caches executing MPEG-4 software where VLD performance is doubled by incorporating the proposed architecture
本文提出了一种基于通用处理器的多媒体应用中熵编码数据的高效变长解码(VLD)结构。它改进了先前提出的低复杂性性能增强硬件结构的建议，这些硬件结构利用通用多媒体格式的变长代码的前缀/后缀属性。增强的体系结构在FPGA实现的复杂性和运行速度方面与以前的体系结构进行了比较，并且在0.18 μ m ASIC制造工艺的面积要求，功耗和运行速度方面也进行了比较。仿真结果报告了一个流水线处理器的缓存执行MPEG-4软件，其中VLD性能通过合并所提出的架构增加了一倍
{"title":"Enhanced Architectural Support for Variable-Length Decoding","authors":"M. Sinnathamby, S. Sudharsanan, N. Manjikian","doi":"10.1109/ICME.2006.262616","DOIUrl":"https://doi.org/10.1109/ICME.2006.262616","url":null,"abstract":"This paper proposes a new architecture for efficient variable-length decoding (VLD) of entropy-coded data for multimedia applications on general-purpose processors. It improves on earlier proposals for low-complexity performance-enhancing hardware structures that exploit prefix/suffix properties of variable-length codes for common multimedia formats. The enhanced architecture is compared to the previous architectures in terms of complexity and operating speed for FPGA implementation, and also in terms of area requirements, power consumption, and operating speed for a 0.18-mum ASIC fabrication process. Simulation results are reported for a pipelined processor with caches executing MPEG-4 software where VLD performance is doubled by incorporating the proposed architecture","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131171779","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}
Pub Date : 2006-07-09DOI: 10.1109/ICME.2006.262618
R. M. Schreier, A. Rahman, G. Krishnamurthy, A. Rothermel
Low-delay video coding is a key technology for video conferencing as well as upcoming remote-monitoring and automotive video applications like rear-view cameras or night vision systems. As the ongoing progress in programmable DSP and ASIC technology allows cost effective and flexible implementations of the necessary hardware, compressed video transmission systems over multimedia busses will soon replace the current uncompressed systems even in latency critical applications. In this paper, fundamentals and theoretic limits of low-delay video coding are discussed with respect to architectural consequences of real-time implementations. A general latency analysis for a compressed video transmission systems is presented considering algorithmic, architectural and transmission related delays
{"title":"Architecture Analysis for Low-Delay Video Coding","authors":"R. M. Schreier, A. Rahman, G. Krishnamurthy, A. Rothermel","doi":"10.1109/ICME.2006.262618","DOIUrl":"https://doi.org/10.1109/ICME.2006.262618","url":null,"abstract":"Low-delay video coding is a key technology for video conferencing as well as upcoming remote-monitoring and automotive video applications like rear-view cameras or night vision systems. As the ongoing progress in programmable DSP and ASIC technology allows cost effective and flexible implementations of the necessary hardware, compressed video transmission systems over multimedia busses will soon replace the current uncompressed systems even in latency critical applications. In this paper, fundamentals and theoretic limits of low-delay video coding are discussed with respect to architectural consequences of real-time implementations. A general latency analysis for a compressed video transmission systems is presented considering algorithmic, architectural and transmission related delays","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131200038","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}
Pub Date : 2006-07-09DOI: 10.1109/ICME.2006.262515
Mika Rautiainen, T. Seppänen, T. Ojala
Interactive experiments on video retrieval systems need to address the problem of internal validity, i.e. how much the test users' experience affects the retrieval effectiveness. This paper compares the semantic retrieval performance of novice users and expert system developers. The test system utilizes cluster-temporal browsing, which combines chronological video structure and computation of similarities into single interface. Interactive experiments with eight test users were carried out in a database of ~80 hours of multilingual news video from TRECVID 2005 benchmark. A cluster-temporal browser was found to improve the retrieval effectiveness by 12% with novice system users. Expert users were able to achieve 18% better performance than the novice users. Additionally, manual search experiments demonstrated that search performance can be improved by 19-25% when a plain text search is supplemented with content-based features
{"title":"Advancing Content-Based Retrieval Effectiveness with Cluster-Temporal Browsing in Multilingual Video Databases","authors":"Mika Rautiainen, T. Seppänen, T. Ojala","doi":"10.1109/ICME.2006.262515","DOIUrl":"https://doi.org/10.1109/ICME.2006.262515","url":null,"abstract":"Interactive experiments on video retrieval systems need to address the problem of internal validity, i.e. how much the test users' experience affects the retrieval effectiveness. This paper compares the semantic retrieval performance of novice users and expert system developers. The test system utilizes cluster-temporal browsing, which combines chronological video structure and computation of similarities into single interface. Interactive experiments with eight test users were carried out in a database of ~80 hours of multilingual news video from TRECVID 2005 benchmark. A cluster-temporal browser was found to improve the retrieval effectiveness by 12% with novice system users. Expert users were able to achieve 18% better performance than the novice users. Additionally, manual search experiments demonstrated that search performance can be improved by 19-25% when a plain text search is supplemented with content-based features","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131098062","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}
Pub Date : 2006-07-09DOI: 10.1109/ICME.2006.262534
Q. Mahmoud
Mobile advertising, which is an area of mobile commerce, is a form of advertising that targets users of handheld wireless devices such as mobile phones and personal digital assistants (PDAs). Given the constraints of such devices, mobile advertisements should be context-aware in the sense that the behaviour of such value-added services is mostly driven by information based on user's location, time, user preferences, and the task at hand. This paper presents the design and prototyping of a system for provisioning context-aware advertisements to wireless mobile users. We use mobile agents because such autonomous entities have characteristics that can benefit mobile devices and the wireless environment. We have constructed a proof of concept implementation using Java technologies with support for WAP-enabled and J2ME-enabled devices
{"title":"Provisioning Context-Aware Advertisements to Wireless Mobile Users","authors":"Q. Mahmoud","doi":"10.1109/ICME.2006.262534","DOIUrl":"https://doi.org/10.1109/ICME.2006.262534","url":null,"abstract":"Mobile advertising, which is an area of mobile commerce, is a form of advertising that targets users of handheld wireless devices such as mobile phones and personal digital assistants (PDAs). Given the constraints of such devices, mobile advertisements should be context-aware in the sense that the behaviour of such value-added services is mostly driven by information based on user's location, time, user preferences, and the task at hand. This paper presents the design and prototyping of a system for provisioning context-aware advertisements to wireless mobile users. We use mobile agents because such autonomous entities have characteristics that can benefit mobile devices and the wireless environment. We have constructed a proof of concept implementation using Java technologies with support for WAP-enabled and J2ME-enabled devices","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127600160","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}
Pub Date : 2006-07-09DOI: 10.1109/ICME.2006.262856
M. Kolekar, S. Sengupta
In this paper, we present a novel approach towards customized and automated generation of sports highlights from its extracted events and semantic concepts. A recorded sports video is first divided into slots, based on the game progress and for each slot, an importance-based concept and event-selection is proposed to include those in the highlights. Using our approach, we have successfully extracted highlights from recorded video of cricket match
{"title":"Event-Importance Based Customized and Automatic Cricket Highlight Generation","authors":"M. Kolekar, S. Sengupta","doi":"10.1109/ICME.2006.262856","DOIUrl":"https://doi.org/10.1109/ICME.2006.262856","url":null,"abstract":"In this paper, we present a novel approach towards customized and automated generation of sports highlights from its extracted events and semantic concepts. A recorded sports video is first divided into slots, based on the game progress and for each slot, an importance-based concept and event-selection is proposed to include those in the highlights. Using our approach, we have successfully extracted highlights from recorded video of cricket match","PeriodicalId":339258,"journal":{"name":"2006 IEEE International Conference on Multimedia and Expo","volume":"32 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132537609","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：