Change search
Link to record
Permanent link

Direct link
BETA
Publications (7 of 7) Show all publications
Westphal, F., Lavesson, N. & Grahn, H. (2019). A Case for Guided Machine Learning. In: Andreas Hozinger, Peter Kieseberg, A Min Tjoa and Edgar Weippl (Ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): . Paper presented at 3rd IFIP Cross Domain Conference for Machine Learning and Knowledge Extraction, CD-MAKE 2019; Canterbury; United Kingdom; 26 August 2019 through 29 August (pp. 353-361). Springer, 11713
Open this publication in new window or tab >>A Case for Guided Machine Learning
2019 (English)In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) / [ed] Andreas Hozinger, Peter Kieseberg, A Min Tjoa and Edgar Weippl, Springer, 2019, Vol. 11713, p. 353-361Conference paper, Published paper (Refereed)
Abstract [en]

Involving humans in the learning process of a machine learning algorithm can have many advantages ranging from establishing trust into a particular model to added personalization capabilities to reducing labeling efforts. While these approaches are commonly summarized under the term interactive machine learning (iML), no unambiguous definition of iML exists to clearly define this area of research. In this position paper, we discuss the shortcomings of current definitions of iML and propose and define the term guided machine learning (gML) as an alternative.

Place, publisher, year, edition, pages
Springer, 2019
Keywords
guided machine learning, interactive machine learning, human-in-the-loop, definition
National Category
Human Computer Interaction Computer Sciences
Identifiers
urn:nbn:se:bth-18708 (URN)10.1007/978-3-030-29726-8_22 (DOI)978-3-030-29726-8 (ISBN)
Conference
3rd IFIP Cross Domain Conference for Machine Learning and Knowledge Extraction, CD-MAKE 2019; Canterbury; United Kingdom; 26 August 2019 through 29 August
Projects
Scalable resource-efficient systems for big data analytics
Funder
Knowledge Foundation, 20140032
Available from: 2019-09-27 Created: 2019-09-27 Last updated: 2019-10-21Bibliographically approved
Westphal, F., Lavesson, N. & Grahn, H. (2018). Document Image Binarization Using Recurrent Neural Networks. In: Proceedings - 13th IAPR International Workshop on Document Analysis Systems, DAS 2018: . Paper presented at 2018 13th IAPR International Workshop on Document Analysis Systems (DAS), vienna (pp. 263-268). IEEE
Open this publication in new window or tab >>Document Image Binarization Using Recurrent Neural Networks
2018 (English)In: Proceedings - 13th IAPR International Workshop on Document Analysis Systems, DAS 2018, IEEE, 2018, p. 263-268Conference paper, Published paper (Refereed)
Abstract [en]

In the context of document image analysis, image binarization is an important preprocessing step for other document analysis algorithms, but also relevant on its own by improving the readability of images of historical documents. While historical document image binarization is challenging due to common image degradations, such as bleedthrough, faded ink or stains, achieving good binarization performance in a timely manner is a worthwhile goal to facilitate efficient information extraction from historical documents. In this paper, we propose a recurrent neural network based algorithm using Grid Long Short-Term Memory cells for image binarization, as well as a pseudo F-Measure based weighted loss function. We evaluate the binarization and execution performance of our algorithm for different choices of footprint size, scale factor and loss function. Our experiments show a significant trade-off between binarization time and quality for different footprint sizes. However, we see no statistically significant difference when using different scale factors and only limited differences for different loss functions. Lastly, we compare the binarization performance of our approach with the best performing algorithm in the 2016 handwritten document image binarization contest and show that both algorithms perform equally well.

