Search | arXiv e-print repository

<!DOCTYPE html> <html lang="en"> <head> <meta charset="utf-8"/> <meta name="viewport" content="width=device-width, initial-scale=1"/>  <link rel="apple-touch-icon" sizes="180x180" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/apple-touch-icon.png"> <link rel="icon" type="image/png" sizes="32x32" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-32x32.png"> <link rel="icon" type="image/png" sizes="16x16" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-16x16.png"> <link rel="manifest" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/site.webmanifest"> <link rel="mask-icon" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/safari-pinned-tab.svg" color="#b31b1b"> <link rel="shortcut icon" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon.ico"> <meta name="msapplication-TileColor" content="#b31b1b"> <meta name="msapplication-config" content="images/icons/browserconfig.xml"> <meta name="theme-color" content="#b31b1b">  <title>Search | arXiv e-print repository</title> <script defer src="https://static.arxiv.org/static/base/1.0.0a5/fontawesome-free-5.11.2-web/js/all.js"></script> <link rel="stylesheet" href="https://static.arxiv.org/static/base/1.0.0a5/css/arxivstyle.css" /> <script type="text/x-mathjax-config"> MathJax.Hub.Config({ messageStyle: "none", extensions: ["tex2jax.js"], jax: ["input/TeX", "output/HTML-CSS"], tex2jax: { inlineMath: [ ['$','$'], ["\$","\$"] ], displayMath: [ ['$$','$$'], ["\\[","\\]"] ], processEscapes: true, ignoreClass: '.*', processClass: 'mathjax.*' }, TeX: { extensions: ["AMSmath.js", "AMSsymbols.js", "noErrors.js"], noErrors: { inlineDelimiters: ["$","$"], multiLine: false, style: { "font-size": "normal", "border": "" } } }, "HTML-CSS": { availableFonts: ["TeX"] } }); </script> <script src='//static.arxiv.org/MathJax-2.7.3/MathJax.js'></script> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/notification.js"></script> <link rel="stylesheet" href="https://static.arxiv.org/static/search/0.5.6/css/bulma-tooltip.min.css" /> <link rel="stylesheet" href="https://static.arxiv.org/static/search/0.5.6/css/search.css" /> <script src="https://code.jquery.com/jquery-3.2.1.slim.min.js" integrity="sha256-k2WSCIexGzOj3Euiig+TlR8gA0EmPjuc79OEeY5L45g=" crossorigin="anonymous"></script> <script src="https://static.arxiv.org/static/search/0.5.6/js/fieldset.js"></script> <style> radio#cf-customfield_11400 { display: none; } </style> </head> <body> <header><a href="#main-container" class="is-sr-only">Skip to main content</a>  <div class="attribution level is-marginless" role="banner"> <div class="level-left"> <a class="level-item" href="https://cornell.edu/"><img src="https://static.arxiv.org/static/base/1.0.0a5/images/cornell-reduced-white-SMALL.svg" alt="Cornell University" width="200" aria-label="logo" /></a> </div> <div class="level-right is-marginless"><p class="sponsors level-item is-marginless"><span id="support-ack-url">We gratefully acknowledge support from<br /> the Simons Foundation, <a href="https://info.arxiv.org/about/ourmembers.html">member institutions</a>, and all contributors. <a href="https://info.arxiv.org/about/donate.html">Donate</a></span></p></div> </div>  <div class="identity level is-marginless"> <div class="level-left"> <div class="level-item"> <a class="arxiv" href="https://arxiv.org/" aria-label="arxiv-logo"> <img src="https://static.arxiv.org/static/base/1.0.0a5/images/arxiv-logo-one-color-white.svg" aria-label="logo" alt="arxiv logo" width="85" style="width:85px;"/> </a> </div> </div> <div class="search-block level-right"> <form class="level-item mini-search" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <div class="control"> <input class="input is-small" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <p class="help"><a href="https://info.arxiv.org/help">Help</a> | <a href="https://arxiv.org/search/advanced">Advanced Search</a></p> </div> <div class="control"> <div class="select is-small"> <select name="searchtype" aria-label="Field to search"> <option value="all" selected="selected">All fields</option> <option value="title">Title</option> <option value="author">Author</option> <option value="abstract">Abstract</option> <option value="comments">Comments</option> <option value="journal_ref">Journal reference</option> <option value="acm_class">ACM classification</option> <option value="msc_class">MSC classification</option> <option value="report_num">Report number</option> <option value="paper_id">arXiv identifier</option> <option value="doi">DOI</option> <option value="orcid">ORCID</option> <option value="author_id">arXiv author ID</option> <option value="help">Help pages</option> <option value="full_text">Full text</option> </select> </div> </div> <input type="hidden" name="source" value="header"> <button class="button is-small is-cul-darker">Search</button> </div> </form> </div> </div>  <div class="container"> <div class="user-tools is-size-7 has-text-right has-text-weight-bold" role="navigation" aria-label="User menu"> <a href="https://arxiv.org/login">Login</a> </div> </div> </header> <main class="container" id="main-container"> <div class="level is-marginless"> <div class="level-left"> <h1 class="title is-clearfix"> Showing 1–33 of 33 results for author: <span class="mathjax">Freisleben, B</span> </h1> </div> <div class="level-right is-hidden-mobile">  <span class="help" style="display: inline-block;"><a href="https://github.com/arXiv/arxiv-search/releases">Search v0.5.6 released 2020-02-24</a>  </span> </div> </div> <div class="content"> <form method="GET" action="/search/cs" aria-role="search"> Searching in archive <strong>cs</strong>. <a href="/search/?searchtype=author&query=Freisleben%2C+B">Search in all archives.</a> <div class="field has-addons-tablet"> <div class="control is-expanded"> <label for="query" class="hidden-label">Search term or terms</label> <input class="input is-medium" id="query" name="query" placeholder="Search term..." type="text" value="Freisleben, B"> </div> <div class="select control is-medium"> <label class="is-hidden" for="searchtype">Field</label> <select class="is-medium" id="searchtype" name="searchtype"><option value="all">All fields</option><option value="title">Title</option><option selected value="author">Author(s)</option><option value="abstract">Abstract</option><option value="comments">Comments</option><option value="journal_ref">Journal reference</option><option value="acm_class">ACM classification</option><option value="msc_class">MSC classification</option><option value="report_num">Report number</option><option value="paper_id">arXiv identifier</option><option value="doi">DOI</option><option value="orcid">ORCID</option><option value="license">License (URI)</option><option value="author_id">arXiv author ID</option><option value="help">Help pages</option><option value="full_text">Full text</option></select> </div> <div class="control"> <button class="button is-link is-medium">Search</button> </div> </div> <div class="field"> <div class="control is-size-7"> <label class="radio"> <input checked id="abstracts-0" name="abstracts" type="radio" value="show"> Show abstracts </label> <label class="radio"> <input id="abstracts-1" name="abstracts" type="radio" value="hide"> Hide abstracts </label> </div> </div> <div class="is-clearfix" style="height: 2.5em"> <div class="is-pulled-right"> <a href="/search/advanced?terms-0-term=Freisleben%2C+B&terms-0-field=author&size=50&order=-announced_date_first">Advanced Search</a> </div> </div> <input type="hidden" name="order" value="-announced_date_first"> <input type="hidden" name="size" value="50"> </form> <div class="level breathe-horizontal"> <div class="level-left"> <form method="GET" action="/search/"> <div style="display: none;"> <select id="searchtype" name="searchtype"><option value="all">All fields</option><option value="title">Title</option><option selected value="author">Author(s)</option><option value="abstract">Abstract</option><option value="comments">Comments</option><option value="journal_ref">Journal reference</option><option value="acm_class">ACM classification</option><option value="msc_class">MSC classification</option><option value="report_num">Report number</option><option value="paper_id">arXiv identifier</option><option value="doi">DOI</option><option value="orcid">ORCID</option><option value="license">License (URI)</option><option value="author_id">arXiv author ID</option><option value="help">Help pages</option><option value="full_text">Full text</option></select> <input id="query" name="query" type="text" value="Freisleben, B"> <ul id="abstracts"><li><input checked id="abstracts-0" name="abstracts" type="radio" value="show"> <label for="abstracts-0">Show abstracts</label></li><li><input id="abstracts-1" name="abstracts" type="radio" value="hide"> <label for="abstracts-1">Hide abstracts</label></li></ul> </div> <div class="box field is-grouped is-grouped-multiline level-item"> <div class="control"> <span class="select is-small"> <select id="size" name="size"><option value="25">25</option><option selected value="50">50</option><option value="100">100</option><option value="200">200</option></select> </span> <label for="size">results per page</label>. </div> <div class="control"> <label for="order">Sort results by</label> <span class="select is-small"> <select id="order" name="order"><option selected value="-announced_date_first">Announcement date (newest first)</option><option value="announced_date_first">Announcement date (oldest first)</option><option value="-submitted_date">Submission date (newest first)</option><option value="submitted_date">Submission date (oldest first)</option><option value="">Relevance</option></select> </span> </div> <div class="control"> <button class="button is-small is-link">Go</button> </div> </div> </form> </div> </div> <ol class="breathe-horizontal" start="1"> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2305.04710">arXiv:2305.04710</a> <span> [<a href="https://arxiv.org/pdf/2305.04710">pdf</a>, <a href="https://arxiv.org/format/2305.04710">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Multimedia">cs.MM</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1007/978-3-030-89131-2_2">10.1007/978-3-030-89131-2_2 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> ElasticHash: Semantic Image Similarity Search by Deep Hashing with Elasticsearch </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Korfhage%2C+N">Nikolaus Korfhage</a>, <a href="/search/cs?searchtype=author&query=M%C3%BChling%2C+M">Markus M眉hling</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2305.04710v1-abstract-short" style="display: inline;"> We present ElasticHash, a novel approach for high-quality, efficient, and large-scale semantic image similarity search. It is based on a deep hashing model to learn hash codes for fine-grained image similarity search in natural images and a two-stage method for efficiently searching binary hash codes using Elasticsearch (ES). In the first stage, a coarse search based on short hash codes is perform… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2305.04710v1-abstract-full').style.display = 'inline'; document.getElementById('2305.04710v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2305.04710v1-abstract-full" style="display: none;"> We present ElasticHash, a novel approach for high-quality, efficient, and large-scale semantic image similarity search. It is based on a deep hashing model to learn hash codes for fine-grained image similarity search in natural images and a two-stage method for efficiently searching binary hash codes using Elasticsearch (ES). In the first stage, a coarse search based on short hash codes is performed using multi-index hashing and ES terms lookup of neighboring hash codes. In the second stage, the list of results is re-ranked by computing the Hamming distance on long hash codes. We evaluate the retrieval performance of \textit{ElasticHash} for more than 120,000 query images on about 6.9 million database images of the OpenImages data set. The results show that our approach achieves high-quality retrieval results and low search latencies. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2305.04710v1-abstract-full').style.display = 'none'; document.getElementById('2305.04710v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 8 May, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> The 19th International Conference on Computer Analysis of Images and Patterns (CAIP), 2021. Lecture Notes in Computer Science, vol 13053. Springer, Cham </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2211.02626">arXiv:2211.02626</a> <span> [<a href="https://arxiv.org/pdf/2211.02626">pdf</a>, <a href="https://arxiv.org/format/2211.02626">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> </div> </div> <p class="title is-5 mathjax"> Leveraging Statistical Shape Priors in GAN-based ECG Synthesis </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Neifar%2C+N">Nour Neifar</a>, <a href="/search/cs?searchtype=author&query=Ben-Hamadou%2C+A">Achraf Ben-Hamadou</a>, <a href="/search/cs?searchtype=author&query=Mdhaffar%2C+A">Afef Mdhaffar</a>, <a href="/search/cs?searchtype=author&query=Jmaiel%2C+M">Mohamed Jmaiel</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2211.02626v2-abstract-short" style="display: inline;"> Electrocardiogram (ECG) data collection during emergency situations is challenging, making ECG data generation an efficient solution for dealing with highly imbalanced ECG training datasets. In this paper, we propose a novel approach for ECG signal generation using Generative Adversarial Networks (GANs) and statistical ECG data modeling. Our approach leverages prior knowledge about ECG dynamics to… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2211.02626v2-abstract-full').style.display = 'inline'; document.getElementById('2211.02626v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2211.02626v2-abstract-full" style="display: none;"> Electrocardiogram (ECG) data collection during emergency situations is challenging, making ECG data generation an efficient solution for dealing with highly imbalanced ECG training datasets. In this paper, we propose a novel approach for ECG signal generation using Generative Adversarial Networks (GANs) and statistical ECG data modeling. Our approach leverages prior knowledge about ECG dynamics to synthesize realistic signals, addressing the complex dynamics of ECG signals. To validate our approach, we conducted experiments using ECG signals from the MIT-BIH arrhythmia database. Our results demonstrate that our approach, which models temporal and amplitude variations of ECG signals as 2-D shapes, generates more realistic signals compared to state-of-the-art GAN based generation baselines. Our proposed approach has significant implications for improving the quality of ECG training datasets, which can ultimately lead to better performance of ECG classification algorithms. This research contributes to the development of more efficient and accurate methods for ECG analysis, which can aid in the diagnosis and treatment of cardiac diseases. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2211.02626v2-abstract-full').style.display = 'none'; document.getElementById('2211.02626v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 3 June, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 22 October, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">6 figures, 31 pages, under review</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2012.05239">arXiv:2012.05239</a> <span> [<a href="https://arxiv.org/pdf/2012.05239">pdf</a>, <a href="https://arxiv.org/format/2012.05239">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Distributed, Parallel, and Cluster Computing">cs.DC</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/ANCS.2019.8901877">10.1109/ANCS.2019.8901877 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> INetCEP: In-Network Complex Event Processing for Information-Centric Networking </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Luthra%2C+M">Manisha Luthra</a>, <a href="/search/cs?searchtype=author&query=Koldehofe%2C+B">Boris Koldehofe</a>, <a href="/search/cs?searchtype=author&query=H%C3%B6chst%2C+J">Jonas H枚chst</a>, <a href="/search/cs?searchtype=author&query=Lampe%2C+P">Patrick Lampe</a>, <a href="/search/cs?searchtype=author&query=Rizvi%2C+A+H">Ali Haider Rizvi</a>, <a href="/search/cs?searchtype=author&query=Kundel%2C+R">Ralf Kundel</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2012.05239v2-abstract-short" style="display: inline;"> Emerging network architectures like Information-centric Networking (ICN) offer simplicity in the data plane by addressing named data. Such flexibility opens up the possibility to move data processing inside network elements for high-performance computation, known as in-network processing. However, existing ICN architectures are limited in terms of data plane programmability due to the lack of (i)… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2012.05239v2-abstract-full').style.display = 'inline'; document.getElementById('2012.05239v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2012.05239v2-abstract-full" style="display: none;"> Emerging network architectures like Information-centric Networking (ICN) offer simplicity in the data plane by addressing named data. Such flexibility opens up the possibility to move data processing inside network elements for high-performance computation, known as in-network processing. However, existing ICN architectures are limited in terms of data plane programmability due to the lack of (i) in-network processing and (ii) data plane programming abstractions. Such architectures can benefit from Complex Event Processing (CEP), an in-network processing paradigm to efficiently process data inside the data plane. Yet, it is extremely challenging to integrate CEP because the current communication model of ICN is limited to consumer-initiated interaction that comes with significant overhead in a number of requests to process continuous data streams. In contrast, a change to producer-initiated interaction, as favored by CEP, imposes severe limitations for request-reply interactions. In this paper, we propose an in-network CEP architecture, INetCEP that supports unified interaction patterns (consumer- and producer-initiated). In addition, we provide a CEP query language and facilitate CEP operations while increasing the range of applications that can be supported by ICN. We provide an open-source implementation and evaluation of INetCEP over an ICN architecture, Named Function Networking, and two applications: energy forecasting in smart homes and a disaster scenario. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2012.05239v2-abstract-full').style.display = 'none'; document.getElementById('2012.05239v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 14 December, 2020; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 9 December, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2020. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">arXiv admin note: text overlap with arXiv:2012.05070</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> 2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), Cambridge, United Kingdom, 2019, pp. 1-13 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2012.05070">arXiv:2012.05070</a> <span> [<a href="https://arxiv.org/pdf/2012.05070">pdf</a>, <a href="https://arxiv.org/format/2012.05070">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Distributed, Parallel, and Cluster Computing">cs.DC</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Efficient Complex Event Processing in Information-centric Networking at the Edge </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Luthra%2C+M">Manisha Luthra</a>, <a href="/search/cs?searchtype=author&query=Pfannm%C3%BCller%2C+J">Johannes Pfannm眉ller</a>, <a href="/search/cs?searchtype=author&query=Koldehofe%2C+B">Boris Koldehofe</a>, <a href="/search/cs?searchtype=author&query=H%C3%B6chst%2C+J">Jonas H枚chst</a>, <a href="/search/cs?searchtype=author&query=Sterz%2C+A">Artur Sterz</a>, <a href="/search/cs?searchtype=author&query=Hark%2C+R">Rhaban Hark</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2012.05070v2-abstract-short" style="display: inline;"> Information-centric Networking (ICN) is an emerging Internet architecture that offers promising features, such as in-network caching and named data addressing, to support the edge computing paradigm, in particular Internet-of-Things (IoT) applications. ICN can benefit from Complex Event Processing (CEP), which is an in-network processing paradigm to specify and perform efficient query operations o… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2012.05070v2-abstract-full').style.display = 'inline'; document.getElementById('2012.05070v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2012.05070v2-abstract-full" style="display: none;"> Information-centric Networking (ICN) is an emerging Internet architecture that offers promising features, such as in-network caching and named data addressing, to support the edge computing paradigm, in particular Internet-of-Things (IoT) applications. ICN can benefit from Complex Event Processing (CEP), which is an in-network processing paradigm to specify and perform efficient query operations on data streams. However, integrating CEP into ICN is a challenging task due to the following reasons: (1) typical ICN architectures do not provide support for forwarding and processing continuous data streams; (2) IoT applications often need short response times and require robust event detection, which both are hard to accomplish using existing CEP systems. In this article, we present a novel network architecture, called INetCEP, for efficient CEP-based in-network processing as part of ICN. INetCEP enables efficient data processing in ICN by means of (1) a unified communication model that supports continuous data streams, (2) a meta query language for CEP to specify data processing operations in the data plane, and (3) query processing algorithms to resolve the specified operations. Our experimental results for two IoT use cases and datasets show that INetCEP offers very short response times of up to 73 渭s under high workload and is more than 15X faster in terms of forwarding events than the state-of-the-art CEP system Flink. Furthermore, the delivery and processing of complex queries is around 32X faster than Flink and more than 100X faster than a naive pull-based reference approach, while maintaining 100% accuracy. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2012.05070v2-abstract-full').style.display = 'none'; document.getElementById('2012.05070v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 13 December, 2020; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 9 December, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2020. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2010.07833">arXiv:2010.07833</a> <span> [<a href="https://arxiv.org/pdf/2010.07833">pdf</a>, <a href="https://arxiv.org/format/2010.07833">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Operating Systems">cs.OS</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computers and Society">cs.CY</span> </div> </div> <p class="title is-5 mathjax"> PIMOD: A Tool for Configuring Single-Board Computer Operating System Images </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=H%C3%B6chst%2C+J">Jonas H枚chst</a>, <a href="/search/cs?searchtype=author&query=Penning%2C+A">Alvar Penning</a>, <a href="/search/cs?searchtype=author&query=Lampe%2C+P">Patrick Lampe</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2010.07833v1-abstract-short" style="display: inline;"> Computer systems used in the field of humanitarian technology are often based on general-purpose single-board computers, such as Raspberry Pis. While these systems offer great flexibility for developers and users, configuration and deployment either introduces overhead by executing scripts on multiple devices or requires deeper technical understanding when building operating system images for such… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2010.07833v1-abstract-full').style.display = 'inline'; document.getElementById('2010.07833v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2010.07833v1-abstract-full" style="display: none;"> Computer systems used in the field of humanitarian technology are often based on general-purpose single-board computers, such as Raspberry Pis. While these systems offer great flexibility for developers and users, configuration and deployment either introduces overhead by executing scripts on multiple devices or requires deeper technical understanding when building operating system images for such small computers from scratch. In this paper, we present PIMOD, a software tool for configuring operating system images for single-board computer systems. We propose a simple yet comprehensive configuration language. In a configuration profile, called Pifile, a small set of commands is used to describe the configuration of an operating system image. Virtualization techniques are used during the execution of the profile in order to be distribution and platform independent. Commands can be issued in the guest operating system, providing access to the distribution specific tools, e.g., to configure hardware parameters. The implementation of PIMOD is made public under a free and open source license. PIMOD is evaluated in terms of user benefits, performance compared to on-system configuration, and applicability across different hardware platforms and operating systems. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2010.07833v1-abstract-full').style.display = 'none'; document.getElementById('2010.07833v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 15 October, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2020. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2010.00354">arXiv:2010.00354</a> <span> [<a href="https://arxiv.org/pdf/2010.00354">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Programming Languages">cs.PL</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.22152/programming-journal.org/2021/5/4">10.22152/programming-journal.org/2021/5/4 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> ReactiFi: Reactive Programming of Wi-Fi Firmware on Mobile Devices </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Sterz%2C+A">Artur Sterz</a>, <a href="/search/cs?searchtype=author&query=Eichholz%2C+M">Matthias Eichholz</a>, <a href="/search/cs?searchtype=author&query=Mogk%2C+R">Ragnar Mogk</a>, <a href="/search/cs?searchtype=author&query=Baumg%C3%A4rtner%2C+L">Lars Baumg盲rtner</a>, <a href="/search/cs?searchtype=author&query=Graubner%2C+P">Pablo Graubner</a>, <a href="/search/cs?searchtype=author&query=Hollick%2C+M">Matthias Hollick</a>, <a href="/search/cs?searchtype=author&query=Mezini%2C+M">Mira Mezini</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2010.00354v4-abstract-short" style="display: inline;"> Network programmability will be required to handle future increased network traffic and constantly changing application needs. However, there is currently no way of using a high-level, easy to use programming language to program Wi-Fi firmware. This impedes rapid prototyping and deployment of novel network services/applications and hinders continuous performance optimization in Wi-Fi networks, sin… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2010.00354v4-abstract-full').style.display = 'inline'; document.getElementById('2010.00354v4-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2010.00354v4-abstract-full" style="display: none;"> Network programmability will be required to handle future increased network traffic and constantly changing application needs. However, there is currently no way of using a high-level, easy to use programming language to program Wi-Fi firmware. This impedes rapid prototyping and deployment of novel network services/applications and hinders continuous performance optimization in Wi-Fi networks, since expert knowledge is required for both the used hardware platforms and the Wi-Fi domain. In this paper, we present ReactiFi, a high-level reactive programming language to program Wi-Fi chips on mobile consumer devices. ReactiFi enables programmers to implement extensions of PHY, MAC, and IP layer mechanisms without requiring expert knowledge of Wi-Fi chips, allowing for novel applications and network protocols. ReactiFi programs are executed directly on the Wi-Fi chip, improving performance and power consumption compared to execution on the main CPU. ReactiFi is conceptually similar to functional reactive languages, but is dedicated to the domain-specific needs of Wi-Fi firmware. First, it handles low-level platform-specific details without interfering with the core functionality of Wi-Fi chips. Second, it supports static reasoning about memory usage of applications, which is important for typically memory-constrained Wi-Fi chips. Third, it limits dynamic changes of dependencies between computations to dynamic branching, in order to enable static reasoning about the order of computations. We evaluate ReactiFi empirically in two real-world case studies. Our results show that throughput, latency, and power consumption are significantly improved when executing applications on the Wi-Fi chip rather than in the operating system kernel or in user space. Moreover, we show that the high-level programming abstractions of ReactiFi have no performance overhead compared to manually written C code. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2010.00354v4-abstract-full').style.display = 'none'; document.getElementById('2010.00354v4-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 4 March, 2021; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 1 October, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2020. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> The Art, Science, and Engineering of Programming, 2021, Vol. 5, Issue 2, Article 4 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2006.05914">arXiv:2006.05914</a> <span> [<a href="https://arxiv.org/pdf/2006.05914">pdf</a>, <a href="https://arxiv.org/format/2006.05914">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Cryptography and Security">cs.CR</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computers and Society">cs.CY</span> </div> </div> <p class="title is-5 mathjax"> Mind the GAP: Security & Privacy Risks of Contact Tracing Apps </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Baumg%C3%A4rtner%2C+L">Lars Baumg盲rtner</a>, <a href="/search/cs?searchtype=author&query=Dmitrienko%2C+A">Alexandra Dmitrienko</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a>, <a href="/search/cs?searchtype=author&query=Gruler%2C+A">Alexander Gruler</a>, <a href="/search/cs?searchtype=author&query=H%C3%B6chst%2C+J">Jonas H枚chst</a>, <a href="/search/cs?searchtype=author&query=K%C3%BChlberg%2C+J">Joshua K眉hlberg</a>, <a href="/search/cs?searchtype=author&query=Mezini%2C+M">Mira Mezini</a>, <a href="/search/cs?searchtype=author&query=Mitev%2C+R">Richard Mitev</a>, <a href="/search/cs?searchtype=author&query=Miettinen%2C+M">Markus Miettinen</a>, <a href="/search/cs?searchtype=author&query=Muhamedagic%2C+A">Anel Muhamedagic</a>, <a href="/search/cs?searchtype=author&query=Nguyen%2C+T+D">Thien Duc Nguyen</a>, <a href="/search/cs?searchtype=author&query=Penning%2C+A">Alvar Penning</a>, <a href="/search/cs?searchtype=author&query=Pustelnik%2C+D+F">Dermot Frederik Pustelnik</a>, <a href="/search/cs?searchtype=author&query=Roos%2C+F">Filipp Roos</a>, <a href="/search/cs?searchtype=author&query=Sadeghi%2C+A">Ahmad-Reza Sadeghi</a>, <a href="/search/cs?searchtype=author&query=Schwarz%2C+M">Michael Schwarz</a>, <a href="/search/cs?searchtype=author&query=Uhl%2C+C">Christian Uhl</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2006.05914v2-abstract-short" style="display: inline;"> Google and Apple have jointly provided an API for exposure notification in order to implement decentralized contract tracing apps using Bluetooth Low Energy, the so-called "Google/Apple Proposal", which we abbreviate by "GAP". We demonstrate that in real-world scenarios the current GAP design is vulnerable to (i) profiling and possibly de-anonymizing infected persons, and (ii) relay-based wormhole… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2006.05914v2-abstract-full').style.display = 'inline'; document.getElementById('2006.05914v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2006.05914v2-abstract-full" style="display: none;"> Google and Apple have jointly provided an API for exposure notification in order to implement decentralized contract tracing apps using Bluetooth Low Energy, the so-called "Google/Apple Proposal", which we abbreviate by "GAP". We demonstrate that in real-world scenarios the current GAP design is vulnerable to (i) profiling and possibly de-anonymizing infected persons, and (ii) relay-based wormhole attacks that basically can generate fake contacts with the potential of affecting the accuracy of an app-based contact tracing system. For both types of attack, we have built tools that can easily be used on mobile phones or Raspberry Pis (e.g., Bluetooth sniffers). The goal of our work is to perform a reality check towards possibly providing empirical real-world evidence for these two privacy and security risks. We hope that our findings provide valuable input for developing secure and privacy-preserving digital contact tracing systems. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2006.05914v2-abstract-full').style.display = 'none'; document.getElementById('2006.05914v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 November, 2020; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 10 June, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2020. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1908.10237">arXiv:1908.10237</a> <span> [<a href="https://arxiv.org/pdf/1908.10237">pdf</a>, <a href="https://arxiv.org/format/1908.10237">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1007/978-3-030-31831-4_14">10.1007/978-3-030-31831-4_14 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> DTN7: An Open-Source Disruption-tolerant Networking Implementation of Bundle Protocol 7 </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Penning%2C+A">Alvar Penning</a>, <a href="/search/cs?searchtype=author&query=Baumg%C3%A4rtner%2C+L">Lars Baumg盲rtner</a>, <a href="/search/cs?searchtype=author&query=H%C3%B6chst%2C+J">Jonas H枚chst</a>, <a href="/search/cs?searchtype=author&query=Sterz%2C+A">Artur Sterz</a>, <a href="/search/cs?searchtype=author&query=Mezini%2C+M">Mira Mezini</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1908.10237v1-abstract-short" style="display: inline;"> In disruption-tolerant networking (DTN), data is transmitted in a store-carry-forward fashion from network node to network node. In this paper, we present an open source DTN implementation, called DTN7, of the recently released Bundle Protocol Version 7 (draft version 13). DTN7 is written in Go and provides features like memory safety and concurrent execution. With its modular design and interchan… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1908.10237v1-abstract-full').style.display = 'inline'; document.getElementById('1908.10237v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1908.10237v1-abstract-full" style="display: none;"> In disruption-tolerant networking (DTN), data is transmitted in a store-carry-forward fashion from network node to network node. In this paper, we present an open source DTN implementation, called DTN7, of the recently released Bundle Protocol Version 7 (draft version 13). DTN7 is written in Go and provides features like memory safety and concurrent execution. With its modular design and interchangeable components, DTN7 facilitates DTN research and application development. Furthermore, we present results of a comparative experimental evaluation of DTN7 and other DTN systems including Serval, IBR-DTN, and Forban. Our results indicate that DTN7 is a flexible and efficient open-source multi-platform implementation of the most recent Bundle Protocol Version 7. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1908.10237v1-abstract-full').style.display = 'none'; document.getElementById('1908.10237v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 27 August, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2019. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">18th International Conference on Ad Hoc Networks and Wireless (AdHoc-Now 2019)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> ADHOC-NOW 2019: Ad-Hoc, Mobile, and Wireless Networks pp 196-209 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1908.10233">arXiv:1908.10233</a> <span> [<a href="https://arxiv.org/pdf/1908.10233">pdf</a>, <a href="https://arxiv.org/format/1908.10233">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Human-Computer Interaction">cs.HC</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computers and Society">cs.CY</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/GHTC46095.2019.9033134">10.1109/GHTC46095.2019.9033134 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Smart Street Lights and Mobile Citizen Apps for Resilient Communication in a Digital City </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Baumg%C3%A4rtner%2C+L">Lars Baumg盲rtner</a>, <a href="/search/cs?searchtype=author&query=H%C3%B6chst%2C+J">Jonas H枚chst</a>, <a href="/search/cs?searchtype=author&query=Lampe%2C+P">Patrick Lampe</a>, <a href="/search/cs?searchtype=author&query=Mogk%2C+R">Ragnar Mogk</a>, <a href="/search/cs?searchtype=author&query=Sterz%2C+A">Artur Sterz</a>, <a href="/search/cs?searchtype=author&query=Weisenburger%2C+P">Pascal Weisenburger</a>, <a href="/search/cs?searchtype=author&query=Mezini%2C+M">Mira Mezini</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1908.10233v1-abstract-short" style="display: inline;"> Currently, nearly four billion people live in urban areas. Since this trend is increasing, natural disasters or terrorist attacks in such areas affect an increasing number of people. While information and communication technology is crucial for the operation of urban infrastructures and the well-being of its inhabitants, current technology is quite vulnerable to disruptions of various kinds. In fu… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1908.10233v1-abstract-full').style.display = 'inline'; document.getElementById('1908.10233v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1908.10233v1-abstract-full" style="display: none;"> Currently, nearly four billion people live in urban areas. Since this trend is increasing, natural disasters or terrorist attacks in such areas affect an increasing number of people. While information and communication technology is crucial for the operation of urban infrastructures and the well-being of its inhabitants, current technology is quite vulnerable to disruptions of various kinds. In future smart cities, a more resilient urban infrastructure is imperative to handle the increasing number of hazardous situations. We present a novel resilient communication approach based on smart street lights as part of the public infrastructure. It supports people in their everyday life and adapts its functionality to the challenges of emergency situations. Our approach relies on various environmental sensors and in-situ processing for automatic situation assessment, and a range of communication mechanisms (e.g., public WiFi hotspot functionality and mesh networking) for maintaining a communication network. Furthermore, resilience is not only achieved based on infrastructure deployed by a digital city's municipality, but also based on integrating citizens through software that runs on their mobile devices (e.g., smartphones and tablets). Web-based zero-installation and platform-agnostic apps can switch to device-to-device communication to continue benefiting people even during a disaster situation. Our approach, featuring a covert channel for professional responders and the zero-installation app, is evaluated through a prototype implementation based on a commercially available street light. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1908.10233v1-abstract-full').style.display = 'none'; document.getElementById('1908.10233v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 27 August, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2019. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">2019 IEEE Global Humanitarian Technology Conference (GHTC)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> 2019 IEEE Global Humanitarian Technology Conference (GHTC) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1907.10971">arXiv:1907.10971</a> <span> [<a href="https://arxiv.org/pdf/1907.10971">pdf</a>, <a href="https://arxiv.org/format/1907.10971">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Distributed, Parallel, and Cluster Computing">cs.DC</span> </div> </div> <p class="title is-5 mathjax"> OPPLOAD: Offloading Computational Workflows in Opportunistic Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Sterz%2C+A">Artur Sterz</a>, <a href="/search/cs?searchtype=author&query=Baumg%C3%A4rtner%2C+L">Lars Baumg盲rtner</a>, <a href="/search/cs?searchtype=author&query=h%C3%B6chst%2C+J">Jonas h枚chst</a>, <a href="/search/cs?searchtype=author&query=Lampe%2C+P">Patrick Lampe</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1907.10971v1-abstract-short" style="display: inline;"> Computation offloading is often used in mobile cloud, edge, and/or fog computing to cope with resource limitations of mobile devices in terms of computational power, storage, and energy. Computation offloading is particularly challenging in situations where network connectivity is intermittent or error-prone. In this paper, we present OPPLOAD, a novel framework for offloading computational workflo… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1907.10971v1-abstract-full').style.display = 'inline'; document.getElementById('1907.10971v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1907.10971v1-abstract-full" style="display: none;"> Computation offloading is often used in mobile cloud, edge, and/or fog computing to cope with resource limitations of mobile devices in terms of computational power, storage, and energy. Computation offloading is particularly challenging in situations where network connectivity is intermittent or error-prone. In this paper, we present OPPLOAD, a novel framework for offloading computational workflows in opportunistic networks. The individual tasks forming a workflow can be assigned to particular remote execution platforms (workers) either preselected ahead of time or decided just in time where a matching worker will automatically be assigned for the next task. Tasks are only assigned to capable workers that announce their capabilities. Furthermore, tasks of a workflow can be executed on multiple workers that are automatically selected to balance the load. Our Python implementation of OPPLOAD is publicly available as open source software. The results of our experimental evaluation demonstrate the feasibility of our approach. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1907.10971v1-abstract-full').style.display = 'none'; document.getElementById('1907.10971v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 25 July, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2019. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1907.10493">arXiv:1907.10493</a> <span> [<a href="https://arxiv.org/pdf/1907.10493">pdf</a>, <a href="https://arxiv.org/format/1907.10493">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/LCN44214.2019.8990753">10.1109/LCN44214.2019.8990753 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Learning Wi-Fi Connection Loss Predictions for Seamless Vertical Handovers Using Multipath TCP </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=H%C3%B6chst%2C+J">Jonas H枚chst</a>, <a href="/search/cs?searchtype=author&query=Sterz%2C+A">Artur Sterz</a>, <a href="/search/cs?searchtype=author&query=Fr%C3%B6mmgen%2C+A">Alexander Fr枚mmgen</a>, <a href="/search/cs?searchtype=author&query=Stohr%2C+D">Denny Stohr</a>, <a href="/search/cs?searchtype=author&query=Steinmetz%2C+R">Ralf Steinmetz</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1907.10493v1-abstract-short" style="display: inline;"> We present a novel data-driven approach to perform smooth Wi-Fi/cellular handovers on smartphones. Our approach relies on data provided by multiple smartphone sensors (e.g., Wi-Fi RSSI, acceleration, compass, step counter, air pressure) to predict Wi-Fi connection loss and uses Multipath TCP to dynamically switch between different connectivity modes. We train a random forest classifier and an arti… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1907.10493v1-abstract-full').style.display = 'inline'; document.getElementById('1907.10493v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1907.10493v1-abstract-full" style="display: none;"> We present a novel data-driven approach to perform smooth Wi-Fi/cellular handovers on smartphones. Our approach relies on data provided by multiple smartphone sensors (e.g., Wi-Fi RSSI, acceleration, compass, step counter, air pressure) to predict Wi-Fi connection loss and uses Multipath TCP to dynamically switch between different connectivity modes. We train a random forest classifier and an artificial neural network on real-world sensor data collected by five smartphone users over a period of three months. The trained models are executed on smartphones to reliably predict Wi-Fi connection loss 15 seconds ahead of time, with a precision of up to 0.97 and a recall of up to 0.98. Furthermore, we present results for four DASH video streaming experiments that run on a Nexus 5 smartphone using available Wi-Fi/cellular networks. The neural network predictions for Wi-Fi connection loss are used to establish MPTCP subflows on the cellular link. The experiments show that our approach provides seamless wireless connectivity, improves quality of experience of DASH video streaming, and requires less cellular data compared to handover approaches without Wi-Fi connection loss predictions. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1907.10493v1-abstract-full').style.display = 'none'; document.getElementById('1907.10493v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 24 July, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2019. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">LCN 2019 Cam Ready Version</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> 2019 IEEE 44th Conference on Local Computer Networks (LCN) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1907.10450">arXiv:1907.10450</a> <span> [<a href="https://arxiv.org/pdf/1907.10450">pdf</a>, <a href="https://arxiv.org/format/1907.10450">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Digital Libraries">cs.DL</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Retrieval">cs.IR</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Multimedia">cs.MM</span> </div> </div> <p class="title is-5 mathjax"> Investigating Correlations of Inter-coder Agreement and Machine Annotation Performance for Historical Video Data </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Pustu-Iren%2C+K">Kader Pustu-Iren</a>, <a href="/search/cs?searchtype=author&query=M%C3%BChling%2C+M">Markus M眉hling</a>, <a href="/search/cs?searchtype=author&query=Korfhage%2C+N">Nikolaus Korfhage</a>, <a href="/search/cs?searchtype=author&query=Bars%2C+J">Joanna Bars</a>, <a href="/search/cs?searchtype=author&query=Bernh%C3%B6ft%2C+S">Sabrina Bernh枚ft</a>, <a href="/search/cs?searchtype=author&query=H%C3%B6rth%2C+A">Angelika H枚rth</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a>, <a href="/search/cs?searchtype=author&query=Ewerth%2C+R">Ralph Ewerth</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1907.10450v1-abstract-short" style="display: inline;"> Video indexing approaches such as visual concept classification and person recognition are essential to enable fine-grained semantic search in large-scale video archives such as the historical video collection of former German Democratic Republic (GDR) maintained by the German Broadcasting Archive (DRA). Typically, a lexicon of visual concepts has to be defined for semantic search. However, the de… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1907.10450v1-abstract-full').style.display = 'inline'; document.getElementById('1907.10450v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1907.10450v1-abstract-full" style="display: none;"> Video indexing approaches such as visual concept classification and person recognition are essential to enable fine-grained semantic search in large-scale video archives such as the historical video collection of former German Democratic Republic (GDR) maintained by the German Broadcasting Archive (DRA). Typically, a lexicon of visual concepts has to be defined for semantic search. However, the definition of visual concepts can be more or less subjective due to individually differing judgments of annotators, which may have an impact on annotation quality and subsequently training of supervised machine learning methods. In this paper, we analyze the inter-coder agreement for historical TV data of the former GDR for visual concept classification and person recognition. The inter-coder agreement is evaluated for a group of expert as well as non-expert annotators in order to determine differences in annotation homogeneity. Furthermore, correlations between visual recognition performance and inter-annotator agreement are measured. In this context, information about image quantity and agreement are used to predict average precision for concept classification. Finally, the influence of expert vs. non-expert annotations acquired in the study are used to evaluate person recognition. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1907.10450v1-abstract-full').style.display = 'none'; document.getElementById('1907.10450v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 24 July, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2019. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1702.03790">arXiv:1702.03790</a> <span> [<a href="https://arxiv.org/pdf/1702.03790">pdf</a>, <a href="https://arxiv.org/format/1702.03790">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Digital Libraries">cs.DL</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Multimedia">cs.MM</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1007/978-3-319-43997-6_6">10.1007/978-3-319-43997-6_6 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Content-Based Video Retrieval in Historical Collections of the German Broadcasting Archive </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=M%C3%BChling%2C+M">Markus M眉hling</a>, <a href="/search/cs?searchtype=author&query=Meister%2C+M">Manja Meister</a>, <a href="/search/cs?searchtype=author&query=Korfhage%2C+N">Nikolaus Korfhage</a>, <a href="/search/cs?searchtype=author&query=Wehling%2C+J">J枚rg Wehling</a>, <a href="/search/cs?searchtype=author&query=H%C3%B6rth%2C+A">Angelika H枚rth</a>, <a href="/search/cs?searchtype=author&query=Ewerth%2C+R">Ralph Ewerth</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1702.03790v1-abstract-short" style="display: inline;"> The German Broadcasting Archive (DRA) maintains the cultural heritage of radio and television broadcasts of the former German Democratic Republic (GDR). The uniqueness and importance of the video material stimulates a large scientific interest in the video content. In this paper, we present an automatic video analysis and retrieval system for searching in historical collections of GDR television r… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1702.03790v1-abstract-full').style.display = 'inline'; document.getElementById('1702.03790v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1702.03790v1-abstract-full" style="display: none;"> The German Broadcasting Archive (DRA) maintains the cultural heritage of radio and television broadcasts of the former German Democratic Republic (GDR). The uniqueness and importance of the video material stimulates a large scientific interest in the video content. In this paper, we present an automatic video analysis and retrieval system for searching in historical collections of GDR television recordings. It consists of video analysis algorithms for shot boundary detection, concept classification, person recognition, text recognition and similarity search. The performance of the system is evaluated from a technical and an archival perspective on 2,500 hours of GDR television recordings. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1702.03790v1-abstract-full').style.display = 'none'; document.getElementById('1702.03790v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 13 February, 2017; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2017. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">TPDL 2016, Hannover, Germany. Final version is available at Springer via DOI</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1602.02881">arXiv:1602.02881</a> <span> [<a href="https://arxiv.org/pdf/1602.02881">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computational Geometry">cs.CG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Graphics">cs.GR</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1117/12.769414">10.1117/12.769414 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Detection and Visualization of Endoleaks in CT Data for Monitoring of Thoracic and Abdominal Aortic Aneurysm Stents </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Lu%2C+J">Jing Lu</a>, <a href="/search/cs?searchtype=author&query=Egger%2C+J">Jan Egger</a>, <a href="/search/cs?searchtype=author&query=Wimmer%2C+A">Andreas Wimmer</a>, <a href="/search/cs?searchtype=author&query=Gro%C3%9Fkopf%2C+S">Stefan Gro脽kopf</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1602.02881v1-abstract-short" style="display: inline;"> In this paper we present an efficient algorithm for the segmentation of the inner and outer boundary of thoratic and abdominal aortic aneurysms (TAA & AAA) in computed tomography angiography (CTA) acquisitions. The aneurysm segmentation includes two steps: first, the inner boundary is segmented based on a grey level model with two thresholds; then, an adapted active contour model approach is appli… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1602.02881v1-abstract-full').style.display = 'inline'; document.getElementById('1602.02881v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1602.02881v1-abstract-full" style="display: none;"> In this paper we present an efficient algorithm for the segmentation of the inner and outer boundary of thoratic and abdominal aortic aneurysms (TAA & AAA) in computed tomography angiography (CTA) acquisitions. The aneurysm segmentation includes two steps: first, the inner boundary is segmented based on a grey level model with two thresholds; then, an adapted active contour model approach is applied to the more complicated outer boundary segmentation, with its initialization based on the available inner boundary segmentation. An opacity image, which aims at enhancing important features while reducing spurious structures, is calculated from the CTA images and employed to guide the deformation of the model. In addition, the active contour model is extended by a constraint force that prevents intersections of the inner and outer boundary and keeps the outer boundary at a distance, given by the thrombus thickness, to the inner boundary. Based upon the segmentation results, we can measure the aneurysm size at each centerline point on the centerline orthogonal multiplanar reformatting (MPR) plane. Furthermore, a 3D TAA or AAA model is reconstructed from the set of segmented contours, and the presence of endoleaks is detected and highlighted. The implemented method has been evaluated on nine clinical CTA data sets with variations in anatomy and location of the pathology and has shown promising results. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1602.02881v1-abstract-full').style.display = 'none'; document.getElementById('1602.02881v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 9 February, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">7 pages, 7 figures, 1 table, 12 references, Proc. SPIE 6918, Medical Imaging 2008: Visualization, Image-Guided Procedures, and Modeling, 69181F (17 March 2008)</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1602.02490">arXiv:1602.02490</a> <span> [<a href="https://arxiv.org/pdf/1602.02490">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Graphics">cs.GR</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computational Engineering, Finance, and Science">cs.CE</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computational Geometry">cs.CG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Medical Physics">physics.med-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Tissues and Organs">q-bio.TO</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1117/12.709260">10.1117/12.709260 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Simulation of bifurcated stent grafts to treat abdominal aortic aneurysms (AAA) </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Egger%2C+J">Jan Egger</a>, <a href="/search/cs?searchtype=author&query=Gro%C3%9Fkopf%2C+S">Stefan Gro脽kopf</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1602.02490v1-abstract-short" style="display: inline;"> In this paper a method is introduced, to visualize bifurcated stent grafts in CT-Data. The aim is to improve therapy planning for minimal invasive treatment of abdominal aortic aneurysms (AAA). Due to precise measurement of the abdominal aortic aneurysm and exact simulation of the bifurcated stent graft, physicians are supported in choosing a suitable stent prior to an intervention. The presented… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1602.02490v1-abstract-full').style.display = 'inline'; document.getElementById('1602.02490v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1602.02490v1-abstract-full" style="display: none;"> In this paper a method is introduced, to visualize bifurcated stent grafts in CT-Data. The aim is to improve therapy planning for minimal invasive treatment of abdominal aortic aneurysms (AAA). Due to precise measurement of the abdominal aortic aneurysm and exact simulation of the bifurcated stent graft, physicians are supported in choosing a suitable stent prior to an intervention. The presented method can be used to measure the dimensions of the abdominal aortic aneurysm as well as simulate a bifurcated stent graft. Both of these procedures are based on a preceding segmentation and skeletonization of the aortic, right and left iliac. Using these centerlines (aortic, right and left iliac) a bifurcated initial stent is constructed. Through the implementation of an ACM method the initial stent is fit iteratively to the vessel walls - due to the influence of external forces (distance- as well as balloonforce). Following the fitting process, the crucial values for choosing a bifurcated stent graft are measured, e.g. aortic diameter, right and left common iliac diameter, minimum diameter of distal neck. The selected stent is then simulated to the CT-Data - starting with the initial stent. It hereby becomes apparent if the dimensions of the bifurcated stent graft are exact, i.e. the fitting to the arteries was done properly and no ostium was covered. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1602.02490v1-abstract-full').style.display = 'none'; document.getElementById('1602.02490v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 8 February, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">6 pages, 5 figures, 5 equations, 9 references in Proc. SPIE 6509, Medical Imaging 2007: Visualization and Image-Guided Procedures, 65091N (22 March 2007)</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1602.02022">arXiv:1602.02022</a> <span> [<a href="https://arxiv.org/pdf/1602.02022">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computational Geometry">cs.CG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Graphics">cs.GR</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1117/12.877660">10.1117/12.877660 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Preoperative Volume Determination for Pituitary Adenoma </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Zukic%2C+D">Dzenan Zukic</a>, <a href="/search/cs?searchtype=author&query=Egger%2C+J">Jan Egger</a>, <a href="/search/cs?searchtype=author&query=Bauer%2C+M+H+A">Miriam H. A. Bauer</a>, <a href="/search/cs?searchtype=author&query=Kuhnt%2C+D">Daniela Kuhnt</a>, <a href="/search/cs?searchtype=author&query=Carl%2C+B">Barbara Carl</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a>, <a href="/search/cs?searchtype=author&query=Kolb%2C+A">Andreas Kolb</a>, <a href="/search/cs?searchtype=author&query=Nimsky%2C+C">Christopher Nimsky</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1602.02022v1-abstract-short" style="display: inline;"> The most common sellar lesion is the pituitary adenoma, and sellar tumors are approximately 10-15% of all intracranial neoplasms. Manual slice-by-slice segmentation takes quite some time that can be reduced by using the appropriate algorithms. In this contribution, we present a segmentation method for pituitary adenoma. The method is based on an algorithm that we have applied recently to segmentin… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1602.02022v1-abstract-full').style.display = 'inline'; document.getElementById('1602.02022v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1602.02022v1-abstract-full" style="display: none;"> The most common sellar lesion is the pituitary adenoma, and sellar tumors are approximately 10-15% of all intracranial neoplasms. Manual slice-by-slice segmentation takes quite some time that can be reduced by using the appropriate algorithms. In this contribution, we present a segmentation method for pituitary adenoma. The method is based on an algorithm that we have applied recently to segmenting glioblastoma multiforme. A modification of this scheme is used for adenoma segmentation that is much harder to perform, due to lack of contrast-enhanced boundaries. In our experimental evaluation, neurosurgeons performed manual slice-by-slice segmentation of ten magnetic resonance imaging (MRI) cases. The segmentations were compared to the segmentation results of the proposed method using the Dice Similarity Coefficient (DSC). The average DSC for all datasets was 75.92% +/- 7.24%. A manual segmentation took about four minutes and our algorithm required about one second. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1602.02022v1-abstract-full').style.display = 'none'; document.getElementById('1602.02022v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 5 February, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">7 pages, 6 figures, 1 table, 16 references in Proc. SPIE 7963, Medical Imaging 2011: Computer-Aided Diagnosis, 79632T (9 March 2011). arXiv admin note: text overlap with arXiv:1103.1778</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1404.4467">arXiv:1404.4467</a> <span> [<a href="https://arxiv.org/pdf/1404.4467">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1371/journal.pone.0093389">10.1371/journal.pone.0093389 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Cube-Cut: Vertebral Body Segmentation in MRI-Data through Cubic-Shaped Divergences </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Schwarzenberg%2C+R">Robert Schwarzenberg</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a>, <a href="/search/cs?searchtype=author&query=Nimsky%2C+C">Christopher Nimsky</a>, <a href="/search/cs?searchtype=author&query=Egger%2C+J">Jan Egger</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1404.4467v2-abstract-short" style="display: inline;"> In this article, we present a graph-based method using a cubic template for volumetric segmentation of vertebrae in magnetic resonance imaging (MRI) acquisitions. The user can define the degree of deviation from a regular cube via a smoothness value Delta. The Cube-Cut algorithm generates a directed graph with two terminal nodes (s-t-network), where the nodes of the graph correspond to a cubic-sha… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1404.4467v2-abstract-full').style.display = 'inline'; document.getElementById('1404.4467v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1404.4467v2-abstract-full" style="display: none;"> In this article, we present a graph-based method using a cubic template for volumetric segmentation of vertebrae in magnetic resonance imaging (MRI) acquisitions. The user can define the degree of deviation from a regular cube via a smoothness value Delta. The Cube-Cut algorithm generates a directed graph with two terminal nodes (s-t-network), where the nodes of the graph correspond to a cubic-shaped subset of the image's voxels. The weightings of the graph's terminal edges, which connect every node with a virtual source s or a virtual sink t, represent the affinity of a voxel to the vertebra (source) and to the background (sink). Furthermore, a set of infinite weighted and non-terminal edges implements the smoothness term. After graph construction, a minimal s-t-cut is calculated within polynomial computation time, which splits the nodes into two disjoint units. Subsequently, the segmentation result is determined out of the source-set. A quantitative evaluation of a C++ implementation of the algorithm resulted in an average Dice Similarity Coefficient (DSC) of 81.33% and a running time of less than a minute. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1404.4467v2-abstract-full').style.display = 'none'; document.getElementById('1404.4467v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 22 July, 2014; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 17 April, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2014. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">23 figures, 2 tables, 43 references, PLoS ONE 9(4): e93389</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1310.6092">arXiv:1310.6092</a> <span> [<a href="https://arxiv.org/pdf/1310.6092">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> </div> <p class="title is-5 mathjax"> A Ray-based Approach for Boundary Estimation of Fiber Bundles Derived from Diffusion Tensor Imaging </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Bauer%2C+M+H+A">Miriam H. A. Bauer</a>, <a href="/search/cs?searchtype=author&query=Barbieri%2C+S">Sebastiano Barbieri</a>, <a href="/search/cs?searchtype=author&query=Klein%2C+J">Jan Klein</a>, <a href="/search/cs?searchtype=author&query=Egger%2C+J">Jan Egger</a>, <a href="/search/cs?searchtype=author&query=Kuhnt%2C+D">Daniela Kuhnt</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a>, <a href="/search/cs?searchtype=author&query=Hahn%2C+H+K">Horst K. Hahn</a>, <a href="/search/cs?searchtype=author&query=Nimsky%2C+C">Christopher Nimsky</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1310.6092v1-abstract-short" style="display: inline;"> Diffusion Tensor Imaging (DTI) is a non-invasive imaging technique that allows estimation of the location of white matter tracts in-vivo, based on the measurement of water diffusion properties. For each voxel, a second-order tensor can be calculated by using diffusion-weighted sequences (DWI) that are sensitive to the random motion of water molecules. Given at least 6 diffusion-weighted images wit… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1310.6092v1-abstract-full').style.display = 'inline'; document.getElementById('1310.6092v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1310.6092v1-abstract-full" style="display: none;"> Diffusion Tensor Imaging (DTI) is a non-invasive imaging technique that allows estimation of the location of white matter tracts in-vivo, based on the measurement of water diffusion properties. For each voxel, a second-order tensor can be calculated by using diffusion-weighted sequences (DWI) that are sensitive to the random motion of water molecules. Given at least 6 diffusion-weighted images with different gradients and one unweighted image, the coefficients of the symmetric diffusion tensor matrix can be calculated. Deriving the eigensystem of the tensor, the eigenvectors and eigenvalues can be calculated to describe the three main directions of diffusion and its magnitude. Using DTI data, fiber bundles can be determined, to gain information about eloquent brain structures. Especially in neurosurgery, information about location and dimension of eloquent structures like the corticospinal tract or the visual pathways is of major interest. Therefore, the fiber bundle boundary has to be determined. In this paper, a novel ray-based approach for boundary estimation of tubular structures is presented. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1310.6092v1-abstract-full').style.display = 'none'; document.getElementById('1310.6092v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 22 October, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">5 pages, 2 figures, 7 references</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Int J CARS, Vol. 5, Suppl. 1, pp. 47-48, Springer Press, June 2010 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1310.5755">arXiv:1310.5755</a> <span> [<a href="https://arxiv.org/pdf/1310.5755">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Medical Physics">physics.med-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Tissues and Organs">q-bio.TO</span> </div> </div> <p class="title is-5 mathjax"> Determination, Calculation and Representation of the Upper and Lower Sealing Zones During Virtual Stenting of Aneurysms </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Egger%2C+J">Jan Egger</a>, <a href="/search/cs?searchtype=author&query=Bauer%2C+M+H+A">Miriam H. A. Bauer</a>, <a href="/search/cs?searchtype=author&query=Gro%C3%9Fkopf%2C+S">Stefan Gro脽kopf</a>, <a href="/search/cs?searchtype=author&query=Biermann%2C+C">Christina Biermann</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a>, <a href="/search/cs?searchtype=author&query=Nimsky%2C+C">Christopher Nimsky</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1310.5755v1-abstract-short" style="display: inline;"> In this contribution, a novel method for stent simulation in preoperative computed tomography angiography (CTA) acquisitions of patients is presented where the sealing zones are automatically calculated and visualized. The method is eligible for non-bifurcated and bifurcated stents (Y-stents). Results of the proposed stent simulation with an automatic calculation of the sealing zones for specific… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1310.5755v1-abstract-full').style.display = 'inline'; document.getElementById('1310.5755v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1310.5755v1-abstract-full" style="display: none;"> In this contribution, a novel method for stent simulation in preoperative computed tomography angiography (CTA) acquisitions of patients is presented where the sealing zones are automatically calculated and visualized. The method is eligible for non-bifurcated and bifurcated stents (Y-stents). Results of the proposed stent simulation with an automatic calculation of the sealing zones for specific diseases (abdominal aortic aneurysms (AAA), thoracic aortic aneurysms (TAA), iliac aneurysms) are presented. The contribution is organized as follows. Section 2 presents the proposed approach. In Section 3, experimental results are discussed. Section 4 concludes the contribution and outlines areas for future work. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1310.5755v1-abstract-full').style.display = 'none'; document.getElementById('1310.5755v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 21 October, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">4 pages, 2 figures, 10 references</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Int J CARS, Vol. 5, Suppl. 1, pp. 13-14, Springer Press, June 2010 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1309.1863">arXiv:1309.1863</a> <span> [<a href="https://arxiv.org/pdf/1309.1863">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1002/rcs.1415">10.1002/rcs.1415 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Integration of the OpenIGTLink Network Protocol for Image-Guided Therapy with the Medical Platform MeVisLab </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Egger%2C+J">Jan Egger</a>, <a href="/search/cs?searchtype=author&query=Tokuda%2C+J">Junichi Tokuda</a>, <a href="/search/cs?searchtype=author&query=Chauvin%2C+L">Laurent Chauvin</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a>, <a href="/search/cs?searchtype=author&query=Nimsky%2C+C">Christopher Nimsky</a>, <a href="/search/cs?searchtype=author&query=Kapur%2C+T">Tina Kapur</a>, <a href="/search/cs?searchtype=author&query=Wells%2C+W+M">William M. Wells III</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1309.1863v1-abstract-short" style="display: inline;"> We present the integration of the OpenIGTLink network protocol for image-guided therapy (IGT) with the medical prototyping platform MeVisLab. OpenIGTLink is a new, open, simple and extensible network communication protocol for IGT. The protocol provides a standardized mechanism to connect hardware and software by the transfer of coordinate transforms, images, and status messages. MeVisLab is a fra… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1309.1863v1-abstract-full').style.display = 'inline'; document.getElementById('1309.1863v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1309.1863v1-abstract-full" style="display: none;"> We present the integration of the OpenIGTLink network protocol for image-guided therapy (IGT) with the medical prototyping platform MeVisLab. OpenIGTLink is a new, open, simple and extensible network communication protocol for IGT. The protocol provides a standardized mechanism to connect hardware and software by the transfer of coordinate transforms, images, and status messages. MeVisLab is a framework for the development of image processing algorithms and visualization and interaction methods, with a focus on medical imaging. The integration of OpenIGTLink into MeVisLab has been realized by developing a software module using the C++ programming language. As a result, researchers using MeVisLab can interface their software to hardware devices that already support the OpenIGTLink protocol, such as the NDI Aurora magnetic tracking system. In addition, the OpenIGTLink module can also be used to communicate directly with Slicer, a free, open source software package for visualization and image analysis. The integration has been tested with tracker clients available online and a real tracking system. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1309.1863v1-abstract-full').style.display = 'none'; document.getElementById('1309.1863v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 7 September, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">18 pages, 5 figures, 1 table, 30 references</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Int J Med Robot. 2012 September, 8(3). pp. 282-290 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1303.0964">arXiv:1303.0964</a> <span> [<a href="https://arxiv.org/pdf/1303.0964">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1038/srep01364">10.1038/srep01364 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> GBM Volumetry using the 3D Slicer Medical Image Computing Platform </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Egger%2C+J">Jan Egger</a>, <a href="/search/cs?searchtype=author&query=Kapur%2C+T">Tina Kapur</a>, <a href="/search/cs?searchtype=author&query=Fedorov%2C+A">Andriy Fedorov</a>, <a href="/search/cs?searchtype=author&query=Pieper%2C+S">Steve Pieper</a>, <a href="/search/cs?searchtype=author&query=Miller%2C+J+V">James V. Miller</a>, <a href="/search/cs?searchtype=author&query=Veeraraghavan%2C+H">Harini Veeraraghavan</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a>, <a href="/search/cs?searchtype=author&query=Golby%2C+A">Alexandra Golby</a>, <a href="/search/cs?searchtype=author&query=Nimsky%2C+C">Christopher Nimsky</a>, <a href="/search/cs?searchtype=author&query=Kikinis%2C+R">Ron Kikinis</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1303.0964v1-abstract-short" style="display: inline;"> Volumetric change in glioblastoma multiforme (GBM) over time is a critical factor in treatment decisions. Typically, the tumor volume is computed on a slice-by-slice basis using MRI scans obtained at regular intervals. (3D)Slicer - a free platform for biomedical research - provides an alternative to this manual slice-by-slice segmentation process, which is significantly faster and requires less us… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1303.0964v1-abstract-full').style.display = 'inline'; document.getElementById('1303.0964v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1303.0964v1-abstract-full" style="display: none;"> Volumetric change in glioblastoma multiforme (GBM) over time is a critical factor in treatment decisions. Typically, the tumor volume is computed on a slice-by-slice basis using MRI scans obtained at regular intervals. (3D)Slicer - a free platform for biomedical research - provides an alternative to this manual slice-by-slice segmentation process, which is significantly faster and requires less user interaction. In this study, 4 physicians segmented GBMs in 10 patients, once using the competitive region-growing based GrowCut segmentation module of Slicer, and once purely by drawing boundaries completely manually on a slice-by-slice basis. Furthermore, we provide a variability analysis for three physicians for 12 GBMs. The time required for GrowCut segmentation was on an average 61% of the time required for a pure manual segmentation. A comparison of Slicer-based segmentation with manual slice-by-slice segmentation resulted in a Dice Similarity Coefficient of 88.43 +/- 5.23% and a Hausdorff Distance of 2.32 +/- 5.23 mm. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1303.0964v1-abstract-full').style.display = 'none'; document.getElementById('1303.0964v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 5 March, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">7 pages, 6 figures, 2 tables, 1 equation, 43 references</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Sci. Rep. 3, 1364, 2013 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1205.6605">arXiv:1205.6605</a> <span> [<a href="https://arxiv.org/pdf/1205.6605">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> </div> <p class="title is-5 mathjax"> Template-Cut: A Pattern-Based Segmentation Paradigm </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Egger%2C+J">Jan Egger</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a>, <a href="/search/cs?searchtype=author&query=Nimsky%2C+C">Christopher Nimsky</a>, <a href="/search/cs?searchtype=author&query=Kapur%2C+T">Tina Kapur</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1205.6605v1-abstract-short" style="display: inline;"> We present a scale-invariant, template-based segmentation paradigm that sets up a graph and performs a graph cut to separate an object from the background. Typically graph-based schemes distribute the nodes of the graph uniformly and equidistantly on the image, and use a regularizer to bias the cut towards a particular shape. The strategy of uniform and equidistant nodes does not allow the cut to… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1205.6605v1-abstract-full').style.display = 'inline'; document.getElementById('1205.6605v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1205.6605v1-abstract-full" style="display: none;"> We present a scale-invariant, template-based segmentation paradigm that sets up a graph and performs a graph cut to separate an object from the background. Typically graph-based schemes distribute the nodes of the graph uniformly and equidistantly on the image, and use a regularizer to bias the cut towards a particular shape. The strategy of uniform and equidistant nodes does not allow the cut to prefer more complex structures, especially when areas of the object are indistinguishable from the background. We propose a solution by introducing the concept of a "template shape" of the target object in which the nodes are sampled non-uniformly and non-equidistantly on the image. We evaluate it on 2D-images where the object's textures and backgrounds are similar, and large areas of the object have the same gray level appearance as the background. We also evaluate it in 3D on 60 brain tumor datasets for neurosurgical planning purposes. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1205.6605v1-abstract-full').style.display = 'none'; document.getElementById('1205.6605v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 30 May, 2012; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2012. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">8 pages, 6 figures, 3 tables, 6 equations, 51 references</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> J. Egger, B. Freisleben, C. Nimsky, T. Kapur. Template-Cut: A Pattern-Based Segmentation Paradigm. Nature - Scientific Reports, Nature Publishing Group (NPG), 2(420), 2012 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1203.2839">arXiv:1203.2839</a> <span> [<a href="https://arxiv.org/pdf/1203.2839">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1371/journal.pone.0031064">10.1371/journal.pone.0031064 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Square-Cut: A Segmentation Algorithm on the Basis of a Rectangle Shape </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Egger%2C+J">Jan Egger</a>, <a href="/search/cs?searchtype=author&query=Kapur%2C+T">Tina Kapur</a>, <a href="/search/cs?searchtype=author&query=Dukatz%2C+T">Thomas Dukatz</a>, <a href="/search/cs?searchtype=author&query=Kolodziej%2C+M">Malgorzata Kolodziej</a>, <a href="/search/cs?searchtype=author&query=Zukic%2C+D">Dzenan Zukic</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a>, <a href="/search/cs?searchtype=author&query=Nimsky%2C+C">Christopher Nimsky</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1203.2839v1-abstract-short" style="display: inline;"> We present a rectangle-based segmentation algorithm that sets up a graph and performs a graph cut to separate an object from the background. However, graph-based algorithms distribute the graph's nodes uniformly and equidistantly on the image. Then, a smoothness term is added to force the cut to prefer a particular shape. This strategy does not allow the cut to prefer a certain structure, especial… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1203.2839v1-abstract-full').style.display = 'inline'; document.getElementById('1203.2839v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1203.2839v1-abstract-full" style="display: none;"> We present a rectangle-based segmentation algorithm that sets up a graph and performs a graph cut to separate an object from the background. However, graph-based algorithms distribute the graph's nodes uniformly and equidistantly on the image. Then, a smoothness term is added to force the cut to prefer a particular shape. This strategy does not allow the cut to prefer a certain structure, especially when areas of the object are indistinguishable from the background. We solve this problem by referring to a rectangle shape of the object when sampling the graph nodes, i.e., the nodes are distributed nonuniformly and non-equidistantly on the image. This strategy can be useful, when areas of the object are indistinguishable from the background. For evaluation, we focus on vertebrae images from Magnetic Resonance Imaging (MRI) datasets to support the time consuming manual slice-by-slice segmentation performed by physicians. The ground truth of the vertebrae boundaries were manually extracted by two clinical experts (neurological surgeons) with several years of experience in spine surgery and afterwards compared with the automatic segmentation results of the proposed scheme yielding an average Dice Similarity Coefficient (DSC) of 90.97\pm62.2%. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1203.2839v1-abstract-full').style.display = 'none'; document.getElementById('1203.2839v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 13 March, 2012; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2012. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">13 pages, 17 figures, 2 tables, 3 equations, 42 references</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Egger J, Kapur T, Dukatz T, Kolodziej M, Zukic D, et al. (2012) Square-Cut: A Segmentation Algorithm on the Basis of a Rectangle Shape. PLoS ONE 7(2): e31064 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1103.1952">arXiv:1103.1952</a> <span> [<a href="https://arxiv.org/pdf/1103.1952">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> </div> <p class="title is-5 mathjax"> Ray-Based and Graph-Based Methods for Fiber Bundle Boundary Estimation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Bauer%2C+M+H+A">Miriam H. A. Bauer</a>, <a href="/search/cs?searchtype=author&query=Egger%2C+J">Jan Egger</a>, <a href="/search/cs?searchtype=author&query=Kuhnt%2C+D">Daniela Kuhnt</a>, <a href="/search/cs?searchtype=author&query=Barbieri%2C+S">Sebastiano Barbieri</a>, <a href="/search/cs?searchtype=author&query=Klein%2C+J">Jan Klein</a>, <a href="/search/cs?searchtype=author&query=Hahn%2C+H+K">Horst K. Hahn</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a>, <a href="/search/cs?searchtype=author&query=Nimsky%2C+C">Christopher Nimsky</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1103.1952v1-abstract-short" style="display: inline;"> Diffusion Tensor Imaging (DTI) provides the possibility of estimating the location and course of eloquent structures in the human brain. Knowledge about this is of high importance for preoperative planning of neurosurgical interventions and for intraoperative guidance by neuronavigation in order to minimize postoperative neurological deficits. Therefore, the segmentation of these structures as clo… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1103.1952v1-abstract-full').style.display = 'inline'; document.getElementById('1103.1952v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1103.1952v1-abstract-full" style="display: none;"> Diffusion Tensor Imaging (DTI) provides the possibility of estimating the location and course of eloquent structures in the human brain. Knowledge about this is of high importance for preoperative planning of neurosurgical interventions and for intraoperative guidance by neuronavigation in order to minimize postoperative neurological deficits. Therefore, the segmentation of these structures as closed, three-dimensional object is necessary. In this contribution, two methods for fiber bundle segmentation between two defined regions are compared using software phantoms (abstract model and anatomical phantom modeling the right corticospinal tract). One method uses evaluation points from sampled rays as candidates for boundary points, the other method sets up a directed and weighted (depending on a scalar measure) graph and performs a min-cut for optimal segmentation results. Comparison is done by using the Dice Similarity Coefficient (DSC), a measure for spatial overlap of different segmentation results. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1103.1952v1-abstract-full').style.display = 'none'; document.getElementById('1103.1952v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 10 March, 2011; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2011. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">4 pages, 6 figures, BIOSIGNAL, Berlin, 2010</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1103.1778">arXiv:1103.1778</a> <span> [<a href="https://arxiv.org/pdf/1103.1778">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computational Engineering, Finance, and Science">cs.CE</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Medical Physics">physics.med-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Tissues and Organs">q-bio.TO</span> </div> </div> <p class="title is-5 mathjax"> Pituitary Adenoma Segmentation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Egger%2C+J">Jan Egger</a>, <a href="/search/cs?searchtype=author&query=Bauer%2C+M+H+A">Miriam H. A. Bauer</a>, <a href="/search/cs?searchtype=author&query=Kuhnt%2C+D">Daniela Kuhnt</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a>, <a href="/search/cs?searchtype=author&query=Nimsky%2C+C">Christopher Nimsky</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1103.1778v1-abstract-short" style="display: inline;"> Sellar tumors are approximately 10-15% among all intracranial neoplasms. The most common sellar lesion is the pituitary adenoma. Manual segmentation is a time-consuming process that can be shortened by using adequate algorithms. In this contribution, we present a segmentation method for pituitary adenoma. The method is based on an algorithm we developed recently in previous work where the novel se… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1103.1778v1-abstract-full').style.display = 'inline'; document.getElementById('1103.1778v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1103.1778v1-abstract-full" style="display: none;"> Sellar tumors are approximately 10-15% among all intracranial neoplasms. The most common sellar lesion is the pituitary adenoma. Manual segmentation is a time-consuming process that can be shortened by using adequate algorithms. In this contribution, we present a segmentation method for pituitary adenoma. The method is based on an algorithm we developed recently in previous work where the novel segmentation scheme was successfully used for segmentation of glioblastoma multiforme and provided an average Dice Similarity Coefficient (DSC) of 77%. This scheme is used for automatic adenoma segmentation. In our experimental evaluation, neurosurgeons with strong experiences in the treatment of pituitary adenoma performed manual slice-by-slice segmentation of 10 magnetic resonance imaging (MRI) cases. Afterwards, the segmentations were compared with the segmentation results of the proposed method via the DSC. The average DSC for all data sets was 77.49% +/- 4.52%. Compared with a manual segmentation that took, on the average, 3.91 +/- 0.54 minutes, the overall segmentation in our implementation required less than 4 seconds. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1103.1778v1-abstract-full').style.display = 'none'; document.getElementById('1103.1778v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 9 March, 2011; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2011. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">4 pages, 5 figures, BIOSIGNAL, Berlin, 2010</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1103.1777">arXiv:1103.1777</a> <span> [<a href="https://arxiv.org/pdf/1103.1777">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computational Engineering, Finance, and Science">cs.CE</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Medical Physics">physics.med-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Tissues and Organs">q-bio.TO</span> </div> </div> <p class="title is-5 mathjax"> A Flexible Semi-Automatic Approach for Glioblastoma multiforme Segmentation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Egger%2C+J">Jan Egger</a>, <a href="/search/cs?searchtype=author&query=Bauer%2C+M+H+A">Miriam H. A. Bauer</a>, <a href="/search/cs?searchtype=author&query=Kuhnt%2C+D">Daniela Kuhnt</a>, <a href="/search/cs?searchtype=author&query=Kappus%2C+C">Christoph Kappus</a>, <a href="/search/cs?searchtype=author&query=Carl%2C+B">Barbara Carl</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a>, <a href="/search/cs?searchtype=author&query=Nimsky%2C+C">Christopher Nimsky</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1103.1777v1-abstract-short" style="display: inline;"> Gliomas are the most common primary brain tumors, evolving from the cerebral supportive cells. For clinical follow-up, the evaluation of the preoperative tumor volume is essential. Volumetric assessment of tumor volume with manual segmentation of its outlines is a time-consuming process that can be overcome with the help of segmentation methods. In this paper, a flexible semi-automatic approach fo… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1103.1777v1-abstract-full').style.display = 'inline'; document.getElementById('1103.1777v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1103.1777v1-abstract-full" style="display: none;"> Gliomas are the most common primary brain tumors, evolving from the cerebral supportive cells. For clinical follow-up, the evaluation of the preoperative tumor volume is essential. Volumetric assessment of tumor volume with manual segmentation of its outlines is a time-consuming process that can be overcome with the help of segmentation methods. In this paper, a flexible semi-automatic approach for grade IV glioma segmentation is presented. The approach uses a novel segmentation scheme for spherical objects that creates a directed 3D graph. Thereafter, the minimal cost closed set on the graph is computed via a polynomial time s-t cut, creating an optimal segmentation of the tumor. The user can improve the results by specifying an arbitrary number of additional seed points to support the algorithm with grey value information and geometrical constraints. The presented method is tested on 12 magnetic resonance imaging datasets. The ground truth of the tumor boundaries are manually extracted by neurosurgeons. The segmented gliomas are compared with a one click method, and the semi-automatic approach yields an average Dice Similarity Coefficient (DSC) of 77.72% and 83.91%, respectively. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1103.1777v1-abstract-full').style.display = 'none'; document.getElementById('1103.1777v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 9 March, 2011; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2011. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">4 pages, 4 figures, BIOSIGNAL, Berlin, 2010</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1103.1773">arXiv:1103.1773</a> <span> [<a href="https://arxiv.org/pdf/1103.1773">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Medical Physics">physics.med-ph</span> </div> </div> <p class="title is-5 mathjax"> Aorta Segmentation for Stent Simulation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Egger%2C+J">Jan Egger</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a>, <a href="/search/cs?searchtype=author&query=Setser%2C+R">Randolph Setser</a>, <a href="/search/cs?searchtype=author&query=Renapuraar%2C+R">Rahul Renapuraar</a>, <a href="/search/cs?searchtype=author&query=Biermann%2C+C">Christina Biermann</a>, <a href="/search/cs?searchtype=author&query=O%27Donnell%2C+T">Thomas O'Donnell</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1103.1773v1-abstract-short" style="display: inline;"> Simulation of arterial stenting procedures prior to intervention allows for appropriate device selection as well as highlights potential complications. To this end, we present a framework for facilitating virtual aortic stenting from a contrast computer tomography (CT) scan. More specifically, we present a method for both lumen and outer wall segmentation that may be employed in determining both t… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1103.1773v1-abstract-full').style.display = 'inline'; document.getElementById('1103.1773v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1103.1773v1-abstract-full" style="display: none;"> Simulation of arterial stenting procedures prior to intervention allows for appropriate device selection as well as highlights potential complications. To this end, we present a framework for facilitating virtual aortic stenting from a contrast computer tomography (CT) scan. More specifically, we present a method for both lumen and outer wall segmentation that may be employed in determining both the appropriateness of intervention as well as the selection and localization of the device. The more challenging recovery of the outer wall is based on a novel minimal closure tracking algorithm. Our aortic segmentation method has been validated on over 3000 multiplanar reformatting (MPR) planes from 50 CT angiography data sets yielding a Dice Similarity Coefficient (DSC) of 90.67%. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1103.1773v1-abstract-full').style.display = 'none'; document.getElementById('1103.1773v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 9 March, 2011; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2011. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">10 pages, 6 figures, MICCAI Workshop on Cardiovascular Interventional Imaging and Biophysical Modelling (2009)</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1103.1475">arXiv:1103.1475</a> <span> [<a href="https://arxiv.org/pdf/1103.1475">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> </div> <p class="title is-5 mathjax"> A Semi-Automatic Graph-Based Approach for Determining the Boundary of Eloquent Fiber Bundles in the Human Brain </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Bauer%2C+M+H+A">Miriam H. A. Bauer</a>, <a href="/search/cs?searchtype=author&query=Egger%2C+J">Jan Egger</a>, <a href="/search/cs?searchtype=author&query=Kuhnt%2C+D">Daniela Kuhnt</a>, <a href="/search/cs?searchtype=author&query=Barbieri%2C+S">Sebastiano Barbieri</a>, <a href="/search/cs?searchtype=author&query=Klein%2C+J">Jan Klein</a>, <a href="/search/cs?searchtype=author&query=Hahn%2C+H+K">Horst K. Hahn</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a>, <a href="/search/cs?searchtype=author&query=Nimsky%2C+C">Christopher Nimsky</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1103.1475v1-abstract-short" style="display: inline;"> Diffusion Tensor Imaging (DTI) allows estimating the position, orientation and dimension of bundles of nerve pathways. This non-invasive imaging technique takes advantage of the diffusion of water molecules and determines the diffusion coefficients for every voxel of the data set. The identification of the diffusion coefficients and the derivation of information about fiber bundles is of major int… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1103.1475v1-abstract-full').style.display = 'inline'; document.getElementById('1103.1475v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1103.1475v1-abstract-full" style="display: none;"> Diffusion Tensor Imaging (DTI) allows estimating the position, orientation and dimension of bundles of nerve pathways. This non-invasive imaging technique takes advantage of the diffusion of water molecules and determines the diffusion coefficients for every voxel of the data set. The identification of the diffusion coefficients and the derivation of information about fiber bundles is of major interest for planning and performing neurosurgical interventions. To minimize the risk of neural deficits during brain surgery as tumor resection (e.g. glioma), the segmentation and integration of the results in the operating room is of prime importance. In this contribution, a robust and efficient graph-based approach for segmentating tubular fiber bundles in the human brain is presented. To define a cost function, the fractional anisotropy (FA) is used, derived from the DTI data, but this value may differ from patient to patient. Besides manually definining seed regions describing the structure of interest, additionally a manual definition of the cost function by the user is necessary. To improve the approach the contribution introduces a solution for automatically determining the cost function by using different 3D masks for each individual data set. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1103.1475v1-abstract-full').style.display = 'none'; document.getElementById('1103.1475v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 8 March, 2011; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2011. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">4 pages, 3 figures, BMT 2010, Rostock</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1103.1474">arXiv:1103.1474</a> <span> [<a href="https://arxiv.org/pdf/1103.1474">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Medical Physics">physics.med-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Tissues and Organs">q-bio.TO</span> </div> </div> <p class="title is-5 mathjax"> Evaluation of a Novel Approach for Automatic Volume Determination of Glioblastomas Based on Several Manual Expert Segmentations </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Egger%2C+J">Jan Egger</a>, <a href="/search/cs?searchtype=author&query=Bauer%2C+M+H+A">Miriam H. A. Bauer</a>, <a href="/search/cs?searchtype=author&query=Kuhnt%2C+D">Daniela Kuhnt</a>, <a href="/search/cs?searchtype=author&query=Carl%2C+B">Barbara Carl</a>, <a href="/search/cs?searchtype=author&query=Kappus%2C+C">Christoph Kappus</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a>, <a href="/search/cs?searchtype=author&query=Nimsky%2C+C">Christopher Nimsky</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1103.1474v1-abstract-short" style="display: inline;"> The glioblastoma multiforme is the most common malignant primary brain tumor and is one of the highest malignant human neoplasms. During the course of disease, the evaluation of tumor volume is an essential part of the clinical follow-up. However, manual segmentation for acquisition of tumor volume is a time-consuming process. In this paper, a new approach for the automatic segmentation and volume… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1103.1474v1-abstract-full').style.display = 'inline'; document.getElementById('1103.1474v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1103.1474v1-abstract-full" style="display: none;"> The glioblastoma multiforme is the most common malignant primary brain tumor and is one of the highest malignant human neoplasms. During the course of disease, the evaluation of tumor volume is an essential part of the clinical follow-up. However, manual segmentation for acquisition of tumor volume is a time-consuming process. In this paper, a new approach for the automatic segmentation and volume determination of glioblastomas (glioblastoma multiforme) is presented and evaluated. The approach uses a user-defined seed point inside the glioma to set up a directed 3D graph. The nodes of the graph are obtained by sampling along rays that are sent through the surface points of a polyhedron. After the graph has been constructed, the minimal s-t cut is calculated to separate the glioblastoma from the background. For evaluation, 12 Magnetic Resonance Imaging (MRI) data sets were manually segmented slice by slice, by neurosurgeons with several years of experience in the resection of gliomas. Afterwards, the manual segmentations were compared with the results of the presented approach via the Dice Similarity Coefficient (DSC). For a better assessment of the DSC results, the manual segmentations of the experts were also compared with each other and evaluated via the DSC. In addition, the 12 data sets were segmented once again by one of the neurosurgeons after a period of two weeks, to also measure the intra-physician deviation of the DSC. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1103.1474v1-abstract-full').style.display = 'none'; document.getElementById('1103.1474v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 8 March, 2011; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2011. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">4 pages, 4 figures, BMT 2010, Rostock</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1102.2382">arXiv:1102.2382</a> <span> [<a href="https://arxiv.org/pdf/1102.2382">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Medical Physics">physics.med-ph</span> </div> </div> <p class="title is-5 mathjax"> A Comparison of Two Human Brain Tumor Segmentation Methods for MRI Data </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Egger%2C+J">Jan Egger</a>, <a href="/search/cs?searchtype=author&query=Zuki%C4%87%2C+D">D啪enan Zuki膰</a>, <a href="/search/cs?searchtype=author&query=Bauer%2C+M+H+A">Miriam H. A. Bauer</a>, <a href="/search/cs?searchtype=author&query=Kuhnt%2C+D">Daniela Kuhnt</a>, <a href="/search/cs?searchtype=author&query=Carl%2C+B">Barbara Carl</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a>, <a href="/search/cs?searchtype=author&query=Kolb%2C+A">Andreas Kolb</a>, <a href="/search/cs?searchtype=author&query=Nimsky%2C+C">Christopher Nimsky</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1102.2382v2-abstract-short" style="display: inline;"> The most common primary brain tumors are gliomas, evolving from the cerebral supportive cells. For clinical follow-up, the evaluation of the preoperative tumor volume is essential. Volumetric assessment of tumor volume with manual segmentation of its outlines is a time-consuming process that can be overcome with the help of computerized segmentation methods. In this contribution, two methods for W… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1102.2382v2-abstract-full').style.display = 'inline'; document.getElementById('1102.2382v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1102.2382v2-abstract-full" style="display: none;"> The most common primary brain tumors are gliomas, evolving from the cerebral supportive cells. For clinical follow-up, the evaluation of the preoperative tumor volume is essential. Volumetric assessment of tumor volume with manual segmentation of its outlines is a time-consuming process that can be overcome with the help of computerized segmentation methods. In this contribution, two methods for World Health Organization (WHO) grade IV glioma segmentation in the human brain are compared using magnetic resonance imaging (MRI) patient data from the clinical routine. One method uses balloon inflation forces, and relies on detection of high intensity tumor boundaries that are coupled with the use of contrast agent gadolinium. The other method sets up a directed and weighted graph and performs a min-cut for optimal segmentation results. The ground truth of the tumor boundaries - for evaluating the methods on 27 cases - is manually extracted by neurosurgeons with several years of experience in the resection of gliomas. A comparison is performed using the Dice Similarity Coefficient (DSC), a measure for the spatial overlap of different segmentation results. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1102.2382v2-abstract-full').style.display = 'none'; document.getElementById('1102.2382v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 10 March, 2011; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 9 February, 2011; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2011. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">4 pages, 5 figures, Proc. of the 6th Russian-Bavarian Conference on Bio-Medical Engineering</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1102.0634">arXiv:1102.0634</a> <span> [<a href="https://arxiv.org/pdf/1102.0634">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Graphics">cs.GR</span> </div> </div> <p class="title is-5 mathjax"> Glioblastoma Multiforme Segmentation in MRI Data with a Balloon Inflation Approach </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Zuki%C4%87%2C+D">D啪enan Zuki膰</a>, <a href="/search/cs?searchtype=author&query=Egger%2C+J">Jan Egger</a>, <a href="/search/cs?searchtype=author&query=Bauer%2C+M+H+A">Miriam H. A. Bauer</a>, <a href="/search/cs?searchtype=author&query=Kuhnt%2C+D">Daniela Kuhnt</a>, <a href="/search/cs?searchtype=author&query=Carl%2C+B">Barbara Carl</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a>, <a href="/search/cs?searchtype=author&query=Kolb%2C+A">Andreas Kolb</a>, <a href="/search/cs?searchtype=author&query=Nimsky%2C+C">Christopher Nimsky</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1102.0634v1-abstract-short" style="display: inline;"> Gliomas are the most common primary brain tumors, evolving from the cerebral supportive cells. For clinical follow-up, the evaluation of the preoperative tumor volume is essential. Volumetric assessment of tumor volume with manual segmentation of its outlines is a time-consuming process that can be overcome with the help of computer-assisted segmentation methods. In this paper, a semi-automatic ap… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1102.0634v1-abstract-full').style.display = 'inline'; document.getElementById('1102.0634v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1102.0634v1-abstract-full" style="display: none;"> Gliomas are the most common primary brain tumors, evolving from the cerebral supportive cells. For clinical follow-up, the evaluation of the preoperative tumor volume is essential. Volumetric assessment of tumor volume with manual segmentation of its outlines is a time-consuming process that can be overcome with the help of computer-assisted segmentation methods. In this paper, a semi-automatic approach for World Health Organization (WHO) grade IV glioma segmentation is introduced that uses balloon inflation forces, and relies on the detection of high-intensity tumor boundaries that are coupled by using contrast agent gadolinium. The presented method is evaluated on 27 magnetic resonance imaging (MRI) data sets and the ground truth data of the tumor boundaries - for evaluation of the results - are manually extracted by neurosurgeons. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1102.0634v1-abstract-full').style.display = 'none'; document.getElementById('1102.0634v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 3 February, 2011; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2011. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">4 pages, 4 figures, Proc. of the 6th Russian-Bavarian Conference on Bio-Medical Engineering</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/0910.1938">arXiv:0910.1938</a> <span> [<a href="https://arxiv.org/pdf/0910.1938">pdf</a>, <a href="https://arxiv.org/format/0910.1938">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Retrieval">cs.IR</span> </div> </div> <p class="title is-5 mathjax"> Information Retrieval via Truncated Hilbert-Space Expansions </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Galeas%2C+P">Patricio Galeas</a>, <a href="/search/cs?searchtype=author&query=Kretschmer%2C+R">Ralph Kretschmer</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="0910.1938v1-abstract-short" style="display: inline;"> In addition to the frequency of terms in a document collection, the distribution of terms plays an important role in determining the relevance of documents. In this paper, a new approach for representing term positions in documents is presented. The approach allows an efficient evaluation of term-positional information at query evaluation time. Three applications are investigated: a function-bas… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0910.1938v1-abstract-full').style.display = 'inline'; document.getElementById('0910.1938v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="0910.1938v1-abstract-full" style="display: none;"> In addition to the frequency of terms in a document collection, the distribution of terms plays an important role in determining the relevance of documents. In this paper, a new approach for representing term positions in documents is presented. The approach allows an efficient evaluation of term-positional information at query evaluation time. Three applications are investigated: a function-based ranking optimization representing a user-defined document region, a query expansion technique based on overlapping the term distributions in the top-ranked documents, and cluster analysis of terms in documents. Experimental results demonstrate the effectiveness of the proposed approach. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0910.1938v1-abstract-full').style.display = 'none'; document.getElementById('0910.1938v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 10 October, 2009; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2009. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">12 pages, submitted to proceedings of ECIR-2010</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">ACM Class:</span> H.3.3 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/0903.0153">arXiv:0903.0153</a> <span> [<a href="https://arxiv.org/pdf/0903.0153">pdf</a>, <a href="https://arxiv.org/format/0903.0153">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Retrieval">cs.IR</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1145/1555400.1555446">10.1145/1555400.1555446 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Document Relevance Evaluation via Term Distribution Analysis Using Fourier Series Expansion </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Galeas%2C+P">Patricio Galeas</a>, <a href="/search/cs?searchtype=author&query=Kretschmer%2C+R">Ralph Kretschmer</a>, <a href="/search/cs?searchtype=author&query=Freisleben%2C+B">Bernd Freisleben</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="0903.0153v1-abstract-short" style="display: inline;"> In addition to the frequency of terms in a document collection, the distribution of terms plays an important role in determining the relevance of documents for a given search query. In this paper, term distribution analysis using Fourier series expansion as a novel approach for calculating an abstract representation of term positions in a document corpus is introduced. Based on this approach, tw… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0903.0153v1-abstract-full').style.display = 'inline'; document.getElementById('0903.0153v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="0903.0153v1-abstract-full" style="display: none;"> In addition to the frequency of terms in a document collection, the distribution of terms plays an important role in determining the relevance of documents for a given search query. In this paper, term distribution analysis using Fourier series expansion as a novel approach for calculating an abstract representation of term positions in a document corpus is introduced. Based on this approach, two methods for improving the evaluation of document relevance are proposed: (a) a function-based ranking optimization representing a user defined document region, and (b) a query expansion technique based on overlapping the term distributions in the top-ranked documents. Experimental results demonstrate the effectiveness of the proposed approach in providing new possibilities for optimizing the retrieval process. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0903.0153v1-abstract-full').style.display = 'none'; document.getElementById('0903.0153v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 1 March, 2009; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2009. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">9 pages, submitted to proceedings of JCDL-2009</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">ACM Class:</span> H.3.3 </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Proceedings of the 2009 Joint international Conference on Digital Libraries (Austin, TX, USA, June 15 - 19, 2009). JCDL '09. ACM, New York, NY, 277-284 </p> </li> </ol> <div class="is-hidden-tablet">  <span class="help" style="display: inline-block;"><a href="https://github.com/arXiv/arxiv-search/releases">Search v0.5.6 released 2020-02-24</a>  </span> </div> </div> </main> <footer> <div class="columns is-desktop" role="navigation" aria-label="Secondary">  <div class="column"> <div class="columns"> <div class="column"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/about">About</a></li> <li><a href="https://info.arxiv.org/help">Help</a></li> </ul> </div> <div class="column"> <ul class="nav-spaced"> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>contact arXiv</title><desc>Click here to contact arXiv</desc><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg> <a href="https://info.arxiv.org/help/contact.html"> Contact</a> </li> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>subscribe to arXiv mailings</title><desc>Click here to subscribe</desc><path d="M476 3.2L12.5 270.6c-18.1 10.4-15.8 35.6 2.2 43.2L121 358.4l287.3-253.2c5.5-4.9 13.3 2.6 8.6 8.3L176 407v80.5c0 23.6 28.5 32.9 42.5 15.8L282 426l124.6 52.2c14.2 6 30.4-2.9 33-18.2l72-432C515 7.8 493.3-6.8 476 3.2z"/></svg> <a href="https://info.arxiv.org/help/subscribe"> Subscribe</a> </li> </ul> </div> </div> </div>   <div class="column"> <div class="columns"> <div class="column"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/help/license/index.html">Copyright</a></li> <li><a href="https://info.arxiv.org/help/policies/privacy_policy.html">Privacy Policy</a></li> </ul> </div> <div class="column sorry-app-links"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/help/web_accessibility.html">Web Accessibility Assistance</a></li> <li> <p class="help"> <a class="a11y-main-link" href="https://status.arxiv.org" target="_blank">arXiv Operational Status <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 256 512" class="icon filter-dark_grey" role="presentation"><path d="M224.3 273l-136 136c-9.4 9.4-24.6 9.4-33.9 0l-22.6-22.6c-9.4-9.4-9.4-24.6 0-33.9l96.4-96.4-96.4-96.4c-9.4-9.4-9.4-24.6 0-33.9L54.3 103c9.4-9.4 24.6-9.4 33.9 0l136 136c9.5 9.4 9.5 24.6.1 34z"/></svg></a><br> Get status notifications via <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/email/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg>email</a> or <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/slack/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-black" role="presentation"><path d="M94.12 315.1c0 25.9-21.16 47.06-47.06 47.06S0 341 0 315.1c0-25.9 21.16-47.06 47.06-47.06h47.06v47.06zm23.72 0c0-25.9 21.16-47.06 47.06-47.06s47.06 21.16 47.06 47.06v117.84c0 25.9-21.16 47.06-47.06 47.06s-47.06-21.16-47.06-47.06V315.1zm47.06-188.98c-25.9 0-47.06-21.16-47.06-47.06S139 32 164.9 32s47.06 21.16 47.06 47.06v47.06H164.9zm0 23.72c25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06H47.06C21.16 243.96 0 222.8 0 196.9s21.16-47.06 47.06-47.06H164.9zm188.98 47.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06h-47.06V196.9zm-23.72 0c0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06V79.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06V196.9zM283.1 385.88c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06v-47.06h47.06zm0-23.72c-25.9 0-47.06-21.16-47.06-47.06 0-25.9 21.16-47.06 47.06-47.06h117.84c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06H283.1z"/></svg>slack</a> </p> </li> </ul> </div> </div> </div>  </div> </footer> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/member_acknowledgement.js"></script> </body> </html>

CINXE.COM

Search | arXiv e-print repository