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

IEEE International Conference on Multimedia and Expo (ICME 2008)

作者： Lin, Yao-Chung Varodayan, David Fink, Torsten Bellers, Erwin Girod, Bernd Stanford Univ Informat Syst Lab Stanford CA 94305 USA NXP Semicond TriMedia Ctr Excellence San Jose CA 95131 USA

ISBN: (纸本)9781424425709

Media authentication is important in content delivery via untrusted intermediaries, such as peer-to-peer (P2P) file sharing. Many differently encoded versions of a media file might exist. Our previous work applied distributed source coding not only to distinguish the legitimate diversity of encoded images from tampering but also localize the tampered regions in an image already deemed to be inauthentic. An authentication decoder was supplied with a Slepian-Wolf encoded image projection as authentication data. We extend our scheme to authenticate contrast and brightness adjusted images using an Expectation Maximization algorithm. Experimental results demonstrate that the proposed algorithm can distinguish legitimate encodings of authentic contrast and brightness adjusted images from illegitimately modified versions using authentication data of about 100 bytes.

关键词： Image authentication distributed source coding Expectation Maximization

来源：评论

学校读者我要写书评

暂无评论

Audio authentication based on distributed source coding

Audio authentication based on distributed source coding

引用

33rd IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Varodayan, David Lin, Yao-Chung Girod, Bernd Stanford Univ Informat Syst Lab Stanford CA 94305 USA

ISBN: (纸本)9781424414833

Audio authentication is important in content delivery via untrusted intermediaries, for example peer-to-peer (P2P) file sharing. Many differently encoded versions of the original audio might exist. Distinguishing the legitimate diversity of encodings from malicious tampering is the challenge addressed in this paper. We develop an approach based on distributed source coding for the problem of backward-compatible audio authentication. The key idea is to provide a Slepian-Wolf encoded quantized perceptually significant audio projection as authentication data. This version can be correctly decoded only with the help of authentic audio as side information. distributed source coding provides the desired robustness against legitimate encoding variations, while detecting illegitimate modification. We demonstrate reliable authentication at a Slepian-Wolf bitrate of less than 100 bit/s.

关键词： audio authentication distributed source coding LDPC codes

来源：评论

学校读者我要写书评

暂无评论

On the Interplay Between Resource-Management Overhead and Performance in Sensor Networks: An Information Theoretic Approach

On the Interplay Between Resource-Management Overhead and Pe...

引用

IEEE Global Communications Conference

作者： Mahshid Rahnamay-Naeini Nasir Ghani Majeed M. Hayat Department of Electrical and Computer Engineering University of New Mexico Albuquerque NM USA Department of Electrical Engineering University of South Florida Tampa FL USA

ISBN: (纸本)9781479913510

Resource management (RM) is a critical action in systems with limited resources such as sensor networks. Efficient RM depends heavily upon the availability of accurate information on the state of available resources. However, exchange of state information incurs an overhead on the system. In this paper, the sensing and computing resource management in sensor networks is considered. A lossless, distributed source-coding framework is presented to model the exchange of state information. The framework enables the characterization of the interplay between the performance and overhead of RM by leveraging the correlation among the state information of various nodes. Moreover, the proposed framework enables an improved estimate of the lower bound for the minimum control overhead necessary to accurately describe the state of nodes in the network. This improvement is achieved by exploiting the correlation among the state information of nodes as well as the available information on prior resource allocation actions as side information.

关键词： Sensor networks resource management distributed computing control overhead information theory distributed source coding side information Sensor networks management of resources distributed source coding distributed computing Information Theory side information Countries (nations) Redmouth disease resource management(computing) Ganglia

来源：评论

学校读者我要写书评

暂无评论

RATE-DISTORTION OPTIMIZED MERGE FRAME USING PIECEWISE CONSTANT FUNCTIONS

RATE-DISTORTION OPTIMIZED MERGE FRAME USING PIECEWISE CONSTA...

引用

IEEE International Conference on Image Processing

作者： Wei Dai Gene Cheung Ngai-Man Cheung Antonio Ortega Oscar C. Au Hong Kong University of Science and Technology National Institute of Informatics Singapore University of Technology and Design University of Southern California

ISBN: (纸本)9781479923427

