An optimal linear time algorithm for quasi-monotonic segmentation.
Daniel LemireMartin BrooksYuhong YanPublished in: Int. J. Comput. Math. (2009)
Keyphrases
- segmentation algorithm
- worst case
- dynamic programming
- optimal solution
- segmentation method
- computational complexity
- similarity measure
- globally optimal
- learning algorithm
- significant improvement
- detection algorithm
- matching algorithm
- computational cost
- search space
- preprocessing
- closed form
- medical images
- objective function
- optimization algorithm
- energy function
- image processing
- optimal path
- test images
- clustering method
- shortest path
- simulated annealing
- scheduling problem
- probabilistic model