Suppose we have a set of items V along with a set of allowed pairings of items E : V × V , which defines a graph G = (V,E). A matching on this graph is a subset of edges E′ ⊆ E such that each vertex in V participates in at most one edge in E′. Call V ′ the set of vertices that participate in some edge e ∈ E′, and let M = (V ′, E′) denote a matching. Depending on additional requirements, we may ...

A matching in a graph G is a collection of non-intersecting edges. The matching is induced if no two edges in the matching are joined by an edge in G. This paper studies the complexity of nding a largest induced matching when the input graph is a tree. We describe the rst linear time algorithm for this problem.

Abstract Semantic segmentation of parts objects is a marginally explored and challenging task in which multiple instances within those must be recognized an image. We introduce novel approach (GMENet) for this combining object-level context conditioning, part-level spatial relationships, shape contour information. The first target achieved by introducing class-conditioning module that enforces ...

A matching M in a graph is called induced if there is no edge in the graph connecting two edges of M. The strong edge coloring problem is to nd an edge coloring of a given graph with minimum number of colors such that each color class is an induced matching. This problem is known to be NP-complete, even in very restricted cases. Here, we show that it can be solved in polynomial time on graphs w...

Aharoni and Berger conjectured that in any bipartite multigraph that is properly edge-coloured by n colours with at least n + 1 edges of each colour there must be a matching that uses each colour exactly once. In this paper we consider the same question without the bipartiteness assumption. We show that in any multigraph with edge multiplicities o(n) that is properly edge-coloured by n colours ...

We present an object recognition system based on symbolic graphs with object corners as vertices and outlines as edges. Corners are determined in a robust way by a multiscale combination of an operator modeling cortical end-stopped cells. Graphs are constructed by line-following between corners. Model matching is then done by nding subgraph isomorphisms in the image graph. The complexity is red...

Consider a complete weighted bipartite graph G in which each left vertex u has two real numbers intercept and slope, each right vertex v has a real number quality, and the weight of any edge (u, v) is defined as the intercept of u plus the slope of u times the quality of v. Let m (resp., n) denote the number of left (resp., right) vertices, and assume that m ≥ n. We develop a fast algorithm for...

A new method for plane hypothesis generation based on a sweeping process is presented. The method is feature based in contradiction to earlier methods which rely on image correlation. The features used are edgel elements (’edgels’) which are extracted in a preprocessing step. The experiments show an improvement in speed as well as in accuracy.

This paper describes techniques to perform eecient and accurate recognition in diicult domains by matching dense, oriented edge pixels. We model three-dimensional objects as the set of two-dimensional views of the object. Translation, rotation, and scaling of the views are allowed to approximate full three-dimensional motion. A modiied Hausdorr measure is used to determine which transformations...