A Linear-Time Constant-Space Algorithm for the Boundary Fill Problem.
Vladimir YanovskiIsrael A. WagnerAlfred M. BrucksteinPublished in: Comput. J. (2007)
Keyphrases
- worst case
- learning algorithm
- high accuracy
- search space
- times faster
- optimization algorithm
- dynamic programming
- objective function
- preprocessing
- detection algorithm
- expectation maximization
- recognition algorithm
- computational complexity
- theoretical analysis
- np hard
- optimal solution
- similarity measure
- input data
- significant improvement
- space complexity
- convergence rate
- neural network
- space requirements
- convex hull
- alphabet size
- path planning
- tree structure
- computationally efficient
- simulated annealing
- cost function
- k means
- image segmentation