Lane Detection and Traffic sign detection are the essential components in ADAS .Although there has been significant quantity of analysis dedicated to lane past, is still need robustness system. An important challenge current algorithm cope with bad weather illumination. In this paper proposes an improved Hough transform order achieve straight line while for curved sections, tracking studied. Th...

Building change detection from very-high-resolution (VHR) urban remote sensing image frequently encounter the challenge of serious false alarm caused by different illumination or viewing angles in bi-temporal images. An approach to alleviate the false alarm in urban building change detection is proposed in this paper. Firstly, as shadows casted by urban buildings are of distinct spectral and sh...

We give an algorithm that reduces the straight skeleton to the motorcycle graph in O(n log n) time for (weakly) simple polygons and O(n(log n) logm) time for a planar straight line graph with m connected components. The current fastest algorithms for computing motorcycle graphs are an O(n ) time algorithm for non-degenerate cases and O(n ) for degenerate cases. Together with our algorithm this ...

Among mathematical models of visual confusion of letters and similar material, those that posit a feature detect ion process have been especially popular. The present s tudy provides direct tests of several of the central assumptions of such models with feature-stimuli composed of the blank, one of two straight line features, or both line. features posit ioned at a right angle. In one condition...

We give a new probabilistic algorithm for interpolating a “sparse” polynomial f given by a straight-line program. Our algorithm constructs an approximation f of f , such that f − f probably has at most half the number of terms of f , then recurses on the difference f−f. Our approach builds on previous work by Garg and Schost (2009), and Giesbrecht and Roche (2011), and is asymptotically more ef...

A linear axis is a straight line skeleton for a polygonal shape. The concept of a linear axis ε-equivalent to the medial axis has been introduced and studied for simple polygons and for those with holes. In this paper, we generalize the notions of a linear axis and of ε-equivalence to the case of planar straight line graphs. We show that for some graphs, a linear axis ε-equivalent to the medial...

This paper addresses the features of Hough Transform (HT) butterflies suitable for image-based segment detection and measurement. The full segment parameters such as the position, slope, width, length, continuity, and uniformity are related to the features of the HT butterflies. Mathematical analysis and experimental data are presented in order to demonstrate and build the relationship between ...

Fitting the \best" straight line to a scatter plot of data D f(x1; y1) : : :(xn; yn)g in which both variables xi; yi are subject to unknown error is undoubtedly the most common problem of inference faced by scientists, engineers, medical researchers, and economists. The problem is to estimate the parameters ; in the straight line equation y = + x , and assess the accuracy of the estimates. When...

It is known that for any set V of n ≥ 4 points in the plane, not in convex position, there is a 3-connected planar straight line graph G = (V, E) with at most 2n− 2 edges, and this bound is the best possible. We show that the upper bound |E| ≤ 2n continues to hold if G is constrained to contain a given graph G0 = (V,E0), which is either a 1-factor (i.e., disjoint line segments) or a 2-factor (i...

Given a planar graph G on n vertices, let fix (G) denote the maximum k such that any straight line drawing of G with possible edge crossings can be made crossing-free by moving at most n − k vertices to new positions. Let v̄(G) denote the maximum possible number of collinear vertices in a crossingfree straight line drawing of G. In view of the relation fix (G) ≤ v̄(G), we are interested in exampl...