In this paper, a motion field representation algorithm based on directional edge information has been developed. This work is aiming at building an ego-motion detection system using dedicated VLSI chips developed for real time motion field generation at low powers [1], [2]. Directional edge maps are utilized instead of original gray-scale images to represent local features of an image and to de...

A motion field generation algorithm using block matching of edge-flag histograms has been developed aiming at its application to motion recognition systems. Use of edge flags instead of pixel intensities has made the algorithm robust against illumination changes. In order to detect local motions of interest effectively, a new adaptive frame interval adjustment scheme has been introduced in whic...

we find recursive formulae for the number of perfect matchings in a graph g by splitting g into subgraphs h and q. we use these formulas to count perfect matching of p hypercube qn. we also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in g, is the graph constructed from by deleting edges with an en...

Introduction: Treatment with megavoltage electron beams is ideal for irradiating superficial tumors because of their limited range in tissues. However, for electron treatment of extended areas, such as the chest wall, two or more adjacent fields can be used. Abutment of these fields may lead to significant dose in homogeneities in the junction region. The aim of this study is to offer a new met...

Background: Craniospinal irradiation (CSI) of medulloblastoma poses technological challenges due to the involvement of large treatment volume. Commonly, the whole treatment length is covered with two different isocentric plans in which the junction is shifted after every five fractions to overcome the possibility of hot and cold spot.Objective: This study aims to evaluate dosimetrically and cli...

We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...

The scattering of a fluid-structure coupled wave at a flanged junction between two flexible waveguides is investigated. The flange is assumed to be rigid on one side and soft on the other; this enables a solution to be formulated using mode-matching. It is shown that both the choice of the edge conditions imposed on the plates at the junction and the choice of incident forcing significantly aff...

Let (G,C) be an edge-colored bipartite graph with bipartition (X,Y ). A heterochromatic matching of G is such a matching in which no two edges have the same color. Let N c(S) denote a maximum color neighborhood of S ⊆ V (G). We show that if |N c(S)| ≥ |S| for all S ⊆ X, then G has a heterochromatic matching with cardinality at least d |X| 3 e. We also obtain that if |X| = |Y | = n and |N c(S)| ...