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

IEEE Information Theory Workshop

作者： Neuhoff, DL Marco, D Univ Michigan Ann Arbor MI 48109 USA

ISBN: (纸本)0780376293

In this paper, we ignore transmission issues and focus on the total number of bits to transmit to the collector to form a reconstruction of the field with a given MSE. We assume that all sensors can transmit bits to the collector without error. With this assumption, with total number of bits as the cost measure, and with the style of coding, it can be argued that sensor-to-sensor relaying offers no advantages. This problem is similar to image coding and transmission, except that the quantization, encoding and transmission are constrained to take place separately at each sensor (pixel location), in contrast to traditional image coding and transmission, wherein the entire image is available for quantization, encoding, and transmission. Due to the need to separately encode values from separate sensors, we pursue a Slepian-Wolf style coding approach.

关键词： source coding mean square error methods sensor fusion rate distortion theory distributed encoding sensor data mean squared error distortion MSE Slepian-Wolf style coding separate sensors continuous-time sources rate-distorti Mean square error source coding Sensor Data Rate distortion theory distributed coding Sensor fusion coding Cost Measures image coding

来源：评论

学校读者我要写书评

暂无评论

Fundamental Limits of distributed Linear encoding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2021年第12期67卷 7985-7998页

作者： Khooshemehr, Nastaran Abadi Maddah-Ali, Mohammad Ali Sharif Univ Technol Dept Elect Engn Tehran *** Iran

In general coding theory, we often assume that error is observed in transferring or storing encoded symbols, while the process of encoding itself is error-free. Motivated by recent applications of coding theory, in this paper, we consider the case where the process of encoding is distributed and prone to error. We introduce the problem of distributed encoding, comprised of a set of K is an element of N isolated source nodes and N is an element of N encoding nodes. Each source node has one symbol from a finite field, which is sent to each of the encoding nodes. Each encoding node stores an encoded symbol from the same field, as a function of the received symbols. However, some of the source nodes are controlled by the adversary and may send different symbols to different encoding nodes. Depending on the number of the adversarial nodes, denoted by beta is an element of N, and the cardinality of the set of symbols that each one generates, denoted by v is an element of N, the process of decoding from the encoded symbols could be impossible. Assume that a decoder connects to an arbitrary subset of t is an element of N encoding nodes and wants to decode the symbols of the honest nodes correctly, without necessarily identifying the sets of honest and adversarial nodes. An important characteristic of a distributed encoding system is t* is an element of N, the minimum of such t, which is a function of K, N, beta, and v. In this paper, we study the distributed linear encoding system, i.e. one in which the encoding nodes use linear coding. We show that t*(Linear) = K+ 2 beta (v- 1), if N >= K+ 2 beta(v-1), and t*(Linear) = N, if N <= K+2 beta(v-1). In order to achieve t*(Linear), we use random linear coding and show that in any feasible solution that the decoder finds, the messages of the honest nodes are decoded correctly. In order to prove the converse of the fundamental limit, we show that when the adversary behaves in a particular way, it can always confuse the decoder bet

关键词： distributed systems distributed encoding sharding blockchain

来源：评论

学校读者我要写书评

暂无评论

Graph Codes for distributed Instant Message Collection in an Arbitrary Noisy Broadcast Network

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2017年第9期63卷 6059-6084页

作者： Yang, Yaoqing Kar, Soummya Grover, Pulkit Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA

We consider the problem of minimizing the number of broadcasts for collecting all sensor measurements at a sink node in a noisy broadcast sensor network. Focusing first on arbitrary network topologies, we provide: 1) fundamental limits on the required number of broadcasts of data gathering and 2) a general in-network computing strategy to achieve an upper bound within factor log N of the fundamental limits, where N is the number of agents in the network. Next, focusing on two example networks, namely, arbitrary geometric networks and random Erds-Renyi networks, we provide improved in-network computing schemes that are optimal in that they attain the fundamental limits, i. e., the lower and upper bounds are tight in scaling sense. Our main techniques are three distributed encoding techniques, called graph codes, which are designed, respectively, for the above-mentioned three scenarios. Our work, thus, extends and unifies previous works such as those of Gallager and Karamchandani on the number of broadcasts for distributed function computation in special network topologies, while bringing in novel techniques, e. g., from error-control coding and noisy circuits, for both upper and lower bounds.

关键词： Coding for distributed computing graph codes noisy networks distributed encoding scaling bounds

来源：评论

学校读者我要写书评

暂无评论

Packet-centric approach to distributed sparse-graph coding in wireless ad hoc networks

引用

AD HOC NETWORKS 2013年第1期11卷 167-181页

