Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ICCV

1999

IEEE

1999

IEEE

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 to 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, function of one image coordinate. This allows, first, to use a recursive Kalman based fitting and, second, to cast the problem as an optimal path search in an directed graph. Experiments on finding lane-markings on roads demonstrate that real-time processing is achievable.

Added |
09 Nov 2009 |

Updated |
04 Dec 2009 |

Type |
Conference |

Year |
1999 |

Where |
ICCV |

Authors |
Frederic Guichard, Jean-Philippe Tarel |

Comments (0)