Fast recognition of a Digital Straight Line subsegment: Two algorithms of logarithmic time complexity.
Isabelle SivignonPublished in: Discret. Appl. Math. (2015)
Keyphrases
- digital straight line
- worst case
- computational complexity
- learning algorithm
- recognition rate
- space complexity
- memory requirements
- computational cost
- theoretical analysis
- recognition accuracy
- data sets
- computationally efficient
- significant improvement
- data structure
- orders of magnitude
- feature extraction
- pattern recognition
- computationally complex
- neural network
- optimization problems
- reduced complexity
- lower complexity
- high computational complexity
- recognition process
- search algorithm
- recently developed
- computational efficiency
- hough transform
- data mining algorithms
- benchmark datasets
- object recognition