有没有什么超快速的算法可以在图片上找到LINES? [英] Is there any super fast algorithm for finding LINES on picture?
问题描述
所以我有这样的图像
(来源:
(来源:narod.ru)
我需要一些超快速的算法来找到它上面的所有直线.我想给算法参数，如最小长度和最大线失真.我想获得相对于图片像素坐标线的起点和终点.
因此在这张图片上找到瓷砖之间的所有线条，并在顶部找到 2 条黑线.
所以我需要算法来超快速地找到图片上不同颜色的直线.
有没有这样的算法?(超级骗子快=)
您需要使用复杂的图像处理方法，例如 Canny 边缘检测、Marr-Hildreth 边缘检测、高斯滤波和霍夫变换等.
但是极不可能存在超快速"方法.
大多数图像处理算法的最小复杂度至少为O(N^2).
超快"我的意思是至多 O(1) ;)
一些可能有帮助的链接:
- http://www.sci.utah.edu/~cscheid/spr05/imageprocessing/project4/
- http://www.contrib.andrew.cmu.edu/~suppe/mobot/
- http://www.dunwich.org/baptiste/sic/ecms/ecpublis.html#2
- http://wayback.archive.org/web/20090304153603/http://hdebruijn.soo.dto.tudelft.nl/jaar2006/alders.htm
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=)
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:
- http://www.sci.utah.edu/~cscheid/spr05/imageprocessing/project4/
- http://www.contrib.andrew.cmu.edu/~suppe/mobot/
- http://www.dunwich.org/baptiste/sic/ecms/ecpublis.html#2
- http://wayback.archive.org/web/20090304153603/http://hdebruijn.soo.dto.tudelft.nl/jaar2006/alders.htm
这篇关于有没有什么超快速的算法可以在图片上找到LINES?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！
