Results 1  10
of
14
Beyond Trees: MRF Inference via OuterPlanar Decomposition
, 2010
"... Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NPhard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. trees), or approximate algorithms (e.g. Loopy Belief Propagation (BP) and Treereweighted (TRW) methods). This paper prese ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NPhard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. trees), or approximate algorithms (e.g. Loopy Belief Propagation (BP) and Treereweighted (TRW) methods). This paper presents a unifying perspective of these approximate techniques called “Decomposition Methods”. These are methods that decompose the given problem over a graph into tractable subproblems over subgraphs and then employ message passing over these subgraphs to merge the solutions of the subproblems into a global solution. This provides a new way of thinking about BP and TRW as successive steps in a hierarchy of decomposition methods. Using this framework, we take a principled first step towards extending this hierarchy beyond trees. We leverage a new class of graphs amenable to exact inference, called outerplanar graphs, and propose an approximate inference algorithm called OuterPlanar Decomposition (OPD). OPD is a strict generalization of BP and TRW, and contains both of them as special cases. Our experiments show that this extension beyond trees is indeed very powerful – OPD outperforms current stateofart inference methods on hard nonsubmodular synthetic problems and is competitive on real computer vision applications.
Planar Cycle Covering Graphs
"... We describe a new variational lowerbound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every face of a planar embedding of the graph in order to capture the effect of unary potentials. A ground state of the resulti ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We describe a new variational lowerbound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every face of a planar embedding of the graph in order to capture the effect of unary potentials. A ground state of the resulting approximation can be computed efficiently by reduction to minimumweight perfect matching. We show that optimization of variational parameters achieves the same lowerbound as dualdecomposition into the set of all cycles of the original graph. We demonstrate that our variational optimization converges quickly and provides highquality solutions to hard combinatorial problems 10100x faster than competing algorithms that optimize the same bound.
Tightening MRF Relaxations with Planar Subproblems
"... We describe a new technique for computing lowerbounds on the minimum energy configuration of a planar Markov Random Field (MRF). Our method successively adds large numbers of constraints and enforces consistency over binary projections of the original problem state space. These constraints are repr ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We describe a new technique for computing lowerbounds on the minimum energy configuration of a planar Markov Random Field (MRF). Our method successively adds large numbers of constraints and enforces consistency over binary projections of the original problem state space. These constraints are represented in terms of subproblems in a dualdecomposition framework that is optimized using subgradient techniques. The complete set of constraints we consider enforces cycle consistency over the original graph. In practice we find that the method converges quickly on most problems with the addition of a few subproblems and outperforms existing methods for some interesting classes of hard potentials.
Fast Planar Correlation Clustering for Image Segmentation
, 2012
"... We describe a new optimization scheme for finding highquality clusterings in planar graphs that uses weighted perfect matching as a subroutine. Our method provides lowerbounds on the energy of the optimal correlation clustering that are typically fast to compute and tight in practice. We demonstr ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We describe a new optimization scheme for finding highquality clusterings in planar graphs that uses weighted perfect matching as a subroutine. Our method provides lowerbounds on the energy of the optimal correlation clustering that are typically fast to compute and tight in practice. We demonstrate our algorithm on the problem of image segmentation where this approach outperforms existing global optimization techniques in minimizing the objective and is competitive with the state of the art in producing highquality segmentations.
This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 1 The Optimal FanOut of Clock Network for Po
"... Abstract—Gating of the clock signal in VLSI chips is nowadays a mainstream design methodology for reducing switching power consumption. In this paper we develop a probabilistic model of the clock gating network that allows us to quantify the expected power savings and the implied overhead. Expressio ..."
Abstract
 Add to MetaCart
Abstract—Gating of the clock signal in VLSI chips is nowadays a mainstream design methodology for reducing switching power consumption. In this paper we develop a probabilistic model of the clock gating network that allows us to quantify the expected power savings and the implied overhead. Expressions for the power savings in a gated clock tree are presented and the optimal gater fanout is derived, based on flipflops toggling probabilities and process technology parameters. The resulting clock gating methodology achieves 10 % savings of the total clock tree switching power. The timing implications of the proposed gating scheme are discussed. The grouping of FFs for a joint clocked gating is also discussed. The analysis and the results match the experimental data obtained for a 3D graphics processor and a 16bit microcontroller, both designed at 65nanometer technology. Index Terms—Clock gating, clock networks, clock tree, dynamic power minimization, optimal fanout.
Dynamic PlanarCuts: Efficient . . .
"... This paper deals with Dynamic MAP Inference, where the goal is to solve an instance of the MAP problem given that we have already solved a related instance of the problem. We propose an algorithm for Dynamic MAP Inference in planar Ising models, called Dynamic PlanarCuts. As an application of our p ..."
Abstract
 Add to MetaCart
