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

Analysis on Tailed distributed Arithmetic Codes for Uniform Binary sources

IEEE TRANSACTIONS ON COMMUNICATIONS 2016年第10期64卷 4305-4319页

作者： Fang, Yong Stankovic, Vladimir Cheng, Samuel Yang, En-Hui Northwest A&F Univ Coll Informat Engn Yangling 712100 Peoples R China Univ Strathclyde Dept Elect & Elect Engn Glasgow G1 1XW Lanark Scotland Univ Oklahoma Sch Elect & Comp Engn Tulsa OK 74135 USA Tongji Univ Dept Comp Sci & Technol Shanghai 200092 Peoples R China Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

distributed arithmetic coding (DAC) is a variant of AC that can realize Slepian-Wolf coding in a nonlinear way. In our previous work, we defined codebook cardinality spectrum (CCS) and Hamming distance spectrum (HDS) for DAC. In this paper, we make use of CCS and HDS to analyze tailed DAC, which is a form of DAC that, as traditional AC, maps the last few symbols of each source block onto non-overlapped intervals. First, we derive the exact HDS formula for tailless DAC, a form of DAC that maps all the symbols of each source block onto overlapped intervals, and show that the HDS formula previously given is in fact approximation. Then, the HDS formula is extended to tailed DAC. Using CCS, we also deduce the average codebook cardinality, which is closely related to decoding complexity, and rate loss of tailed DAC. The effects of tail length are extensively analyzed. It is revealed that by increasing tail length to a value not close to the bitstream length, closely spaced codewords within the same codebook can be removed at the cost of a higher decoding complexity and a larger rate loss. Finally, theoretical analyses are verified by experiments.

关键词： distributed source coding Slepian-Wolf coding distributed arithmetic coding Hamming distance spectrum codebook cardinality spectrum

来源：评论

学校读者我要写书评

暂无评论

PRISM: A video coding paradigm with motion estimation at the decoder

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2007年第10期16卷 2436-2448页

作者： Puri, Rohit Majumdar, Abhik Ramchandran, Karman Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

We describe PRISM,(1) a video coding paradigm based on the principles of lossy distributed compression (also called source coding with side information or Wyner-Ziv coding) from multiuser information theory. PRISM represents a major departure from conventional video coding architectures (e.g., the MPEGx, H.26x families) that are based on motion-compensated predictive coding, with the goal of addressing some of their architectural limitations. PRISM allows for two key architectural enhancements: 1) inbuilt robustness to "drift" between encoder and decoder and 2) the feasibility of a flexible distribution of computational complexity between encoder and decoder. Specifically, PRISM enables transfer of the computationally expensive video encoder motion-search module to the video decoder. Based on this capability, we consider an instance of PRISM corresponding to a near reversal in codec complexities with respect to today's codecs (leading to a novel light encoder and heavy decoder paradigm), in this paper. We present encouraging preliminary results on real-world video sequences, particularly in the realm of transmission losses, where PRISM exhibits the characteristic of rapid recovery, in contrast to contemporary codecs. This renders PRISM as an attractive candidate for wireless video applications.

关键词： distributed source coding distributed video coding robust video coding wireless video

来源：评论

学校读者我要写书评

暂无评论

Two Applications of Coset Cardinality Spectrum of distributed Arithmetic coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2021年第12期67卷 8335-8350页

作者： Fang, Yong Changan Univ Sch Informat Engn Xian 710064 Shaanxi Peoples R China Xian Univ Posts & Telecommun Shaanxi Key Lab Informat Commun Network & Secur Xian 710121 Shaanxi Peoples R China

distributed Arithmetic coding (DAC) is a practical realization of Slepian-Wolf coding that partitions source space into cosets. Coset Cardinality Spectrum (CCS) is an important property of DAC that was defined in our previous work. In this paper, we give two applications of CCS. First, we find that DAC bitstream is not compact. The rate loss of DAC bitstream is caused by two factors: unequal coset partitioning and bit indivisibility. It is proved that as code length goes to infinity, the expected value of bit-indivisibility rate loss will tend to 0.5 for any irrational Rate Change Step (RCS), where the RCS refers to the rate change when one source bit is flipped. With the help of CCS, the bit-indivisibility rate loss can be compensated to some extend. Especially, for any irrational RCS, as code length goes to infinity, the expected value of the remaining bit-indivisibility rate loss after compensation will tend to about 0.47. The second application of CCS is DAC decoder design. We derive the formula of path metric and find that in the original paper on DAC, the intuitive formula of path metric is not correct. The backward-replacing algorithm is proposed to make full use of memory. Experimental results confirm the correctness of theoretical analyses.

关键词： distributed source coding Slepian-Wolf coding distributed arithmetic coding coset cardinality spectrum max a posteriori decoding

