M.R. Everingham, H. Muller, and B.T. Thomas, "Evaluating Image Segmentation Algorithms Using the Pareto Front," Proc. Seventh European Conf. Computer Vision, pp. IV:34-48, May 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Method for Objective Edge Detection Evaluation and Detector.. - Yitzhaky (2003) (1 citation) (Correct)
....forming an outer bound with regard to the other points. We will term this line: the PSROC curve. The best PS point in this case is the point on the PSROC curve that is the closest to the diagnosis line. Examples for that are shown in Figs. 3a and 3c. A similar concept is the Pareto front [22], which is the outer bound that connects the points that represent the best parameters for segmentation algorithms in a fitness cost space. The Chi square measure in this case, # D j EGT , will be similar to (7) but with Q D j EGT instead of Q PGT , where Q D EGT TPD j EGT FPD j EGT . The ....
M.R. Everingham, H. Muller, and B.T. Thomas, "Evaluating Image Segmentation Algorithms Using the Pareto Front," Proc. Seventh European Conf. Computer Vision, pp. IV:34-48, May 2002.
Algorithm Evaluation by Probabilistic Fitness/Cost.. - Everingham, Muller.. (2002) Self-citation (Muller Image) (Correct)
....ap # Part of this work was sponsored by Hewlett Packard Research Laboratories, Bristol proach to allow examination of an algorithm s stability in addition to its average performance. This gives a significant improvement over the evaluation by monotonic hulls which we have proposed [3], and is more general than the convex hull methods which have been proposed for analysis of receiver operating characteristic (ROC) curves [8] We apply our approach to the evaluation of image segmentation algorithms, since this is an area in which some attempts at evaluation have been made, and ....
....in the set #p # Pa ##q Pa : n(a # q , a # p ) 2) n(a # q , a # p ) true if #f # F : f(a # q , D) f(a # p , D)# C : c(a # q , D) c(a # p , D) # false otherwise (3) and F = 1 . f m , C = 1 . c m . We call the set of such points the monotonic hull [3]. Figure 1b shows these points for the graph of Figure 1a, where we have drawn connecting lines to indicate the partitioning of the space by the hull. The strength of this construction is that we can readily show that for any choice of overall fitness function # that increases monotonically in F ....
[Article contains additional citation context not shown here]
M. R. Everingham, H. Muller, and B. T. Thomas. Evaluating image segmentation algorithms using monotonic hulls in fitness/cost space. In Proc. BMVC'2001.
R.L. Kirby, "A Product Rule Relaxation Method," Technical.. - Kittler Christmas And (Correct)
No context found.
M.R. Everingham, H. Muller, and B.T. Thomas, "Evaluating Image Segmentation Algorithms Using the Pareto Front," Proc. Seventh European Conf. Computer Vision, pp. IV:34-48, May 2002.
Automating Cell Segmentation Evaluation with Annotated.. - Pascal Bamford Cooperative (2003) (Correct)
No context found.
M. Everingham, H. Muller, and B. Thomas, "Evaluating image segmentation algorithms using the pareto front," Lecture Notes in Computer Science, vol. 2353, pp. 34--48, 2002.
Simultaneous Truth and Performance Level Estimation.. - Warfield, Zou, Wells (2004) (Correct)
No context found.
M. Everingham, H. Muller, and B. Thomas, "Evaluating Image Segmentation Algorithms Using the Pareto Front," in ECCV, vol. LNCS 2353, 2002, pp. 34--48.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC