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

distributed lossy compression for hyperspectral images based on multilevel coset codes

INTERNATIONAL JOURNAL OF WAVELETS MULTIRESOLUTION AND INFORMATION PROCESSING 2017年第2期15卷 1750012-1750012页

作者： Xu, Ke Liu, Bin Nian, Yongjian He, Mi Wan, Jianwei Natl Univ Def Technol Coll Elect Sci & Engn Changsha 410073 Hunan Peoples R China Jinan Mil Area Command Gen Hosp Dept Med Informat Jinan 250031 Peoples R China Third Mil Med Univ Sch Biomed Engn Chongqing 400038 Peoples R China

This paper focuses on the problem of lossy compression for hyperspectral images and presents an efficient compression algorithm based on distributed source coding. The proposed algorithm employs a block-based quantizer followed by distributed lossless coding, which is implemented through the use of multilevel coset codes. First, a bitrate allocation algorithm is proposed to assign the rational bitrate for each block. Subsequently, the multilinear regression model is employed to construct the side information of each block, and the optimal quantization step size of each block is obtained under the assigned bitrate while minimizing the distortion. Finally, the quantized version of each block is encoded by distributed lossless compression. Experimental results show that the compression performance of the proposed algorithm is competitive with that of state-of-the-art transformbased compression algorithms. Moreover, the proposed algorithm provides both low encoder complexity and error resilience, making it suitable for onboard compression.

关键词： Hyperspectral images lossy compression distributed source coding bitrate allocation error resilience

来源：评论

学校读者我要写书评

暂无评论

Hypergraph-Based source Codes for Function Computation Under Maximal Distortion

IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY

引用

IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY 2022年第4期3卷 824-838页

作者： Basu, Sourya Seo, Daewon Varshney, Lav R. Univ Illinois Coordinated Sci Lab Urbana IL 61801 USA Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA Daegu Gyeongbuk Inst Sci & Technol Dept Elect Engn & Comp Sci Daegu 42988 South Korea

This work investigates functional source coding problems with maximal distortion, motivated by approximate function computation in many modern applications. The maximal distortion treats imprecise reconstruction of a function value as good as perfect computation if it deviates less than a tolerance level, while treating reconstruction that differs by more than that level as a failure. Using a geometric understanding of the maximal distortion, we propose a hypergraph-based source coding scheme for function computation that is constructive in the sense that it gives an explicit procedure for finding optimal or good auxiliary random variables. Moreover, we find that the hypergraph-based coding scheme achieves the optimal rate-distortion function in the setting of coding for computing with side information and achieves the Berger-Tung sum-rate inner bound in the setting of distributed source coding for computing. It also achieves the El Gamal-Cover inner bound for multiple description coding for computing and is optimal for successive refinement and cascade multiple description problems for computing. Lastly, the benefit of complexity reduction of finding a forward test channel is shown for a class of Markov sources.

关键词： coding for computing functional compression distributed source coding hypergraph

来源：评论

学校读者我要写书评

暂无评论

A Characterization of the Error Exponent for the Byzantine CEO Problem

A Characterization of the Error Exponent for the Byzantine C...

引用

Annual Allerton Conference on Communication, Control, and Computing

作者： Oliver Kosut Lang Tong Cornell University

ISBN: (纸本)9781424429257

The discrete CEO Problem is considered when the agents are under Byzantine attack. That is, a malicious intruder has captured an unknown subset of the agents and reprogrammed them to increase the probability of error. Two traitor models are considered, depending on whether the traitors are able to see honest agents' messages before choosing their own. If they can, bounds are given on the error exponent with respect to the sum-rate as a function of the fraction of agents that are traitors. The number of traitors is assumed to be known to the CEO, but not their identity. If they are not able to see the honest agents' messages, an exact but uncomputable characterization of the error exponent is given. It is shown that for a given sum-rate, the minimum achievable probability of error is within a factor of two of a quantity based on the traitors simulating a false distribution to generate messages they send to the CEO. This false distribution is chosen by the traitors to increase the probability of error as much as possible without revealing their identities to the CEO. Because this quantity is always within a constant factor of the probability of error, it gives the error exponent directly.

关键词： distributed source coding Byzantine Attack Sensor Fusion Network Security

来源：评论

学校读者我要写书评

暂无评论

MAXIMIZING THE LIFETIME OF CLUSTERS WITH SLEPIAN-WOLF coding

MAXIMIZING THE LIFETIME OF CLUSTERS WITH SLEPIAN-WOLF CODING

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Tianqi Wang Wendi Heinzelman Alireza Seyedi Azadeh Vosoughi Electrical and Computer Engineering Department University of Rochester

ISBN: (纸本)9781424442959

In this paper, we propose an iteration-free algorithm to find the optimal configuration, including transmit power and source coding rates, to maximize the lifetime of a cluster utilizing Slepian-Wolf source coding of data sent to a fusion center. Exact closed form solutions are derived when the fusion center is not energy constrained. When the fusion center is energy constrained, a near optimum solution is provided. Numerical results demonstrating the performance of the proposed algorithms are also provided.

