#### Filter Results:

- Full text PDF available (44)

#### Publication Year

1999

2016

- This year (0)
- Last 5 years (10)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Jonathan S. Yedidia, William T. Freeman, Yair Weiss
- IEEE Transactions on Information Theory
- 2005

Important inference problems in statistical physics, computer vision, error-correcting coding theory, and artificial intelligence can all be reformulated as the computation of marginal probabilities on factor graphs. The belief propagation (BP) algorithm is an efficient way to solve these problems that is exact when the factor graph is a tree, but only… (More)

- Jonathan S. Yedidia, William T. Freeman, Yair Weiss
- NIPS
- 2000

Belief propagation (BP) was only supposed to work for tree-like networks but works surprisingly well in many applications involving networks with loops, including turbo codes. However, there has been little understanding of the algorithm or the nature of the solutions it finds for general graphs. We show that BP can only converge to a stationary point of an… (More)

This is an updated and expanded version of TR2000-26, but it is still in draft form. Belief propagation (BP) was only supposed to work for tree-like networks but works surprisingly well in many applications involving networks with loops, including turbo codes. However, there has been little understanding of the algorithm or the nature of the solutions it… (More)

- Emin Martinian, Jonathan S. Yedidia
- ArXiv
- 2003

We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is the dual of the binary erasure channel (BEC) coding problem. We show that duals of capacity achieving codes for the BEC yield codes which approach the minimum possible rate for the… (More)

- Andreas F. Molisch, Neelesh B. Mehta, Jonathan S. Yedidia, Jin Zhang
- IEEE Trans. Wireless Communications
- 2007

Cooperative communications, where parallel relays forward information to a destination node, can greatly improve the energy efficiency and latency in ad-hoc networks. However, current networks do not fully exploit its potential, as they only use traditional energy-accumulation, which is often used in conjunction with repetition coding or cooperative… (More)

- David B. Anderson, James L. Frankel, +7 authors Jonathan S. Yedidia
- SIGGRAPH
- 2000

Construction toys are a superb medium for geometric models. We argue that such toys, suitably instrumented or sensed, could be the inspiration for a new generation of easy-to-use, tangible modeling systems—especially if the tangible modeling is combined with graphical-interpretation techniques for enhancing nascent models automatically. The three key… (More)

We study the performance of the newly invented rateless codes (LTand Raptor codes) on noisy channels such as the BSC and the AWGN channel. We find that Raptor codes outperform LT codes, and have good performance on a wide variety of noisy channels. To be published in the Proceedings of the International Symposium on Information Theory, 2004. This work may… (More)

- David Anderson, James L. Frankel, +4 authors Kathy Ryall
- ACM Symposium on User Interface Software and…
- 1999

We describe a tangible interface for building virtual structures using physical building blocks. We demonstrate two applications of our system. In one version, the blocks are used to construct geometric models of objects and structures for a popular game, Quake II™. In another version, buildings created with our blocks are rendered in different… (More)

Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are even greater when nodes perform mutual-information accumulation, e.g., by using rateless codes. In this paper, we investigate routing problems in such networks. Given a network, a… (More)

- Yagiz Sutcu, Shantanu Rane, Jonathan S. Yedidia, Stark C. Draper, Anthony Vetro
- 2008 IEEE International Symposium on Information…
- 2008

We present an information-theoretically secure biometric storage system using graph-based error correcting codes in a Slepian-Wolf coding framework. Our architecture is motivated by the noisy nature of personal biometrics and the requirement to provide security without storing the true biometric at the device. The principal difficulty is that real biometric… (More)