Results 11  20
of
578
Image Segmentation for Object Detection using CRFs with Robust Higher Order Clique Potentials
"... Object recognition is a fundamental problem in computer vision. In this work, an approach for object recognition that combines detection and segmentation is explored. Using the result of segmentation in the detection process leads to significant improvements in the recognition accuracies. Rather tha ..."
Abstract
 Add to MetaCart
than considering a simple pairwise CRF model for the segmentation process, the use of higherorder clique potentials is explored. The results are presented on the PASCAL Visual Object Classes Challenge dataset. 1
Published In Efficient Belief Propagation for Higher Order Cliques Using Linear Constraint Nodes
"... Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems. However, pairwise interactions are often insufficient to capture the full statistics of the problem. Higherorder intera ..."
Abstract
 Add to MetaCart
realvalued variables. We discuss how this technique can be generalized to still wider classes of potential functions at varying levels of efficiency. Also, we develop a form of nonparametric belief representation specifically designed to address issues common to networks with higherorder cliques
SEMANTIC SEGMENTATION OF AERIAL IMAGES IN URBAN AREAS WITH CLASSSPECIFIC HIGHERORDER CLIQUES
"... In this paper we propose an approach to multiclass semantic segmentation of urban areas in highresolution aerial images with classspecific object priors for buildings and roads. What makes model design challenging are highly heterogeneous object appearances and shapes that call for priors beyond ..."
Abstract
 Add to MetaCart
by sampling large sets of putative object candidates. Buildings are represented by sets of compact polygons, while roads are modeled as a collection of long, narrow segments. To obtain the final pixelwise labeling, we use a CRF with higherorder potentials that balances the data term with the object
PROBLEMS AND RESULTS ON 3CHROMATIC HYPERGRAPHS AND SOME RELATED QUESTIONS
 COLLOQUIA MATHEMATICA SOCIETATIS JANOS BOLYAI 10. INFINITE AND FINITE SETS, KESZTHELY (HUNGARY)
, 1973
"... A hypergraph is a collection of sets. This paper deals with finite hypergraphs only. The sets in the hypergraph are called edges, the elements of these edges are points. The degree of a point is the number of edges containing it. The hypergraph is runiform if every edge has r points. A hypergraph i ..."
Abstract

Cited by 311 (0 self)
 Add to MetaCart
is simple if any two edges have at most one common point, and it is called a clique if any two edges have at least one common point. The chromatic number of a hypergraph is the least number k such that the points can be kcolored so that no edge is monochromatic. As far as we know families of sets
Linear time solvable optimization problems on graphs of bounded cliquewidth
, 2000
"... Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones. On graphs of treewidth at most k, i.e., that have tree decompositions of width at most k, where k is fixed, every dec ..."
Abstract

Cited by 170 (24 self)
 Add to MetaCart
decision or optimization problem expressible in monadic secondorder logic has a linear algorithm. We prove that this is also the case for graphs of cliquewidth at most k, where this complexity measure is associated with hierarchical decompositions of another type, and where logical formulas are no longer
Clique Partitions, Graph Compression and Speedingup Algorithms
 Journal of Computer and System Sciences
, 1991
"... We first consider the problem of partitioning the edges of a graph G into bipartite cliques such that the total order of the cliques is minimized, where the order of a clique is the number of vertices in it. It is shown that the problem is NPcomplete. We then prove the existence of a partition of s ..."
Abstract

Cited by 88 (3 self)
 Add to MetaCart
We first consider the problem of partitioning the edges of a graph G into bipartite cliques such that the total order of the cliques is minimized, where the order of a clique is the number of vertices in it. It is shown that the problem is NPcomplete. We then prove the existence of a partition
The number of cliques in graphs of given order and size
, 2008
"... Let kr (n,m) denote the minimum number of rcliques in graphs with n vertices and m edges. For r = 3,4 we give a lower bound on kr (n,m) that approximates kr (n,m) with an error smaller than n r / ( n 2 − 2m). The solution is based on a constraint minimization of certain multilinear forms. Our proo ..."
Abstract

Cited by 31 (1 self)
 Add to MetaCart
Let kr (n,m) denote the minimum number of rcliques in graphs with n vertices and m edges. For r = 3,4 we give a lower bound on kr (n,m) that approximates kr (n,m) with an error smaller than n r / ( n 2 − 2m). The solution is based on a constraint minimization of certain multilinear forms. Our
Which Problems Have Strongly Exponential Complexity?
 Journal of Computer and System Sciences
, 1998
"... For several NPcomplete problems, there have been a progression of better but still exponential algorithms. In this paper, we address the relative likelihood of subexponential algorithms for these problems. We introduce a generalized reduction which we call SubExponential Reduction Family (SERF) t ..."
Abstract

Cited by 242 (11 self)
 Add to MetaCart
) that preserves subexponential complexity. We show that CircuitSAT is SERFcomplete for all NPsearch problems, and that for any fixed k, kSAT, kColorability, kSet Cover, Independent Set, Clique, Vertex Cover, are SERFcomplete for the class SNP of search problems expressible by second order existential
Results 11  20
of
578