Abstract: In our examination, a powerful algorithm for plate recognition which is able to recognize plates having different dimensions in unaccustomed and complicated backgrounds.License plate detection is first step in ANPR systems. The paper defines an algorithm to detect license plate.The plate is detected based on its edge density features. Integral edge image is calculated and then edge de...

In this paper we propose a multipartite version of the classical Turán problem of determining the minimum number of edges needed for an arbitrary graph to contain a given subgraph. As it turns out, here the non-trivial problem is the determination of the minimal edge density between two classes that implies the existence of a given subgraph. We determine the critical edge density for trees and ...

We propose a method for extracting lowdimensional features from omnidirectional images to be used for robot localization and navigation. Edge detection is combined with thresholding to locate sharp edge pixels, the coordinates of which are fed into a Parzeii density estimator to compute the edge spatial density. The use of the Fast Fourier Transform makes this density estimate feasible in real-...

an injective map f : e(g) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph g(p, q) if the induced vertex function f*: v (g) → z − {0} defined by f*(v) = (sigma e∈ev) f (e) is one-one, where ev denotes the set of edges in g that are incident with a vetex v and f*(v (g)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} u {k(p+1)/2} accordin...