Question

So I have Image like this

_{(source: de-viz.ru)}

I want to get something like this (I hevent drawn all lines I want but I hope you can get my idea)

_{(source: narod.ru)}

I need some super fast algorithm for finding all straight lines on it. I want to give to algorithm parameters like min length and max line distortion. I want to get relative to picture pixel coords start and end points of lines.

So on this picture to find all lines between tiles and thouse 2 black lines on top.

So I need algorithm for super fast finding straight lines of different colors on picture.

Is there any such algorithm? (super duper fast=)

Answer 1

You need to use sophisticated image processing methods such as Canny Edge Detection, Marr-Hildreth edge detection, Gaussian Filtering and Hough Transform etc.

But existence of “super fast” method is highly unlikely.

Minimum complexity of most of the image processing algorithms is at least O(N^2).

By “super fast” I mean at most O(1) 😉

Some links that might help:

1. http://www.sci.utah.edu/~cscheid/spr05/imageprocessing/project4/
2. http://www.contrib.andrew.cmu.edu/~suppe/mobot/
3. http://www.dunwich.org/baptiste/sic/ecms/ecpublis.html#2
4. http://wayback.archive.org/web/20090304153603/http://hdebruijn.soo.dto.tudelft.nl/jaar2006/alders.htm