2021
DOI: 10.5194/isprs-annals-v-2-2021-121-2021
|View full text |Cite
|
Sign up to set email alerts
|

Tesserae3d: A Benchmark for Tesserae Semantic Segmentation in 3d Point Clouds

Abstract: Abstract. 3D point cloud of mosaic tesserae is used by heritage researchers, restorers and archaeologists for digital investigations. Information extraction, pattern analysis and semantic assignment are necessary to complement the geometric information. Automated processes that can speed up the task are highly sought after, especially new supervised approaches. However, the availability of labelled data necessary for training supervised learning models is a significant constraint. This paper introduces Tessera… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 23 publications
0
0
0
Order By: Relevance
“…Decision tree ensemble learning has previously been performed for 3D PCC, based on the technique of bagging [14,22] or boosting [20]. RF [28]-a bagging-based ensemble of decision trees, which is based on a combination of tree scores from randomly created multiple decision trees-especially comes forward among them [15] and has become a popular choice of ML classifier in 3D PCC [14,21,22], and even considered as a baseline method in many benchmark datasets, such as in Kölle et al [52] and Kharroubi et al [53]. Gradient-boosting machines [54], however, construct a strong learner from weak learners iteratively, which is based on improving the scores according to the previous iteration.…”
Section: Classificationmentioning
confidence: 99%
“…Decision tree ensemble learning has previously been performed for 3D PCC, based on the technique of bagging [14,22] or boosting [20]. RF [28]-a bagging-based ensemble of decision trees, which is based on a combination of tree scores from randomly created multiple decision trees-especially comes forward among them [15] and has become a popular choice of ML classifier in 3D PCC [14,21,22], and even considered as a baseline method in many benchmark datasets, such as in Kölle et al [52] and Kharroubi et al [53]. Gradient-boosting machines [54], however, construct a strong learner from weak learners iteratively, which is based on improving the scores according to the previous iteration.…”
Section: Classificationmentioning
confidence: 99%