This paper presents a novel mobility modeling approach for a two-tier integrated wireless system that accommodates the system complexity represented by the residence-time correlation between different access networks. Additionally, a novel session model is presented as an adapted version of the proposed mobility model. Furthermore, we develop an analytical framework using this session model to obtain several salient performance metrics such as network utilization times and handoff rates. Simulation results demonstrate that the proposed mobility model is substantially more accurate than existing modeling techniques, and that the proposed analytical framework provide tractable performance evaluation based on the new mobility model.
{"title":"Mobility modeling for two-tier integrated wireless multimedia networks","authors":"A. Zahran, B. Liang","doi":"10.1109/ISM.2005.81","DOIUrl":"https://doi.org/10.1109/ISM.2005.81","url":null,"abstract":"This paper presents a novel mobility modeling approach for a two-tier integrated wireless system that accommodates the system complexity represented by the residence-time correlation between different access networks. Additionally, a novel session model is presented as an adapted version of the proposed mobility model. Furthermore, we develop an analytical framework using this session model to obtain several salient performance metrics such as network utilization times and handoff rates. Simulation results demonstrate that the proposed mobility model is substantially more accurate than existing modeling techniques, and that the proposed analytical framework provide tractable performance evaluation based on the new mobility model.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"45 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":"133293606","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}
Ioan Marius Bilasco, J. Gensel, M. Villanova-Oliver, H. Martin
The progress and the continuous evolution of computer capacities, as well as the emergence of the X3D standard have recently boosted the 3D domain. Associating some semantics with 3D contents becomes a major issue specially for reusing such contents or pieces of content after having extracted them from existing 3D scenes. In this paper, we address this issue by proposing a generic semantic annotation model for 3D, called 3DSEAM (3D semantics annotation model). 3DSEAM aims at indexing 3D contents considering visual, geometric and semantic aspects. 3DSEAM is instantiated using MPEG 7 that we have extended with 3D specific locators. These locators link some visual, geometric and semantic features to the corresponding X3D fragments. These features can then be used for indexing and querying.
{"title":"3DSEAM: a model for annotating 3D scenes using MPEG-7","authors":"Ioan Marius Bilasco, J. Gensel, M. Villanova-Oliver, H. Martin","doi":"10.1109/ISM.2005.2","DOIUrl":"https://doi.org/10.1109/ISM.2005.2","url":null,"abstract":"The progress and the continuous evolution of computer capacities, as well as the emergence of the X3D standard have recently boosted the 3D domain. Associating some semantics with 3D contents becomes a major issue specially for reusing such contents or pieces of content after having extracted them from existing 3D scenes. In this paper, we address this issue by proposing a generic semantic annotation model for 3D, called 3DSEAM (3D semantics annotation model). 3DSEAM aims at indexing 3D contents considering visual, geometric and semantic aspects. 3DSEAM is instantiated using MPEG 7 that we have extended with 3D specific locators. These locators link some visual, geometric and semantic features to the corresponding X3D fragments. These features can then be used for indexing and querying.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"28 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":"133642606","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}
Functional harmonic analysis is an important task in music composition, accompaniment, arrangement and others. However, the solutions are still not satisfactory. The proposed process is divided into two levels: the former extends one of previous works in the domain to carry out a richer analysis of chord grids and is where the very analysis is performed, and the latter is devoted to correct some conceptual inconsistencies concerning enharmonic spelling of chords. Both levels use an engine to make inferences on some rule bases, which can be easily improved by addition of new rules.
{"title":"Automating functional harmonic analysis: the Funchal system","authors":"Ricardo E. P. Scholz, Vítor Dantas, Geber Ramalho","doi":"10.1109/ISM.2005.39","DOIUrl":"https://doi.org/10.1109/ISM.2005.39","url":null,"abstract":"Functional harmonic analysis is an important task in music composition, accompaniment, arrangement and others. However, the solutions are still not satisfactory. The proposed process is divided into two levels: the former extends one of previous works in the domain to carry out a richer analysis of chord grids and is where the very analysis is performed, and the latter is devoted to correct some conceptual inconsistencies concerning enharmonic spelling of chords. Both levels use an engine to make inferences on some rule bases, which can be easily improved by addition of new rules.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"19 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":"128865390","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}
Spontaneous communications for either personal or shared activities are becoming very common in wireless pervasive computing environments. However, there still remain challenging problems in this type of communications, especially their security over ad-hoc wireless channels. In this paper we present an approach to using a visual code system in order to establish secure spontaneous communications among wireless devices in pervasive computing environments. After briefly discussing the visual code system, we describe two distinct models of spontaneous communications, and then discuss how the visual code system can be leveraged in order to secure spontaneous communications in those models. We also demonstrate our approach through a proof-of-concept implementation.
{"title":"Securing spontaneous communications in wireless pervasive computing environments","authors":"Dongwan Shin","doi":"10.1109/ISM.2005.100","DOIUrl":"https://doi.org/10.1109/ISM.2005.100","url":null,"abstract":"Spontaneous communications for either personal or shared activities are becoming very common in wireless pervasive computing environments. However, there still remain challenging problems in this type of communications, especially their security over ad-hoc wireless channels. In this paper we present an approach to using a visual code system in order to establish secure spontaneous communications among wireless devices in pervasive computing environments. After briefly discussing the visual code system, we describe two distinct models of spontaneous communications, and then discuss how the visual code system can be leveraged in order to secure spontaneous communications in those models. We also demonstrate our approach through a proof-of-concept implementation.","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":"131316671","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 propose a rate-efficient peer-to-peer architecture for video multicasting over the Internet. The limited capacity of the Internet hosts and the heterogeneous property of their access links are the main challenges of the peer-to-peer video multicasting over the Internet. Although, the rate-optimized overlay tree construction is a NP-hard problem, we propose a number of distributed and efficient protocols for rate-efficient overlay tree construction. Our proposed protocols include efficient join, improvement, overlay tree refinement and an optimum rate allocation protocol. The simulation results show the efficiency of the proposed protocols in rate-efficient overlay tree construction. We show that through combination of the efficient join protocol, tree refinement operations and an optimum rate allocation algorithm we can achieve a suboptimum overlay tree.
{"title":"A rate-efficient peer-to-peer architecture for video multicasting over the Internet","authors":"B. Akbari, H. Rabiee, M. Ghanbari","doi":"10.1109/ISM.2005.20","DOIUrl":"https://doi.org/10.1109/ISM.2005.20","url":null,"abstract":"In this paper we propose a rate-efficient peer-to-peer architecture for video multicasting over the Internet. The limited capacity of the Internet hosts and the heterogeneous property of their access links are the main challenges of the peer-to-peer video multicasting over the Internet. Although, the rate-optimized overlay tree construction is a NP-hard problem, we propose a number of distributed and efficient protocols for rate-efficient overlay tree construction. Our proposed protocols include efficient join, improvement, overlay tree refinement and an optimum rate allocation protocol. The simulation results show the efficiency of the proposed protocols in rate-efficient overlay tree construction. We show that through combination of the efficient join protocol, tree refinement operations and an optimum rate allocation algorithm we can achieve a suboptimum overlay tree.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"12 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":"115456523","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 development of complex object behaviour in domains of interactive graphical applications such as desktop-virtual reality (desktop-VR) or multimedia is still a problem today. We attribute this situation to the lack of sophisticated concepts and tools for pre-implementation behaviour specification and provide the tool-supported visual modeling language SSIML/Behaviour to address this problem. As an extension of the Unified Modeling Language (UML) our language allows the platform-independent behaviour description and can be easily integrated into UML tools. Moreover, it is possible to map SSIML/Behaviour models to platform-specific program code automatically.
{"title":"SSIML/Behaviour: designing behaviour and animation of graphical objects in virtual reality and multimedia applications","authors":"Arnd Vitzthum","doi":"10.1109/ISM.2005.109","DOIUrl":"https://doi.org/10.1109/ISM.2005.109","url":null,"abstract":"The development of complex object behaviour in domains of interactive graphical applications such as desktop-virtual reality (desktop-VR) or multimedia is still a problem today. We attribute this situation to the lack of sophisticated concepts and tools for pre-implementation behaviour specification and provide the tool-supported visual modeling language SSIML/Behaviour to address this problem. As an extension of the Unified Modeling Language (UML) our language allows the platform-independent behaviour description and can be easily integrated into UML tools. Moreover, it is possible to map SSIML/Behaviour models to platform-specific program code automatically.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"295 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":"124280299","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}
Meng-Ting Lu, Chang-Kuan Lin, Jason J. Yao, Homer H. Chen
For a live streaming server, it is highly desirable to allocate the available computational resource and bandwidth to each channel fairly and efficiently. In this paper, we propose a complexity-aware live streaming system with bit rate adjustment that can handle the allocation of bandwidth and computational resource of a live streaming server. The proposed system encodes the input videos at different quality levels based on the priority of the input videos and the available computational resource. It incorporates a bit rate adjustment mechanism to compensate for the video quality drop resulted from the quality level change of high priority encoders. The resulting system is able to handle channels more efficiently because the complexity of high priority encoders can also be dynamically adjusted with little quality drop. A new complexity adjustment method is developed that enables the system to stabilize more quickly and minimizes the variance of the time buffer. The experimental results show that the system can handle more channels while still maintaining the quality of high priority encoders. The proposed system is applicable to multimedia home gateways, surveillance, IP-based TV, and on-line sports game relays.
{"title":"A complexity-aware live streaming system with bit rate adjustment","authors":"Meng-Ting Lu, Chang-Kuan Lin, Jason J. Yao, Homer H. Chen","doi":"10.1109/ISM.2005.4","DOIUrl":"https://doi.org/10.1109/ISM.2005.4","url":null,"abstract":"For a live streaming server, it is highly desirable to allocate the available computational resource and bandwidth to each channel fairly and efficiently. In this paper, we propose a complexity-aware live streaming system with bit rate adjustment that can handle the allocation of bandwidth and computational resource of a live streaming server. The proposed system encodes the input videos at different quality levels based on the priority of the input videos and the available computational resource. It incorporates a bit rate adjustment mechanism to compensate for the video quality drop resulted from the quality level change of high priority encoders. The resulting system is able to handle channels more efficiently because the complexity of high priority encoders can also be dynamically adjusted with little quality drop. A new complexity adjustment method is developed that enables the system to stabilize more quickly and minimizes the variance of the time buffer. The experimental results show that the system can handle more channels while still maintaining the quality of high priority encoders. The proposed system is applicable to multimedia home gateways, surveillance, IP-based TV, and on-line sports game relays.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"20 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":"128209969","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 method of adaptive holistic 3D visualization of arbitrarily large datasets. The method, called AVE, permits to visualize entire datasets by the use of the most appropriate interface selected automatically from a number of available interfaces. The choice of an interface is based on the dataset properties. Different types of interfaces enable presenting the dataset categorized according to multiple criteria. The method is most suitable for abstract multidimensional datasets. Examples provided in this paper relate to visualization of data generated by indexing search engines.
{"title":"A method of holistic 3D visualization of arbitrarily large datasets","authors":"W. Wiza, W. Cellary, K. Walczak","doi":"10.1109/ISM.2005.14","DOIUrl":"https://doi.org/10.1109/ISM.2005.14","url":null,"abstract":"In this paper, we describe a method of adaptive holistic 3D visualization of arbitrarily large datasets. The method, called AVE, permits to visualize entire datasets by the use of the most appropriate interface selected automatically from a number of available interfaces. The choice of an interface is based on the dataset properties. Different types of interfaces enable presenting the dataset categorized according to multiple criteria. The method is most suitable for abstract multidimensional datasets. Examples provided in this paper relate to visualization of data generated by indexing search engines.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"102 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":"128650227","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 paper presents a global-time based approach for realizing high-quality real-time video streaming over networks. The application goal is to play the video streams at a remote site with minimal distortion of the temporal relationship among the video data units. The time-triggered message-triggered object (TMO) programming tool-kit, which enables construction of distributed real-time computing programs in the form of networks of high-level, easily analyzable, real-time objects, facilitates efficient practice of this approach. The experimental results of a feasibility evaluation of this global time based approach for real-time video streaming are also presented.
{"title":"A global-time-based approach for high-quality real-time video streaming services","authors":"K. Kim, Sheng Liu, Moon-hae Kim, Doohyun Kim","doi":"10.1109/ISM.2005.8","DOIUrl":"https://doi.org/10.1109/ISM.2005.8","url":null,"abstract":"This paper presents a global-time based approach for realizing high-quality real-time video streaming over networks. The application goal is to play the video streams at a remote site with minimal distortion of the temporal relationship among the video data units. The time-triggered message-triggered object (TMO) programming tool-kit, which enables construction of distributed real-time computing programs in the form of networks of high-level, easily analyzable, real-time objects, facilitates efficient practice of this approach. The experimental results of a feasibility evaluation of this global time based approach for real-time video streaming are also presented.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"65 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":"125677629","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}
Our research extends the general technologies detecting pornographic images to prevent the benign images whose content is approximate with the pornographic ones from being screened. This paper presents a multiple-step method to distinguish the benign bikini photos from pornographic photos. The proposed approach utilizes the information about the body shape and face to determine the feature region where the specific patterns of the skin distribution of bikini model's body are represented, and uses a neural network to learn these, patterns to recognize the bikini photos. The experimental results show that more than 80% normal bikini photos are recognized from the pornographic images by the method, and at the same time few pornographic images are mistaken as bikini photos. The results indicate it is possible to distinguish the bikini photos from pornographic ones.
{"title":"Research on the discrimination of pornographic and bikini images","authors":"Yushi Wang, Weiqiang Wang, Wen Gao","doi":"10.1109/ISM.2005.97","DOIUrl":"https://doi.org/10.1109/ISM.2005.97","url":null,"abstract":"Our research extends the general technologies detecting pornographic images to prevent the benign images whose content is approximate with the pornographic ones from being screened. This paper presents a multiple-step method to distinguish the benign bikini photos from pornographic photos. The proposed approach utilizes the information about the body shape and face to determine the feature region where the specific patterns of the skin distribution of bikini model's body are represented, and uses a neural network to learn these, patterns to recognize the bikini photos. The experimental results show that more than 80% normal bikini photos are recognized from the pornographic images by the method, and at the same time few pornographic images are mistaken as bikini photos. The results indicate it is possible to distinguish the bikini photos from pornographic ones.","PeriodicalId":322363,"journal":{"name":"Seventh IEEE International Symposium on Multimedia (ISM'05)","volume":"49 3 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":"132993700","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
扫码关注我们
求助内容：
应助结果提醒方式：