来源：评论

学校读者我要写书评

暂无评论

A reduced-reference structural similarity approximation for videos corrupted by channel errors

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2010年第3期48卷 471-492页

作者： Tagliasacchi, Marco Valenzise, Giuseppe Naccari, Matteo Tubaro, Stefano Politecn Milan Dipartimento Elettron & Informat I-20133 Milan Italy

In this paper we propose a reduced-reference quality assessment algorithm which computes an approximation of the Structural SIMilarity (SSIM) metrics exploiting coding tools provided by the distributed source coding theory. The algorithm has been tested to evaluate the quality of decoded video bitstreams after transmission over error-prone networks. We evaluate the accuracy of the proposed quality assessment algorithm by measuring the Pearson's correlation coefficient between the structural similarity metrics computed in full-reference mode and the one provided by the proposed reduced-reference algorithm. The proposed reduced-reference algorithm achieves good correlation values (higher than 0.85 with packet loss rate equal up to 2.5%).

关键词： Reduced reference video quality assessment distributed source coding

来源：评论

学校读者我要写书评

暂无评论

On functional duality in multiuser source and channel coding problems with one-sided collaboration

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2006年第7期52卷 2986-3002页

作者： Pradhan, S. Sandeep Ramichandran, Kannan Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

In this paper, we address duality in a variety of multiuser source and channel coding problems under different scenarios of "one-sided" inter-terminal collaboration at either the transmitter or at the receiver. First we consider duality between broadcast channel coding and distributed source coding problems. We also consider a new source coding problem in this paper, which we refer to as distributed reconstruction source coding. This problem is closely related to the multiple description source coding problem. We then consider duality between this problem and the multiple access channel coding problem.. Our notion of duality in this paper is in a functional sense, where the optimal encoder mapping for a multiuser source coding problem becomes identical to the optimal decoder mapping for the dual multiuser channel coding problem, and vice versa. For ease of illustration we give the formulation only for systems which involve either two encoders or two decoders. Our formulation can be easily extended to the multiuser (more than two noncollaborating terminals) case. We present the precise mathematical conditions under which these encoder-decoder mappings are swappable in the two dual multiuser communication problems, identifying the key roles played by the source distortion and channel cost measures respectively in the multiuser source and channel coding problems in capturing this duality.

关键词： broadcast channel distributed reconstruction source coding distributed source coding duality multiple-access channel multiple-description source coding

来源：评论

学校读者我要写书评

暂无评论

Multiterminal source coding for multiview images under wireless fading channels

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2010年第3期48卷 457-470页

作者： Khirallah, Chadi Stankovic, Vladimir Stankovic, Lina Cheng, Samuel Univ Strathclyde Dept Elect & Elect Engn Glasgow G1 1XW Lanark Scotland Univ Oklahoma Sch Elect & Comp Engn Schusterman Ctr Tulsa OK 74135 USA

This paper addresses the problem of wireless transmission of a captured scene from multiple cameras, which do not communicate among each other, to a joint decoder. Correlation among different camera views calls for distributed source coding for efficient multiview image compression. The fact that cameras are placed within a short range of each other results in a high level of interference, multipath fading, and noise effects during communications. We develop a novel two-camera system, that employs multiterminal source coding and complete complementary data spreading, so that while the former technique exploits the statistical correlation between camera views, and performs joint compression to reduce transmission rates, the spreading technique will protect transmitted data by mitigating the effects of wireless fading channels. Our results indicate that the proposed system is competitive when compared to two independently JPEG encoded streams at low to medium transmission rates.

关键词： Multiview image coding distributed source coding Slepian-Wolf coding Spread spectrum Complete complementary sequences

来源：评论

学校读者我要写书评

暂无评论

Channel Optimized distributed Multiple Description coding

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2012年第5期60卷 2539-2551页

作者： Valipour, Mehrdad Lahouti, Farshad Univ Tehran Sch Elect & Comp Engn Ctr Excellence Appl Electromagnet Syst Wireless Multimedia Commun LabColl Engn Tehran 14174 Iran

In this paper, for robust and efficient transmission of multiple correlated sources over noisy channels with packet loss, a channel optimized distributed multiple description vector quantization (CDMD) scheme is presented. The proposed CDMD scheme enjoys low-complexity encoding and delay and a scalable CDMD decoder, which jointly reconstructs the symbols of an arbitrary number of correlated sources. This, for example, suits data-gathering applications in wireless sensor networks. The CDMD encoder is designed using a deterministic annealing approach based on a minimum mean squared error asymmetric CDMD. A CDMD decoder for asymmetric distributed source coding is presented, which takes into account the side information, as well as channel noise and packet loss. Two types of iterative symmetric CDMD decoders, namely the estimated-SI and the soft-SI decoders, are presented, which respectively exploit the reconstructed symbols and a posteriori probabilities of other sources as SI in iterations. In a multiple-source CDMD setting, for reconstruction of a source, three methods are proposed to select another source as its SI during the decoding. The methods operate based on minimum physical distance, maximum mutual information, and minimum end-to-end distortion. The performance of the proposed systems and algorithms are evaluated and compared in detail.

