检索结果-内蒙古大学图书馆

Image Based coding of Spatial Probability Distribution on Human Dynamics Data

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2021年第10期E104D卷 1545-1554页

作者： Kimata, Hideaki Wu, Xiaojun Tanida, Ryuichi NTT Corp NTT Media Intelligence Labs Yokosuka Kanagawa 2390847 Japan

The need for real-time use of human dynamics data is increasing. The technical requirements for this include improved databases for handling a large amount of data as well as highly accurate sensing of people's movements. A bitmap index format has been proposed for high-speed processing of data that spreads in a two-dimensional space. Using the same format is expected to provide a service that searches queries, reads out desired data, visualizes it, and analyzes it. In this study, we propose a coding format that enables human dynamics data to compress it in the target data size, in order to save data storage for successive increase of real-time human dynamics data. In the proposed method, the spatial population distribution, which is expressed by a probability distribution, is approximated and compressed using the one-pixel one-byte data format normally used for image coding. We utilize two kinds of approximation, which are accuracy of probability and precision of spatial location, in order to control the data size and the amount of information. For accuracy of probability, we propose a non-linear mapping method for the spatial distribution, and for precision of spatial location, we propose spatial scalable layered coding to refine the mesh level of the spatial distribution. Also, in order to enable additional detailed analysis, we propose another scalable layered coding that improves the accuracy of the distribution. We demonstrate through experiments that the proposed data approximation and coding format achieve sufficient approximation of spatial population distribution in the given condition of target data size.

关键词： human dynamics data probability distribution scalable coding non-linear mapping multimedia database

来源：评论

学校读者我要写书评

暂无评论

End-to-end security in the presence of intelligent data adapting proxies: The case of authenticating transcoded streaming media

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2005年第2期23卷 464-473页

作者： Gentry, C Hevia, A Jain, R Kawahara, T Ramzan, Z DoCoMo Commun Labs San Jose CA 95110 USA Univ Calif San Diego Dept Comp Sci & Engn La Jolla CA 92093 USA

We consider the problem of maintaining end-to-end security in the presence of intelligent proxies that may adaptively modify data being transmitted across a network. The video coding community considers this problem in the context of transcoding media streams, but their approaches either fail to address authentication or fail to provide meaningful security guarantees. We present two provably-secure schemes, LISSA and TRESSA,that allow an intelligent network intermediary to intercept a stream signed by a content provider, and adapt it dynamically, while preserving the ultimate receiver's ability to securely verify the content provider's signature (and, hence, authenticity and integrity of the data received). Our schemes allow the intermediary to selectively remove portions of the stream and, thus, permit common media transcoding techniques such as scalable compression and multiple file switching. Moreover, a content provider only has to encode and sign its entire data stream once, as opposed to nondynamically encoding and signing different versions for each anticipated combination of device, network configuration, and channel condition. Our implementation results demonstrate efficiency.

关键词： adaptive security digital signatures multiple file switching scalable coding

来源：评论

学校读者我要写书评

暂无评论

Rate-Distortion-Memory Trade-Offs in Heterogeneous Caching Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2020年第5期19卷 3019-3033页

作者： Hassanzadeh, Parisa Tulino, Antonia M. Llorca, Jaime Erkip, Elza NYU ECE Dept Tandon Sch Engn Brooklyn NY 11201 USA JP Morgan AI Res New York NY 10017 USA Univ Naples Federico II DIETI I-80125 Naples Italy Nokia Bell Labs Holmdel NJ 07733 USA

Caching at the wireless edge can be used to keep up with the increasing demand for high-definition wireless video streaming. By prefetching popular content into memory at wireless access points or end-user devices, requests can be served locally, relieving strain on expensive backhaul. In addition, using network coding allows the simultaneous serving of distinct cache misses via common coded multicast transmissions, resulting in significantly larger load reductions compared to those achieved with traditional delivery schemes. Most prior works simply treat video content as fixed-size files that users would like to fully download. This work is motivated by the fact that video can be coded in a scalable fashion and that the decoded video quality depends on the number of layers a user receives in sequence. Using a Gaussian source model, caching and coded delivery methods are designed to minimize the squared error distortion at end-user devices in a rate-limited caching network. The framework is very general and accounts for heterogeneous cache sizes, video popularities and user-file play-back qualities. As part of the solution, a new decentralized scheme for lossy cache-aided delivery subject to preset user distortion targets is proposed, which further generalizes prior literature to a setting with file heterogeneity.

关键词： Caching networks coded multicast scalable coding successive refinement lossy source coding

