Pub Date : 2007-12-10DOI: 10.1109/ISM.2007.4412352
M. Muhlhauser
In the emerging Post-PC era, more and more computers 'in the net' can see, hear, or feel. Since these computers are networked, they can cooperate in the interpretation of their 'sensation'. Cameras, camcorders, etc. will soon be wirelessly connected, doubling as mobile phones. In other words: multimedia goes ubiquitous. On the other hand, users leverage off the wealth of text-based information present in the global Internet. However, the potential that lies in the 'cooperative sensation' and in the use of global textual information is by far not leveraged: it is the past, present, and future grand challenge to enable computers to 'make more sense' of all this information. The talk will provide a unified model for both multimedia sense-making and textual-information sense-making, and propose fostering the confluence of these two threads. Based on this unified view, it will suggest steps towards improved sense-making in the world of ubiquitous computers.
{"title":"Making Sense of Ubiquitous Media style","authors":"M. Muhlhauser","doi":"10.1109/ISM.2007.4412352","DOIUrl":"https://doi.org/10.1109/ISM.2007.4412352","url":null,"abstract":"In the emerging Post-PC era, more and more computers 'in the net' can see, hear, or feel. Since these computers are networked, they can cooperate in the interpretation of their 'sensation'. Cameras, camcorders, etc. will soon be wirelessly connected, doubling as mobile phones. In other words: multimedia goes ubiquitous. On the other hand, users leverage off the wealth of text-based information present in the global Internet. However, the potential that lies in the 'cooperative sensation' and in the use of global textual information is by far not leveraged: it is the past, present, and future grand challenge to enable computers to 'make more sense' of all this information. The talk will provide a unified model for both multimedia sense-making and textual-information sense-making, and propose fostering the confluence of these two threads. Based on this unified view, it will suggest steps towards improved sense-making in the world of ubiquitous computers.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129674023","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 IPTV, Internet Protocol TV, is one of the hottest topics as an emerging service. This new media service has a significant potential where a various kind of content can be enjoyed in a variety of way. We are living in the content-centric world. This flood of data thanks to the evolution of the hardware since 60 year- old transistor technology becomes the potential problem these days. The user experience of this new media is thought as a key factor to success an IPTV service. Since a very early stage in ITU-T Focus Group on IPTV, QoE, Quality of Experience, is considered as a most important factor. This subjective concept should be measurable in a same manner as the QoS. The metadata function for the personalized service in IPTV will be described also.
{"title":"The Role of QoE on IPTV Services style","authors":"J. Kishigami","doi":"10.1109/ISM.2007.46","DOIUrl":"https://doi.org/10.1109/ISM.2007.46","url":null,"abstract":"The IPTV, Internet Protocol TV, is one of the hottest topics as an emerging service. This new media service has a significant potential where a various kind of content can be enjoyed in a variety of way. We are living in the content-centric world. This flood of data thanks to the evolution of the hardware since 60 year- old transistor technology becomes the potential problem these days. The user experience of this new media is thought as a key factor to success an IPTV service. Since a very early stage in ITU-T Focus Group on IPTV, QoE, Quality of Experience, is considered as a most important factor. This subjective concept should be measurable in a same manner as the QoS. The metadata function for the personalized service in IPTV will be described also.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121062913","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}
Block truncation coding is an efficient compression technique while offering good image quality. Nonetheless, the blocking effect inherent in BTC causes severe perceptual artifact in high compression ratio applications. In this paper, an error-diffused block truncation coding (EDBTC) is proposed to solve this problem. According to the EDBTC, the error caused by the difference between the original grayscale pixel value and the correspondingly high or low mean substitute is diffused to the predefined neighborhood, and hence the average grayscale will be maintained invariably. In addition, since the compressed data are widely distributed in the internet transmission, the extra message delivering in a secret way also highly raises attention recently. In this paper, we propose the compressed steganography using Hidden Referenced Halftoning (CSHRH), which cooperates with error diffusion and ordered dithering to achieve the objective of secret communication in BTC images. As documented in the experimental results, a low complexity with good image quality approach is obtained. Moreover, CSHRH is extended to secret-sharing steganography (SSS) and color extension steganography (CES). The SSS is able to distribute message into multiple host images and hence improves the security. The CES is able to deliver secure message via color embedded CSHRH image. Both extensions are also with an extra benefit of achieving high capacity message convection.
{"title":"Quality Compressed Steganography Using Hidden Referenced Halftoning","authors":"Jing-Ming Guo, Jen-Ho Chen","doi":"10.1109/ISM.2007.50","DOIUrl":"https://doi.org/10.1109/ISM.2007.50","url":null,"abstract":"Block truncation coding is an efficient compression technique while offering good image quality. Nonetheless, the blocking effect inherent in BTC causes severe perceptual artifact in high compression ratio applications. In this paper, an error-diffused block truncation coding (EDBTC) is proposed to solve this problem. According to the EDBTC, the error caused by the difference between the original grayscale pixel value and the correspondingly high or low mean substitute is diffused to the predefined neighborhood, and hence the average grayscale will be maintained invariably. In addition, since the compressed data are widely distributed in the internet transmission, the extra message delivering in a secret way also highly raises attention recently. In this paper, we propose the compressed steganography using Hidden Referenced Halftoning (CSHRH), which cooperates with error diffusion and ordered dithering to achieve the objective of secret communication in BTC images. As documented in the experimental results, a low complexity with good image quality approach is obtained. Moreover, CSHRH is extended to secret-sharing steganography (SSS) and color extension steganography (CES). The SSS is able to distribute message into multiple host images and hence improves the security. The CES is able to deliver secure message via color embedded CSHRH image. Both extensions are also with an extra benefit of achieving high capacity message convection.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116872895","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}
Traditionally, a consumer decided how much to trust a piece of data based on its source. As digital video cameras and editors become ubiquitous, an arbitrary video object is increasingly likely to be produced using a range of operations that combine clips from a multitude of sources. A consumer can determine the assurance level of the data by knowing its lineage. We describe a system to embed the provenance of the video into the data itself. As long as the video contains a predefined threshold of data (from the spatial and temporal domains), the entire lineage can be ascertained. We embed the metadata using subpixel linear interpolation between similar blocks in proximal frames. It can then be extracted in real time using a novel method for computing the embedded interpolation. We implemented the process in C and report the performance overhead it introduces for playing video files. We also characterize the tradeoff between the auxiliary channel's capacity (which limits the amount of provenance metadata that can be embedded) and the extent to which the video can be edited (in the spatial or temporal domains) while retaining complete lineage.
{"title":"VEIL: A System for Certifying Video Provenance","authors":"Ashish Gehani, U. Lindqvist","doi":"10.1109/ISM.2007.10","DOIUrl":"https://doi.org/10.1109/ISM.2007.10","url":null,"abstract":"Traditionally, a consumer decided how much to trust a piece of data based on its source. As digital video cameras and editors become ubiquitous, an arbitrary video object is increasingly likely to be produced using a range of operations that combine clips from a multitude of sources. A consumer can determine the assurance level of the data by knowing its lineage. We describe a system to embed the provenance of the video into the data itself. As long as the video contains a predefined threshold of data (from the spatial and temporal domains), the entire lineage can be ascertained. We embed the metadata using subpixel linear interpolation between similar blocks in proximal frames. It can then be extracted in real time using a novel method for computing the embedded interpolation. We implemented the process in C and report the performance overhead it introduces for playing video files. We also characterize the tradeoff between the auxiliary channel's capacity (which limits the amount of provenance metadata that can be embedded) and the extent to which the video can be edited (in the spatial or temporal domains) while retaining complete lineage.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121663541","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}
Due to the heterogeneity of the environment, in which hosts may have different bandwidth capacities and network distances between hosts vary, current mesh-based multicast protocols for video streaming over the Internet tend to in efficiently utilise the available bandwidth and often transfer large amounts of data between distant hosts. This limits system throughput, which results in reduced video quality, and imposes significant costs on Internet service providers (ISPs) caused by network traffic outside a provider's own network. This paper presents MeshTV, a mesh-based peer-to-peer (P2P) multicast protocol for streaming live video from a transmitter to numerous viewers. MeshTV proposes an algorithm for adapting the mesh overlay in which nodes explore their possible neighbour nodes and select neighbours so that data throughput is optimised and data is transmitted between nearby (low-latency) nodes, typically within the same ISP thus reducing the costs to ISPs. Our evaluation demonstrates that the adaptation algorithm used in MeshTV can improve video streaming throughput by over 100 % and typically reduces the distances (network latencies) between interacting nodes by 50 % compared to unoptimised mesh overlays.
{"title":"Improving Throughput and Node Proximity of P2P Live Video Streaming through Overlay Adaptation","authors":"B. Biskupski, R. Cunningham, R. Meier","doi":"10.1109/ISM.2007.36","DOIUrl":"https://doi.org/10.1109/ISM.2007.36","url":null,"abstract":"Due to the heterogeneity of the environment, in which hosts may have different bandwidth capacities and network distances between hosts vary, current mesh-based multicast protocols for video streaming over the Internet tend to in efficiently utilise the available bandwidth and often transfer large amounts of data between distant hosts. This limits system throughput, which results in reduced video quality, and imposes significant costs on Internet service providers (ISPs) caused by network traffic outside a provider's own network. This paper presents MeshTV, a mesh-based peer-to-peer (P2P) multicast protocol for streaming live video from a transmitter to numerous viewers. MeshTV proposes an algorithm for adapting the mesh overlay in which nodes explore their possible neighbour nodes and select neighbours so that data throughput is optimised and data is transmitted between nearby (low-latency) nodes, typically within the same ISP thus reducing the costs to ISPs. Our evaluation demonstrates that the adaptation algorithm used in MeshTV can improve video streaming throughput by over 100 % and typically reduces the distances (network latencies) between interacting nodes by 50 % compared to unoptimised mesh overlays.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131321846","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}
Continuously increasing demand for richer functionality, faster real-time communication, smaller feature size, longer battery life, more elevated security, and higher reliability is pushing the design for portable multimedia applications into the era where a single system is consisted of a general-purpose CPU interacting with several application-specific accelerating components and coprocessors to fulfill the ever diverse constraints imposed multi- directionally. The inter-component communication overhead, along with the engineering efforts required to integrate, verify, and validate such heterogeneous systems are scaled disproportionally as the complexity of such systems continue rising skyrocketedly. Moreover, due to limited instruction encoding space and the need to maintain backward compatibly in the future designs, designers are often forced to include only a very small subset of the total desired functionalities on chip, despite there can be more than sufficient silicon real estate to incorporate these specialized function units. This paper proposes a cost-effective technique of incorporating diverse functionalities into a single multi-purpose, streamlining acceleration unit, named Versatile Processing Unit (VPU), to replace the conventional ALU on a CPU. The proposed VPU can supply the general-purpose CPU with a rich set of streamlined operations, which may supersede some or even all of the heterogeneous cores. The superseded hardware components are removed to reduce the integration and communication overhead. The issues of limited instruction encoding space and future backward compatibility are resolved by our proposed dynamic instruction re-mapping technique, in which the instruction bit fields can be redefined on the fly to allow instruction space reuse at run time.
{"title":"Accelerating Embedded Multimedia Applications with Versatile and Reconfigurable Instruction Fusion","authors":"A. Cheng","doi":"10.1109/ISM.2007.23","DOIUrl":"https://doi.org/10.1109/ISM.2007.23","url":null,"abstract":"Continuously increasing demand for richer functionality, faster real-time communication, smaller feature size, longer battery life, more elevated security, and higher reliability is pushing the design for portable multimedia applications into the era where a single system is consisted of a general-purpose CPU interacting with several application-specific accelerating components and coprocessors to fulfill the ever diverse constraints imposed multi- directionally. The inter-component communication overhead, along with the engineering efforts required to integrate, verify, and validate such heterogeneous systems are scaled disproportionally as the complexity of such systems continue rising skyrocketedly. Moreover, due to limited instruction encoding space and the need to maintain backward compatibly in the future designs, designers are often forced to include only a very small subset of the total desired functionalities on chip, despite there can be more than sufficient silicon real estate to incorporate these specialized function units. This paper proposes a cost-effective technique of incorporating diverse functionalities into a single multi-purpose, streamlining acceleration unit, named Versatile Processing Unit (VPU), to replace the conventional ALU on a CPU. The proposed VPU can supply the general-purpose CPU with a rich set of streamlined operations, which may supersede some or even all of the heterogeneous cores. The superseded hardware components are removed to reduce the integration and communication overhead. The issues of limited instruction encoding space and future backward compatibility are resolved by our proposed dynamic instruction re-mapping technique, in which the instruction bit fields can be redefined on the fly to allow instruction space reuse at run time.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123994453","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, a novel method is presented to detect video copies for a given video query. These copies and the query have identical or near-duplicate content, which might differ in their spatiotemporal structures slightly. To address both the efficient and effective issues, we conduct the bag-of words model for video feature representation, and apply a coarse-to-fine matching scheme to analyze the video spatiotemporal structure. The proposed method can deal with various kinds of video transformations, such as cropping, zooming, speed change, and subsequence insertion/deletion, which are not well addressed in existing methods. Besides, two indexing methods are employed to speed up the matching process. Experimental results show that the proposed method can behave in an efficient and effective manner.
{"title":"Efficient and Effective Video Copy Detection Based on Spatiotemporal Analysis","authors":"Chih-Yi Chiu, Cheng-Chih Yang, Chu-Song Chen","doi":"10.1109/ISM.2007.38","DOIUrl":"https://doi.org/10.1109/ISM.2007.38","url":null,"abstract":"In this paper, a novel method is presented to detect video copies for a given video query. These copies and the query have identical or near-duplicate content, which might differ in their spatiotemporal structures slightly. To address both the efficient and effective issues, we conduct the bag-of words model for video feature representation, and apply a coarse-to-fine matching scheme to analyze the video spatiotemporal structure. The proposed method can deal with various kinds of video transformations, such as cropping, zooming, speed change, and subsequence insertion/deletion, which are not well addressed in existing methods. Besides, two indexing methods are employed to speed up the matching process. Experimental results show that the proposed method can behave in an efficient and effective manner.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116261495","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 performance of an AURORA-like distributed speech recognition system over IEEE 802.11 WLANs is studied. The recognition features are packetized and sent over an 802.11b network. At the receiver recognition is performed. Two different scenarios are simulated to analyze DSR performance in presence of losses due to either low received power or to network congestion. Varying recognizer complexities, packet lengths, number of concurrent flows, and signal power levels are considered in both scenarios. Experimental results on a connected digits task show that for low signal power levels, the best recognition performance is obtained when speech features are sent in small IP packets, while in the case of network congestion the best performance is obtained by increasing the packet size.
{"title":"Performance Analysis of Distributed Speech Recognition Services over Noisy 802.11b Wireless Networks","authors":"A. Rinotti, P. Demichelis, Juan Carlos De Martin","doi":"10.1109/ISM.2007.24","DOIUrl":"https://doi.org/10.1109/ISM.2007.24","url":null,"abstract":"The performance of an AURORA-like distributed speech recognition system over IEEE 802.11 WLANs is studied. The recognition features are packetized and sent over an 802.11b network. At the receiver recognition is performed. Two different scenarios are simulated to analyze DSR performance in presence of losses due to either low received power or to network congestion. Varying recognizer complexities, packet lengths, number of concurrent flows, and signal power levels are considered in both scenarios. Experimental results on a connected digits task show that for low signal power levels, the best recognition performance is obtained when speech features are sent in small IP packets, while in the case of network congestion the best performance is obtained by increasing the packet size.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121707419","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}
Prosody has been widely used in many speech-related applications including speaker and word recognition, emotion and accent identification, topic and sentence segmentation, and text-to-speech applications. An important application we investigate is that of identifying question sentences in Arabic monologue lectures. Languages other than Arabic have received a lot of attention in this regard. We approach this problem by first segmenting the sentences from the continuous speech using intensity and duration features. Prosodic features are, then, extracted from each sentence. These features are used as input to decision trees to classify each sentence into either question or non question sentence. Our results suggest that questions are cued by more than one type of prosodic features in natural Arabic speech. We used C4.5 decision trees for classification and achieved 75.7% accuracy. Feature specific analysis further reveals that energy and fundamental frequency features are mainly responsible for discriminating between questions and non-question sentences.
{"title":"Detection of Questions in Arabic Audio Monologues Using Prosodic Features","authors":"O. Khan, W. Al-Khatib, L. Cheded","doi":"10.1109/ISM.2007.37","DOIUrl":"https://doi.org/10.1109/ISM.2007.37","url":null,"abstract":"Prosody has been widely used in many speech-related applications including speaker and word recognition, emotion and accent identification, topic and sentence segmentation, and text-to-speech applications. An important application we investigate is that of identifying question sentences in Arabic monologue lectures. Languages other than Arabic have received a lot of attention in this regard. We approach this problem by first segmenting the sentences from the continuous speech using intensity and duration features. Prosodic features are, then, extracted from each sentence. These features are used as input to decision trees to classify each sentence into either question or non question sentence. Our results suggest that questions are cued by more than one type of prosodic features in natural Arabic speech. We used C4.5 decision trees for classification and achieved 75.7% accuracy. Feature specific analysis further reveals that energy and fundamental frequency features are mainly responsible for discriminating between questions and non-question sentences.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129024898","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}
D. Jurca, W. Kellerer, E. Steinbach, Shoaib Khan, Srisakul Thakolsri, P. Frossard
We address the problem of video streaming over multiple parallel networks. In the context of multiple users, accessing different types of applications, we are looking for efficient ways of allocating network resources and selecting network paths for each application, in order to maximize the overall systems performance. Our optimization joint problem consists of finding the appropriate application rate allocation and network parameters for each individual user, such that a universal system quality metric is maximized. A specific mapping between the requirements of each considered application and the overall quality metric is introduced, and our results are compared to other solutions based on throughput optimization strategies. The superiority and robustness of our approach is shown through extensive simulations in constant and dynamic systems, when clients can join/leave the access networks. Furthermore, we introduce heuristic algorithms which can obtain good results and are inexpensive in terms of computation and execution time.
{"title":"Joint Network and Rate Allocation for Video Streaming over Multiple Wireless Networks","authors":"D. Jurca, W. Kellerer, E. Steinbach, Shoaib Khan, Srisakul Thakolsri, P. Frossard","doi":"10.1109/ISM.2007.31","DOIUrl":"https://doi.org/10.1109/ISM.2007.31","url":null,"abstract":"We address the problem of video streaming over multiple parallel networks. In the context of multiple users, accessing different types of applications, we are looking for efficient ways of allocating network resources and selecting network paths for each application, in order to maximize the overall systems performance. Our optimization joint problem consists of finding the appropriate application rate allocation and network parameters for each individual user, such that a universal system quality metric is maximized. A specific mapping between the requirements of each considered application and the overall quality metric is introduced, and our results are compared to other solutions based on throughput optimization strategies. The superiority and robustness of our approach is shown through extensive simulations in constant and dynamic systems, when clients can join/leave the access networks. Furthermore, we introduce heuristic algorithms which can obtain good results and are inexpensive in terms of computation and execution time.","PeriodicalId":129680,"journal":{"name":"Ninth IEEE International Symposium on Multimedia (ISM 2007)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123033203","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
扫码关注我们
求助内容：
应助结果提醒方式：