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:
- Efficient calculation of Fibonacci series
- What is the best algorithm for overriding GetHashCode?
- Picking a random element from a set
- How to generate combinations in chunks
- How do I check if an array includes a value in JavaScript?
- Why is O(n) better than O( nlog(n) )?
- Geometric series: calculate quotient and number of elements from sum and first & last element
- Algorithm to find all the exact divisors of a given integer
- Fastest way to generate binomial coefficients
- Enumerate all full (labeled) binary tree
- What's the best way to write `indexBy` in Scala?
- In Dijkstra's algorithm why must it first expand nodes with the current least cost?
- Distance between every Vertices in Graph
- Design an efficient algorithm to sort 5 distinct keys in fewer than 8 comparisons
- Is there any easy way to do modulus of 2³² - 1 operation?
- Difference between Big-O and Little-O Notation
- Solving a simultaneous equation through code
- Number of paths using k coins
- Infix to postfix algorithm that takes care of unary operators
- What would cause an algorithm to have O(log log n) complexity?
- Algorithm to create a singly linked list
- Why does cache use Most Recently Used (MRU) algorithm as evict policy?
- How to check if a number is a power of 2
- How to define a normal Markov algorithm (NMA) to swap two ternary numbers separated by the symbol "^"?
- Enumerating all paths in a directed acyclic graph
- Segmented Sieve of Eratosthenes?
- what is the output of this simple recursive function? can you explain in detail?
- Does lower_bound() return the same result with reverse iterators of a vector in increasing order vs forward iterators of a vector in decreasing order?
- Insert sequence of formatting that can overlap into a string at specific locations
- How to sort two arrays with one being sorted based on the sorting of the other?