来源：评论

学校读者我要写书评

暂无评论

Towards Analysis-Friendly Face Representation With scalable Feature and Texture Compression

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2022年 24卷 3169-3181页

作者： Wang, Shurun Wang, Shiqi Yang, Wenhan Zhang, Xinfeng Wang, Shanshe Ma, Siwei Gao, Wen City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China Univ Chinese Acad Sci Sch Comp Sci & Technol Beijing 100190 Peoples R China Peking Univ Inst Digital Media Beijing 100871 Peoples R China

Compactly representing visual information plays a fundamental role in optimizing the ultimate utility of myriad visual data-centered applications. Numerous approaches have been proposed to efficiently compress the texture and visual features for human visual perception and machine intelligence, respectively;however, much less work has been dedicated to studying the interactions between them. Here, we investigate the integration of feature and texture compression and show that a universal and collaborative visual information representation can be achieved in a hierarchical way. In particular, we study feature and texture compression in a scalable coding framework, where the base layer serves as the deep learning feature and the enhancement layer targets to perfectly reconstruct the texture. Based on the strong generative capability of deep neural networks, the gap between the base feature layer and enhancement layer is further filled with feature-level texture reconstruction, with the goal of further constructing texture representations from features. As such, the residuals between the original and reconstructed texture could be further conveyed in the enhancement layer. To improve the efficiency of the proposed framework, the base layer neural network is trained in a multitask manner such that the learned features enjoy both high-quality reconstruction and high-accuracy analysis. The framework and optimization strategies are further applied in face image compression, and promising coding performance has been achieved in terms of both rate-fidelity and rate-accuracy evaluations.

关键词： Image coding Visualization Standards Transform coding Feature extraction Image reconstruction Deep learning Feature compression texture compression scalable coding multitask learning

来源：评论

学校读者我要写书评

暂无评论

Union of MDCT Bases for Audio coding

引用

IEEE TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING 2008年第8期16卷 1361-1372页

作者： Ravelli, Emmanuel Richard, Gal Daudet, Laurent Univ Paris 06 Inst Jean le Rond Alembert LAM F-75015 Paris France GET ENST Tlcom Paris TSI Dept F-75014 Paris France

This paper investigates the use of sparse overcomplete decompositions for audio coding. Audio signals are decomposed over a redundant union of modified discrete cosine transform (MDCT) bases having eight different scales. This approach produces a sparser decomposition than the traditional MDCT-based orthogonal transform and allows better coding efficiency at low bitrates. Contrary to state-of-the-art low bitrate coders, which are based on pure parametric or hybrid representations, our approach is able to provide transparency. Moreover, we use a bitplane encoding approach, which provides a fine-grain scalable coder that can seamlessly operate from very low bitrates up to transparency. Objective evaluation, as well as listening tests, show that the performance of our coder is significantly better than a state-of-the-art transform coder at very low bitrates and has similar performance at high bitrates. We provide a link to test soundfiles and source code to allow better evaluation and reproducibility of the results.

关键词： Audio coding matching pursuit scalable coding signal representations sparse representations

来源：评论

学校读者我要写书评

暂无评论

On robustness against JPEG2000: a performance evaluation of wavelet-based watermarking techniques

引用

MULTIMEDIA SYSTEMS 2014年第2期20卷 239-252页

作者： Bhowmik, Deepayan Abhayaratne, Charith Heriot Watt Univ Inst Sensors Signals & Syst Vis Lab Edinburgh EH14 4AS Midlothian Scotland Univ Sheffield Dept Elect & Elect Engn Sheffield S1 3JD S Yorkshire England Univ Sheffield Sheffield S1 3JD S Yorkshire England

With the emergence of new scalable coding standards, such as JPEG2000, multimedia is stored as scalable coded bit streams that may be adapted to cater network, device and usage preferences in multimedia usage chains providing universal multimedia access. These adaptations include quality, resolution, frame rate and region of interest scalability and achieved by discarding least significant parts of the bit stream according to the scalability criteria. Such content adaptations may also affect the content protection data, such as watermarks, hidden in the original content. Many wavelet-based robust watermarking techniques robust to such JPEG2000 compression attacks are proposed in the literature. In this paper, we have categorized and evaluated the robustness of such wavelet-based image watermarking techniques against JPEG2000 compression, in terms of algorithmic choices, wavelet kernel selection, subband selection, or watermark selection using a new modular framework. As most of the algorithms use a different set of parametric combination, this analysis is particularly useful to understand the effect of various parameters on the robustness under a common platform and helpful to design any such new algorithm. The analysis also considers the imperceptibility performance of the watermark embedding, as robustness and imperceptibility are two main watermarking properties, complementary to each other.

