On the partition of binary edge maps as a first step for quantitative quality evaluation

We present a method to obtain a partition of binary edge maps. The edge maps are partitioned into three subsets of active elements, according to the following classification: matched edge elements, smeared edge elements, and false edge elements. Based on this partition, figures of merit for the quantitative evaluation of edge maps can be derived.

[1]  Les Kitchen,et al.  Edge Evaluation Using Local Edge Coherence , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[2]  Armando J. Pinho,et al.  Edge Detection Filters Based on Artificial Neural Networks , 1995, ICIAP.

[3]  Armando J. Pinho,et al.  Figures of merit for quality assessment of binary edge maps , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

[4]  I.E. Abdou,et al.  Quantitative design and evaluation of enhancement/thresholding edge detectors , 1979, Proceedings of the IEEE.

[5]  Edward S. Deutsch,et al.  A Quantitative Study of the Orientation Bias of Some Edge Detector Schemes , 1978, IEEE Transactions on Computers.

[6]  Edward S. Deutsch,et al.  On the Quantitative Evaluation of Edge Detection Schemes and their Comparison with Human Performance , 1975, IEEE Transactions on Computers.