The ability to efficiently switch from one pre-encoded video stream to another is a valuable attribute for a variety of interactive streaming applications, such as switching among streams of the same video encoded in different bit-rates for real-time bandwidth adaptation, or view-switching among videos capturing the same dynamic 3D scene but from different viewpoints. It is well known that intra-coded I-frames can be used at switch boundaries to facilitate stream-switching. However, the size of an I-frame is large, making frequent insertion impractical. A recent proposal towards a more efficient stream-switching mechanism is distributed source coding (D-SC), which exploits worst-case correlation between a set of potential predictor frames in the decoder buffer (called side information (SI) frames) and a target frame to lower encoding rate. However, the conventional use of bit-plane and channel coding means the encoding and decoding complexity of DSC frames is large. In this paper, we pursue a novel approach to the stream-switching problem based on the concept of "signal merging", using piecewise constant (p-wc) function as the merge operator. Specifically, we propose a new merge mode for a code block, where for each k-th transform coefficient in the block, we encode appropriate step size and horizontal shift parameters at the encoder, so that the resulting floor function at the decoder can map corresponding coefficients from any SI frame to the same reconstructed value, resulting in an identically merged signal. The selection of shift parameter per coefficient, as well as coding modes between intra and merge per block, are optimized in a rate-distortion (RD) optimal manner. Experiments show encouraging coding gain over a previous implementation of DSC frame at low- to mid-bitrates at reduced computation complexity.

关键词： Interactive video video coding distributed source coding

来源：评论

学校读者我要写书评

暂无评论

distributed MULTI-HYPOTHESIS coding OF DEPTH MAPS USING TEXTURE MOTION INFORMATION AND OPTICAL FLOW

DISTRIBUTED MULTI-HYPOTHESIS CODING OF DEPTH MAPS USING TEXT...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Matteo Salmistraro Marco Zamarin Lars Lau Raket Soren Forchhammer DTU Fotonik Technical University of Denmark Department of Computer Science University of Copenhagen

ISBN: (纸本)9781479903573

distributed Video coding (DVC) is a video coding paradigm allowing a shift of complexity from the encoder to the decoder. Depth maps are images enabling the calculation of the distance of an object from the camera, which can be used in multiview coding in order to generate virtual views, but also in single view coding for motion detection or image segmentation. In this work, we address the problem of depth map video DVC encoding in a single-view scenario. We exploit the motion of the corresponding texture video which is highly correlated with the depth maps. In order to extract the motion information, a block-based and an optical flow-based method are employed. Finally we fuse the proposed Side Information using a multi-hypothesis DVC decoder, which allows us to exploit the strengths of all the proposed methods at the same time.

关键词： distributed source coding Depth Map coding Wyner-Ziv coding Optical Flow distributed Video coding Optic Flow distributed source coding Video coding digital video coding information maps STRUCTURE MAP Motion detection

来源：评论

学校读者我要写书评

暂无评论

To Overhear or Not to Overhear: On Correlated Data Gathering in M2M Networks with Limited Radio Resources

To Overhear or Not to Overhear: On Correlated Data Gathering...

引用

IEEE Global Communications Conference

作者： Wei-Chih Liao Hung-Yun Hsieh Graduate Institute of Communication Engineering National Taiwan University

ISBN: (纸本)9781479913510

In this paper, we consider the problem of correlated data gathering in M2M (machine-to-machine) wireless networks with a large number of machines. Since machines communicate directly with the aggregator, the limited radio resources at the aggregator become the bottleneck for supporting all machines. Unlike related work that employs distributed source coding for minimizing resource usage, we assume that machines only perform local source coding. However, machines can leverage data overheard from transmissions of other machines for removing redundancy based on "dependent" source coding. To explore the performance tradeoffs of overhearing, we formulate a joint optimization problem involving node selection, resource allocation, and transmission scheduling, and then solve the problem based on the cross entropy method. Evaluation results show that without incurring the complexity of distributed source coding, dependent source coding via overhearing can achieve noticeable performance gain compared to independent source coding - even if the overhearing range and time are limited due to energy consideration. The results thus motivate further investigation for leveraging overhearing opportunities in M2M networks with limited radio resources.

关键词： source coding crosstalk Data Collection Methods machine machine to machine machinery Radio transmission Not distributed source coding

来源：评论

学校读者我要写书评

暂无评论

Interactive source coding for Function Computation in Collocated Networks

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2012年第7期58卷 4289-4305页

作者： Ma, Nan Ishwar, Prakash Gupta, Piyush Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94709 USA Boston Univ Dept Elect & Comp Engn Boston MA 02215 USA Alcatel Lucent Bell Labs Murray Hill NJ 07974 USA

