In this note we provide a generalization of a result of Goddard, Raines and Slater [4] on edge-connectivity of permutation graphs for hypergraphs. A permutation hypergraph Gπ is obtained from a hypergraph G by taking two disjoint copies of G and by adding a perfect matching between them. The main tool in the proof of the graph result was the theorem on partition constrained splitting off preser...

Edge detection and edge enhancement techniques play an essential role in interpreting potential field data. This paper describes the application of various edge detection techniques to gravity data in order to delineate the edges of subsurface structures. The edge detection methods comprise analytic signal, total horizontal derivative (THDR), theta angle, tilt angle, hyperbolic of tilt angle (H...

In this paper, we propose an efficient framework for edge-preserving stereo matching. Local methods for stereo matching are more suitable than global methods for real-time applications. Moreover, we can obtain accurate depth maps by using edge-preserving filter for the cost aggregation process in local stereo matching. The computational cost is high, since we must perform the filter for every n...

This paper presents a fast approach for matching stereoscopic images acquired by stereo cameras mounted aboard a moving car. The proposed approach exploits the spatio-temporal consistency between consecutive frames in stereo sequences to improve matching results. This means that the matching process at current frame uses the matching results obtained at its preceding one. The preceding frame al...

Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper, we characterized when equality holds. In this paper, we prove a lower bound for the minimum size of a maximum matching in an l-edge-connected k-regular graph with n vertices, for l ≥ 2 and k ≥ 4. Again it is sharp for...

This paper presents a method for detecting tumors in breast. The tumors detected are circular in shape. The method used for detecting tumor is pixel-based mass detection. It uses template-matching procedure. These templates are defined according to the shape, and brightness of the tumor masses. Prior to template matching, median filtering enhances the mammogram images. High pass filtering enhan...

Let G be an edge-colored graph and v a vertex of G. The color degree of v is the number of colors appearing on the edges incident to v. A rainbow triangle in G is one in which all edges have distinct colors. In this paper, we first prove that an edge-colored graph on n vertices contains a rainbow triangle if the color degree sum of any two adjacent vertices is at least n+ 1. Afterwards, we char...

Many applications such as information retrieval and classification, involve measuring graph distance or similarity, i.e., matching graphs to identify and quantify their common features. Different kinds of graph matchings have been proposed, giving rise to different graph similarity or distance measures. Graph matchings may be univalent – when each vertex is associated with at most one vertex of...

We study the stochastic matching problem on k-uniform hypergraphs. In this problem, we are given a hypergraphH on V vertices. With each hyperedge E, we are given a probability pe of its existence i.e. an edge e exists in the hypergraph with probability pe , independent of all other edges. Each edge also has a weight associated with it. Our goal is to construct a matching with maximum expected w...

In this paper, we propose an efficient framework for edge-preserving stereo matching. Local methods for stereo matching are more suitable than global methods for real-time applications. Moreover, we can obtain accurate depth maps by using edge-preserving filter for the cost aggregation process in local stereo matching. The computational cost is high, since we must perform the filter for every n...