Video streaming is one of the most important applications that will make use of the high data rates offered by 4G networks. The current video transport techniques are already very advanced, and the more immediate prob...
详细信息
Video streaming is one of the most important applications that will make use of the high data rates offered by 4G networks. The current video transport techniques are already very advanced, and the more immediate problems lie in the joint optimization of video coding, AL-FEC, and PHY rate selection with the goal of enhancing the user perceived quality. In this work we provide an analysis of video broadcast streaming services for different combinations of layered coding and AL-FEC, using a realistic LTE PHY layer. Our simulation results show that the scalable content adaptation given by Scalable Video Coding (SVC) and the scheduling flexibility offered by the 3G-LTE MAC-layer provide a good match for enhanced video broadcast services for next generation cellular networks. Our proposed solution is compared to baseline algorithms and broadcast systems based on H.264/AVC streaming solutions. We emphasize the system quality improvement brought by our solution and discuss implications for a wide-scale practical deployment.
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Nearest neighbor search (NNS) algorithms a...
详细信息
ISBN:
(纸本)9781450300322
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Nearest neighbor search (NNS) algorithms are often used to retrieve similar entries, given a query. While there exist efficient techniques for exact query lookup using hashing, similarity search using exact nearest neighbors suffers from a "curse of dimensionality", i.e. for high dimensional spaces, best known solutions offer little improvement over brute force search and thus are unsuitable for large scale streaming applications. Fast solutions to the approximate NNS problem include Locality Sensitive Hashing (LSH) based techniques, which need storage polynomial in n with exponent greater than 1, and query time sublinear, but still polynomial in n, where n is the size of the database. In this work we present a new technique of solving the approximate NNS problem in Euclidean space using a Ternary content Addressable Memory (TCAM), which needs near linear space and has O(1) query time. In fact, this method also works around the best known lower bounds in the cell probe model for the query time using a data structure near linear in the size of the data base. TCAMs are high performance associative memories widely used in networking applications such as address lookups and access control lists. A TCAM can query for a bit vector within a database of ternary vectors, where every bit position represents 0, 1 or*. The*is a wild card representing either a 0 or a 1. We leverage TCAMs to design a variant of LSH, called Ternary Locality Sensitive Hashing (TLSH) wherein we hash database entries represented by vectors in the Euclidean space into {0,1,*}. By using the added functionality of a TLSH scheme with respect to the*character, we solve an instance of the approximate nearest neighbor problem with 1 TCAM access and storage nearly linear in the size of the database. We validate our claims with extensive
The portability and popularity of mobile devices make the access of Internet content become a common phenomenon. To support different mobile devices in the heterogeneous networking environments, digital content provid...
详细信息
ISBN:
(纸本)9780769536583
The portability and popularity of mobile devices make the access of Internet content become a common phenomenon. To support different mobile devices in the heterogeneous networking environments, digital content providers have to provide different versions of the multimedia streaming video for clients to choose. Traditional caching technology is not applicable to multimedia streaming proxy. Therefore, we propose a new caching algorithm with static weight transcoding graph and dynamic caching relation tree. With a transcoding proxy, the transmission time can be reduced by transcoding the original content before delivering it. In this paper, the proposed algorithm is compared with LRU and LFU cache algorithms in three parts: Hit Ratio, Byte Hit Ratio, and Average Transcoding Delay. Experimental results show that the proposed algorithm outperforms than traditional LRU and LFU cache algorithms.
Peer-to-peer content distribution provides high network throughput with relatively low server cost and scales better than traditional content distribution networks with respect to the number of clients. It is ideal fo...
详细信息
ISBN:
(纸本)9781424442904
Peer-to-peer content distribution provides high network throughput with relatively low server cost and scales better than traditional content distribution networks with respect to the number of clients. It is ideal for applications requiring large data transfer such as Video-on-Demand or live video streaming. Traditional forensic watermarking systems are based on the assumption that each user receives a unique copy of video content to allow for tracking of pirated content back to the original recipient. However, P2P-based distribution systems are typically designed to supply identical copies to each user. This paper proposes a new watermarking framework that is suitable for P2P-based content delivery systems. Watermarking algorithms that are appropriate for this system are also discussed.
Virtualization and emulation techniques are getting better and better, and it feels thus natural to apply them to address the problem of data preservation for future contentaccess. In this paper, we virtualized a num...
详细信息
ISBN:
(纸本)9781424444717
Virtualization and emulation techniques are getting better and better, and it feels thus natural to apply them to address the problem of data preservation for future contentaccess. In this paper, we virtualized a number of existing servers and clients and ran the virtual machines tinder VMware's hypervisor. Not all of the investigated operating systems could be virtualized successfully, and even with successful conversions often settings had to he reconfigurated, and support for particular devices had to be added manually. It is concluded that many, operating systems are not flexible enough to allow for a problem-free conversion to a virtual machine.
The visual representation of information is an interesting way of communication both in industrial and science. The viewing of interactive data gives the users a fun and immediate access to information they are lookin...
详细信息
ISBN:
(纸本)9781424437566
The visual representation of information is an interesting way of communication both in industrial and science. The viewing of interactive data gives the users a fun and immediate access to information they are looking for. In this context and with existing technologies that make Internet applications rich in content, we can ask our selves for the relevance of a software architecture dedicated to this type of media. We tried to design an architecture responding to our expectations, and its feasibility study by the realization of an application in the context of geographic mapping,
Color features of an image are the most widely used features in content-based image retrieval (CBIR) [1][6] systems. Specifically histogram-based algorithms are considered to be effective for color image indexing. Col...
详细信息
ISBN:
(纸本)9781424437566
Color features of an image are the most widely used features in content-based image retrieval (CBIR) [1][6] systems. Specifically histogram-based algorithms are considered to be effective for color image indexing. Color histogram [2] describes the global distribution of pixels of an image which is insensitive to variations in scale and easy to calculate. However, the high dimensionality of feature vectors results in high computation cost and space cost. In this paper, we mainly focus on color features and propose a novel method named Color Frequency Sequence Difference (CFSD) to express color images, which only has one numerical value in one color channel The CFSD is combined with information entropy to realize indexing. The novel approach is described in detail and compared with color histogram method presented in the literature. The experiment is finished and shows that the method proposed in this paper is effective and efficient
作者:
Ciocca, G.Marini, F.Schettini, R.DISCo
Dipartimento di Informatica Sistemistica e Comunicazione Universita Degli Studi di Milano-Bicocca Viale Sarca 336 20126 Milano Italy
In the framework of multimedia applications image quality may have different meanings and interpretations. In this paper, considering the quality of an image as the degree of adequacy to its function/goal within a spe...
详细信息
Efficient file searching is an essential feature in P2P systems. While many current approaches use brute force techniques to search files by meta information (file names, extensions or user-provided tags), the interes...
详细信息
Efficient file searching is an essential feature in P2P systems. While many current approaches use brute force techniques to search files by meta information (file names, extensions or user-provided tags), the interest is in implementing techniques that allow content-based search in P2P systems. Recently, clustering techniques have been used for searching text documents to increase the efficiency of document discovery and retrieval. Integrating such techniques into P2P systems is important to enhance searching in P2P file sharing systems. While some effort has been taken for content-based searching for text documents in P2P systems, there has been few research work for applying these techniques to multimediacontent in P2P systems. In this paper, we introduce two P2P content-based clustering techniques for multimedia documents. These techniques are an adaptation of the existing Class-based Semantic Search algorithm for text documents. The proposed algorithms have been integrated into a JXTA-based Overlay P2P platform, and evaluation results are provided. The JXTA-Overlay together with the considered clustering techniques is thus very useful for developing P2P multimedia applications requiring efficient searching of multimediacontents in peer nodes.
暂无评论