In this paper, we considered the problem of transporting layered video over erroneous multi-hop wireless networks and proposed a distributed system. Our proposed distributed scheme is comprised of distributed control (DC), distributed buffer (DB) and distributed error control schemes. The DC scheme improves the efficiency of the network bandwidth usage and reduces the end-to-end delay of the streaming application. End-to-end delay jitter can be reduced by proper use of the DB nodes' buffer. Replacing the traditional EEC and ARQ with our distributed FEC and ARQ scheme reduces the error-protection overhead and ARQ delay and improves the wireless channel throughput. A layered video module is developed in GlomoSim 2.03 for video streaming application. We simulated our distributed scheme employing the layered video module in GlomoSim 2.03. Our simulation results confirm that QoS of streaming video over erroneous multi-hop wireless network can be improved using our proposed distributed scheme.
{"title":"Video streaming over multi-hop wireless networks","authors":"Hao Wang, A. Faragó, S. Venkatesan","doi":"10.1109/ISM.2005.121","DOIUrl":"https://doi.org/10.1109/ISM.2005.121","url":null,"abstract":"In this paper, we considered the problem of transporting layered video over erroneous multi-hop wireless networks and proposed a distributed system. Our proposed distributed scheme is comprised of distributed control (DC), distributed buffer (DB) and distributed error control schemes. The DC scheme improves the efficiency of the network bandwidth usage and reduces the end-to-end delay of the streaming application. End-to-end delay jitter can be reduced by proper use of the DB nodes' buffer. Replacing the traditional EEC and ARQ with our distributed FEC and ARQ scheme reduces the error-protection overhead and ARQ delay and improves the wireless channel throughput. A layered video module is developed in GlomoSim 2.03 for video streaming application. We simulated our distributed scheme employing the layered video module in GlomoSim 2.03. Our simulation results confirm that QoS of streaming video over erroneous multi-hop wireless network can be improved using our proposed distributed scheme.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"41 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":"134152871","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}
M. Villa-Uriol, F. Kuester, O. G. Pañella, J. Munuera
Hazard detection and prevention of natural and man-made disasters at critical civil infrastructure is becoming increasingly important. Recent events, such as earthquakes and terrorist attacks, clearly demonstrated the societal and economical impact stemming from the limitations and uncertainty within currently deployed emergency response systems. We present a new data visualization and simulation platform that facilitates risk detection, emergency response and assessment in hazardous situations. The platform is based on the acquisition, modeling and analysis of sensor data, to capture objects and temporal changes in the observed spaces. Avatars are acquired, inserted and tracked in a virtual environment, enabling the simulation of multiple perilous situations and assisting in determining possible risk mitigation strategies. While the initial research focus is on algorithms and techniques in the field of hazard detection and prevention using path planning, the results can also be applied to diverse fields such as media contents development, cultural heritage, e-learning, teleconferencing, animation and video gaming.
{"title":"Avatar-centric risk evaluation","authors":"M. Villa-Uriol, F. Kuester, O. G. Pañella, J. Munuera","doi":"10.1109/ISM.2005.40","DOIUrl":"https://doi.org/10.1109/ISM.2005.40","url":null,"abstract":"Hazard detection and prevention of natural and man-made disasters at critical civil infrastructure is becoming increasingly important. Recent events, such as earthquakes and terrorist attacks, clearly demonstrated the societal and economical impact stemming from the limitations and uncertainty within currently deployed emergency response systems. We present a new data visualization and simulation platform that facilitates risk detection, emergency response and assessment in hazardous situations. The platform is based on the acquisition, modeling and analysis of sensor data, to capture objects and temporal changes in the observed spaces. Avatars are acquired, inserted and tracked in a virtual environment, enabling the simulation of multiple perilous situations and assisting in determining possible risk mitigation strategies. While the initial research focus is on algorithms and techniques in the field of hazard detection and prevention using path planning, the results can also be applied to diverse fields such as media contents development, cultural heritage, e-learning, teleconferencing, animation and video gaming.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"78 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":"114847711","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 describe a visualization tool for the Linux processor scheduling algorithm. The tool is developed for use by operating system learners to gain insight on the Linux scheduling algorithm. Through its graphical environment, a user selects a set of predefined processes as input to the tool. Each process selected possesses a specific characteristic geared toward effectively coercing the Linux scheduling algorithm to behave in a particular manner. By running the selected processes and gathering their runtime information, the tool is able to generate diagrams that reveal the intimate knowledge of the Linux scheduler such as dynamic priority assignment of processes, time quantum changes, scheduling sequence of the processes, classification of processes based upon projected CPU cycle requirements, and favoritism in scheduling toward I/O processes over CPU processes. In addition, the tool can be extended to serve as the basis for process performance measuring or optimization purpose.
{"title":"Animation of Linux processor scheduling algorithm","authors":"K. Leung, Du Zhang","doi":"10.1109/ISM.2005.33","DOIUrl":"https://doi.org/10.1109/ISM.2005.33","url":null,"abstract":"In this paper, we describe a visualization tool for the Linux processor scheduling algorithm. The tool is developed for use by operating system learners to gain insight on the Linux scheduling algorithm. Through its graphical environment, a user selects a set of predefined processes as input to the tool. Each process selected possesses a specific characteristic geared toward effectively coercing the Linux scheduling algorithm to behave in a particular manner. By running the selected processes and gathering their runtime information, the tool is able to generate diagrams that reveal the intimate knowledge of the Linux scheduler such as dynamic priority assignment of processes, time quantum changes, scheduling sequence of the processes, classification of processes based upon projected CPU cycle requirements, and favoritism in scheduling toward I/O processes over CPU processes. In addition, the tool can be extended to serve as the basis for process performance measuring or optimization purpose.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"152 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":"115702005","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}
C. Calafate, Juan-Carlos Cano, P. Manzoni, Manuel P. Malumbres
In this work, we propose a QoS architecture for MANETs based on a probe-based distributed admission control mechanism and the IEEE 802.11e technology. Our aim is to improve peer-to-peer communication in wireless mobile ad hoc networks by supporting real-time multimedia streaming. This technology can adapt to applications with bandwidth, delay and jitter constraints, and yet we keep to a minimum the requirements imposed on intermediate stations. Simulation results show that we successfully achieve our goal of supporting QoS-constrained applications in MANETs with a low overhead, confirming the adequateness of using probe-based admission control in these environments.
{"title":"A QoS architecture for MANETs supporting real-time peer-to-peer multimedia applications","authors":"C. Calafate, Juan-Carlos Cano, P. Manzoni, Manuel P. Malumbres","doi":"10.1109/ISM.2005.18","DOIUrl":"https://doi.org/10.1109/ISM.2005.18","url":null,"abstract":"In this work, we propose a QoS architecture for MANETs based on a probe-based distributed admission control mechanism and the IEEE 802.11e technology. Our aim is to improve peer-to-peer communication in wireless mobile ad hoc networks by supporting real-time multimedia streaming. This technology can adapt to applications with bandwidth, delay and jitter constraints, and yet we keep to a minimum the requirements imposed on intermediate stations. Simulation results show that we successfully achieve our goal of supporting QoS-constrained applications in MANETs with a low overhead, confirming the adequateness of using probe-based admission control in these environments.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"117 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":"116183732","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 qualitative mapping (QM) model for judging a property p(o) whose true value varies according to the qualitative criterion [/spl alpha/,/spl beta/], /spl tau//sub p/(x, [/spl alpha/,/spl beta/]) is presented in this paper. The inner product transformation of qualitative criterion w/spl I.bar/[/spl alpha/,/spl beta/] and the relation between w/spl I.bar/[/spl alpha/,/spl beta/] and artificial neuron is discussed. By the the intercept form of artificial neuron, we prove that an AN is just a boundary of a qualitative mapping, and if a neighborhood is closed by a group of artificial neurons induced by a group inner product transformations, then the qualitative mapping whose criterion is the closed neighborhood is equivalent to the artificial networks which consists of the group of them.
{"title":"Qualitative mapping, inner product transformation of qualitative criterion, artificial neuron and pattern recognition","authors":"Jia-li Feng, Qihuang Mao, Guanglin Xu, Jingjuan Feng","doi":"10.1109/ISM.2005.94","DOIUrl":"https://doi.org/10.1109/ISM.2005.94","url":null,"abstract":"The qualitative mapping (QM) model for judging a property p(o) whose true value varies according to the qualitative criterion [/spl alpha/,/spl beta/], /spl tau//sub p/(x, [/spl alpha/,/spl beta/]) is presented in this paper. The inner product transformation of qualitative criterion w/spl I.bar/[/spl alpha/,/spl beta/] and the relation between w/spl I.bar/[/spl alpha/,/spl beta/] and artificial neuron is discussed. By the the intercept form of artificial neuron, we prove that an AN is just a boundary of a qualitative mapping, and if a neighborhood is closed by a group of artificial neurons induced by a group inner product transformations, then the qualitative mapping whose criterion is the closed neighborhood is equivalent to the artificial networks which consists of the group of them.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"133 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":"116025710","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 incorporate a set of principles that originated in cognitive psychology into the design of 3D shape analysis and retrieval systems. Based on the "visual salience guided mesh decomposition" scheme we proposed previously, a 3D shape represented in mesh form is first broken into parts such that human visual perception of the parts can be appropriately mimicked. Next, the decomposed parts are individually analyzed and quantified according to the properties of visual salience. To establish the indices of 3D meshes for the subsequent retrieval process, spherical parameterization is adopted to map the decomposed parts onto the surface of a unit sphere. In this way, the degree of similarity between a query provided by a user and models in the database can be calculated. The experiment results show that the retrieval performance of the proposed scheme is indeed efficient and powerful.
{"title":"3D shape retrieval using cognitive psychology-based principles","authors":"Hsueh-Yi Sean Lin, Ja-Chen Lin, H. Liao","doi":"10.1109/ISM.2005.1","DOIUrl":"https://doi.org/10.1109/ISM.2005.1","url":null,"abstract":"In this paper, we incorporate a set of principles that originated in cognitive psychology into the design of 3D shape analysis and retrieval systems. Based on the \"visual salience guided mesh decomposition\" scheme we proposed previously, a 3D shape represented in mesh form is first broken into parts such that human visual perception of the parts can be appropriately mimicked. Next, the decomposed parts are individually analyzed and quantified according to the properties of visual salience. To establish the indices of 3D meshes for the subsequent retrieval process, spherical parameterization is adopted to map the decomposed parts onto the surface of a unit sphere. In this way, the degree of similarity between a query provided by a user and models in the database can be calculated. The experiment results show that the retrieval performance of the proposed scheme is indeed efficient and powerful.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"8 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":"122059744","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}
For efficient video data management, 'video data mining' is required to discover 'semantic patterns' which are not only previously unknown and interesting, but also associated with semantically relevant events ('semantic events') in movies. In order to extract semantic patterns from a movie, we firstly represent it as a multi-stream of raw level metadata that abstracts the semantic information of the movie. Then, regarding to the temporal characteristic of the semantic event of the movie, we extract sequential patterns which are obtained by connecting temporally close and strongly associated symbols in the multi-stream of raw level metadata. We also propose a parallel data mining method in order to reduce the expensive computational cost. Finally, we verify whether the extracted patterns can be considered as semantic patterns or not.
{"title":"Video data mining: mining semantic patterns with temporal constraints from movies","authors":"Kimiaki Shirahama, Koichi Ideno, K. Uehara","doi":"10.1109/ISM.2005.120","DOIUrl":"https://doi.org/10.1109/ISM.2005.120","url":null,"abstract":"For efficient video data management, 'video data mining' is required to discover 'semantic patterns' which are not only previously unknown and interesting, but also associated with semantically relevant events ('semantic events') in movies. In order to extract semantic patterns from a movie, we firstly represent it as a multi-stream of raw level metadata that abstracts the semantic information of the movie. Then, regarding to the temporal characteristic of the semantic event of the movie, we extract sequential patterns which are obtained by connecting temporally close and strongly associated symbols in the multi-stream of raw level metadata. We also propose a parallel data mining method in order to reduce the expensive computational cost. Finally, we verify whether the extracted patterns can be considered as semantic patterns or not.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"87 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":"127577382","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}
R. Guido, L. S. Vieira, F. L. Sanchez, J. Slaets, Lyrio Onofre Almeida, A. Gonzaga, Marcelo Bianchi
This paper describes a novel technique for audio coding, a lossy compression algorithm, that considers perceptual and rate-distortion criteria. It is based on matched finite impulse response (FIR) wavelet-packet-like filter banks, the filter coefficients being produced adoptively according to the input signal. This technique achieves perceptually transparent coding of high-quality audio, signals sampled at 44.1 KHz - 16 bits PCM, at bit rates of about 54 - 64 Kbps. The matched filter-bank makes a time-frequency-shape analysis, reducing the number of sub-bands requiring quantization. The decoder that implements this algorithm works effectively in real time. This reassures the efficacy of our technique.
{"title":"A matched FIR filter bank for audio coding","authors":"R. Guido, L. S. Vieira, F. L. Sanchez, J. Slaets, Lyrio Onofre Almeida, A. Gonzaga, Marcelo Bianchi","doi":"10.1109/ISM.2005.13","DOIUrl":"https://doi.org/10.1109/ISM.2005.13","url":null,"abstract":"This paper describes a novel technique for audio coding, a lossy compression algorithm, that considers perceptual and rate-distortion criteria. It is based on matched finite impulse response (FIR) wavelet-packet-like filter banks, the filter coefficients being produced adoptively according to the input signal. This technique achieves perceptually transparent coding of high-quality audio, signals sampled at 44.1 KHz - 16 bits PCM, at bit rates of about 54 - 64 Kbps. The matched filter-bank makes a time-frequency-shape analysis, reducing the number of sub-bands requiring quantization. The decoder that implements this algorithm works effectively in real time. This reassures the efficacy of our technique.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"6 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120841320","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}
Suzana M. de Borba Maranhao, M. A. C. Gois, Erika Pessoa Araujo, G. Cabral
Computers have been used to assist users to learn music concepts and acquire musical skills as soon as they were introduced in people's life. However, even within a specific class of application, such as the instrument performance systems (IPS), that tries to teach intuitively how to play a musical instrument, there is no attempt to provide reusable components. This paper proposes an original framework architecture whose purpose is to support the development of percussive IPS. The framework was validated by an instantiation on the alfaia, a sort of tambour used in Brazilian folklore.
{"title":"A framework to percussive educational systems","authors":"Suzana M. de Borba Maranhao, M. A. C. Gois, Erika Pessoa Araujo, G. Cabral","doi":"10.1109/ISM.2005.7","DOIUrl":"https://doi.org/10.1109/ISM.2005.7","url":null,"abstract":"Computers have been used to assist users to learn music concepts and acquire musical skills as soon as they were introduced in people's life. However, even within a specific class of application, such as the instrument performance systems (IPS), that tries to teach intuitively how to play a musical instrument, there is no attempt to provide reusable components. This paper proposes an original framework architecture whose purpose is to support the development of percussive IPS. The framework was validated by an instantiation on the alfaia, a sort of tambour used in Brazilian folklore.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"26 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":"121034770","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 increasing popularity of multiway multimedia collaboration sessions over wired networks is now spreading into the wireless domain. Due to this, the inherent need to record some sessions and make them available for later replay poses some new interesting challenges. This paper presents an analysis of the recording requirements and issues arising when participants "based" on a wireless network are also present in a session. An architecture for supporting reliable recording of Voice-over-IP sessions is described; an inherent part is an agent on the sender host that assists in the recording process. Reliability is facilitated through a flexible and adaptive data repair protocol. Once a recording is complete, it can be used to analyse the session and assist in locating any network and reception problems that may have degraded the quality of the conversation. Moreover, playing back the recorded session potentially provide better quality than what the participants observed if there was packet loss during the conversation.
{"title":"Reliable recording and analysis of multimedia collaboration sessions over wireless networks","authors":"L. Lambrinos","doi":"10.1109/ISM.2005.96","DOIUrl":"https://doi.org/10.1109/ISM.2005.96","url":null,"abstract":"The increasing popularity of multiway multimedia collaboration sessions over wired networks is now spreading into the wireless domain. Due to this, the inherent need to record some sessions and make them available for later replay poses some new interesting challenges. This paper presents an analysis of the recording requirements and issues arising when participants \"based\" on a wireless network are also present in a session. An architecture for supporting reliable recording of Voice-over-IP sessions is described; an inherent part is an agent on the sender host that assists in the recording process. Reliability is facilitated through a flexible and adaptive data repair protocol. Once a recording is complete, it can be used to analyse the session and assist in locating any network and reception problems that may have degraded the quality of the conversation. Moreover, playing back the recorded session potentially provide better quality than what the participants observed if there was packet loss during the conversation.","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":"126461040","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
扫码关注我们
求助内容：
应助结果提醒方式：