[23] | Natalia Sokolova, Klaus Schöffmann, Mario Taschwer, Doris Putzgruber-Adamitsch, Yosuf El-Shabrawi, Evaluating the Generalization Performance of Instrument Classification in Cataract Surgery Videos, In Proceedings of the 26th International Conference in MultiMedia Modeling (MMM 2020) (Part II) (Wen-Huang Cheng, Junmo Kim, Wei-Ta Chu, Peng Cui, Jung-Woo Choi, Min-Chun Hu, Wesley De Neve, eds.), Springer, vol. 11962, Berlin, pp. 626-636, 2019.
[bib][url] [doi] |
[22] | Mario Taschwer, Manfred Jürgen Primus, Klaus Schoeffmann, Oge Marques, Early and Late Fusion of Classifiers for the MediaEval Medico Task, In Working Notes Proceedings of the MediaEval 2018 Workshop (M. Larson, P. Arora, C.H. Demarty, M. Riegler, B. Bischke, E. Dellandrea, M. Lux, A. Porter, G.J.F. Jones, eds.), vol. 2283, 2018.
[bib][url] |
[21] | Mario Taschwer, Oge Marques, Automatic separation of compound figures in scientific articles, In Multimedia Tools and Applications, no. 77, pp. 519-548, 2018.
[bib][url] [doi] [abstract]
Abstract: Content-based analysis and retrieval of digital images found in scientific articles is often hindered by images consisting of multiple subfigures (compound figures). We address this problem by proposing a method (ComFig) to automatically classify and separate compound figures, which consists of two main steps: (i) a supervised compound figure classifier (ComFig classifier) discriminates between compound and non-compound figures using task-specific image features; and (ii) an image processing algorithm is applied to predicted compound images to perform compound figure separation (ComFig separation). The proposed ComFig classifier is shown to achieve state-of-the-art classification performance on a published dataset. Our ComFig separation algorithm shows superior separation accuracy on two different datasets compared to other known automatic approaches. Finally, we propose a method to evaluate the effectiveness of the ComFig chain combining classifier and separation algorithm, and use it to optimize the misclassification loss of the ComFig classifier for maximal effectiveness in the chain.
|
[20] | Mario Taschwer, Concept-Based and Multimodal Methods for Medical Case Retrieval, PhD thesis, Alpen-Adria-Universität Klagenfurt, Austria, pp. 200, 2017.
[bib] [pdf] [abstract]
Abstract: Medical case retrieval (MCR) is defined as a multimedia retrieval problem, where the document collection consists of medical case descriptions that pertain to particular diseases, patients' histories, or other entities of biomedical knowledge. Case descriptions are multimedia documents containing textual and visual modalities (images). A query may consist of a textual description of patient's symptoms and related diagnostic images. This thesis proposes and evaluates methods that aim at improving MCR effectiveness over the baseline of fulltext retrieval. We hypothesize that this objective can be achieved by utilizing controlled vocabularies of biomedical concepts for query expansion and concept-based retrieval. The latter represents case descriptions and queries as vectors of biomedical concepts, which may be generated automatically from textual and/or visual modalities by concept mapping algorithms. We propose a multimodal retrieval framework for MCR by late fusion of text-based retrieval (including query expansion) and concept-based retrieval and show that retrieval effectiveness can be improved by 49% using linear fusion of practical component retrieval systems. The potential of further improvement is experimentally estimated as a 166% increase of effectiveness over fulltext retrieval using query-adaptive fusion of ideal component retrieval systems. Additional contributions of this thesis include the proposal and comparative evaluation of methods for concept mapping, query and document expansion, and automatic classification and separation of compound figures found in case descriptions.
|
[19] | Konstantin Pogorelov, Kristin Ranheim Randel, Thomas de Lange, Sigrun L. Eskeland, Carsten Griwodz, Concetto Spampinato, Mario Taschwer, Mathias Lux, Peter T. Schmidt, Michael Riegler, Pal Halvorsen, Nerthus: A Bowel Preparation Quality Video Dataset, In Proceedings of the 8th ACM on Multimedia Systems Conference (MMSys 2017) (Kuan-Ta Chen, Pablo Cesar, Cheng-Hsin Hsu, eds.), Association for Computing Machinery (ACM), pp. 170-174, 2017.
[bib][url] [doi] [abstract]
Abstract: Bowel preparation (cleansing) is considered to be a key precondition for successful colonoscopy (endoscopic examination of the bowel). The degree of bowel cleansing directly affects the possibility to detect diseases and may influence decisions on screening and follow-up examination intervals. An accurate assessment of bowel preparation quality is therefore important. Despite the use of reliable and validated bowel preparation scales, the grading may vary from one doctor to another. An objective and automated assessment of bowel cleansing would contribute to reduce such inequalities and optimize use of medical resources. This would also be a valuable feature for automatic endoscopy reporting in the future. In this paper, we present Nerthus, a dataset containing videos from inside the gastrointestinal (GI) tract, showing different degrees of bowel cleansing. By providing this dataset, we invite multimedia researchers to contribute in the medical field by making systems automatically evaluate the quality of bowel cleansing for colonoscopy. Such innovations would probably contribute to improve the medical field of GI endoscopy.
|
[18] | Mario Taschwer, Oge Marques, Automatic Separation of Compound Figures in Scientific Articles, In Multimedia Tools and Applications, Springer, New York, pp. 1-30, 2016.
[bib] [doi] [pdf] [abstract]
Abstract: Content-based analysis and retrieval of digital images found in scientific articles is often hindered by images consisting of multiple subfigures (compound figures). We address this problem by proposing a method (ComFig) to automatically classify and separate compound figures, which consists of two main steps: (i) a supervised compound figure classifier (ComFig classifier) discriminates between compound and non-compound figures using task-specific image features; and (ii) an image processing algorithm is applied to predicted compound images to perform compound figure separation (ComFig separation). The proposed ComFig classifier is shown to achieve state-of-the-art classification performance on a published dataset. Our ComFig separation algorithm shows superior separation accuracy on two different datasets compared to other known automatic approaches. Finally, we propose a method to evaluate the effectiveness of the ComFig chain combining classifier and separation algorithm, and use it to optimize the misclassification loss of the ComFig classifier for maximal effectiveness in the chain.
|
[17] | Mario Taschwer, Oge Marques, Compound Figure Separation Combining Edge and Band Separator Detection, In MultiMedia Modeling (Qi Tian, Nicu Sebe, Guo-Jun Qi, Benoit Huet, Richang Hong, Xueliang Liu, eds.), Springer International Publishing, vol. 9516, Cham, Switzerland, pp. 162-173, 2016.
[bib][url] [doi] [pdf] [slides] [abstract]
Abstract: We propose an image processing algorithm to automatically separate compound figures appearing in scientific articles. We classify compound images into two classes and apply different algorithms for detecting vertical and horizontal separators to each class: the edge-based algorithm aims at detecting visible edges between subfigures, whereas the band-based algorithm tries to detect whitespace separating subfigures (separator bands). The proposed algorithm has been evaluated on two datasets for compound figure separation (CFS) in the biomedical domain and compares well to semi-automatic or more comprehensive state-of-the-art approaches. Additional experiments investigate CFS effectiveness and classification accuracy of various classifier implementations.
|
[16] | Mario Taschwer, Oge Marques, AAUITEC at ImageCLEF 2015: Compound Figure Separation, In CLEF 2015 Working Notes (Linda Capellato, Nicola Ferro, Gareth Jones, Eric Juan, eds.), CLEF Association, vol. 1391, Padova, Italy, pp. 9, 2015.
[bib][url] [pdf] [slides] [abstract]
Abstract: Our approach to automatically separating compound figures appearing in biomedical articles is split into two image processing algorithms: one is based on detecting separator edges, and the other tries to identify background bands separating subgures. Only one algorithm is applied to a given image, according to the prediction of a binary classifier trained to distinguish graphical illustrations from other images in biomedical articles. Our submission to the ImageCLEF 2015 compound figure separation task achieved an accuracy of 49% on the provided test set of about 3400 compound images. This stays clearly behind the best submission of other participants (85% accuracy), but is by an order of magnitude faster than other approaches reported in the literature.
|
[15] | Mario Taschwer, Medical Case Retrieval, In Proceedings of the ACM International Conference on Multimedia (n/a n/a, ed.), ACM, New York, NY, USA, pp. 639-642, 2014.
[bib] [doi] [pdf] [slides] |
[14] | Mario Taschwer, Textual Methods for Medical Case Retrieval, Technical report, Institute of Information Technology (ITEC), Alpen-Adria-Universität, no. TR/ITEC/14/2.01, Klagenfurt, Austria, pp. 50, 2014.
[bib] [pdf] [abstract]
Abstract: Medical case retrieval (MCR) is information retrieval in a collection of medical case descriptions, where descriptions of patients' symptoms are used as queries. We apply known text retrieval techniques based on query and document expansion to this problem, and combine them with new algorithms to match queries and documents with Medical Subject Headings (MeSH). We ran comprehensive experiments to evaluate 546 method combinations on the ImageCLEF 2013 MCR dataset. Methods combining MeSH query expansion with pseudo-relevance feedback performed best, delivering retrieval performance comparable to or slightly better than the best MCR run submitted to ImageCLEF 2013.
|
[13] | Mario Taschwer, Text-Based Medical Case Retrieval Using MeSH Ontology, In CLEF 2013 Evaluation Labs and Workshop, Online Working Notes (Pamela Forner, Roberto Navigli, Dan Tufis, eds.), CLEF Initiative, Padua, Italy, pp. 5, 2013.
[bib][url] [pdf] [slides] [abstract]
Abstract: Our approach to the ImageCLEF medical case retrieval task consists of text-only retrieval combined with utilizing the Medical Subject Headings (MeSH) ontology. MeSH terms extracted from the query are used for query expansion or query term weighting. MeSH annotations of documents available from PubMed Central are added to the corpus. Retrieval results improve slightly upon full-text retrieval.
|
[12] | Manfred Del Fabro, Klaus Schoeffmann, Mario Guggenberger, Mario Taschwer, A Filtering Tool to Support Interactive Search in Internet Video Archives, In 11th International Workshop on Content-Based Multimedia Indexing (Laszlo Czuni, ed.), IEEE Computer Society, Los Alamitos, CA, USA, pp. 7-10, 2013.
[bib] |
[11] | Mario Taschwer, A Key-Frame-Oriented Video Browser, In Advances in Multimedia Modeling (Klaus Schoeffmann, Bernard Merialdo, Alexander Hauptmann, Chong-Wah Ngo, Yiannis Andreopoulos, Christian Breiteneder, eds.), Springer, vol. 7131, Berlin / Heidelberg, pp. 655-657, 2012.
[bib][url] [doi] [abstract]
Abstract: We propose a video browser facilitating known-item search in a single video. Key frames are presented as four images at a time and can be navigated quickly in both forward and backward directions using a slider. Alternatively, key frames can be displayed automatically at different frame rates. The user may choose between three mappings of key frames to the four key frame widgets based on video time stamps and color similarity.
|
[10] | Mathias Lux, Mario Taschwer, Oge Marques, Classification of photos based on good feelings: ACM MM 2012 multimedia grand challenge submission, In Proceedings of the 20th ACM international conference on Multimedia (Kiyoharu Aizawa, Noboru Babaguchi, John Smith, eds.), ACM, New York, NY, USA, pp. 1367-1368, 2012.
[bib][url] [doi] |
[9] | Mathias Lux, Mario Taschwer, Oge Marques, A closer look at photographers' intentions: a test dataset, In Proceedings of the ACM multimedia 2012 workshop on Crowdsourcing for multimedia (Kiyoharu Aizawa, Noboru Babaguchi, John Smith, eds.), ACM, New York, NY, USA, pp. 17-18, 2012.
[bib][url] [doi] |
[8] | Manfred Del Fabro, Mathias Lux, Klaus Schoeffmann, Mario Taschwer, ITEC-UNIKLU Known-Item Search Submission 2012, In Proceedings of TRECVID 2012 (Paul Over, George Awad, Martial Michel, Jonathan Fiscus, Greg Sanders, Barbara Shaw, Wessel Kraaij, Alan Smeaton, Georges Quénot, eds.), National Institute of Standards and Technology (NIST), Gaithersburg, USA, pp. 11, 2012.
[bib][url] [abstract]
Abstract: In this report we describe our approach to the known-item search task for TRECVID 2012. We describe how we index available metadata and how we gain additional information about the videos using content-based analysis. A rule-based query expansion and query reduction method is applied to increase the number of relevant videos in automatic runs. Furthermore, we describe an approach for quick, interactive filtering of large result sets. We outline how the parameters of our system were tuned for the IACC dataset and discuss our TRECVID 2012 KIS results.
|
[7] | Klaus Schoeffmann, Mario Taschwer, Laszlo Böszörmenyi, The video explorer: a tool for navigation and searching within a single video based on fast content analysis, In MMSys ’10: Proceedings of the first annual ACM SIGMM conference on Multimedia systems (Wu-chi Feng, Ketan Mayer-Patel, eds.), ACM, New York, NY, USA, pp. 247–258, 2010.
[bib] [doi] |
[6] | Anita Sobe, Laszlo Böszörmenyi, Mario Taschwer, Video Notation (ViNo): A Formalism for Describing and Evaluating Non-sequential Multimedia Access, In International Journal on Advances in Software, International Academy, Research and Industry Association (IARIA), vol. 3, no. 1 & 2, Valencia, Spain, pp. 19-30, 2010.
[bib][url] [pdf] [abstract]
Abstract: The contributions of this paper are threefold: (1) the extensive introduction of a formal Video Notation (ViNo) that allows for describing different multimedia transport techniques for specifying required QoS; (2) the application of this formal notation to analyzing different transport mechanisms without the need of detailed simulations; (3) further application of ViNo to caching techniques, leading to the introduction of two cache admission policies and one replacement policy supporting nonsequential multimedia access. The applicability of ViNo is shown by example and by analysis of an existing CDN simulation. We find that a pure LRU replacement yields significantly lower hit rates than our suggested popularity-based replacement. The evaluation of caches was done by simulation and by usage of ViNo.
|
[5] | Mathias Lux, Klaus Schoeffmann, Manfred del Fabro, Marian Kogler, Mario Taschwer, ITEC-UNIKLU Known-Item Search Submission, In TRECVID 2010 Participant Notebook Papers (Paul Over, George Awad, Jonathan Fiscus, Martial Michel, Wessel Kraaij, Alan Smeaton, Georges Quénot, eds.), National Institute of Standards and Technology (NIST), Gaithersburg, USA, pp. 9, 2010.
[bib][url] |
[4] | Klaus Schoeffmann, Mathias Lux, Mario Taschwer, Laszlo Böszörmenyi, Visualization of Video Motion in Context of Video Browsing, In ICME'09 Proceedings of the 2009 IEEE international Conference on Multimedia and Expo (CY Lin, I Cox, eds.), IEEE, Los Alamitos, CA, USA, pp. 658-661, 2009.
[bib][url] [abstract]
Abstract: We present a new approach for video browsing using visualization of motion direction and motion intensity statistics by color and brightness variations. Statistics are collected from motion vectors of H.264/AVC encoded video streams, so full video decoding is not required. By interpreting visualized motion patterns of video segments, users are able to quickly identify scenes similar to a prototype scene or identify potential scenes of interest. We give some examples of motion patterns with different semantic value, including camera zooms, hill jumps of ski-jumpers, and the repeated appearance of a news speaker. In a user study we show that certain scenes of interest can be found significantly faster using our video browsing tool than using a video player with VCR-like controls.
|
[3] | Klaus Schoeffmann, Mario Taschwer, Laszlo Böszörmenyi, Video Browsing Using Motion Visualization, In Proceedings oft the International Conference on Multimedia and Expo 2009 (CY Lin, I Cox, eds.), IEEE, Los Alamitos, CA, USA, pp. 1835-1836, 2009.
[bib] [abstract]
Abstract: We present a video browsing tool that uses a novel and powerful visualization technique of video motion. The tool provides an interactive navigation index that allows users to quickly and easily recognize content semantics like scenes with fast/slow motion (in general or according to a specific direction), scenes showing still/moving objects in front of a still/moving background, camera pans, or camera zooms. Moreover, the visualization facilitates identification of similar segments in a video. A first user study has shown encouraging results.
|
[2] | Mario Taschwer, Armin Müller, Laszlo Böszörmenyi, Integrating Semantic Search and Adaptive Streaming of Video Segments: the DAHL Project, Technical report, Institute of Information Technology (ITEC), Klagenfurt University, no. TR/ITEC/05/2.04, Klagenfurt, Austria, pp. 34, 2005.
[bib] [abstract]
Abstract: The DAHL project aimed at demonstrating some of the research achievements at ITEC by extending anexisting web application with content-based search mechanisms and an adaptive streaming environment for video data. The search is based on MPEG-7 descriptions of video data, and video retrieval uses an MPEG-4 conforming adaptive streaming server and player, which allows to adapt the video stream dynamically to client capabilities, user preferences, and available network bandwidth. This report describes the design, implementation, and integration work done in the DAHL project.
|
[1] | Mario Taschwer, Modular Multiplication Using Special Prime Moduli, In Kommunikationssicherheit im Zeichen des Internet (Patrick Horster, ed.), Vieweg, Braunschweig/Wiesbaden, pp. 346-371, 2001.
[bib] [pdf] [abstract]
Abstract: Elliptic curve cryptosystems allow the use of prime fields with special prime moduli that speed up the finite field arithmetic considerably. Two algorithms for reduction with respect to special moduli have been implemented in software on both a 32-bit and a 64-bit platform and compared to well-known generic modular reduction methods. Timing results for multiplications in prime fields of size between 2^191 and 2^512 are presented and discussed.
|