关键词： distributed source coding Wireless sensor networks Energy efficiency Lifetime distributed source coding mean life Wireless sensor networks Energy efficiency Fusion reactions FUSION fusion (melting) source coding optimal configuration Closed-form solutions Transmitter power Fusion, biological Clusters

来源：评论

学校读者我要写书评

暂无评论

Q-LDPCA based distributed coding for Asymmetrical Correlated Non-binary sources

Q-LDPCA based Distributed Coding for Asymmetrical Correlated...

引用

9th International Conference on Signal Processing(第九届国际信号处理学术会议)(ICSP'08)

作者： Zun-liang Wang Xue-ming Li Jing Li School of Information Engineering Beijing University of Posts and TelecommunicationsBeijing 100876P School of Information Engineering Beijing University of Posts and Telecommunications Beijing 100876

distributed coding is a new paradigm for compressing correlated distributed sources,based on Slepian-Wolf and Wyner-Ziv *** scheme is appropriate for wireless sensor network and distributed video *** this paper,we address the problem of coding two correlated non-binary sources with asymmetrical statistical dependency using the q-ary low-density parity-check accumulate (Q-LDPCA) *** one hand the use of Q-LDPCA codes in the proposed system makes coding without converting non-binary sources to binary bits feasible,and thus it overcomes the reduction in correlation caused by *** the other hand it makes coding rate varying adaptively with correlation of the correlated sources with asymmetrical statistical dependency,so it is suitable for many practical applications of distributed coding where the correlated sources are highly *** shows that the proposed system performs better than coding by binary LDPC code with conversion first.

关键词： distributed source coding wyner-ziv coding LDPC rate adaptive

来源：评论

学校读者我要写书评

暂无评论

ADAPTIVE-distributed ARITHMETIC coding FOR LOSSLESS COMPRESSION

ADAPTIVE-DISTRIBUTED ARITHMETIC CODING FOR LOSSLESS COMPRESS...

引用

2010 2nd IEEE International Conference on Network Infrasturcture & Digital Content(2010年第二届IEEE网络基础设施与数字内容国际会议 IC-NIDC 2010)

作者： Jechang Jeong Jiaji Wu Licheng Jiao Minli Wang Department of Electronics and Computer Engineering Hanyang University Seoul 133-791 Korea School of Electronic Engineering Xidian University Xi’an 710071 China

distributed arithmetic coding (DAC) is an effective implementation of Slepian–Wolf coding (SWC), especially for short data blocks. However, currently, most of the DAC research methods focus on the lossy compression on the condition that the prior knowledge is known in advance. In order to realize lossless and adaptive compression, in this paper, we propose lossless adaptivedistributed arithmetic coding (LADAC) using the method of EOF (end of the file) and the adaptive encoding. In our proposed LADAC, encoder and decoder can work simultaneously instead of alternatively, and encoder-driven method is also achieved without a feedback channel instead of decoder-driven. Experimental results show that LADAC performs the better compression performance and the lower complexity than conventional lossless distributed arithmetic coding (LDAC).

关键词： distributed source coding arithmetic coding Slepian-Wolf coding Wyner-Ziv coding compression.

来源：评论

学校读者我要写书评

暂无评论

REDUNDANT FRAME STRUCTURE USING M-FRAME FOR INTERACTIVE LIGHT FIELD STREAMING

REDUNDANT FRAME STRUCTURE USING M-FRAME FOR INTERACTIVE LIGH...

引用

IEEE International Conference on Image Processing

作者： Benedicte Motz Gene Cheung Antonio Ortega The Graduate University for Advanced Studies National Institute of Informatics University of Southern California

ISBN: (纸本)9781467399623

A light field (LF) is a 2D array of closely spaced viewpoint images of a static 3D scene. In an interactive LF streaming (ILFS) scenario, a user successively requests desired neighboring viewpoints for observation, and in response the server must transmit pre-encoded data for correct decoding of the requested viewpoint images. Designing frame structures for ILFS is challenging, since at encoding time it is not known what navigation path a user will take, making differential coding very difficult to employ. In this paper, leveraging on a recent work on the merge operator - a new distributed source coding technique that efficiently merges differences among a set of side information (SI) frames into an identical reconstruction - we design redundant frame structures that facilitate ILFS, trading off expected transmission cost with total storage size. Specifically, we first propose a new view interaction model that captures view navigation tendencies of typical users. Assuming a flexible one-frame buffer at the decoder, we then derive a set of recursive equations that compute the expected transmission cost for a navigation lifetime of T views, given the proposed interaction model and a pre-encoded frame structure. Finally, we propose an algorithm that greedily builds a redundant frame structure, minimizing a weighted sum of expected transmission cost and total storage size. Experimental results show that our proposed algorithm generates frame structures with better transmission/storage tradeoffs than competing schemes.

关键词： Interactive streaming Light field distributed source coding

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：