Minimal representation of -openings via pattern bases
Academic Article
Overview
Identity
Additional Document Info
Other
View All
Overview
abstract
Minimization of binary -opening bases is characterized by defining openings relative to pattern classes. Minimal pattern bases are unique and algorithmically derived for finite bases. They are used to derive a minimal bounding -opening for an antiextensive, increasing operator from the minimal erosion representation of the operator. 1994.