In this paper, we present an algorithm for parsing natural images into middle level vision representations—regions, curves, and curve groups (parallel curves and trees). This algorithm is targeted for an integrated solution to image segmentation and curve grouping through Bayesian inference. The paper makes the following contributions. (1) It adopts a layered (or 2.1D-sketch) representation integrating both region and curve models which compete to explain an input image. The curve layer occludes the region layer and curves observe a partial order occlusion relation. (2) A Markov chain search scheme Metropolized Gibbs Samplers (MGS) is studied. It consists of several pairs of reversible jumps to traverse the complex solution space. An MGS pr...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
This paper approaches the problem of geometric multi-model fitting as a data segmentation problem. T...
Abstract—Many vision tasks can be formulated as graph partition problems that minimize energy functi...
In this paper, we present an algorithm for parsing natural images into middle level vision represent...
Natura scenes consist of a wide variety of stochastic patterns. While many patterns are represented ...
Abstract. We present an algorithm to generate samples from probability distributions on the space of...
Vision tasks, such as segmentation, grouping, recognition, and learning, have a "what-goes-with-what...
In this paper we present a Bayesian framework for parsing images into their constituent visual patte...
Many vision tasks, such as segmentation, grouping, and recognition can be formulated as graph partit...
Markov chain Monte Carlo (MCMC) methods have been used in many fields (physics, chemistry, biology, ...
We consider the problem of deriving a global interpretation of an image in terms of a small set of s...
The identification of centres of clustering is of interest in many areas of applications, for instan...
We present an algorithm that extracts curves from a set of edgels within a specific class in a decre...
Maßmann S, Sagerer G, Posch S. Using Markov Random Fields for Contour-Based Grouping. In: Proceedin...
AbstractÐThis paper presents a computational paradigm called Data-Driven Markov Chain Monte Carlo �D...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
This paper approaches the problem of geometric multi-model fitting as a data segmentation problem. T...
Abstract—Many vision tasks can be formulated as graph partition problems that minimize energy functi...
In this paper, we present an algorithm for parsing natural images into middle level vision represent...
Natura scenes consist of a wide variety of stochastic patterns. While many patterns are represented ...
Abstract. We present an algorithm to generate samples from probability distributions on the space of...
Vision tasks, such as segmentation, grouping, recognition, and learning, have a "what-goes-with-what...
In this paper we present a Bayesian framework for parsing images into their constituent visual patte...
Many vision tasks, such as segmentation, grouping, and recognition can be formulated as graph partit...
Markov chain Monte Carlo (MCMC) methods have been used in many fields (physics, chemistry, biology, ...
We consider the problem of deriving a global interpretation of an image in terms of a small set of s...
The identification of centres of clustering is of interest in many areas of applications, for instan...
We present an algorithm that extracts curves from a set of edgels within a specific class in a decre...
Maßmann S, Sagerer G, Posch S. Using Markov Random Fields for Contour-Based Grouping. In: Proceedin...
AbstractÐThis paper presents a computational paradigm called Data-Driven Markov Chain Monte Carlo �D...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
This paper approaches the problem of geometric multi-model fitting as a data segmentation problem. T...
Abstract—Many vision tasks can be formulated as graph partition problems that minimize energy functi...