A greedy and branch and bound searching algorithm for finding the optimal morphological erosion filter on binary images.
Chin-Chuan HanKuo-Chin FanPublished in: IEEE Signal Process. Lett. (1994)
Keyphrases
- binary images
- optimal solution
- branch and bound
- mathematical morphology
- search space
- dynamic programming
- worst case
- euclidean distance transformation
- component labeling
- structuring elements
- gray scale
- lower bound
- morphological operations
- connected component labeling
- combinatorial optimization
- cost function
- implicit enumeration
- distance transformation
- beam search
- topology preserving
- morphological filters
- input image
- search algorithm
- branch and bound method
- medial axis transform
- objective function
- connected components
- np hard
- morphological operators
- branch and bound search
- branch and bound procedure
- greedy heuristic
- image processing
- hill climbing
- mixed integer programming
- column generation
- knapsack problem
- branch and bound algorithm
- convex hull
- parallel algorithm
- upper bound
- gray level
- particle swarm optimization
- linear programming