Place, publisher, year, edition, pages
IEEE, 2018
Keywords
image binarization, recurrent neural networks, Grid LSTM, historical documents, Text analysis, Labeling, Recurrent neural networks, Heuristic algorithms, Training, Degradation, Ink
National Category
Computer Vision and Robotics (Autonomous Systems)
Identifiers
urn:nbn:se:bth-16749 (URN)10.1109/DAS.2018.71 (DOI)000467070300045 ()978-1-5386-3346-5 (ISBN)
Conference
2018 13th IAPR International Workshop on Document Analysis Systems (DAS), vienna
Funder
Knowledge Foundation, 20140032
Available from: 2018-07-06 Created: 2018-07-06 Last updated: 2019-06-28Bibliographically approved
Westphal, F. (2018). Efficient Document Image Binarization using Heterogeneous Computing and Interactive Machine Learning. (Licentiate dissertation). Karlskrona: Blekinge Tekniska Högskola
Open this publication in new window or tab >>Efficient Document Image Binarization using Heterogeneous Computing and Interactive Machine Learning
2018 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Large collections of historical document images have been collected by companies and government institutions for decades. More recently, these collections have been made available to a larger public via the Internet. However, to make accessing them truly useful, the contained images need to be made readable and searchable. One step in that direction is document image binarization, the separation of text foreground from page background. This separation makes the text shown in the document images easier to process by humans and other image processing algorithms alike. While reasonably well working binarization algorithms exist, it is not sufficient to just being able to perform the separation of foreground and background well. This separation also has to be achieved in an efficient manner, in terms of execution time, but also in terms of training data used by machine learning based methods. This is necessary to make binarization not only theoretically possible, but also practically viable.

In this thesis, we explore different ways to achieve efficient binarization in terms of execution time by improving the implementation and the algorithm of a state-of-the-art binarization method. We find that parameter prediction, as well as mapping the algorithm onto the graphics processing unit (GPU) help to improve its execution performance. Furthermore, we propose a binarization algorithm based on recurrent neural networks and evaluate the choice of its design parameters with respect to their impact on execution time and binarization quality. Here, we identify a trade-off between binarization quality and execution performance based on the algorithm’s footprint size and show that dynamically weighted training loss tends to improve the binarization quality. Lastly, we address the problem of training data efficiency by evaluating the use of interactive machine learning for reducing the required amount of training data for our recurrent neural network based method. We show that user feedback can help to achieve better binarization quality with less training data and that visualized uncertainty helps to guide users to give more relevant feedback.

Place, publisher, year, edition, pages
Karlskrona: Blekinge Tekniska Högskola, 2018. p. 135
Series
Blekinge Institute of Technology Licentiate Dissertation Series, ISSN 1650-2140 ; 3
Keywords
image binarization, heterogeneous computing, recurrent neural networks, interactive machine learning, historical documents
National Category
Computer Engineering Computer Sciences Computer Vision and Robotics (Autonomous Systems)
Identifiers
urn:nbn:se:bth-16797 (URN)978-91-7295-355-0 (ISBN)
Presentation
2018-09-10, J1640, Valhallavägen 1, Karlskrona, 10:15 (English)
Opponent
Supervisors
Projects
Scalable resource-efficient systems for big data analytics
Funder
Knowledge Foundation, 20140032
Available from: 2018-08-27 Created: 2018-07-12 Last updated: 2018-11-14Bibliographically approved
Westphal, F., Grahn, H. & Lavesson, N. (2018). Efficient document image binarization using heterogeneous computing and parameter tuning. International Journal on Document Analysis and Recognition, 21(1-2), 41-58
Open this publication in new window or tab >>Efficient document image binarization using heterogeneous computing and parameter tuning
2018 (English)In: International Journal on Document Analysis and Recognition, ISSN 1433-2833, E-ISSN 1433-2825, Vol. 21, no 1-2, p. 41-58Article in journal (Refereed) Published
Abstract [en]

