2006
DOI: 10.1016/j.patrec.2006.05.002
|View full text |Cite
|
Sign up to set email alerts
|

On the use of the overlapping area matrix for image segmentation evaluation: A survey and new performance measures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 35 publications
(18 citation statements)
references
References 39 publications
0
16
0
Order By: Relevance
“…This method finds oneto-one matches between the reference and output objects. To be able to handle over-detections where more than one output object correspond to a reference object, and under-detections where more than one reference object correspond to an output object, the maximum overlap criterion can be relaxed to allow all overlaps above a certain threshold (Hoover et al, 1996;Mariano et al, 2002;Ortiz and Oliver, 2006). Alternatively, Jiang et al (2006) used maximum-weight bipartite graph matching to find optimal one-to-one matching between the reference and output objects where the weights correspond to overlaps among the objects.…”
Section: Related Work On Object Detection Evaluationmentioning
confidence: 99%
“…This method finds oneto-one matches between the reference and output objects. To be able to handle over-detections where more than one output object correspond to a reference object, and under-detections where more than one reference object correspond to an output object, the maximum overlap criterion can be relaxed to allow all overlaps above a certain threshold (Hoover et al, 1996;Mariano et al, 2002;Ortiz and Oliver, 2006). Alternatively, Jiang et al (2006) used maximum-weight bipartite graph matching to find optimal one-to-one matching between the reference and output objects where the weights correspond to overlaps among the objects.…”
Section: Related Work On Object Detection Evaluationmentioning
confidence: 99%
“…In Baraldi, Boschetti, and Humber (2014), a crisp thematic map assessment protocol was proposed based on: (i) a probability sampling strategy, (ii) a pair of test and reference thematic map legends A and B that may differ, (iii) a crisp overlapping area matrix, OAMTRX = FrequencyCount(A × B), defined as a BIVRFTAB instantiation estimated from a geospatial population with or without sampling, (Beauchemin & Thomson, 1997; Ortiz & Oliver, 2006), whose spatial unit x is (0D) pixel, (iv) a set of thematic quantitative quality indicators (Q 2 Is), TQ 2 Is, extracted from the OAMTRX and (v) a set of spatial Q 2 Is (SQ 2 Is) extracted from sub-symbolic image-objects (image-segments) in the multi-level map domain, where image-objects are either (0D) pixels, (1D) lines or (2D) polygons according to the OGC nomenclature (OGC, 2015). Whereas the construction of an OAMTRX is straightforward and non-controversial when categorical labels of sampling units are crisp (hard), the method to construct an OAMTRX when categorical labels are soft (fuzzy) is not obvious at all; for example, refer to (Kuzera & Pontius, 2008).…”
Section: Methodsmentioning
confidence: 99%
“…In greater detail, for any BIVRFTAB instance, either square or non-square, there is a binary relationship R: A ⇒ B ⊆ A × B that guides the interpretation process, where “correct” binary entry-pair cells of the 2-fold Cartesian product A × B are equal to 1 and located either off-diagonal (scattered) or on-diagonal, if a main diagonal exists when the BIVRFTAB is square. When a BIVRFTAB is estimated from a geospatial population with or without sampling, it is called overlapping area matrix (OAMTRX) (Baraldi et al, 2014; Baraldi, Bruzzone, & Blonda, 2005; Baraldi et al, 2006; Beauchemin & Thomson, 1997; Lunetta & Elvidge, 1999; Ortiz & Oliver, 2006; Pontius & Connors, 2006). When the binary relationship R: A ⇒ B is a bijective function (both 1–1 and onto), i.e., when the two categorical variables A and B estimated from a single population coincide, then the BIVRFTAB instantiation is square and sorted; it is typically called confusion matrix (CMTRX) or error matrix (Congalton & Green, 1999; Lunetta & Elvidge, 1999; Pontius & Millones, 2011; Stehman & Czaplewski, 1998).…”
Section: Problem Background Of Color Naming In Cognitive Sciencementioning
confidence: 99%