English
Related papers

Related papers: Sensing Capacity for Markov Random Fields

200 papers

This paper demonstrates fundamental limits of sensor networks for detection problems where the number of hypotheses is exponentially large. Such problems characterize many important applications including detection and classification of…

Information Theory · Computer Science 2016-11-17 Yaron Rachlin , Rohit Negi , Pradeep Khosla

In this paper we address the problem of finding the sensing capacity of sensor networks for a class of linear observation models and a fixed SNR regime. Sensing capacity is defined as the maximum number of signal dimensions reliably…

Information Theory · Computer Science 2007-07-13 Shuchin Aeron , Manqi Zhao , Venkatesh Saligrama

Recently, it has been shown that the max flow capacity can be achieved in a multicast network using network coding. In this paper, we propose and analyze a more realistic model for wireless random networks. We prove that the capacity of…

Information Theory · Computer Science 2008-11-11 Salah A. Aly , Vishal Kapoor , Jie Meng , Andreas Klappenecker

In this paper, we study network coding capacity for random wireless networks. Previous work on network coding capacity for wired and wireless networks have focused on the case where the capacities of links in the network are independent. In…

Information Theory · Computer Science 2007-08-23 Zhenning Kong , Salah A. Aly , Emina Soljanin , Edmund M. Yeh , Andreas Klappenecker

We present an alternative take on the recently popularized concept of `\textit{joint sensing and communications}', which focuses on using communication resources also for sensing. Here, we propose the opposite, where we utilize the…

Information Theory · Computer Science 2025-07-29 Mohammad Kazemi , Tolga M. Duman , Deniz Gündüz

Markov networks are frequently used in sciences to represent conditional independence relationships underlying observed variables arising from a complex system. It is often of interest to understand how an underlying network differs between…

Methodology · Statistics 2021-04-26 Byol Kim , Song Liu , Mladen Kolar

Previous work on network coding capacity for random wired and wireless networks have focused on the case where the capacities of links in the network are independent. In this paper, we consider a more realistic model, where wireless…

Information Theory · Computer Science 2008-11-11 Zhenning Kong , Salah A. Aly , Emina Soljanin , Edmund M. Yeh , Andreas Klappenecker

For a general sensory system following an external stochastic signal, we introduce the sensory capacity. This quantity characterizes the performance of a sensor: sensory capacity is maximal if the instantaneous state of the sensor has as…

Statistical Mechanics · Physics 2016-02-11 David Hartich , Andre C. Barato , Udo Seifert

Exploiting intrinsic structures in sparse signals underpins the recent progress in compressive sensing (CS). The key for exploiting such structures is to achieve two desirable properties: generality (\ie, the ability to fit a wide range of…

Signal Processing · Electrical Eng. & Systems 2018-12-26 Suwichaya Suwanwimolkul , Lei Zhang , Dong Gong , Zhen Zhang , Chao Chen , Damith C. Ranasinghe , Qinfeng Shi

We study a fading linear finite-field relay network having multiple source-destination pairs. Because of the interference created by different unicast sessions, the problem of finding its capacity region is in general difficult. We observe…

Information Theory · Computer Science 2009-05-12 Sang-Woon Jeon , Sae-Young Chung

Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained system is limited by the combinatorial capacity of the system…

Information Theory · Computer Science 2008-09-09 Georg Böcherer , Valdemar Cardoso da Rocha , Cecilio Pimentel

In this paper, we analyze various critical transmitting/sensing ranges for connectivity and coverage in three-dimensional sensor networks. As in other large-scale complex systems, many global parameters of sensor networks undergo phase…

Data Structures and Algorithms · Computer Science 2007-05-23 Vlady Ravelomanana

This paper shows how a folded Markov chain network can be applied to the problem of processing data from multiple sensors, with an emphasis on the special case of 2 sensors. It is necessary to design the network so that it can transform a…

Neural and Evolutionary Computing · Computer Science 2010-12-21 S P Luttrell

We consider a crucial aspect of self-organization of a sensor network consisting of a large set of simple sensor nodes with no location hardware and only very limited communication range. After having been distributed randomly in a given…

Data Structures and Algorithms · Computer Science 2007-05-23 Sandor P. Fekete , Alexander Kroeller , Dennis Pfisterer , Stefan Fischer , Carsten Buschmann

Optimal sensor scheduling with applications to networked estimation and control systems is considered. We model sensor measurement and transmission instances using jumps between states of a continuous-time Markov chain. We introduce a cost…

Optimization and Control · Mathematics 2014-05-07 Farhad Farokhi , Karl H. Johansson

According to the theory of efficient coding, sensory systems are adapted to represent natural scenes with high fidelity and at minimal metabolic cost. Testing this hypothesis for sensory structures performing non-linear computations on high…

Neurons and Cognition · Quantitative Biology 2018-04-13 Ulisse Ferrari , Christophe Gardella , Olivier Marre , Thierry Mora

The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. The channel state is unknown at the transmitter, but observations of…

Information Theory · Computer Science 2015-06-25 Michael Heindlmaier , Shirin Saeedi Bidokhti

Markov random fields are used to model high dimensional distributions in a number of applied areas. Much recent interest has been devoted to the reconstruction of the dependency structure from independent samples from the Markov random…

Computational Complexity · Computer Science 2010-03-09 Guy Bresler , Elchanan Mossel , Allan Sly

In this paper we propose the capacity optimization over sensing threshold for sensing-based cognitive radio networks. The objective function of the proposed optimization is to maximize the capacity at the secondary user subject to the…

Information Theory · Computer Science 2013-01-29 Fotis Foukalas , George T. Karetsos , Lazaros Merakos

This paper introduces an objective function that seeks to minimise the average total number of bits required to encode the joint state of all of the layers of a Markov source. This type of encoder may be applied to the problem of optimising…

Neural and Evolutionary Computing · Computer Science 2007-05-23 Stephen Luttrell
‹ Prev 1 2 3 10 Next ›