作者： Stefanovic, Cedomir Vukobratovic, Dejan Stankovic, Vladimir Fantacci, Romano Univ Novi Sad Dept Power Elect & Commun Engn Novi Sad 21000 Serbia Univ Strathclyde Dept Elect & Elect Engn Glasgow G1 1XW Lanark Scotland Univ Florence Dept Elect & Commun Engn Florence Italy Univ Florence Elect & Telecommun Dept Florence Italy

In this paper we present a packet-centric approach for distributed coding in decentralized wireless ad hoc networks, for applications in distributed data storage, data persistence and efficient data gathering. We study the setting where each of N network nodes generates an information packet and the goal is to efficiently encode information packets and disseminate produced encoded packets across the network in such fashion that gathering of any subset of slightly more than N encoded packets allows for retrieval of the original information. The process of distributed encoding is performed using packets that randomly walk over the network and sample information packets from network nodes, producing the encoded packets in a simple, elegant, fully decentralized and stateless way. The proposed scheme maintains properties of centralized codes in terms of performance parameters, offering at the same time advantage of robustness to node failures and changes in network topology. We specialize the proposed scheme for several important classes of low-complexity encodable/decodable sparse-graph codes - LDGM, LDPC (IRA), LT, and Raptor codes, evaluating its performance via simulation for various data-gathering scenarios. (C) 2011 Elsevier B.V. All rights reserved.

关键词： distributed encoding Sparse-graph codes Wireless ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Soft Information Relaying for distributed Turbo Product Codes (SIR-DTPC)

引用

IEEE SIGNAL PROCESSING LETTERS 2010年第4期17卷 363-366页

作者： Obiedat, Esam A. Cao, Lei Univ Mississippi University MS 38677 USA

In this letter, we propose a distributed Turbo Product Code (DTPC) with soft information relaying over cooperative network using block Extended Bose Chaudhuri Hochquenghem (EBCH) codes as component codes. The source broadcasts extended EBCH coded frames to the destination and to a preassigned relay. After soft-decoding, the received sequences and obtaining the Log-Likelihood Ratio (LLR) values, the relay constructs a product code by arranging the decoded bit sequences in rows and re-encoding them along the columns using a novel soft block encoding technique to obtain soft parity bits with different reliabilities that can be used as soft Incremental Redundancy (IR) that is forwarded to the destination. We compared the simulation results in Additive White Gaussian Noise (AWGN) channel with our previous work for Decode and Forward (DF) DTPC and with noncooperative case. The proposed system shows better Bit Error Rate (BER) performance and less sensitivity to the relay's position.

关键词： BCH codes cooperative systems distributed encoding Turbo Product Codes soft encoding soft relaying

来源：评论

学校读者我要写书评

暂无评论

VAE for Joint Source-Channel Coding of distributed Gaussian Sources over AWGN MAC 21

VAE for Joint Source-Channel Coding of Distributed Gaussian ...

引用

21st IEEE International Workshop on Signal Processing Advances in Wireless Communications (IEEE SPAWC)

作者： Saidutla, Yashas Malur Abdi, Afshin Fekri, Faramarz Georgia Inst Technol Sch ECE Atlanta GA 30332 USA

ISBN: (纸本)9781728154787

In this paper, we introduce a framework for Joint Source-Channel Coding of distributed Gaussian sources over a multiple access AWGN channel. Although there are prior works that have studied this, they either strongly rely on intuition to design encoders and decoder or require the knowledge of the complete joint distribution of all the distributed sources. Our system overcomes this. We model our system as a Variational Autoencoder and leverage insight provided by this connection to propose a crucial regularization mechanism for learning. This allows us to beat the state of the art by improving the signal reconstruction quality by almost 1dB for certain configurations. The end-to-end learned system is also found to be robust to channel condition variations of +/- 5dB and shows a drop in signal reconstruction quality by at most 1dB. Finally, we propose a novel lower bound on the optimal distortion in signal reconstruction and empirically showcase the tightness of the bound in comparison with the existing bound.

关键词： joint source-channel coding distributed encoding multiple access channels machine learning deep learning

来源：评论

学校读者我要写书评

暂无评论

Severe-occluded 3D object identification via region-based descriptions

引用

SIGNAL PROCESSING-IMAGE COMMUNICATION 2017年 58卷 240-257页

作者： Escudero-Vinolo, Marcos Bescos, Jesus Univ Autonoma Madrid Escuela Politecn Super Video Proc & Understanding Lab Madrid Spain