A problem of interactive function computation in a collocated network is studied in a distributed block source coding framework. With the goal of computing samples of a desired function of sources at the sink, the source nodes exchange messages through a sequence of error-free broadcasts. For any function of independent sources, a computable characterization of the set of all feasible message coding rates-the rate region-isderived in terms of single-letter information measures. In the limit as the number of messages tends to infinity, the infinite-message minimum sum rate, viewed as a functional of the joint source probability mass function, is characterized as the least element of a partially ordered family of functionals having certain convex-geometric properties. This characterization leads to a family of lower bounds for the infinite-message minimum sum rate and a simple criterion to test the optimality of any achievable infinite-message sum rate. An iterative algorithm for evaluating the infinite-message minimum sum-rate functional is proposed and is demonstrated through an example of computing the minimum function of three Bernoulli sources. Based on the characterizations of the rate regions, it is shown that when computing symmetric functions of binary sources, the sink will inevitably learn certain additional information that is not demanded in computing the function. This conceptual understanding leads to new improved bounds for the minimum sum rate. The new bounds are shown to be orderwise better than those based on cut-sets as the network scales. The scaling law of the minimum sum rate is explored for different classes of symmetric functions and source parameters.

关键词： Collocated networks communication complexity distributed source coding function computation interactive coding

来源：评论

学校读者我要写书评

暂无评论

distributed source coding using Abelian Group Codes: Extracting Performance from Structure

Distributed Source Coding using Abelian Group Codes: Extract...

引用

Annual Allerton Conference on Communication, Control, and Computing

作者： Dinesh Krithivasan S. Sandeep Pradhan Department of Electrical Engineering and Computer Science University of Michigan

ISBN: (纸本)9781424429257

In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the problem of computing a function of the sources to within some distortion and also the classic Slepian-Wolf problem [12], Berger-Tung problem [5], Wyner-Ziv problem [4], Yeung-Berger problem [6] and the Ahlswede-Korner-Wyner problem [3], [13]. While the prevalent trend in information theory has been to prove achievability results using Shannon's random coding arguments, using structured random codes offer rate gains over unstructured random codes for many problems. Motivated by this, we present a new achievable rate-distortion region (an inner bound to the performance limit) for this problem for discrete memoryless sources based on "good" structured random nested codes built over abelian groups. We demonstrate rate gains for this problem over traditional coding schemes using random unstructured codes. For certain sources and distortion functions, the new rate region is strictly bigger than the Berger-Tung rate region, which has been the best known achievable rate region for this problem till now. Further, there is no known unstructured random coding scheme that achieves these rate gains. Achievable performance limits for single-user source coding using abelian group codes are also obtained as parts of the proof of the main coding theorem. As a corollary, we also prove that nested linear codes achieve the Shannon rate-distortion bound in the single-user setting. Note that while group codes retain some structure, they are more general than linear codes which can only be built over finite fields which are known to exist only for certain sizes.

关键词： distributed source coding Abelian group group codes linear codes distortion random codes Codes random coding single user Galois fields Rate distortion

来源：评论

学校读者我要写书评

暂无评论

Quality and Complexity Controllable DVC Bitstream Organizer

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2012年第5期E95B卷 1894-1897页

作者： Kim, Chul Keun Cho, Yongwoo Park, Jongbin Suh, Doug Young Jeon, Byeungwoo Kyung Hee Univ Seoul South Korea Sungkyunkwan Univ Seoul South Korea

Applying distributed Video coding (DVC) to mobile devices that have limited computation and power resources can be a very challenging problem due to its high-complexity decoding. To address this, this paper proposes a DVC bitstream organizer. The proposed DVC bitstream organizer reduces the complexity associated with repetitive channel decoding and SI generation in a flexible manner. It allows users to choose a means of minimizing the computational complexity of the DVC decoder according to their preferences and the device's resource limitations. An experiment shows that the proposed method increases decoding speeds by up to 25 times.

关键词： distributed video coding distributed source coding video compression video communication

来源：评论

学校读者我要写书评

暂无评论

Wyner-Ziv coding Based on Multidimensional Nested Lattices

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2012年第5期60卷 1328-1335页

作者： Ling, Cong Gao, Su Belfiore, Jean-Claude Univ London Imperial Coll Sci Technol & Med Dept Elect & Elect Engn London SW7 2AZ England Telecom ParisTech Dept Commun & Elect Paris France

distributed source coding addresses the compression of correlated sources without communication links among them. This paper is concerned with the Wyner-Ziv problem: coding of an information source with side information available only at the decoder in the form of a noisy version of the source. Both the problems of theoretical analysis and code design are addressed in the framework of multi-dimensional nested lattice coding. For theoretical analysis, accurate computation of the rate-distortion function is given under the high-resolution assumption, and a new upper bound using the derivative of the theta series is derived. For practical code design, several low-complexity techniques are proposed. Compared to the existing Slepian-Wolf coded nested quantization for Wyner-Ziv coding based on one or two-dimensional lattices, our proposed multi-dimensional lattice coding can offer better performance at arguably lower complexity, since it does not require the second stage of Slepian-Wolf coding.

关键词： distributed source coding multi-dimensional lattices nested lattices rate-distortion function Wyner-Ziv coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：