Thomas Lampert

Thomas Lampert

Auto-generated profile, based on publicly available information

Thomas Lampert

University of Strasbourg, CNRS, INSERM, ICube, UMR7357, 300 boulevard Sébastien Brant, Illkirch, 67412, France

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 March 2016 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
TLThomas A. Lampert
Thomas A. Lampert
ASAndre Stumpf
Andre Stumpf
PGPierre Gancarski
Pierre Gancarski
Although agreement between the annotators who mark feature locations within images has been studied in the past from a statistical viewpoint, little work has attempted to quantify the extent to which this phenomenon affects the evaluation of foreground-background segmentation algorithms. Many researchers utilize ground truth (GT) in experimentation and more often than not this GT is derived from one annotator's opinion. How does the difference in opinion affects an algorithm's evaluation? A methodology is applied to four image-processing problems to quantify the interannotator variance and to offer insight into the mechanisms behind agreement and the use of GT. It is found that when detecting linear structures, annotator agreement is very low. The agreement in a structure's position can be partially explained through basic image properties. Automatic segmentation algorithms are compared with annotator agreement and it is found that there is a clear relation between the two. Several GT estimation methods are used to infer a number of algorithm performances. It is found that the rank of a detector is highly dependent upon the method used to form the GT, and that although STAPLE and LSML appear to represent the mean of the performance measured using individual annotations, when there are few annotations, or there is a large variance in them, these estimates tend to degrade. Furthermore, one of the most commonly adopted combination methods-consensus voting-accentuates more obvious features, resulting in an overestimation of performance. It is concluded that in some data sets, it is not possible to confidently infer an algorithm ranking when evaluating upon one GT.

1 February 2010 in Applied Acoustics
Verified
Journal Article
Closed access
TLThomas A. Lampert
Thomas A. Lampert
SOSimon E.M. O’kEefe
Simon E.M. O’kEefe

7 October 2022 in Artificial Intelligence in Medicine
Verified
Journal Article
Closed access
JVJelica Vasiljević
Jelica Vasiljević
ZNZeeshan Nisar
Zeeshan Nisar
FFFriedrich Feuerhake
Friedrich Feuerhake
CWCédric Wemmert
Cédric Wemmert
TLThomas Lampert
Thomas Lampert

30 May 2018 in Data Mining and Knowledge Discovery
Verified
Journal Article
Open access
PDF file
TLThomas Lampert
Thomas Lampert
TDThi-Bich-Hanh Dao
Thi-Bich-Hanh Dao
BLBaptiste Lafabregue
Baptiste Lafabregue
NSNicolas Serrette
Nicolas Serrette
GFGermain Forestier
Germain Forestier
PGPierre Gançarski
Pierre Gançarski
Constrained clustering is becoming an increasingly popular approach in data mining. It offers a balance between the complexity of producing a formal definition of thematic classes—required by supervised methods—and unsupervised approaches, which ignore expert knowledge and intuition. Nevertheless, the application of constrained clustering to time-series analysis is relatively unknown. This is partly due to the unsuitability of the Euclidean distance metric, which is typically used in data mining, to time-series data. This article addresses this divide by presenting an exhaustive review of constrained clustering algorithms and by modifying publicly available implementations to use a more appropriate distance measure—dynamic time warping. It presents a comparative study, in which their performance is evaluated when applied to time-series. It is found that k-means based algorithms become computationally expensive and unstable under these modifications. Spectral approaches are easily applied and offer state-of-the-art performance, whereas declarative approaches are also easily applied and guarantee constraint satisfaction. An analysis of the results raises several influencing factors to an algorithm’s performance when constraints are introduced.

1 May 2013 in Pattern Recognition
Verified
Journal Article
Closed access
TLThomas A. Lampert
Thomas A. Lampert
SOSimon O'Keefe
Simon O'Keefe