Curve finder combining perceptual grouping and a Kalman like fitting

We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their “length”. The algorithm inherits the perceptual grouping approaches. But, instead of using only local cues, a global constraint is imposed on each extracted subset of edgels, that the underlying curve belongs to a specific class. In order to reduce the complexity of the solution, we work with a linearly parameterized class of curves, a function of one image coordinate. This first allows one to use recursive Kalman based fitting and, second, to cast the problem as an optimal path search in a directed graph. Experiments on finding lane-markings on roads demonstrate that real-time processing is achievable