26 research outputs found
Quasi-graphic matroids
Frame matroids and lifted-graphic matroids are two interesting generalizations of graphic matroids. Here we introduce a new generalization, quasi-graphic matroids, that unifies these two existing classes. Unlike frame matroids and lifted-graphic matroids, it is easy to certify that a matroid is quasi-graphic. The main result of the paper is that every 3-connected representable quasi-graphic matroid is either a lifted-graphic matroid or a rame matroid
Describing Quasi-Graphic Matroids
The class of quasi-graphic matroids recently introduced by Geelen, Gerards,
and Whittle generalises each of the classes of frame matroids and
lifted-graphic matroids introduced earlier by Zaslavsky. For each biased graph
Zaslavsky defined a unique lift matroid
and a unique frame matroid , each on ground set . We
show that in general there may be many quasi-graphic matroids on and
describe them all. We provide cryptomorphic descriptions in terms of subgraphs
corresponding to circuits, cocircuits, independent sets, and bases. Equipped
with these descriptions, we prove some results about quasi-graphic matroids. In
particular, we provide alternate proofs that do not require 3-connectivity of
two results of Geelen, Gerards, and Whittle for 3-connected matroids from their
introductory paper: namely, that every quasi-graphic matroid linearly
representable over a field is either lifted-graphic or frame, and that if a
matroid has a framework with a loop that is not a loop of then is
either lifted-graphic or frame. We also provide sufficient conditions for a
quasi-graphic matroid to have a unique framework.
Zaslavsky has asked for those matroids whose independent sets are contained
in the collection of independent sets of while containing
those of , for some biased graph . Adding a
natural (and necessary) non-degeneracy condition defines a class of matroids,
which we call biased graphic. We show that the class of biased graphic matroids
almost coincides with the class of quasi-graphic matroids: every quasi-graphic
matroid is biased graphic, and if is a biased graphic matroid that is not
quasi-graphic then is a 2-sum of a frame matroid with one or more
lifted-graphic matroids
Representations of even-cycle and even-cut matroids
In this thesis, two classes of binary matroids will be discussed: even-cycle and even-cut matroids, together with problems which are related to their graphical representations. Even-cycle and even-cut matroids can be represented as signed graphs and grafts, respectively. A signed graph is a pair where is a graph and is a subset of edges of .
A cycle of is a subset of edges of such that every vertex of the subgraph of induced by has an even degree. We say that is even in if is even. A matroid is an even-cycle matroid if there exists a signed graph such that circuits of precisely corresponds to inclusion-wise minimal non-empty even cycles of . A graft is a pair where is a graph and is a subset of vertices of such that each component of contains an even number of vertices in . Let be a subset of vertices of and let be a cut of . We say that is even in if is even. A matroid is an even-cut matroid if there exists a graft such that circuits of corresponds to inclusion-wise minimal non-empty even cuts of .\\
This thesis is motivated by the following three fundamental problems for even-cycle and even-cut matroids with their graphical representations.
(a) Isomorphism problem: what is the relationship between two representations?
(b) Bounding the number of representations: how many representations can a matroid have?
(c) Recognition problem: how can we efficiently determine if a given matroid is in the class? And how can we find a representation if one exists?
These questions for even-cycle and even-cut matroids will be answered in this thesis, respectively. For Problem (a), it will be characterized when two -connected graphs and have a pair of signatures such that and represent the same even-cycle matroids. This also characterize when and have a pair of terminal sets such that and represent the same even-cut matroid.
For Problem (b), we introduce another class of binary matroids, called pinch-graphic matroids, which can generate expo\-nentially many representations even when the matroid is -connected. An even-cycle matroid is a pinch-graphic matroid if there exists a signed graph with a blocking pair. A blocking pair of a signed graph is a pair of vertices such that every odd cycles intersects with at least one of them. We prove that there exists a constant such that if a matroid is even-cycle matroid that is not pinch-graphic, then the number of representations is bounded by . An analogous result for even-cut matroids that are not duals of pinch-graphic matroids will be also proven. As an application, we construct algorithms to solve Problem (c) for even-cycle, even-cut matroids. The input matroids of these algorithms are binary, and they are given by a -matrix over the finite field \gf(2). The time-complexity of these algorithms is polynomial in the size of the input matrix
Discrete Optimization Methods for Segmentation and Matching
This dissertation studies discrete optimization methods for several computer vision problems. In the first part, a new objective function for superpixel segmentation is proposed. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term. The entropy rate favors formation of compact and homogeneous clusters, while the balancing function encourages clusters with similar sizes. I present a new graph construction for images and show that this construction induces a matroid. The segmentation is then given by the graph topology which maximizes the objective function under the matroid constraint. By exploiting submodular and monotonic properties of the objective function, I develop an efficient algorithm with a worst-case performance bound of for the superpixel segmentation problem. Extensive experiments on the Berkeley segmentation benchmark show the proposed algorithm outperforms the state of the art in all the standard evaluation metrics.
Next, I propose a video segmentation algorithm by maximizing a submodular objective function subject to a matroid constraint. This function is similar to the standard energy function in computer vision with unary terms, pairwise terms from the Potts model, and a novel higher-order term based on appearance histograms. I show that the standard Potts model prior, which becomes non-submodular for multi-label problems, still induces a submodular function in a maximization framework. A new higher-order prior further enforces consistency in the appearance histograms both spatially and temporally across the video. The matroid constraint leads to a simple algorithm with a performance bound of . A branch and bound procedure is also presented to improve the solution computed by the algorithm.
The last part of the dissertation studies the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been proposed for the problem, chamfer matching remains to be the preferred method when speed and robustness are considered. In this dissertation, I significantly improve the accuracy of chamfer matching while reducing the computational time from linear to sublinear (shown empirically). It is achieved by incorporating edge orientation information in the matching algorithm so the resulting cost function is piecewise smooth and the cost variation is tightly bounded. Moreover, I present a sublinear time algorithm for exact computation of the directional chamfer matching score using techniques from 3D distance transforms and directional integral images. In addition, the smooth cost function allows one to bound the cost distribution of large neighborhoods and skip the bad hypotheses. Experiments show that the proposed approach improves the speed of the original chamfer matching up to an order of 45 times, and it is much faster than many state of art techniques while the accuracy is comparable. I further demonstrate the application of the proposed algorithm in providing seamless operation for a robotic bin picking system
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09)
The Symposium on Theoretical Aspects of Computer Science (STACS) is held alternately in France and in Germany. The conference of February 26-28, 2009, held in Freiburg, is the 26th in this series. Previous meetings took place in Paris (1984), Saarbr¨ucken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), W¨urzburg (1993), Caen (1994), M¨unchen (1995), Grenoble (1996), L¨ubeck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), Berlin (2003), Montpellier (2004), Stuttgart (2005), Marseille (2006), Aachen (2007), and Bordeaux (2008). ..