This paper describes a region-based strategy for part-based object identification with independence of the external factors that affect its captured image: light variations, capture point-of-view or occlusions. Starting from color images and depth estimations, i.e. not requiring 3-dimensional models, we focus on the identification of learned objects in severe-occlusion scenarios. To face this problem, we assume that objects have been preliminarily segregated from the scene. Strong changes of appearance-due to one or several of the aforementioned factors or to the object nature, e.g. deformable objects-substantially increase the problem complexity. The proposed algorithm operates by splitting segregated objects in successively coarser region-partitions, with each region representing a part of the object from which it was extracted. For the characterization of these parts, two region driven descriptors are proposed: R-DAISY and R-SHOT. Their novelty relies on the use of a size-and-shape variable description support which is automatically defined by the object part itself. Descriptions obtained in this way are self-organized in a single neural structure by an unsupervised learning process. Experimental results are promising in the identification of severe-occluded objects using a small set of training instances-1-to-8 short-varied views per object. (C) 2017 Elsevier B.V. All rights reserved.

关键词： 3D-object identification Severe-occlusion Region-based PoI descriptions Identification in clutter Self-organized maps distributed encoding

来源：评论

学校读者我要写书评

暂无评论

Perfect failure detection with very few bits

引用

INFORMATION AND COMPUTATION 2020年 275卷 104604-104604页

作者： Fraigniaud, Pierre Rajsbaum, Sergio Travers, Corentin Kuznetsov, Petr Rieutord, Thibault CNRS Paris France Univ Paris Paris France Univ Nacl Autonoma Mexico Inst Matemat Mexico City DF Mexico Univ Bordeaux LaBRI Bordeaux France Inst Polytech Paris Telecom Paris LTCI Paris France CEA LIST PC 174 F-91191 Gif Sur Yvette France

A failure detector is a distributed oracle that provides each process with a module that continuously outputs an estimate of which processes in the system have failed. The perfect failure detector provides accurate and eventually complete information about process failures. We show that, in asynchronous failure-prone message-passing systems, perfect failure detection can be achieved using an oracle that outputs at most [log alpha(n)] + 1 bits per process in n-process systems, where alpha denotes the inverse-Ackermann function. This result is essentially optimal, as we also show that, in the same environment, no failure detector outputting a constant number of bits per process can achieve perfect failure detection. (C) 2020 Elsevier Inc. All rights reserved.

关键词： Failure detectors Well-quasi-order Higman's lemma distributed encoding

来源：评论

学校读者我要写书评

暂无评论

CLASSIFICATION OF TRAJECTORIES - EXTRACTING INVARIANTS WITH A NEURAL-NETWORK

引用

NEURAL NETWORKS 1993年第7期6卷 1011-1017页

作者： KINDER, M BRAUER, W Technische Universit&auml t M&uuml nchen Germany

A neural classifier of planar trajectories is presented. There already exist a large variety of classifiers that are specialized in particular invariants contained in a trajectory classification task such as position-invariance, rotation-invariance, and size-invariance. That is, there exist classifiers specialized in recognizing trajectories, eg., independently of their position. The neural classifier presented in this paper is not restricted to certain invariants in a task: The neural network itself extracts the invariants contained in a classification task by assessing only the trajectories. The trajectories need to be given as a set of points. No additional information must be available for training, which saves the designer from determining the needed invariants by himself Besides its applicability to real-world problems, such a more general classifier is also cognitively plausible: In assessing trajectories for classification, human beings are able to find class specific features no matter what kinds of invariants they are confronted with, Invariants are easily handled by ignoring unspecific features.

关键词： INVARIANT REPRESENTATION TASK-DEPENDENT SIMILARITY MEASURE TOPOLOGICAL distributed encoding WICKEL FEATURES TUPLE CODING DELTA RULE PERCEPTRON

来源：评论

学校读者我要写书评

暂无评论

The Capacity Region of a Class of Z Channels With Degraded Message Sets

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第10期60卷 6144-6153页

作者： Liu, Nan Kang, Wei Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Jiangsu Peoples R China Southeast Univ Sch Informat Sci & Engn Nanjing 210096 Jiangsu Peoples R China

We study a two-transmitter two-receiver network where Receiver 1 can only hear the transmitted signal of Transmitter 1. Transmitter 1 has two messages, one of which is intended for Receiver 1 while both are intended for Receiver 2. Transmitter 2 has one message which is intended for Receiver 2. We call this channel model the Z channel with degraded message sets. For networks with the element of distributed encoding, it has been shown that when the multiple access link between the two encoders and the decoder satisfies the conditions proposed by Liu and Goldsmith, capacity results can be obtained for a variety of problems. In this paper, we generalize these conditions and show that for a larger class of multiple access links, the capacity region of the Z channel with degraded message sets can be characterized despite the presence of distributed encoding.

关键词： Capacity degraded message sets distributed encoding Z channel

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：