A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Curve finder combining perceptual grouping and a Kalman like fitting
1999
Proceedings of the Seventh IEEE International Conference on Computer Vision
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
doi:10.1109/iccv.1999.790378
dblp:conf/iccv/GuichardT99
fatcat:c5sbkbvp4rd2hor3qmee65u6ua