Is there any super fast algorithm for finding LINES on picture?
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:
- Is it possible to divide points to regions only based on their minimum distance to region-dividing curves?
- How can I find a number in a list (smaller than a given bound but the biggest one)?
- Balanced Partition greedy approach
- Algorithm for minimizing (s[i]-s[j]+d)/(i-j)
- Find longest substring
- Fish codility excercise
- Next prime number algorithm
- Using Loop invariant to prove correctness of merge sort (Initialization , Maintenance , Termination)
- Allocate bikes to people - First Priority (Closest bike to closest person)
- Isolation Forest Sklearn for 1D array or list and how to tune hyper parameters
- If the n-body problem is chaotic, why isn't it used as a RNG?
- Implementing Miller-Rabin in C
- Prove or disprove: there exists three vertexes a,b,c in a connected but incomplete graph satisfying a and b have a common neighbor c
- Boolean formula for a graph vertex-colouring algorithm
- heapq with custom compare predicate
- Algorithm to calculate number of intersecting discs
- Verifying the minimum cost from each node to a sink node in linear time
- Variations with repetition of r integers in {0...k} that sum to u
- How to reconstrunct a binary tree from an array produced by preorder tree traversal
- Two implementation methods of BFS for finding the shortest path, which one is the obvious winner?
- Determining coefficient of x^m term in (x^2 + x + 1)^n is even or odd
- How to merge 3 sorted arrays into 1 sorted array in Big-O(N) time?
- what is the best algorithm for this game?
- codility absolute distinct count from an array
- Avoid duplicates in N Queen iterative solutions (No Recursion Allowed)
- Split a binary search Tree
- minimum number of steps to reduce number to 1
- How to fix 'Codility FrogJump' Algorithm?
- Suffix tree VS Tries - in plain English , what's the difference?
- Pollard Rho factorization method implementation