Markus Diem
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Markus Diem has a total of 47 co-authors. Here are the top co-authors by number of shared publications:
- Robert Sablatnig
TU Wien
28 shared publications - Florian Kleber
TU Wien
25 shared publications - Stefan Fiel
Technische Univ. Wien (Austria)
9 shared publications - Fabian Hollaus
Vienna University of Technology
5 shared publications Angelika Garz
4 shared publicationsMartin Kampel
Institute of Visual Computing and Human-Centered Technology, TU Wien
4 shared publications
Latest Publications
- 2 January 2019
- Published by Springer Nature
- p. 189-197
Monitoring Acute Lymphoblastic Leukemia Therapy with Stacked Denoising Autoencoders
- 2 January 2019
- Published by Springer Nature
- p. 189-197
Monitoring Acute Lymphoblastic Leukemia Therapy with Stacked Denoising Autoencoders
- 1 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 570-575
MultiSpectral Image Binarization using GMMs
MultiSpectral Imaging enhances the study of degraded historical documents. It allows for visualizing washed out or even invisible ink but also improves the automated analysis because of a denser spectral sampling. We present a new methodology for binarization of multispectral document images that groups spectral signatures of different sources by fitting two Gaussian Mixture Models (GMMs) with Expectation Maximization. Both GMMs assign cluster labels to the multispectral samples and the clustering results are combined for the identification of the handwriting regions. The method is evaluated on the ICDAR 2015 MS-TEx dataset. Results on this publicly available benchmarking set are encouraging.
- 1 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 570-575
MultiSpectral Image Binarization using GMMs
MultiSpectral Imaging enhances the study of degraded historical documents. It allows for visualizing washed out or even invisible ink but also improves the automated analysis because of a denser spectral sampling. We present a new methodology for binarization of multispectral document images that groups spectral signatures of different sources by fitting two Gaussian Mixture Models (GMMs) with Expectation Maximization. Both GMMs assign cluster labels to the multispectral samples and the clustering results are combined for the identification of the handwriting regions. The method is evaluated on the ICDAR 2015 MS-TEx dataset. Results on this publicly available benchmarking set are encouraging.
- 1 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 217-222
Matching Table Structures of Historical Register Books using Association Graphs
In this paper we present a template-based table structure matching using association graphs for handwritten/printed historical documents. The recognition of the table structure consisting of column and header information is the prerequisite for the subsequent row detection and handwritten text recognition used for information extraction. The table matching is done by detecting the maximum clique in an association graph, which represents the matching of the line information of the template and a document of interest. This allows for variations of widths and heights of rows and columns. The presented methodology is evaluated on historical register books (death records) of the Archive of the Diocese of Passau. The method shows a reliable detection of the structure of handwritten/printed tables with a mean cell match of 88.28%.
- 1 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 217-222
Matching Table Structures of Historical Register Books using Association Graphs
In this paper we present a template-based table structure matching using association graphs for handwritten/printed historical documents. The recognition of the table structure consisting of column and header information is the prerequisite for the subsequent row detection and handwritten text recognition used for information extraction. The table matching is done by detecting the maximum clique in an association graph, which represents the matching of the line information of the template and a document of interest. This allows for variations of widths and heights of rows and columns. The presented methodology is evaluated on historical register books (death records) of the Archive of the Diocese of Passau. The method shows a reliable detection of the structure of handwritten/printed tables with a mean cell match of 88.28%.
- 1 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3868-3873
WGAN Latent Space Embeddings for Blast Identification in Childhood Acute Myeloid Leukaemia
Acute Myeloid Leukaemia (AML) is a rare type of childhood acute leukaemia. During treatment, the assessment of the number of cancer cells is particularly important to determine treatment response and consequently adapt the treatment scheme if necessary. Minimal Residual Disease (MRD) is a diagnostic measure based on Flow CytoMetry (FCM) data that captures the amount of blasts in a blood sample and is a clinical tool for planning patients' individual therapy, which requires reliable blast identification. In this work we propose a novel semi-supervised learning approach, which is acquired whenever large amounts of unlabeled data and only a small amount of annotated data is available. The proposed semi-supervised learning approach is based on Wasserstein Generative Adversarial Network (WGAN) latent space embeddings learned in an unsupervised fashion and a simple Fully connected Neural Network (FNN) trained on labeled data leveraging the learned embedding. We apply our proposed learning approach for semi-supervised classification of blasts vs. non-blasts. We compare our approach with two baseline approaches, 1) semi-supervised learning based on Principal Component Analysis (PCA) embedding, and 2) a deep FNN that is trained only on the annotated data without leveraging an embedding. Results suggest that our proposed semi-supervised WGAN embedding outperforms semi-supervised learning based on PCA embeddings and if only small amounts of annotated data is available it even outperforms an FNN classifier.
- 1 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3868-3873
WGAN Latent Space Embeddings for Blast Identification in Childhood Acute Myeloid Leukaemia
Acute Myeloid Leukaemia (AML) is a rare type of childhood acute leukaemia. During treatment, the assessment of the number of cancer cells is particularly important to determine treatment response and consequently adapt the treatment scheme if necessary. Minimal Residual Disease (MRD) is a diagnostic measure based on Flow CytoMetry (FCM) data that captures the amount of blasts in a blood sample and is a clinical tool for planning patients' individual therapy, which requires reliable blast identification. In this work we propose a novel semi-supervised learning approach, which is acquired whenever large amounts of unlabeled data and only a small amount of annotated data is available. The proposed semi-supervised learning approach is based on Wasserstein Generative Adversarial Network (WGAN) latent space embeddings learned in an unsupervised fashion and a simple Fully connected Neural Network (FNN) trained on labeled data leveraging the learned embedding. We apply our proposed learning approach for semi-supervised classification of blasts vs. non-blasts. We compare our approach with two baseline approaches, 1) semi-supervised learning based on Principal Component Analysis (PCA) embedding, and 2) a deep FNN that is trained only on the annotated data without leveraging an embedding. Results suggest that our proposed semi-supervised WGAN embedding outperforms semi-supervised learning based on PCA embeddings and if only small amounts of annotated data is available it even outperforms an FNN classifier.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 351-356
READ-BAD: A New Dataset and Evaluation Scheme for Baseline Detection in Archival Documents
Text line detection is crucial for any application associated with Automatic Text Recognition or Keyword Spotting. Modern algorithms perform good on well-established datasets since they either comprise clean data or simple/homogeneous page layouts. We have collected and annotated 2036 archival document images from different locations and time periods. The dataset contains varying page layouts and degradations that challenge text line segmentation methods. Well established text line segmentation evaluation schemes such as the Detection Rate or Recognition Accuracy demand for binarized data that is annotated on a pixel level. Producing ground truth by these means is laborious and not needed to determine a method's quality. In this paper we propose a new evaluation scheme that is based on baselines. The proposed scheme has no need for binarization and it can handle skewed as well as rotated text lines. The ICDAR 2017 Competition on Baseline Detection and the ICDAR 2017 Competition on Layout Analysis for Challenging Medieval Manuscripts used this evaluation scheme. Finally, we present results achieved by a recently published text line detection algorithm.
- 1 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 351-356
READ-BAD: A New Dataset and Evaluation Scheme for Baseline Detection in Archival Documents
Text line detection is crucial for any application associated with Automatic Text Recognition or Keyword Spotting. Modern algorithms perform good on well-established datasets since they either comprise clean data or simple/homogeneous page layouts. We have collected and annotated 2036 archival document images from different locations and time periods. The dataset contains varying page layouts and degradations that challenge text line segmentation methods. Well established text line segmentation evaluation schemes such as the Detection Rate or Recognition Accuracy demand for binarized data that is annotated on a pixel level. Producing ground truth by these means is laborious and not needed to determine a method's quality. In this paper we propose a new evaluation scheme that is based on baselines. The proposed scheme has no need for binarization and it can handle skewed as well as rotated text lines. The ICDAR 2017 Competition on Baseline Detection and the ICDAR 2017 Competition on Layout Analysis for Challenging Medieval Manuscripts used this evaluation scheme. Finally, we present results achieved by a recently published text line detection algorithm.
- 1 March 2018
- Published by World Scientific Pub Co Pte Ltd
- p. 67-88
Handwritten Digit and Digit String Recognition
- 1 March 2018
- Published by World Scientific Pub Co Pte Ltd
- p. 67-88
Handwritten Digit and Digit String Recognition
- Open Access
- 1 January 2018
- Published by INSTICC
- p. 401-408
Application of Machine Learning for Automatic MRD Assessment in Paediatric Acute Myeloid Leukaemia
- 1 January 2018
- Published by INSTICC
- p. 401-408
Open AccessApplication of Machine Learning for Automatic MRD Assessment in Paediatric Acute Myeloid Leukaemia
- Open Access
- 10 November 2017
- Published by Association for Computing Machinery (ACM)
- p. 65-70
Mass Digitization of Archival Documents using Mobile Phones
European Union's Horizon 2020: 67494
- 10 November 2017
- Published by Association for Computing Machinery (ACM)
- p. 65-70
Open AccessMass Digitization of Archival Documents using Mobile Phones
European Union's Horizon 2020: 67494
- Top Cited Papers
- 1 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 01, 1377-1382
ICDAR2017 Competition on Historical Document Writer Identification (Historical-WI)
The ICDAR 2017 Competition on Historical Document Writer Identification is dedicated to record the most recent advances made in the field of writer identification. The goal of the writer identification task is the retrieval of pages, which have been written by the same author. The test dataset used in this competition consists of 3600 handwritten pages originating from 13th to 20th century. It contains manuscripts from 720 different writers where each writer contributed five pages. This paper describes the dataset, as well as the details of the competition. Five different institutions submitted six methods which were ranked using identification and retrieval metrics. The paper describes the competition details including the dataset, the evaluation measures used as well as a short description of each submitted method.
- 1 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 01, 1377-1382
Top Cited PapersICDAR2017 Competition on Historical Document Writer Identification (Historical-WI)
The ICDAR 2017 Competition on Historical Document Writer Identification is dedicated to record the most recent advances made in the field of writer identification. The goal of the writer identification task is the retrieval of pages, which have been written by the same author. The test dataset used in this competition consists of 3600 handwritten pages originating from 13th to 20th century. It contains manuscripts from 720 different writers where each writer contributed five pages. This paper describes the dataset, as well as the details of the competition. Five different institutions submitted six methods which were ranked using identification and retrieval metrics. The paper describes the competition details including the dataset, the evaluation measures used as well as a short description of each submitted method.
- 1 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 01, 1355-1360
cBAD: ICDAR2017 Competition on Baseline Detection
The cBAD competition aims at benchmarking state-of-the-art baseline detection algorithms. It is in line with previous competitions such as the ICDAR 2013 Handwriting Segmentation Contest. A new, challenging, dataset was created to test the behavior of state-of-the-art systems on real world data. Since traditional evaluation schemes are not applicable to the size and modality of this dataset, we present a new one that introduces baselines to measure performance. We received submissions from five different teams for both tracks.
- 1 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 01, 1355-1360
cBAD: ICDAR2017 Competition on Baseline Detection
The cBAD competition aims at benchmarking state-of-the-art baseline detection algorithms. It is in line with previous competitions such as the ICDAR 2013 Handwriting Segmentation Contest. A new, challenging, dataset was created to test the behavior of state-of-the-art systems on real world data. Since traditional evaluation schemes are not applicable to the size and modality of this dataset, we present a new one that introduces baselines to measure performance. We received submissions from five different teams for both tracks.