An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation.
Daniel LemireMartin BrooksYuhong YanPublished in: ICDM (2005)
Keyphrases
- segmentation algorithm
- worst case
- dynamic programming
- optimal solution
- segmentation method
- preprocessing
- detection algorithm
- cost function
- closed form
- significant improvement
- level set
- computational cost
- learning algorithm
- final result
- exhaustive search
- prior information
- np hard
- k means
- linear programming
- expectation maximization
- optimization algorithm
- computational complexity
- matching algorithm
- objective function
- image segmentation
- neural network
- association rules
- convex hull
- multiscale
- optimal path