关键词： Wavelet-based image watermarking Watermarking evaluation Robustness scalable coding Content adaptation JPEG2000

来源：评论

学校读者我要写书评

暂无评论

Efficient peer assignment for low-latency transmission of scalable coded images

引用

JOURNAL OF COMMUNICATIONS AND NETWORKS 2008年第1期10卷 79-88页

作者： Su, Xiao Wang, Tao San Jose State Univ Dept Comp Engn San Jose CA 95192 USA Synopsys Inc Mountain View CA USA

In this paper, we propose efficient peer assignment algorithms for low-latency transmission of scalable coded images in peer-to-peer networks, in which peers may dynamically join and leave the networks. The objective of our algorithm is to minimize the transmission time of a requested image that is scalable coded. When an image is scalable coded in different bit rates, the bit stream encoded in a lower bit rate is a prefix subset of the one encoded in a higher bit rate. Therefore, a peer with the same requested image coded in any bit rate, even when it is different from the requested rate, may work as a supplying peer. As a result, when a scalable coded image is requested, more supplying peers can be found in peer-to-peer networks to help with the transfer. However, the set of supplying peers is not static during transmission, as the peers in this set may leave the network or finish their transmission at different times. The proposed peer assignment algorithms have taken into account the above constraints. In this paper, we first prove the existence of an optimal peer assignment solution for a simple identity permutation function, and then formulate peer assignment with this identity permutation as a mixed-integer programming problem. Next, we discuss how to address the problem of dynamic peer departures during image transmission. Finally, we carry out experiments to evaluate the performance of proposed peer assignment algorithms.

关键词： image transmission peer-to-peer networks scalable coding

来源：评论

学校读者我要写书评

暂无评论

On successive refinement of the binary symmetric Markov source

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2006年第9期52卷 4190-4197页

作者： Lastras-Montano, Luis Alfonso Berger, Toby IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA Cornell Univ Sch Elect & Comp Engn Ithaca NY USA

We show that for every n > 2 the standard nth-order approximation R-n (D), to the rate-distortion function of the binary-symmetric Markov source (BSMS) is not successively refineable under the Hamming distortion me... 详细信息

关键词： binary-symmetric Markov source critical distortion lossy source coding Markov source progressive transmission rate-distortion function scalable coding successive refinement

来源：评论

学校读者我要写书评

暂无评论

Distribution Preserving Quantization With Dithering and Transformation

引用

IEEE SIGNAL PROCESSING LETTERS 2010年第12期17卷 1014-1017页

作者： Li, Minyue Klejsa, Janusz Kleijn, W. Bastiaan KTH Royal Inst Technol Sch Elect Engn Stockholm Sweden Massey Univ Sch Adv Sci & Technol Wellington New Zealand

A new quantization scheme that preserves the probability distribution of the source signal is presented. The distribution preserving quantization (DPQ) achieves the optimal trade-off between mean square error and bit rate asymptotically. It provides a continuum ranging from rate-distortion optimal signal quantization to parametric coding. The method can be used as a core component for scalable coding. Its efficacy is illustrated by applying the scheme to audio coding.

关键词： Distribution preserving quantization perceptual coding scalable coding

来源：评论

学校读者我要写书评

暂无评论

A hierarchical lossless/lossy coding system for high quality audio up to 192 kHz sampling 24 bit format

引用

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS 2003年第3期49卷 759-764页

作者： Jin, A Moriya, T Ikeda, K Yang, DT NTT Commun Corp Tokyo Japan NTT Cyber Space Labs Tokyo Japan NTT Intellectual Property Ctr Tokyo Japan

We present a flexible audio coding system for use in the continuous transmission of high-quality (192-kHz sampling rate, 24-bit digitization (mac)) stereo-audio data streams, either live or recorded The system provides both lossless and variable-level lossy quality, quality is selectable to suit a full range of wide- and narrow-band IP networks As input signals for transmission at the server PC, less than nine PCM sound files in different formats are simultaneously encodable, and the efficiency of simultaneous compression is very high. The system is realized by software that runs on a typical PC This gives everyone on an IP network the ability to transmit high-quality sound anywhere within the network An MPEG-4 audio codec provides the core of the lossy coding module.

关键词： lossless coding scalable coding high-quality audio MPEG-4 DVD-audio

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：