I've written some code that uses OpenCV libraries to detect white lines painted on grass. I need someone's opinion on the approach I used (as I'm sure there's a much better way than mine). Also, the results I'm getting are not as good as I expected because slight variations in the image require tweaking the parameters (and I need to operate on fixed parameters).
My approach so far:
Should I change the sequence of the filters?
P.S. I'm not too concerned about processing power; I'm running the HoughLinesP on the GPU B-)
Also, here is a sample image:
The results I'm getting: with canny WITHOUT canny (slightly tweaked parameters)
Any help or guidance would be appreciated! I just have no idea what to do to improve it!
UPDATE After using a really quick skeleton implementation (with TONS of blur) as per the chosen answer, I got this:
points and finds all the lines on which these edge points lie. The most popular line detectors are the Hough transform and convolution-based techniques.
In a convolution-based technique, the line detector operator consists of a convolution masks tuned to detect the presence of lines of a particular width n and a θ orientation. Here are the four convolution masks to detect horizontal, vertical, oblique (+45 degrees), and oblique (−45 degrees) lines in an image.
Line detection consists of detecting alignments of points on an image of contours. The usual method for line detection is the Hough transform [Hough 1962]. Like the Fourier transform, it transposes the image from the spatial domain to another domain, where the information of interest is represented differently.
Sobel Filter This is the most common simple first order differential edge detector.
I would try to use a skeleton representation of the image. The problem with your canny, here, is that it basically results in two lines because of the width of the line.
Then I would apply the Hough transform on it.
One possible solution is to take all the edge points that you obtain from the canny edge detection and fit a line using linear least sqaures (maybe iterative) on these points. This way you always get a single line that "best fits" the edge points. There is virtually no parametrisation involved with this method.
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With