In the context of historical document analysis, image binarization is a first important step, which separates foreground from background, despite common image degradations, such as faded ink, stains, or bleed-through. Fast binarization has great significance when analyzing vast archives of document images, since even small inefficiencies can quickly accumulate to years of wasted execution time. Therefore, efficient binarization is especially relevant to companies and government institutions, who want to analyze their large collections of document images. The main challenge with this is to speed up the execution performance without affecting the binarization performance. We modify a state-of-the-art binarization algorithm and achieve on average a 3.5 times faster execution performance by correctly mapping this algorithm to a heterogeneous platform, consisting of a CPU and a GPU. Our proposed parameter tuning algorithm additionally improves the execution time for parameter tuning by a factor of 1.7, compared to previous parameter tuning algorithms. We see that for the chosen algorithm, machine learning-based parameter tuning improves the execution performance more than heterogeneous computing, when comparing absolute execution times. © 2018 The Author(s)

Place, publisher, year, edition, pages
Springer Verlag, 2018
Keywords
Automatic parameter tuning, Heterogeneous computing, Historical documents, Image binarization, Bins, History, Image analysis, Learning systems, Document image binarization, Government institutions, Heterogeneous platforms, Parameter tuning algorithm, Parameter estimation
National Category
Computer Sciences
Identifiers
urn:nbn:se:bth-15891 (URN)10.1007/s10032-017-0293-7 (DOI)000433193500003 ()2-s2.0-85041228615 (Scopus ID)
Available from: 2018-02-15 Created: 2018-02-15 Last updated: 2018-08-27Bibliographically approved
Westphal, F., Grahn, H. & Lavesson, N. (2018). User Feedback and Uncertainty in User Guided Binarization. In: Tong, H; Li, Z; Zhu, F; Yu, J (Ed.), International Conference on Data Mining Workshops: . Paper presented at 18th IEEE International Conference on Data Mining Workshops, ICDMW, Singapore; Singapore; 17 November 2018 through 20 November (pp. 403-410). IEEE Computer Society, Article ID 8637367.
Open this publication in new window or tab >>User Feedback and Uncertainty in User Guided Binarization
2018 (English)In: International Conference on Data Mining Workshops / [ed] Tong, H; Li, Z; Zhu, F; Yu, J, IEEE Computer Society, 2018, p. 403-410, article id 8637367Conference paper, Published paper (Refereed)
Abstract [en]

In a child’s development, the child’s inherent ability to construct knowledge from new information is as important as explicit instructional guidance. Similarly, mechanisms to produce suitable learning representations, which can be trans- ferred and allow integration of new information are important for artificial learning systems. However, equally important are modes of instructional guidance, which allow the system to learn efficiently. Thus, the challenge for efficient learning is to identify suitable guidance strategies together with suitable learning mechanisms.

In this paper, we propose guided machine learning as source for suitable guidance strategies, we distinguish be- tween sample selection based and privileged information based strategies and evaluate three sample selection based strategies on a simple transfer learning task. The evaluated strategies are random sample selection, i.e., supervised learning, user based sample selection based on readability, and user based sample selection based on readability and uncertainty. We show that sampling based on readability and uncertainty tends to produce better learning results than the other two strategies. Furthermore, we evaluate the use of the learner’s uncertainty for self directed learning and find that effects similar to the Dunning-Kruger effect prevent this use case. The learning task in this study is document image binarization, i.e., the separation of text foreground from page background and the source domain of the transfer are texts written on paper in Latin characters, while the target domain are texts written on palm leaves in Balinese script.

Place, publisher, year, edition, pages
IEEE Computer Society, 2018
Keywords
guided machine learning, interactive machine learning, image binarization, historical documents
National Category
Computer Vision and Robotics (Autonomous Systems) Human Computer Interaction
Identifiers
urn:nbn:se:bth-17742 (URN)10.1109/ICDMW.2018.00066 (DOI)000465766800058 ()978-1-5386-9288-2 (ISBN)
Conference
18th IEEE International Conference on Data Mining Workshops, ICDMW, Singapore; Singapore; 17 November 2018 through 20 November
Funder
Knowledge Foundation, 20140032
Note

 "© 20XX IEEE.  Personal use of this material is permitted.  Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Available from: 2019-03-27 Created: 2019-03-27 Last updated: 2019-07-01Bibliographically approved