This paper deals with Dynamic MAP Inference, where the goal is to solve an instance of the MAP problem given that we have already solved a related instance of the problem. We propose an algorithm for Dynamic MAP Inference in planar Ising models, called Dynamic PlanarCuts. As an application of our proposed approach, we show that we can extend the MAP inference algorithm of Schraudolph and Kamenetsky [14] to efficiently compute minmarginals for all variables in the same time complexity as the MAP inference algorithm, which is an O(n) speedup over a naïve approach.
UC Santa Barbara,
"... Abstract. We address the problem of segmenting an image into a previously unknown number of segments from the perspective of graph partitioning. Specifically, we consider minimum multicuts of superpixel affinity graphs in which all affinities between nonadjacent superpixels are negative. We propose ..."
Abstract
 Add to MetaCart
Abstract. We address the problem of segmenting an image into a previously unknown number of segments from the perspective of graph partitioning. Specifically, we consider minimum multicuts of superpixel affinity graphs in which all affinities between nonadjacent superpixels are negative. We propose a relaxation by Lagrangian decomposition and a constrained set of reparameterizations for which we can optimize exactly and efficiently. Our contribution is to show how the planarity of the adjacency graph can be exploited if the affinity graph is nonplanar. We demonstrate the effectiveness of this approach in userassisted image segmentation and show that the solution of the relaxed problem is fast and the relaxation is tight in practice. 1
Learning with DegreeBased Subgraph Estimation
, 2011
"... Networks and their topologies are critical to nearly every aspect of modern life, with social networks governing human interactions and computer networks governing global informationflow. Network behavior is inherently structural, and thus modeling data from networks benefits from explicitly modeli ..."
Abstract
 Add to MetaCart
Networks and their topologies are critical to nearly every aspect of modern life, with social networks governing human interactions and computer networks governing global informationflow. Network behavior is inherently structural, and thus modeling data from networks benefits from explicitly modeling structure. This thesis covers methods for and analysis of machine learning from network data while explicitly modeling one important measure of structure: degree. Central to this work is a procedure for exact maximum likelihood estimation of a distribution over graph structure, where the distribution factorizes into edgelikelihoods for each pair of nodes and degreelikelihoods for each node. This thesis provides a novel method for exact estimation of the maximum likelihood edge structure under the distribution. The algorithm solves the optimization by constructing an augmented graph containing, in addition to the original nodes, auxiliary nodes whose edges encode the degree potentials. The exact solution is then recoverable by finding the maximum weight bmatching on the augmented graph, a wellstudied combinatorial optimization. To solve the combinatorial optimization, this thesis focuses in particular on a belief propagationbased approach to finding the optimal bmatching and provides a novel proof of convergence for belief propagation on the loopy graphical model representing the bmatching objective. Additionally,
Decoding color codes by projection onto surface codes
, 2013
"... We propose a new strategy to decode color codes, which is based on the projection of the error onto three surface codes. This provides a method to transform every decoding algorithm of surface codes into a decoding algorithm of color codes. Applying this idea to a family of hexagonal color codes, wi ..."
Abstract
 Add to MetaCart
We propose a new strategy to decode color codes, which is based on the projection of the error onto three surface codes. This provides a method to transform every decoding algorithm of surface codes into a decoding algorithm of color codes. Applying this idea to a family of hexagonal color codes, with the perfect matching decoding algorithm for the three corresponding surface codes, we find a phase error threshold of approximately 8.7%. Finally, our approach enables us to establish a general lower bound on the error threshold of a family of color codes depending on the threshold of the three corresponding surface codes. These results are based on a chain complex interpretation of surface codes and color codes. 1
Neurocomputing 120 (2013) 453–460 Contents lists available at ScienceDirect
"... journal homepage: www.elsevier.com/locate/neucom A new criterion for choosing planar subproblems ..."
Abstract
 Add to MetaCart
journal homepage: www.elsevier.com/locate/neucom A new criterion for choosing planar subproblems