A simplified algorithm for approximate separable decomposition of morphological templates.
Balvinder SinghM. U. SiddiqiPublished in: Pattern Recognit. (1996)
Keyphrases
- dynamic programming
- learning algorithm
- experimental evaluation
- decomposition algorithm
- optimization algorithm
- particle swarm optimization
- search space
- high accuracy
- detection algorithm
- expectation maximization
- significant improvement
- cost function
- improved algorithm
- computationally efficient
- neural network
- theoretical analysis
- times faster
- convergence rate
- computational cost
- k means
- optimal solution
- decomposition method
- recognition algorithm
- convex hull
- efficient computation
- decomposition methods
- matching algorithm
- tree structure
- clustering method
- graph cuts
- simulated annealing
- worst case
- np hard
- objective function
- image processing
- feature selection
- genetic algorithm