关键词： distributed source coding multiple descriptions noisy channels with packet loss

来源：评论

学校读者我要写书评

暂无评论

coding of Image Feature Descriptors for distributed Rate-efficient Visual Correspondences

引用

INTERNATIONAL JOURNAL OF COMPUTER VISION 2011年第3期94卷 267-281页

作者： Yeo, Chuohao Ahammad, Parvez Ramchandran, Kannan Inst Infocomm Res Signal Proc Dept Singapore 118936 Singapore Howard Hughes Med Inst Ashburn VA 20147 USA Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

Establishing visual correspondences is a critical step in many computer vision tasks involving multiple views of a scene. In a dynamic environment and when cameras are mobile, visual correspondences need to be updated on a recurring basis. At the same time, the use of wireless links between camera motes imposes tight rate constraints. This combination of issues motivates us to consider the problem of establishing visual correspondences in a distributed fashion between cameras operating under rate constraints. We propose a solution based on constructing distance preserving hashes using binarized random projections. By exploiting the fact that descriptors of regions in correspondence are highly correlated, we propose a novel use of distributed source coding via linear codes on the binary hashes to more efficiently exchange feature descriptors for establishing correspondences across multiple camera views. A systematic approach is used to evaluate rate vs visual correspondences retrieval performance;under a stringent matching criterion, our proposed methods demonstrate superior performance to a baseline scheme employing transform coding of descriptors.

关键词： distributed source coding Camera calibration Camera networks Visual correspondences distributed feature matching

来源：评论

学校读者我要写书评

暂无评论

Depth-Based Multiview distributed Video coding

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2014年第7期16卷 1834-1848页

作者： Petrazzuoli, Giovanni Maugey, Thomas Cagnazzo, Marco Pesquet-Popescu, Beatrice Inst Mines Telecom Dept Image & Signal Proc F-75634 Paris France CNRS Lab Commun & Proc Informat LTCI Paris France Ecole Polytech Fed Lausanne Inst Elect Engn Signal Proc Lab LTS4 CH-1015 Lausanne Switzerland

Multiview distributed video coding (DVC) has gained much attention in the last few years because of its potential in avoiding communication between cameras without decreasing the coding performance. However, the current results are not matching the expectations mainly due to the fact that some theoretical assumptions are not satisfied in the current implementations. For example, in distributed source coding the encoder must know the correlation between the sources, which cannot be achieved in the traditional DVC systems without having a communication between the cameras. In this work, we propose a novel multiview distributed video coding scheme in which the depth maps are used to estimate the way two views are correlated with no exchanges between the cameras. Only their relative positions are known. We design the complete scheme and further propose a rate allocation algorithm to efficiently share the bit budget between the different components of our scheme. Then, a rate allocation algorithm for depth maps is proposed in order to maximize the quality of synthesized virtual views. We show, through detailed experiments, that our scheme significantly outperforms the state-of-the-art DVC system.

关键词： 3DTV depth image based rendering (DIBR) depth maps distributed source coding shape adaptive coding

来源：评论

学校读者我要写书评

暂无评论

Generalized and Extended Subspace Algorithms for Error Correction with Quantized DFT Codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2014年第2期62卷 410-422页

作者： Vaezi, Mojtaba Labeau, Fabrice McGill Univ Dept Elect & Comp Engn Montreal PQ H3A 0E9 Canada

Discrete Fourier transform (DFT) codes have been used to provide robustness against errors and erasures in various applications. This paper focuses on improving error localization of the Bose-Chaudhuri-Hocquenghem (BCH) DFT codes. First, we analyze how the subspace-based error localization outperforms the coding-theoretic one. Then, we propose an extension of the subspace-based error localization, based on additional syndrome, that improves the existing one and is naturally suitable for rate-adaptive distributed source coding (DSC). Further, we propose a new generic subspace-based algorithm to decode BCH-DFT codes. The proposed approach generalizes the encoding and decoding of this important class of DFT codes. It introduces many different decoding matrices for a DFT code;this diversity is then used to diminish the effect of the quantization noise and thus to improve the decoding. Finally, the extended and generalized approaches are combined to maximize the decoding gain. Simulation results demonstrate the capability of the proposed algorithms to perform significantly better than the existing subspace-based error localization, in the presence of quantization noise.

关键词： BCH-DFT codes subspace error localization distributed source coding channel coding rate-adaptive codes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：