Westphal, F., Axelsson, S., Neuhaus, C. & Polze, A. (2014). VMI-PL: A monitoring language for virtual platforms using virtual machine introspection. Digital Investigation. The International Journal of Digital Forensics and Incident Response, 11, S85-S94 Supplement: 2
Open this publication in new window or tab >>VMI-PL: A monitoring language for virtual platforms using virtual machine introspection
2014 (English)In: Digital Investigation. The International Journal of Digital Forensics and Incident Response, ISSN 1742-2876, E-ISSN 1873-202X, Vol. 11, p. S85-S94 Supplement: 2Article in journal (Refereed) Published
Abstract [en]

With the growth of virtualization and cloud computing, more and more forensic investigations rely on being able to perform live forensics on a virtual machine using virtual machine introspection (VMI). Inspecting a virtual machine through its hypervisor enables investigation without risking contamination of the evidence, crashing the computer, etc. To further access to these techniques for the investigator/researcher we have developed a new VMI monitoring language. This language is based on a review of the most commonly used VMI-techniques to date, and it enables the user to monitor the virtual machine's memory, events and data streams. A prototype implementation of our monitoring system was implemented in KVM, though implementation on any hypervisor that uses the common x86 virtualization hardware assistance support should be straightforward. Our prototype outperforms the proprietary VMWare VProbes in many cases, with a maximum performance loss of 18% for a realistic test case, which we consider acceptable. Our implementation is freely available under a liberal software distribution license.

Place, publisher, year, edition, pages
Elsevier, 2014
Keywords
Virtualization, Security, Monitoring language, Live forensics, Introspection, Classification
National Category
Computer Sciences
Identifiers
urn:nbn:se:bth-6582 (URN)10.1016/j.diin.2014.05.016 (DOI)000340301000011 ()oai:bth.se:forskinfo0A0A78B4664692A1C1257D6D003DE867 (Local ID)oai:bth.se:forskinfo0A0A78B4664692A1C1257D6D003DE867 (Archive number)oai:bth.se:forskinfo0A0A78B4664692A1C1257D6D003DE867 (OAI)
Available from: 2014-10-10 Created: 2014-10-10 Last updated: 2018-02-02Bibliographically approved
Westphal, F., Grahn, H. & Lavesson, N.User Feedback and Uncertainty in Interactive Binarization.
Open this publication in new window or tab >>User Feedback and Uncertainty in Interactive Binarization
(English)Manuscript (preprint) (Other academic)
Abstract [en]

A major challenge in document image binarization is the large variety in appearance of images from different document collections. This is especially challenging for parameterless, machine learning based binarization algorithms, which require additional ground truth training data to generalize or fine-tune to a new image collection. Reducing this costly labeling effort is relevant to companies and government institutions, which possess many different document image collections. One approach to address this problem is interactive machine learning, which enables a user to guide the fine-tuning process by providing feedback on the produced binarization result.

In this paper, we evaluate the claim that user guided training requires less labeled samples to fine-tune a basic model for binarization to a new image collection. Further, we propose a way to guide user feedback by visualizing the model’s labeling uncertainty and analyze the relationship between model uncertainty and binarization quality. Our experiments show that user feedback biases the model towards favoring foreground labels, which results in less erased text and thus better readability than when training samples are chosen randomly. Additionally, we find that model uncertainty serves as a useful guide for users and explain how the Dunning-Kruger effect prevents model uncertainty from being useful for automated sample selection.

National Category
Computer Sciences
Identifiers
urn:nbn:se:bth-16877 (URN)
Available from: 2018-08-20 Created: 2018-08-20 Last updated: 2018-08-27Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-2161-7371

Search in DiVA

Show all publications