In this paper, the authors splice together an image which has been split up on a piece of paper by using duplication detection. The nearest pieces are connected using edge searching and matching and the pieces that have graphics or textures are matched using the edge shape and intersection between the two near pieces. Thus, the initial step is to mark the direction of each piece and put the pie...

Suppose that k is a non-negative integer and a bipartite multigraph G is the union of N = ⌊ k + 2 k + 1 n ⌋ − (k + 1) matchings M1, . . . ,MN , each of size n. We show that G has a rainbow matching of size n− k, i.e. a matching of size n− k with all edges coming from different Mi’s. Several choices of parameters relate to known results and conjectures. Suppose that a multigraph G is given with ...

In this paper, we show that the edge set of a cubic graph can always be partitioned into 10 subsets, each of which induces a matching in the graph. This result is a special case of a general conjecture made by Erdos and NeSetiil: For each d 2 3, the edge set of a graph of maximum degree d can always be partitioned into [5d2/4] subsets each of which induces a matching.

The distance transform has been proposed for use in computer vision for a number of applications such as matching and skeletonisation. This paper proposes two things: (1) a multi-scale distance transform to overcome the need to choose edge thresholds and scale and (2) the addition of various saliency factors such as edge strength, length and curvature to the basic distance transform to improve ...

An edge coloring of a graph G is a process of assigning colors to the adjacent edges so that the adjacent edges represents the different colors. In this paper, an algorithm is proposed to find the perfect color matching of the regular bipartite multigraph with low time complexity. For that, the proposed algorithm is divided into two procedures. In the first procedure, the possible circuits and ...

Let HPn,m,k be drawn uniformly from all m-edge, k-uniform, k-partite hypergraphs where each part of the partition is a disjoint copy of [n]. We let HP (κ) n,m,k be an edge colored version, where we color each edge randomly from one of κ colors. We show that if κ = n and m = Kn log n where K is sufficiently large then w.h.p. there is a rainbow colored perfect matching. I.e. a perfect matching in...