In this paper we propose a variant of RSA public key scheme, called "hidden exponent RSA". Based on this new scheme, we devised an efficient key distribution/management scheme for secure communication among devices in the context of pervasive computing, with emphasis on the simplicity and efficiency of the protocol. We show the new scheme is secure under the strong RSA assumption.
{"title":"An efficient key management scheme for pervasive computing","authors":"H. Ge","doi":"10.1109/ISM.2005.30","DOIUrl":"https://doi.org/10.1109/ISM.2005.30","url":null,"abstract":"In this paper we propose a variant of RSA public key scheme, called \"hidden exponent RSA\". Based on this new scheme, we devised an efficient key distribution/management scheme for secure communication among devices in the context of pervasive computing, with emphasis on the simplicity and efficiency of the protocol. We show the new scheme is secure under the strong RSA assumption.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"330 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134032657","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}
This work presents a new distance function - the global warp metric distance - to compare histograms used as a feature to index image databases in content based image retrieval environments. The metric histogram represents a compact, but efficient alternative to the use of traditional gray level histograms to represent images. The global warp metric distance (GWMD) enhances the comparison between histograms, replacing the rigid bin to bin evaluation by the warp method, which allows a local "adjustment" of one histogram to the other during the distance calculation, introducing a global matching of the curves. Besides this, GWMD applies a set of geometric global features of histograms to determine the final distance. Results on similarity retrieval in medical images demonstrate the superiority of the proposed approach in analyzing image sets that present brightness and contrast disparities: it reduces the amount of both false positive and false negative retrievals. Moreover, these results comply with similarity evaluations performed by domain specialists.
{"title":"Global warp metric distance: boosting content-based image retrieval through histograms","authors":"J. C. Felipe, A. Traina, C. Traina","doi":"10.1109/ISM.2005.64","DOIUrl":"https://doi.org/10.1109/ISM.2005.64","url":null,"abstract":"This work presents a new distance function - the global warp metric distance - to compare histograms used as a feature to index image databases in content based image retrieval environments. The metric histogram represents a compact, but efficient alternative to the use of traditional gray level histograms to represent images. The global warp metric distance (GWMD) enhances the comparison between histograms, replacing the rigid bin to bin evaluation by the warp method, which allows a local \"adjustment\" of one histogram to the other during the distance calculation, introducing a global matching of the curves. Besides this, GWMD applies a set of geometric global features of histograms to determine the final distance. Results on similarity retrieval in medical images demonstrate the superiority of the proposed approach in analyzing image sets that present brightness and contrast disparities: it reduces the amount of both false positive and false negative retrievals. Moreover, these results comply with similarity evaluations performed by domain specialists.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129376694","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}
It is well known that simple amplification cannot help many hearing-impaired listeners. As a consequence of this, numerous signal enhancement algorithms have been proposed for digital hearing aids. Many of these algorithms are only effective in certain environments. The ability to quickly and correctly detect elements of the auditory scene can permit the selection/parameterization of enhancement algorithms from a library of available routines. In this work, the authors examine the real time parameterization of a frequency-domain compression algorithm which preserves formant ratios and thus enhances speech understanding for some individuals with severe sensorineural hearing loss in the 2-3 kHz range. The optimal compression ratio is dependent upon qualities of the acoustical signal. We briefly review the frequency-compression technology and describe a Gaussian mixture model classifier which can dynamically set the frequency compression ratio according to broad acoustic categories which we call cohorts. We discuss the results of a prototype simulator which has been implemented on a general purpose computer.
{"title":"Audio scene analysis as a control system for hearing aids","authors":"M. Roch, T. Huang, Jing Liu, R. Hurtig","doi":"10.1109/ISM.2005.36","DOIUrl":"https://doi.org/10.1109/ISM.2005.36","url":null,"abstract":"It is well known that simple amplification cannot help many hearing-impaired listeners. As a consequence of this, numerous signal enhancement algorithms have been proposed for digital hearing aids. Many of these algorithms are only effective in certain environments. The ability to quickly and correctly detect elements of the auditory scene can permit the selection/parameterization of enhancement algorithms from a library of available routines. In this work, the authors examine the real time parameterization of a frequency-domain compression algorithm which preserves formant ratios and thus enhances speech understanding for some individuals with severe sensorineural hearing loss in the 2-3 kHz range. The optimal compression ratio is dependent upon qualities of the acoustical signal. We briefly review the frequency-compression technology and describe a Gaussian mixture model classifier which can dynamically set the frequency compression ratio according to broad acoustic categories which we call cohorts. We discuss the results of a prototype simulator which has been implemented on a general purpose computer.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116032206","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}
The specification of the IP multimedia subsystem as a service delivery architecture for next generation networks and the introduction of push to talk (PTT) as an IMS based service moves VoIP applications for mobile devices already to the market. PTT has gained a strong following in the US market and is on the verge of spreading globally. The open mobile alliance (OMA) currently specifies PTT as an IMS based service to assure interoperability between different operator domains. Most PTT solution vendors think already about extending PTT with other media types then voice, like video communication, file transfer or service subscription for content push services. Thus, push to multimedia (PTM) does not seem to be that far away from market and is well suited as an enabler to provide IMS applications with advanced multimedia communication functionalities. The department for Next Generation Network Integration (NGNI) at Fraunhofer Institute FOKUS has created a PTM application that utilises the IMS architecture. This paper reports about a concept of integrating this PTT/PTM functionality in community based applications to enable already existing groups and communities with new communication features.
IP多媒体子系统作为下一代网络的服务交付体系结构的规范，以及推送通话(PTT)作为基于IMS的服务的引入，已经将用于移动设备的VoIP应用推向了市场。PTT在美国市场已经获得了强大的追随者，并即将向全球扩张。开放移动联盟(OMA)目前将PTT指定为基于IMS的服务，以确保不同运营商域之间的互操作性。大多数PTT解决方案供应商已经在考虑将PTT扩展到语音之外的其他媒体类型，如视频通信、文件传输或内容推送服务的服务订阅。因此，推送到多媒体(PTM)似乎离市场并不遥远，而且非常适合作为一种使能器，为IMS应用程序提供高级多媒体通信功能。弗劳恩霍夫研究所(Fraunhofer Institute focus)的下一代网络集成(NGNI)部门创建了一个利用IMS架构的PTM应用程序。本文报告了在基于社区的应用程序中集成这种PTT/PTM功能的概念，以使已经存在的组和社区具有新的通信特性。
{"title":"PTT + IMS = PTM - towards community/presence-based IMS multimedia services","authors":"N. Blum, T. Magedanz","doi":"10.1109/ISM.2005.93","DOIUrl":"https://doi.org/10.1109/ISM.2005.93","url":null,"abstract":"The specification of the IP multimedia subsystem as a service delivery architecture for next generation networks and the introduction of push to talk (PTT) as an IMS based service moves VoIP applications for mobile devices already to the market. PTT has gained a strong following in the US market and is on the verge of spreading globally. The open mobile alliance (OMA) currently specifies PTT as an IMS based service to assure interoperability between different operator domains. Most PTT solution vendors think already about extending PTT with other media types then voice, like video communication, file transfer or service subscription for content push services. Thus, push to multimedia (PTM) does not seem to be that far away from market and is well suited as an enabler to provide IMS applications with advanced multimedia communication functionalities. The department for Next Generation Network Integration (NGNI) at Fraunhofer Institute FOKUS has created a PTM application that utilises the IMS architecture. This paper reports about a concept of integrating this PTT/PTM functionality in community based applications to enable already existing groups and communities with new communication features.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123190459","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}
Multimedia services over wireless networks were made popular by the arrival of smart handhelds. These devices bring heterogeneity to the wireless networks and to the content creation as the content cannot be delivered in its original format due to the difference in the capabilities of these handhelds. An intermediate stage of processing like transcoding is carried out before delivering multimedia content. Under certain scenarios, it is required to convert the content attributes such as bit rate, frame rate, etc. while still retaining the content format to cater to devices with varying capabilities. We propose an algorithm that prioritizes frames taking into account inter frame similarity to perform frame dropping. The priority value based frame dropping in turn aids in delivering better quality video. Our frame priority assignment algorithm is based on uniform distribution of dropped frames to minimize jitter and maximizing the distance between two consecutive dropped frames.
{"title":"Inter-frame similarity based video transcoding","authors":"R. Balsree, A. Thawani, S. Gopalan, V. Sridhar","doi":"10.1109/ISM.2005.71","DOIUrl":"https://doi.org/10.1109/ISM.2005.71","url":null,"abstract":"Multimedia services over wireless networks were made popular by the arrival of smart handhelds. These devices bring heterogeneity to the wireless networks and to the content creation as the content cannot be delivered in its original format due to the difference in the capabilities of these handhelds. An intermediate stage of processing like transcoding is carried out before delivering multimedia content. Under certain scenarios, it is required to convert the content attributes such as bit rate, frame rate, etc. while still retaining the content format to cater to devices with varying capabilities. We propose an algorithm that prioritizes frames taking into account inter frame similarity to perform frame dropping. The priority value based frame dropping in turn aids in delivering better quality video. Our frame priority assignment algorithm is based on uniform distribution of dropped frames to minimize jitter and maximizing the distance between two consecutive dropped frames.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121075651","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}
Gang Zhai, G. Fox, M. Pierce, Wenjun Wu, Hasan Bulut
We designed eSports - a collaborative and synchronous video annotation platform, which is to be used in Internet scale cross-platform grid computing environment to facilitate computer supported cooperative work (CSCW) in education settings such as distance sport coaching, distance classroom etc. Different from traditional multimedia annotation systems, eSports provides the capabilities to collaboratively and synchronously play and archive real time live video, to take snapshots, to annotate video snapshots using whiteboard and to play back the video annotations synchronized with original video streams. eSports is designed based on the grid based collaboration paradigm $the shared event model using NaradaBrokering, which is a publish/subscribe based distributed message passing and event notification system. In addition to elaborate the design and implementation of eSports, we analyze the potential use cases of eSports under different education settings. We believed that eSports is very useful to improve the online collaborative coaching and education.
{"title":"eSports: collaborative and synchronous video annotation system in grid computing environment","authors":"Gang Zhai, G. Fox, M. Pierce, Wenjun Wu, Hasan Bulut","doi":"10.1109/ISM.2005.55","DOIUrl":"https://doi.org/10.1109/ISM.2005.55","url":null,"abstract":"We designed eSports - a collaborative and synchronous video annotation platform, which is to be used in Internet scale cross-platform grid computing environment to facilitate computer supported cooperative work (CSCW) in education settings such as distance sport coaching, distance classroom etc. Different from traditional multimedia annotation systems, eSports provides the capabilities to collaboratively and synchronously play and archive real time live video, to take snapshots, to annotate video snapshots using whiteboard and to play back the video annotations synchronized with original video streams. eSports is designed based on the grid based collaboration paradigm $the shared event model using NaradaBrokering, which is a publish/subscribe based distributed message passing and event notification system. In addition to elaborate the design and implementation of eSports, we analyze the potential use cases of eSports under different education settings. We believed that eSports is very useful to improve the online collaborative coaching and education.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126080903","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}
Advanced personal wireless mobile devices, such as today's emerging smart phones, are capable computers that have the potential to enable individuals to share personal content, such as photographs, music, and video. Face to face sharing can be a satisfying and even emotional experience, yet it is not well supported by existing digital technologies, which typically isolate media into separate collections or require that they be manually combined into a single collection on a single machine. Federating wireless mobile devices with fixed infrastructure, such as a digital home entertainment center, provides a lightweight, unified, and intuitive way to share media among friends and family. This paper looks at both technological and social issues that surround sharing media using federated devices, considering the relevant emerging technologies, media types, and usage contexts.
{"title":"Face-to-face media sharing using wireless mobile devices","authors":"T. Pering, David H. Nguyen, J. Light, R. Want","doi":"10.1109/ISM.2005.57","DOIUrl":"https://doi.org/10.1109/ISM.2005.57","url":null,"abstract":"Advanced personal wireless mobile devices, such as today's emerging smart phones, are capable computers that have the potential to enable individuals to share personal content, such as photographs, music, and video. Face to face sharing can be a satisfying and even emotional experience, yet it is not well supported by existing digital technologies, which typically isolate media into separate collections or require that they be manually combined into a single collection on a single machine. Federating wireless mobile devices with fixed infrastructure, such as a digital home entertainment center, provides a lightweight, unified, and intuitive way to share media among friends and family. This paper looks at both technological and social issues that surround sharing media using federated devices, considering the relevant emerging technologies, media types, and usage contexts.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116885241","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}
Internet worms pose a serious threat to networks. Most current intrusion detection systems (IDSs) take signature matching approach to detect worms. Given the fact that most signatures are developed manually, generating new signatures for each variant of a worm incurs significant overhead. In this paper, we propose a difference-based scheme which differences worm flows and normal flows to generate robust worm signatures. The proposed scheme is based on two observational facts - worm flows contain several invariant portions in their payloads, and core worm codes do not exist in normal flows. It uses samples of worm flows detected by available means to extract common tokens. It then differences the set of these tokens with those of normal flows and generates signature candidates. By using such signatures within enterprises, out of reach of worm writers, the possibility of being tricked by worm writers can be reduced. We evaluate the proposed scheme using real network traffic traces that contains worms. Experiment results show that the proposed scheme exhibits high detection rate with low false positives.
{"title":"Differencing worm flows and normal flows for automatic generation of worm signatures","authors":"K. Simkhada, H. Tsunoda, Yuji Waizumi, Y. Nemoto","doi":"10.1109/ISM.2005.49","DOIUrl":"https://doi.org/10.1109/ISM.2005.49","url":null,"abstract":"Internet worms pose a serious threat to networks. Most current intrusion detection systems (IDSs) take signature matching approach to detect worms. Given the fact that most signatures are developed manually, generating new signatures for each variant of a worm incurs significant overhead. In this paper, we propose a difference-based scheme which differences worm flows and normal flows to generate robust worm signatures. The proposed scheme is based on two observational facts - worm flows contain several invariant portions in their payloads, and core worm codes do not exist in normal flows. It uses samples of worm flows detected by available means to extract common tokens. It then differences the set of these tokens with those of normal flows and generates signature candidates. By using such signatures within enterprises, out of reach of worm writers, the possibility of being tricked by worm writers can be reduced. We evaluate the proposed scheme using real network traffic traces that contains worms. Experiment results show that the proposed scheme exhibits high detection rate with low false positives.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129297143","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}
E. Fonseca, R. Guido, Andre C. Silvestre, J. Pereira
An algorithm able to classify pathological and normal voice signals based on Daubechies discrete wavelet transform (DWT-db) and support vector machines (SVM) classifier is presented. DWT-db is used for time-frequency analysis giving quantitative evaluation of signal characteristics to identify pathologies in voice signals, particularly nodules in vocal folds, of subjects with different ages for both male and female. After using a linear prediction coefficients (LPC) filter, the signals mean square values of a particular scale from wavelet analysis are entries to a nonlinear least square support vector machine (LS-SVM) classifier, which leads to an adequate larynx pathology classifier which over 95% of classification accuracy.
{"title":"Discrete wavelet transform and support vector machine applied to pathological voice signals identification","authors":"E. Fonseca, R. Guido, Andre C. Silvestre, J. Pereira","doi":"10.1109/ISM.2005.50","DOIUrl":"https://doi.org/10.1109/ISM.2005.50","url":null,"abstract":"An algorithm able to classify pathological and normal voice signals based on Daubechies discrete wavelet transform (DWT-db) and support vector machines (SVM) classifier is presented. DWT-db is used for time-frequency analysis giving quantitative evaluation of signal characteristics to identify pathologies in voice signals, particularly nodules in vocal folds, of subjects with different ages for both male and female. After using a linear prediction coefficients (LPC) filter, the signals mean square values of a particular scale from wavelet analysis are entries to a nonlinear least square support vector machine (LS-SVM) classifier, which leads to an adequate larynx pathology classifier which over 95% of classification accuracy.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130402532","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}
In this paper we explore, via an extensive simulation study, the performance of a new medium access control (MAC) protocol when integrating video and data packet traffic over a wireless picocellular system of very high capacity, with errors. Mobile terminals are considered to be high performance devices with extended storage capabilities which can act like cache memories streaming multimedia material. Our scheme achieves high aggregate channel throughput in all cases of traffic load, despite the very bursty nature of the examined traffic and the introduction of errors in the system.
{"title":"On the performance evaluation of a dynamic bandwidth reservation mechanism for integrated H.263 video, IP and MP3 traffic over wireless networks","authors":"H. Papadakis, P. Koutsakis, M. Vafiadis","doi":"10.1109/ISM.2005.86","DOIUrl":"https://doi.org/10.1109/ISM.2005.86","url":null,"abstract":"In this paper we explore, via an extensive simulation study, the performance of a new medium access control (MAC) protocol when integrating video and data packet traffic over a wireless picocellular system of very high capacity, with errors. Mobile terminals are considered to be high performance devices with extended storage capabilities which can act like cache memories streaming multimedia material. Our scheme achieves high aggregate channel throughput in all cases of traffic load, despite the very bursty nature of the examined traffic and the introduction of errors in the system.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130581581","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
扫码关注我们
求助内容：
应助结果提醒方式：