2000 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'00) - Volume 1 Assignment Problem in Edge Detection Performance Evaluation Hilton Head, South Carolina June 13-June 15 ISBN: 0-7695-0662-3
We propose to use the combinatorial assignment problem to model the issue of associating ground-truth and declared edge pixels in the objective empirical performance evaluation of edge detectors. The assignment problem is adapted to the maximal assignment problem to incorporate the need for tolerating certain amount of localization error for the detected ground-truth pixels. The solution to this problem yields a maximal one-to-one association between ground-truth and declared edge pixels. Performance evaluation based on this association has the attitude of making the most positive interpretation of the declared edge map. Synthetic test data is used in the experiment to allow unambiguous subjective judgment of edge detection performance. The preciseness and reasonableness of the performance evaluation from the proposed method is observed. The usefulness of this method in other performance evaluation applications is also discussed.
Index Terms:
performance evaluation, edge detection, assignment problem, Hungarian algorithm
Citation:
Gang Liu, Robert M. Haralick, "Assignment Problem in Edge Detection Performance Evaluation," cvpr, vol. 1, pp.1026, 2000 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'00) - Volume 1, 2000 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||