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–34 of 34 results for author: <span class="mathjax">McLaughlin, S</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=McLaughlin%2C+S">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="McLaughlin, S"> </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=McLaughlin%2C+S&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="McLaughlin, S"> <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/2408.07758">arXiv:2408.07758</a> <span> [<a href="https://arxiv.org/pdf/2408.07758">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Robotics">cs.RO</span> </div> </div> <p class="title is-5 mathjax"> RAVE Checklist: Recommendations for Overcoming Challenges in Retrospective Safety Studies of Automated Driving Systems </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Scanlon%2C+J+M">John M. Scanlon</a>, <a href="/search/cs?searchtype=author&query=Teoh%2C+E+R">Eric R. Teoh</a>, <a href="/search/cs?searchtype=author&query=Kidd%2C+D+G">David G. Kidd</a>, <a href="/search/cs?searchtype=author&query=Kusano%2C+K+D">Kristofer D. Kusano</a>, <a href="/search/cs?searchtype=author&query=B%C3%A4rgman%2C+J">Jonas B盲rgman</a>, <a href="/search/cs?searchtype=author&query=Chi-Johnston%2C+G">Geoffrey Chi-Johnston</a>, <a href="/search/cs?searchtype=author&query=Di+Lillo%2C+L">Luigi Di Lillo</a>, <a href="/search/cs?searchtype=author&query=Favaro%2C+F">Francesca Favaro</a>, <a href="/search/cs?searchtype=author&query=Flannagan%2C+C">Carol Flannagan</a>, <a href="/search/cs?searchtype=author&query=Liers%2C+H">Henrik Liers</a>, <a href="/search/cs?searchtype=author&query=Lin%2C+B">Bonnie Lin</a>, <a href="/search/cs?searchtype=author&query=Lindman%2C+M">Magdalena Lindman</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Shane McLaughlin</a>, <a href="/search/cs?searchtype=author&query=Perez%2C+M">Miguel Perez</a>, <a href="/search/cs?searchtype=author&query=Victor%2C+T">Trent Victor</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="2408.07758v1-abstract-short" style="display: inline;"> The public, regulators, and domain experts alike seek to understand the effect of deployed SAE level 4 automated driving system (ADS) technologies on safety. The recent expansion of ADS technology deployments is paving the way for early stage safety impact evaluations, whereby the observational data from both an ADS and a representative benchmark fleet are compared to quantify safety performance.… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2408.07758v1-abstract-full').style.display = 'inline'; document.getElementById('2408.07758v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2408.07758v1-abstract-full" style="display: none;"> The public, regulators, and domain experts alike seek to understand the effect of deployed SAE level 4 automated driving system (ADS) technologies on safety. The recent expansion of ADS technology deployments is paving the way for early stage safety impact evaluations, whereby the observational data from both an ADS and a representative benchmark fleet are compared to quantify safety performance. In January 2024, a working group of experts across academia, insurance, and industry came together in Washington, DC to discuss the current and future challenges in performing such evaluations. A subset of this working group then met, virtually, on multiple occasions to produce this paper. This paper presents the RAVE (Retrospective Automated Vehicle Evaluation) checklist, a set of fifteen recommendations for performing and evaluating retrospective ADS performance comparisons. The recommendations are centered around the concepts of (1) quality and validity, (2) transparency, and (3) interpretation. Over time, it is anticipated there will be a large and varied body of work evaluating the observed performance of these ADS fleets. Establishing and promoting good scientific practices benefits the work of stakeholders, many of whom may not be subject matter experts. This working group's intentions are to: i) strengthen individual research studies and ii) make the at-large community more informed on how to evaluate this collective body of work. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2408.07758v1-abstract-full').style.display = 'none'; document.getElementById('2408.07758v1-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 August, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2201.10910">arXiv:2201.10910</a> <span> [<a href="https://arxiv.org/pdf/2201.10910">pdf</a>, <a href="https://arxiv.org/format/2201.10910">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Image and Video Processing">eess.IV</span> <span class="tag is-small is-grey 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.1109/JSTSP.2022.3170228">10.1109/JSTSP.2022.3170228 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> A Bayesian Based Deep Unrolling Algorithm for Single-Photon Lidar Systems </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Koo%2C+J">Jakeoung Koo</a>, <a href="/search/cs?searchtype=author&query=Halimi%2C+A">Abderrahim Halimi</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Stephen McLaughlin</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="2201.10910v1-abstract-short" style="display: inline;"> Deploying 3D single-photon Lidar imaging in real world applications faces multiple challenges including imaging in high noise environments. Several algorithms have been proposed to address these issues based on statistical or learning-based frameworks. Statistical methods provide rich information about the inferred parameters but are limited by the assumed model correlation structures, while deep… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2201.10910v1-abstract-full').style.display = 'inline'; document.getElementById('2201.10910v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2201.10910v1-abstract-full" style="display: none;"> Deploying 3D single-photon Lidar imaging in real world applications faces multiple challenges including imaging in high noise environments. Several algorithms have been proposed to address these issues based on statistical or learning-based frameworks. Statistical methods provide rich information about the inferred parameters but are limited by the assumed model correlation structures, while deep learning methods show state-of-the-art performance but limited inference guarantees, preventing their extended use in critical applications. This paper unrolls a statistical Bayesian algorithm into a new deep learning architecture for robust image reconstruction from single-photon Lidar data, i.e., the algorithm's iterative steps are converted into neural network layers. The resulting algorithm benefits from the advantages of both statistical and learning based frameworks, providing best estimates with improved network interpretability. Compared to existing learning-based solutions, the proposed architecture requires a reduced number of trainable parameters, is more robust to noise and mismodelling effects, and provides richer information about the estimates including uncertainty measures. Results on synthetic and real data show competitive results regarding the quality of the inference and computational complexity when compared to state-of-the-art algorithms. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2201.10910v1-abstract-full').style.display = 'none'; document.getElementById('2201.10910v1-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> 26 January, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2022. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2110.11414">arXiv:2110.11414</a> <span> [<a href="https://arxiv.org/pdf/2110.11414">pdf</a>, <a href="https://arxiv.org/format/2110.11414">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> </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.17861/e85a6eae-13f9-4bcd-9dff-73f8107c09a2">10.17861/e85a6eae-13f9-4bcd-9dff-73f8107c09a2 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Real-time, low-cost multi-person 3D pose estimation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Ruget%2C+A">Alice Ruget</a>, <a href="/search/cs?searchtype=author&query=Tyler%2C+M">Max Tyler</a>, <a href="/search/cs?searchtype=author&query=Mart%C3%ADn%2C+G+M">Germ谩n Mora Mart铆n</a>, <a href="/search/cs?searchtype=author&query=Scholes%2C+S">Stirling Scholes</a>, <a href="/search/cs?searchtype=author&query=Zhu%2C+F">Feng Zhu</a>, <a href="/search/cs?searchtype=author&query=Gyongy%2C+I">Istvan Gyongy</a>, <a href="/search/cs?searchtype=author&query=Hearn%2C+B">Brent Hearn</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Steve McLaughlin</a>, <a href="/search/cs?searchtype=author&query=Halimi%2C+A">Abderrahim Halimi</a>, <a href="/search/cs?searchtype=author&query=Leach%2C+J">Jonathan Leach</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="2110.11414v3-abstract-short" style="display: inline;"> The process of tracking human anatomy in computer vision is referred to pose estimation, and it is used in fields ranging from gaming to surveillance. Three-dimensional pose estimation traditionally requires advanced equipment, such as multiple linked intensity cameras or high-resolution time-of-flight cameras to produce depth images. However, there are applications, e.g.~consumer electronics, whe… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2110.11414v3-abstract-full').style.display = 'inline'; document.getElementById('2110.11414v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2110.11414v3-abstract-full" style="display: none;"> The process of tracking human anatomy in computer vision is referred to pose estimation, and it is used in fields ranging from gaming to surveillance. Three-dimensional pose estimation traditionally requires advanced equipment, such as multiple linked intensity cameras or high-resolution time-of-flight cameras to produce depth images. However, there are applications, e.g.~consumer electronics, where significant constraints are placed on the size, power consumption, weight and cost of the usable technology. Here, we demonstrate that computational imaging methods can achieve accurate pose estimation and overcome the apparent limitations of time-of-flight sensors designed for much simpler tasks. The sensor we use is already widely integrated in consumer-grade mobile devices, and despite its low spatial resolution, only 4$\times$4 pixels, our proposed Pixels2Pose system transforms its data into accurate depth maps and 3D pose data of multiple people up to a distance of 3 m from the sensor. We are able to generate depth maps at a resolution of 32$\times$32 and 3D localization of a body parts with an error of only $\approx$10 cm at a frame rate of 7 fps. This work opens up promising real-life applications in scenarios that were previously restricted by the advanced hardware requirements and cost of time-of-flight technology. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2110.11414v3-abstract-full').style.display = 'none'; document.getElementById('2110.11414v3-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 August, 2022; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 11 October, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2021. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2110.01585">arXiv:2110.01585</a> <span> [<a href="https://arxiv.org/pdf/2110.01585">pdf</a>, <a href="https://arxiv.org/format/2110.01585">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> </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/TIP.2022.3202092">10.1109/TIP.2022.3202092 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Fast Scalable Image Restoration using Total Variation Priors and Expectation Propagation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Yao%2C+D">Dan Yao</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Stephen McLaughlin</a>, <a href="/search/cs?searchtype=author&query=Altmann%2C+Y">Yoann Altmann</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="2110.01585v1-abstract-short" style="display: inline;"> This paper presents a scalable approximate Bayesian method for image restoration using total variation (TV) priors. In contrast to most optimization methods based on maximum a posteriori estimation, we use the expectation propagation (EP) framework to approximate minimum mean squared error (MMSE) estimators and marginal (pixel-wise) variances, without resorting to Monte Carlo sampling. For the cla… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2110.01585v1-abstract-full').style.display = 'inline'; document.getElementById('2110.01585v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2110.01585v1-abstract-full" style="display: none;"> This paper presents a scalable approximate Bayesian method for image restoration using total variation (TV) priors. In contrast to most optimization methods based on maximum a posteriori estimation, we use the expectation propagation (EP) framework to approximate minimum mean squared error (MMSE) estimators and marginal (pixel-wise) variances, without resorting to Monte Carlo sampling. For the classical anisotropic TV-based prior, we also propose an iterative scheme to automatically adjust the regularization parameter via expectation-maximization (EM). Using Gaussian approximating densities with diagonal covariance matrices, the resulting method allows highly parallelizable steps and can scale to large images for denoising, deconvolution and compressive sensing (CS) problems. The simulation results illustrate that such EP methods can provide a posteriori estimates on par with those obtained via sampling methods but at a fraction of the computational cost. Moreover, EP does not exhibit strong underestimation of posteriori variances, in contrast to variational Bayes alternatives. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2110.01585v1-abstract-full').style.display = 'none'; document.getElementById('2110.01585v1-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 October, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2021. </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">14 pages</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2106.15327">arXiv:2106.15327</a> <span> [<a href="https://arxiv.org/pdf/2106.15327">pdf</a>, <a href="https://arxiv.org/format/2106.15327">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="Methodology">stat.ME</span> </div> </div> <p class="title is-5 mathjax"> Patch-Based Image Restoration using Expectation Propagation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Yao%2C+D">Dan Yao</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Stephen McLaughlin</a>, <a href="/search/cs?searchtype=author&query=Altmann%2C+Y">Yoann Altmann</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="2106.15327v2-abstract-short" style="display: inline;"> This paper presents a new Expectation Propagation (EP) framework for image restoration using patch-based prior distributions. While Monte Carlo techniques are classically used to sample from intractable posterior distributions, they can suffer from scalability issues in high-dimensional inference problems such as image restoration. To address this issue, EP is used here to approximate the posterio… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2106.15327v2-abstract-full').style.display = 'inline'; document.getElementById('2106.15327v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2106.15327v2-abstract-full" style="display: none;"> This paper presents a new Expectation Propagation (EP) framework for image restoration using patch-based prior distributions. While Monte Carlo techniques are classically used to sample from intractable posterior distributions, they can suffer from scalability issues in high-dimensional inference problems such as image restoration. To address this issue, EP is used here to approximate the posterior distributions using products of multivariate Gaussian densities. Moreover, imposing structural constraints on the covariance matrices of these densities allows for greater scalability and distributed computation. While the method is naturally suited to handle additive Gaussian observation noise, it can also be extended to non-Gaussian noise. Experiments conducted for denoising, inpainting and deconvolution problems with Gaussian and Poisson noise illustrate the potential benefits of such flexible approximate Bayesian method for uncertainty quantification in imaging problems, at a reduced computational cost compared to sampling techniques. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2106.15327v2-abstract-full').style.display = 'none'; document.getElementById('2106.15327v2-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 November, 2021; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 18 June, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2021. </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">27 pages</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2106.13367">arXiv:2106.13367</a> <span> [<a href="https://arxiv.org/pdf/2106.13367">pdf</a>, <a href="https://arxiv.org/format/2106.13367">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Databases">cs.DB</span> </div> </div> <p class="title is-5 mathjax"> SeaNet -- Towards A Knowledge Graph Based Autonomic Management of Software Defined Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Zhou%2C+Q">Qianru Zhou</a>, <a href="/search/cs?searchtype=author&query=Gray%2C+A+J+G">Alasdair J. G. Gray</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Stephen McLaughlin</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="2106.13367v3-abstract-short" style="display: inline;"> Automatic network management driven by Artificial Intelligent technologies has been heatedly discussed over decades. However, current reports mainly focus on theoretic proposals and architecture designs, works on practical implementations on real-life networks are yet to appear. This paper proposes our effort toward the implementation of knowledge graph driven approach for autonomic network manage… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2106.13367v3-abstract-full').style.display = 'inline'; document.getElementById('2106.13367v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2106.13367v3-abstract-full" style="display: none;"> Automatic network management driven by Artificial Intelligent technologies has been heatedly discussed over decades. However, current reports mainly focus on theoretic proposals and architecture designs, works on practical implementations on real-life networks are yet to appear. This paper proposes our effort toward the implementation of knowledge graph driven approach for autonomic network management in software defined networks (SDNs), termed as SeaNet. Driven by the ToCo ontology, SeaNet is reprogrammed based on Mininet (a SDN emulator). It consists three core components, a knowledge graph generator, a SPARQL engine, and a network management API. The knowledge graph generator represents the knowledge in the telecommunication network management tasks into formally represented ontology driven model. Expert experience and network management rules can be formalized into knowledge graph and by automatically inferenced by SPARQL engine, Network management API is able to packet technology-specific details and expose technology-independent interfaces to users. The Experiments are carried out to evaluate proposed work by comparing with a commercial SDN controller Ryu implemented by the same language Python. The evaluation results show that SeaNet is considerably faster in most circumstances than Ryu and the SeaNet code is significantly more compact. Benefit from RDF reasoning, SeaNet is able to achieve O(1) time complexity on different scales of the knowledge graph while the traditional database can achieve O(nlogn) at its best. With the developed network management API, SeaNet enables researchers to develop semantic-intelligent applications on their own SDNs. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2106.13367v3-abstract-full').style.display = 'none'; document.getElementById('2106.13367v3-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 May, 2022; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 24 June, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2021. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2011.11444">arXiv:2011.11444</a> <span> [<a href="https://arxiv.org/pdf/2011.11444">pdf</a>, <a href="https://arxiv.org/format/2011.11444">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Image and Video Processing">eess.IV</span> <span class="tag is-small is-grey 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.1364/OE.415563">10.1364/OE.415563 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Robust super-resolution depth imaging via a multi-feature fusion deep network </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Ruget%2C+A">Alice Ruget</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Stephen McLaughlin</a>, <a href="/search/cs?searchtype=author&query=Henderson%2C+R+K">Robert K. Henderson</a>, <a href="/search/cs?searchtype=author&query=Gyongy%2C+I">Istvan Gyongy</a>, <a href="/search/cs?searchtype=author&query=Halimi%2C+A">Abderrahim Halimi</a>, <a href="/search/cs?searchtype=author&query=Leach%2C+J">Jonathan Leach</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="2011.11444v2-abstract-short" style="display: inline;"> Three-dimensional imaging plays an important role in imaging applications where it is necessary to record depth. The number of applications that use depth imaging is increasing rapidly, and examples include self-driving autonomous vehicles and auto-focus assist on smartphone cameras. Light detection and ranging (LIDAR) via single-photon sensitive detector (SPAD) arrays is an emerging technology th… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2011.11444v2-abstract-full').style.display = 'inline'; document.getElementById('2011.11444v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2011.11444v2-abstract-full" style="display: none;"> Three-dimensional imaging plays an important role in imaging applications where it is necessary to record depth. The number of applications that use depth imaging is increasing rapidly, and examples include self-driving autonomous vehicles and auto-focus assist on smartphone cameras. Light detection and ranging (LIDAR) via single-photon sensitive detector (SPAD) arrays is an emerging technology that enables the acquisition of depth images at high frame rates. However, the spatial resolution of this technology is typically low in comparison to the intensity images recorded by conventional cameras. To increase the native resolution of depth images from a SPAD camera, we develop a deep network built specifically to take advantage of the multiple features that can be extracted from a camera's histogram data. The network is designed for a SPAD camera operating in a dual-mode such that it captures alternate low resolution depth and high resolution intensity images at high frame rates, thus the system does not require any additional sensor to provide intensity images. The network then uses the intensity images and multiple features extracted from downsampled histograms to guide the upsampling of the depth. Our network provides significant image resolution enhancement and image denoising across a wide range of signal-to-noise ratios and photon levels. We apply the network to a range of 3D data, demonstrating denoising and a four-fold resolution enhancement of depth. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2011.11444v2-abstract-full').style.display = 'none'; document.getElementById('2011.11444v2-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 February, 2021; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 20 November, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2020. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2011.05624">arXiv:2011.05624</a> <span> [<a href="https://arxiv.org/pdf/2011.05624">pdf</a>, <a href="https://arxiv.org/format/2011.05624">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.1109/WD.2019.8734260">10.1109/WD.2019.8734260 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> SARA -- A Semantic Access Point Resource Allocation Service for Heterogenous Wireless Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Zhou%2C+Q">Qianru Zhou</a>, <a href="/search/cs?searchtype=author&query=Gray%2C+A+J+G">Alasdair J. G. Gray</a>, <a href="/search/cs?searchtype=author&query=Pezaros%2C+D">Dimitrios Pezaros</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Stephen McLaughlin</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="2011.05624v1-abstract-short" style="display: inline;"> In this paper, we present SARA, a Semantic Access point Resource Allocation service for heterogenous wireless networks with various wireless access technologies existing together. By automatically reasoning on the knowledge base of the full system provided by a knowledge based autonomic network management system -- SEANET, SARA selects the access point providing the best quality of service among t… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2011.05624v1-abstract-full').style.display = 'inline'; document.getElementById('2011.05624v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2011.05624v1-abstract-full" style="display: none;"> In this paper, we present SARA, a Semantic Access point Resource Allocation service for heterogenous wireless networks with various wireless access technologies existing together. By automatically reasoning on the knowledge base of the full system provided by a knowledge based autonomic network management system -- SEANET, SARA selects the access point providing the best quality of service among the different access technologies. Based on an ontology assisted knowledge based system SEANET, SARA can also adapt the access point selection strategy according to customer defined rules automatically. Results of our evaluation based on emulated networks with hybrid access technologies and various scales show that SARA is able to improve the channel condition, in terms of throughput, evidently. Comparisons with current AP selection algorithms demonstrate that SARA outperforms the existing AP selection algorithms. The overhead in terms of time expense is reasonable and is shown to be faster than traditional access point selection approaches. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2011.05624v1-abstract-full').style.display = 'none'; document.getElementById('2011.05624v1-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> 11 November, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 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">2019 IEEE Wireless Day</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2004.09211">arXiv:2004.09211</a> <span> [<a href="https://arxiv.org/pdf/2004.09211">pdf</a>, <a href="https://arxiv.org/format/2004.09211">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Image and Video Processing">eess.IV</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computational Engineering, Finance, and Science">cs.CE</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/TIP.2020.3046882">10.1109/TIP.2020.3046882 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Robust 3D reconstruction of dynamic scenes from single-photon lidar using Beta-divergences </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Legros%2C+Q">Quentin Legros</a>, <a href="/search/cs?searchtype=author&query=Tachella%2C+J">Julian Tachella</a>, <a href="/search/cs?searchtype=author&query=Tobin%2C+R">Rachael Tobin</a>, <a href="/search/cs?searchtype=author&query=McCarthy%2C+A">Aongus McCarthy</a>, <a href="/search/cs?searchtype=author&query=Meignen%2C+S">Sylvain Meignen</a>, <a href="/search/cs?searchtype=author&query=Buller%2C+G+S">Gerald S. Buller</a>, <a href="/search/cs?searchtype=author&query=Altmann%2C+Y">Yoann Altmann</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Stephen McLaughlin</a>, <a href="/search/cs?searchtype=author&query=Davies%2C+M+E">Michael E. Davies</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="2004.09211v3-abstract-short" style="display: inline;"> In this paper, we present a new algorithm for fast, online 3D reconstruction of dynamic scenes using times of arrival of photons recorded by single-photon detector arrays. One of the main challenges in 3D imaging using single-photon lidar in practical applications is the presence of strong ambient illumination which corrupts the data and can jeopardize the detection of peaks/surface in the signals… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2004.09211v3-abstract-full').style.display = 'inline'; document.getElementById('2004.09211v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2004.09211v3-abstract-full" style="display: none;"> In this paper, we present a new algorithm for fast, online 3D reconstruction of dynamic scenes using times of arrival of photons recorded by single-photon detector arrays. One of the main challenges in 3D imaging using single-photon lidar in practical applications is the presence of strong ambient illumination which corrupts the data and can jeopardize the detection of peaks/surface in the signals. This background noise not only complicates the observation model classically used for 3D reconstruction but also the estimation procedure which requires iterative methods. In this work, we consider a new similarity measure for robust depth estimation, which allows us to use a simple observation model and a non-iterative estimation procedure while being robust to mis-specification of the background illumination model. This choice leads to a computationally attractive depth estimation procedure without significant degradation of the reconstruction performance. This new depth estimation procedure is coupled with a spatio-temporal model to capture the natural correlation between neighboring pixels and successive frames for dynamic scene analysis. The resulting online inference process is scalable and well suited for parallel implementation. The benefits of the proposed method are demonstrated through a series of experiments conducted with simulated and real single-photon lidar videos, allowing the analysis of dynamic scenes at 325 m observed under extreme ambient illumination conditions. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2004.09211v3-abstract-full').style.display = 'none'; document.getElementById('2004.09211v3-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> 18 December, 2020; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 20 April, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 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">12 pages</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2002.07118">arXiv:2002.07118</a> <span> [<a href="https://arxiv.org/pdf/2002.07118">pdf</a>, <a href="https://arxiv.org/format/2002.07118">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Image and Video Processing">eess.IV</span> <span class="tag is-small is-grey 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="Optics">physics.optics</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/s41467-020-19727-4">10.1038/s41467-020-19727-4 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Seeing Around Corners with Edge-Resolved Transient Imaging </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Rapp%2C+J">Joshua Rapp</a>, <a href="/search/cs?searchtype=author&query=Saunders%2C+C">Charles Saunders</a>, <a href="/search/cs?searchtype=author&query=Tachella%2C+J">Juli谩n Tachella</a>, <a href="/search/cs?searchtype=author&query=Murray-Bruce%2C+J">John Murray-Bruce</a>, <a href="/search/cs?searchtype=author&query=Altmann%2C+Y">Yoann Altmann</a>, <a href="/search/cs?searchtype=author&query=Tourneret%2C+J">Jean-Yves Tourneret</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Stephen McLaughlin</a>, <a href="/search/cs?searchtype=author&query=Dawson%2C+R+M+A">Robin M. A. Dawson</a>, <a href="/search/cs?searchtype=author&query=Wong%2C+F+N+C">Franco N. C. Wong</a>, <a href="/search/cs?searchtype=author&query=Goyal%2C+V+K">Vivek K Goyal</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="2002.07118v1-abstract-short" style="display: inline;"> Non-line-of-sight (NLOS) imaging is a rapidly growing field seeking to form images of objects outside the field of view, with potential applications in search and rescue, reconnaissance, and even medical imaging. The critical challenge of NLOS imaging is that diffuse reflections scatter light in all directions, resulting in weak signals and a loss of directional information. To address this proble… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2002.07118v1-abstract-full').style.display = 'inline'; document.getElementById('2002.07118v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2002.07118v1-abstract-full" style="display: none;"> Non-line-of-sight (NLOS) imaging is a rapidly growing field seeking to form images of objects outside the field of view, with potential applications in search and rescue, reconnaissance, and even medical imaging. The critical challenge of NLOS imaging is that diffuse reflections scatter light in all directions, resulting in weak signals and a loss of directional information. To address this problem, we propose a method for seeing around corners that derives angular resolution from vertical edges and longitudinal resolution from the temporal response to a pulsed light source. We introduce an acquisition strategy, scene response model, and reconstruction algorithm that enable the formation of 2.5-dimensional representations -- a plan view plus heights -- and a 180$^{\circ}$ field of view (FOV) for large-scale scenes. Our experiments demonstrate accurate reconstructions of hidden rooms up to 3 meters in each dimension. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2002.07118v1-abstract-full').style.display = 'none'; document.getElementById('2002.07118v1-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> 17 February, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 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">Includes manuscript (14 pages) and supplement (24 pages)</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1903.05372">arXiv:1903.05372</a> <span> [<a href="https://arxiv.org/pdf/1903.05372">pdf</a>, <a href="https://arxiv.org/format/1903.05372">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computers and Society">cs.CY</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"> Lost Silence: An emergency response early detection service through continuous processing of telecommunication data streams </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Zhou%2C+Q">Qianru Zhou</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Stephen McLaughlin</a>, <a href="/search/cs?searchtype=author&query=Gray%2C+A+J+G">Alasdair J. G. Gray</a>, <a href="/search/cs?searchtype=author&query=Wu%2C+S">Shangbin Wu</a>, <a href="/search/cs?searchtype=author&query=Wang%2C+C">Chengxiang Wang</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="1903.05372v1-abstract-short" style="display: inline;"> Early detection of significant traumatic events, e.g. a terrorist attack or a ship capsizing, is important to ensure that a prompt emergency response can occur. In the modern world telecommunication systems could play a key role in ensuring a successful emergency response by detecting such incidents through significant changes in calls and access to the networks. In this paper a methodology is ill… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1903.05372v1-abstract-full').style.display = 'inline'; document.getElementById('1903.05372v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1903.05372v1-abstract-full" style="display: none;"> Early detection of significant traumatic events, e.g. a terrorist attack or a ship capsizing, is important to ensure that a prompt emergency response can occur. In the modern world telecommunication systems could play a key role in ensuring a successful emergency response by detecting such incidents through significant changes in calls and access to the networks. In this paper a methodology is illustrated to detect such incidents immediately (with the delay in the order of milliseconds), by processing semantically annotated streams of data in cellular telecommunication systems. In our methodology, live information about the position and status of phones are encoded as RDF streams. We propose an algorithm that processes streams of RDF annotated telecommunication data to detect abnormality. Our approach is exemplified in the context of a passenger cruise ship capsizing. However, the approach is readily translatable to other incidents. Our evaluation results show that with a properly chosen window size, such incidents can be detected efficiently and effectively. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1903.05372v1-abstract-full').style.display = 'none'; document.getElementById('1903.05372v1-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, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 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">15 pages, 4 figures, WSP ISWC 2017 conference</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> ISWC WSP 2017, pp. 33--47 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1810.12043">arXiv:1810.12043</a> <span> [<a href="https://arxiv.org/pdf/1810.12043">pdf</a>, <a href="https://arxiv.org/format/1810.12043">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> </div> </div> <p class="title is-5 mathjax"> Patch-Based Sparse Representation For Bacterial Detection </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Eldaly%2C+A+K">Ahmed Karam Eldaly</a>, <a href="/search/cs?searchtype=author&query=Altmann%2C+Y">Yoann Altmann</a>, <a href="/search/cs?searchtype=author&query=Akram%2C+A">Ahsan Akram</a>, <a href="/search/cs?searchtype=author&query=Perperidis%2C+A">Antonios Perperidis</a>, <a href="/search/cs?searchtype=author&query=Dhaliwal%2C+K">Kevin Dhaliwal</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Stephen McLaughlin</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="1810.12043v2-abstract-short" style="display: inline;"> In this paper, we propose an unsupervised approach for bacterial detection in optical endomicroscopy images. This approach splits each image into a set of overlapping patches and assumes that observed intensities are linear combinations of the actual intensity values associated with background image structures, corrupted by additive Gaussian noise and potentially by a sparse outlier term modelling… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1810.12043v2-abstract-full').style.display = 'inline'; document.getElementById('1810.12043v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1810.12043v2-abstract-full" style="display: none;"> In this paper, we propose an unsupervised approach for bacterial detection in optical endomicroscopy images. This approach splits each image into a set of overlapping patches and assumes that observed intensities are linear combinations of the actual intensity values associated with background image structures, corrupted by additive Gaussian noise and potentially by a sparse outlier term modelling anomalies (which are considered to be candidate bacteria). The actual intensity term representing background structures is modelled as a linear combination of a few atoms drawn from a dictionary which is learned from bacteria-free data and then fixed while analyzing new images. The bacteria detection task is formulated as a minimization problem and an alternating direction method of multipliers (ADMM) is then used to estimate the unknown parameters. Simulations conducted using two ex vivo lung datasets show good detection and correlation performance between bacteria counts identified by a trained clinician and those of the proposed method. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1810.12043v2-abstract-full').style.display = 'none'; document.getElementById('1810.12043v2-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 January, 2019; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 29 October, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2018. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1809.00604">arXiv:1809.00604</a> <span> [<a href="https://arxiv.org/pdf/1809.00604">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.1016/j.media.2019.101620">10.1016/j.media.2019.101620 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Image computing for fibre-bundle endomicroscopy: A review </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Perperidis%2C+A">Antonios Perperidis</a>, <a href="/search/cs?searchtype=author&query=Dhaliwal%2C+K">Kevin Dhaliwal</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Stephen McLaughlin</a>, <a href="/search/cs?searchtype=author&query=Vercauteren%2C+T">Tom Vercauteren</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="1809.00604v1-abstract-short" style="display: inline;"> Endomicroscopy is an emerging imaging modality, that facilitates the acquisition of in vivo, in situ optical biopsies, assisting diagnostic and potentially therapeutic interventions. While there is a diverse and constantly expanding range of commercial and experimental optical biopsy platforms available, fibre-bundle endomicroscopy is currently the most widely used platform and is approved for cli… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1809.00604v1-abstract-full').style.display = 'inline'; document.getElementById('1809.00604v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1809.00604v1-abstract-full" style="display: none;"> Endomicroscopy is an emerging imaging modality, that facilitates the acquisition of in vivo, in situ optical biopsies, assisting diagnostic and potentially therapeutic interventions. While there is a diverse and constantly expanding range of commercial and experimental optical biopsy platforms available, fibre-bundle endomicroscopy is currently the most widely used platform and is approved for clinical use in a range of clinical indications. Miniaturised, flexible fibre-bundles, guided through the working channel of endoscopes, needles and catheters, enable high-resolution imaging across a variety of organ systems. Yet, the nature of image acquisition though a fibre-bundle gives rise to several inherent characteristics and limitations necessitating novel and effective image pre- and post-processing algorithms, ranging from image formation, enhancement and mosaicing to pathology detection and quantification. This paper introduces the underlying technology and most prevalent clinical applications of fibre-bundle endomicroscopy, and provides a comprehensive, up-to-date, review of relevant image reconstruction, analysis and understanding/inference methodologies. Furthermore, current limitations as well as future challenges and opportunities in fibre-bundle endomicroscopy computing are identified and discussed. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1809.00604v1-abstract-full').style.display = 'none'; document.getElementById('1809.00604v1-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 September, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2018. </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">38 Pages, 2 Figures, 6 Tables</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1701.08107">arXiv:1701.08107</a> <span> [<a href="https://arxiv.org/pdf/1701.08107">pdf</a>, <a href="https://arxiv.org/format/1701.08107">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="Applications">stat.AP</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/TCI.2018.2811939">10.1109/TCI.2018.2811939 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Deconvolution and Restoration of Optical Endomicroscopy Images </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Eldaly%2C+A+K">Ahmed Karam Eldaly</a>, <a href="/search/cs?searchtype=author&query=Altmann%2C+Y">Yoann Altmann</a>, <a href="/search/cs?searchtype=author&query=Perperidis%2C+A">Antonios Perperidis</a>, <a href="/search/cs?searchtype=author&query=Krstajic%2C+N">Nikola Krstajic</a>, <a href="/search/cs?searchtype=author&query=Choudhary%2C+T">Tushar Choudhary</a>, <a href="/search/cs?searchtype=author&query=Dhaliwal%2C+K">Kevin Dhaliwal</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Stephen McLaughlin</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="1701.08107v3-abstract-short" style="display: inline;"> Optical endomicroscopy (OEM) is an emerging technology platform with preclinical and clinical imaging applications. Pulmonary OEM via fibre bundles has the potential to provide in vivo, in situ molecular signatures of disease such as infection and inflammation. However, enhancing the quality of data acquired by this technique for better visualization and subsequent analysis remains a challenging p… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1701.08107v3-abstract-full').style.display = 'inline'; document.getElementById('1701.08107v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1701.08107v3-abstract-full" style="display: none;"> Optical endomicroscopy (OEM) is an emerging technology platform with preclinical and clinical imaging applications. Pulmonary OEM via fibre bundles has the potential to provide in vivo, in situ molecular signatures of disease such as infection and inflammation. However, enhancing the quality of data acquired by this technique for better visualization and subsequent analysis remains a challenging problem. Cross coupling between fiber cores and sparse sampling by imaging fiber bundles are the main reasons for image degradation, and poor detection performance (i.e., inflammation, bacteria, etc.). In this work, we address the problem of deconvolution and restoration of OEM data. We propose a hierarchical Bayesian model to solve this problem and compare three estimation algorithms to exploit the resulting joint posterior distribution. The first method is based on Markov chain Monte Carlo (MCMC) methods, however, it exhibits a relatively long computational time. The second and third algorithms deal with this issue and are based on a variational Bayes (VB) approach and an alternating direction method of multipliers (ADMM) algorithm respectively. Results on both synthetic and real datasets illustrate the effectiveness of the proposed methods for restoration of OEM images. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1701.08107v3-abstract-full').style.display = 'none'; document.getElementById('1701.08107v3-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> 28 August, 2018; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 27 January, 2017; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2017. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1505.00273">arXiv:1505.00273</a> <span> [<a href="https://arxiv.org/pdf/1505.00273">pdf</a>, <a href="https://arxiv.org/ps/1505.00273">ps</a>, <a href="https://arxiv.org/format/1505.00273">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</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/JSTSP.2015.2496908">10.1109/JSTSP.2015.2496908 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> A Survey of Stochastic Simulation and Optimization Methods in Signal Processing </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Pereyra%2C+M">Marcelo Pereyra</a>, <a href="/search/cs?searchtype=author&query=Schniter%2C+P">Philip Schniter</a>, <a href="/search/cs?searchtype=author&query=Chouzenoux%2C+E">Emilie Chouzenoux</a>, <a href="/search/cs?searchtype=author&query=Pesquet%2C+J">Jean-Christophe Pesquet</a>, <a href="/search/cs?searchtype=author&query=Tourneret%2C+J">Jean-Yves Tourneret</a>, <a href="/search/cs?searchtype=author&query=Hero%2C+A">Alfred Hero</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Steve McLaughlin</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="1505.00273v4-abstract-short" style="display: inline;"> Modern signal processing (SP) methods rely very heavily on probability and statistics to solve challenging SP problems. SP methods are now expected to deal with ever more complex models, requiring ever more sophisticated computational inference techniques. This has driven the development of statistical SP methods based on stochastic simulation and optimization. Stochastic simulation and optimizati… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1505.00273v4-abstract-full').style.display = 'inline'; document.getElementById('1505.00273v4-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1505.00273v4-abstract-full" style="display: none;"> Modern signal processing (SP) methods rely very heavily on probability and statistics to solve challenging SP problems. SP methods are now expected to deal with ever more complex models, requiring ever more sophisticated computational inference techniques. This has driven the development of statistical SP methods based on stochastic simulation and optimization. Stochastic simulation and optimization algorithms are computationally intensive tools for performing statistical inference in models that are analytically intractable and beyond the scope of deterministic inference methods. They have been recently successfully applied to many difficult problems involving complex statistical models and sophisticated (often Bayesian) statistical inference techniques. This survey paper offers an introduction to stochastic simulation and optimization methods in signal and image processing. The paper addresses a variety of high-dimensional Markov chain Monte Carlo (MCMC) methods as well as deterministic surrogate methods, such as variational Bayes, the Bethe approach, belief and expectation propagation and approximate message passing algorithms. It also discusses a range of optimization methods that have been adopted to solve stochastic problems, as well as stochastic methods for deterministic optimization. Subsequently, areas of overlap between simulation and optimization, in particular optimization-within-MCMC and MCMC-driven optimization are discussed. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1505.00273v4-abstract-full').style.display = 'none'; document.getElementById('1505.00273v4-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> 20 November, 2015; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 1 May, 2015; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2015. </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">To appear in the IEEE Journal of Selected Topics in Signal Processing special issue on Stochastic Simulation and Optimisation in Signal Processing, March 2016</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1502.01400">arXiv:1502.01400</a> <span> [<a href="https://arxiv.org/pdf/1502.01400">pdf</a>, <a href="https://arxiv.org/format/1502.01400">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computation">stat.CO</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> </div> </div> <p class="title is-5 mathjax"> Fast unsupervised Bayesian image segmentation with adaptive spatial regularisation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Pereyra%2C+M">Marcelo Pereyra</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Steve McLaughlin</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="1502.01400v3-abstract-short" style="display: inline;"> This paper presents a new Bayesian estimation technique for hidden Potts-Markov random fields with unknown regularisation parameters, with application to fast unsupervised K-class image segmentation. The technique is derived by first removing the regularisation parameter from the Bayesian model by marginalisation, followed by a small-variance-asymptotic (SVA) analysis in which the spatial regulari… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1502.01400v3-abstract-full').style.display = 'inline'; document.getElementById('1502.01400v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1502.01400v3-abstract-full" style="display: none;"> This paper presents a new Bayesian estimation technique for hidden Potts-Markov random fields with unknown regularisation parameters, with application to fast unsupervised K-class image segmentation. The technique is derived by first removing the regularisation parameter from the Bayesian model by marginalisation, followed by a small-variance-asymptotic (SVA) analysis in which the spatial regularisation and the integer-constrained terms of the Potts model are decoupled. The evaluation of this SVA Bayesian estimator is then relaxed into a problem that can be computed efficiently by iteratively solving a convex total-variation denoising problem and a least-squares clustering (K-means) problem, both of which can be solved straightforwardly, even in high-dimensions, and with parallel computing techniques. This leads to a fast fully unsupervised Bayesian image segmentation methodology in which the strength of the spatial regularisation is adapted automatically to the observed image during the inference procedure, and that can be easily applied in large 2D and 3D scenarios or in applications requiring low computing times. Experimental results on real images, as well as extensive comparisons with state-of-the-art algorithms, confirm that the proposed methodology offer extremely fast convergence and produces accurate segmentation results, with the important additional advantage of self-adjusting regularisation parameters. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1502.01400v3-abstract-full').style.display = 'none'; document.getElementById('1502.01400v3-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> 2 February, 2016; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 4 February, 2015; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2015. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1501.02155">arXiv:1501.02155</a> <span> [<a href="https://arxiv.org/pdf/1501.02155">pdf</a>, <a href="https://arxiv.org/ps/1501.02155">ps</a>, <a href="https://arxiv.org/format/1501.02155">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Metric Geometry">math.MG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Logic in Computer Science">cs.LO</span> </div> </div> <p class="title is-5 mathjax"> A formal proof of the Kepler conjecture </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Hales%2C+T">Thomas Hales</a>, <a href="/search/cs?searchtype=author&query=Adams%2C+M">Mark Adams</a>, <a href="/search/cs?searchtype=author&query=Bauer%2C+G">Gertrud Bauer</a>, <a href="/search/cs?searchtype=author&query=Dang%2C+D+T">Dat Tat Dang</a>, <a href="/search/cs?searchtype=author&query=Harrison%2C+J">John Harrison</a>, <a href="/search/cs?searchtype=author&query=Hoang%2C+T+L">Truong Le Hoang</a>, <a href="/search/cs?searchtype=author&query=Kaliszyk%2C+C">Cezary Kaliszyk</a>, <a href="/search/cs?searchtype=author&query=Magron%2C+V">Victor Magron</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Sean McLaughlin</a>, <a href="/search/cs?searchtype=author&query=Nguyen%2C+T+T">Thang Tat Nguyen</a>, <a href="/search/cs?searchtype=author&query=Nguyen%2C+T+Q">Truong Quang Nguyen</a>, <a href="/search/cs?searchtype=author&query=Nipkow%2C+T">Tobias Nipkow</a>, <a href="/search/cs?searchtype=author&query=Obua%2C+S">Steven Obua</a>, <a href="/search/cs?searchtype=author&query=Pleso%2C+J">Joseph Pleso</a>, <a href="/search/cs?searchtype=author&query=Rute%2C+J">Jason Rute</a>, <a href="/search/cs?searchtype=author&query=Solovyev%2C+A">Alexey Solovyev</a>, <a href="/search/cs?searchtype=author&query=Ta%2C+A+H+T">An Hoai Thi Ta</a>, <a href="/search/cs?searchtype=author&query=Tran%2C+T+N">Trung Nam Tran</a>, <a href="/search/cs?searchtype=author&query=Trieu%2C+D+T">Diep Thi Trieu</a>, <a href="/search/cs?searchtype=author&query=Urban%2C+J">Josef Urban</a>, <a href="/search/cs?searchtype=author&query=Vu%2C+K+K">Ky Khac Vu</a>, <a href="/search/cs?searchtype=author&query=Zumkeller%2C+R">Roland Zumkeller</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="1501.02155v1-abstract-short" style="display: inline;"> This article describes a formal proof of the Kepler conjecture on dense sphere packings in a combination of the HOL Light and Isabelle proof assistants. This paper constitutes the official published account of the now completed Flyspeck project. </span> <span class="abstract-full has-text-grey-dark mathjax" id="1501.02155v1-abstract-full" style="display: none;"> This article describes a formal proof of the Kepler conjecture on dense sphere packings in a combination of the HOL Light and Isabelle proof assistants. This paper constitutes the official published account of the now completed Flyspeck project. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1501.02155v1-abstract-full').style.display = 'none'; document.getElementById('1501.02155v1-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 January, 2015; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2015. </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">21 pages</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1410.4871">arXiv:1410.4871</a> <span> [<a href="https://arxiv.org/pdf/1410.4871">pdf</a>, <a href="https://arxiv.org/format/1410.4871">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Data Analysis, Statistics and Probability">physics.data-an</span> <span class="tag is-small is-grey 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="Methodology">stat.ME</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/TIP.2015.2426021">10.1109/TIP.2015.2426021 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Bayesian estimation of the multifractality parameter for image texture using a Whittle approximation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Combrexelle%2C+S">S茅bastien Combrexelle</a>, <a href="/search/cs?searchtype=author&query=Wendt%2C+H">Herwig Wendt</a>, <a href="/search/cs?searchtype=author&query=Dobigeon%2C+N">Nicolas Dobigeon</a>, <a href="/search/cs?searchtype=author&query=Tourneret%2C+J">Jean-Yves Tourneret</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Steve McLaughlin</a>, <a href="/search/cs?searchtype=author&query=Abry%2C+P">Patrice Abry</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="1410.4871v2-abstract-short" style="display: inline;"> Texture characterization is a central element in many image processing applications. Multifractal analysis is a useful signal and image processing tool, yet, the accurate estimation of multifractal parameters for image texture remains a challenge. This is due in the main to the fact that current estimation procedures consist of performing linear regressions across frequency scales of the two-dimen… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1410.4871v2-abstract-full').style.display = 'inline'; document.getElementById('1410.4871v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1410.4871v2-abstract-full" style="display: none;"> Texture characterization is a central element in many image processing applications. Multifractal analysis is a useful signal and image processing tool, yet, the accurate estimation of multifractal parameters for image texture remains a challenge. This is due in the main to the fact that current estimation procedures consist of performing linear regressions across frequency scales of the two-dimensional (2D) dyadic wavelet transform, for which only a few such scales are computable for images. The strongly non-Gaussian nature of multifractal processes, combined with their complicated dependence structure, makes it difficult to develop suitable models for parameter estimation. Here, we propose a Bayesian procedure that addresses the difficulties in the estimation of the multifractality parameter. The originality of the procedure is threefold: The construction of a generic semi-parametric statistical model for the logarithm of wavelet leaders; the formulation of Bayesian estimators that are associated with this model and the set of parameter values admitted by multifractal theory; the exploitation of a suitable Whittle approximation within the Bayesian model which enables the otherwise infeasible evaluation of the posterior distribution associated with the model. Performance is assessed numerically for several 2D multifractal processes, for several image sizes and a large range of process parameters. The procedure yields significant benefits over current benchmark estimators in terms of estimation performance and ability to discriminate between the two most commonly used classes of multifractal process models. The gains in performance are particularly pronounced for small image sizes, notably enabling for the first time the analysis of image patches as small as 64x64 pixels. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1410.4871v2-abstract-full').style.display = 'none'; document.getElementById('1410.4871v2-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 April, 2015; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 17 October, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2014. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> IEEE T. Image Proces., vol. 24, no. 8, pp. 2540-2551, Aug. 2015 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1112.0665">arXiv:1112.0665</a> <span> [<a href="https://arxiv.org/pdf/1112.0665">pdf</a>, <a href="https://arxiv.org/ps/1112.0665">ps</a>, <a href="https://arxiv.org/format/1112.0665">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Generalized Thresholding and Online Sparsity-Aware Learning in a Union of Subspaces </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Slavakis%2C+K">Konstantinos Slavakis</a>, <a href="/search/cs?searchtype=author&query=Kopsinis%2C+Y">Yannis Kopsinis</a>, <a href="/search/cs?searchtype=author&query=Theodoridis%2C+S">Sergios Theodoridis</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Stephen McLaughlin</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="1112.0665v3-abstract-short" style="display: inline;"> This paper studies a sparse signal recovery task in time-varying (time-adaptive) environments. The contribution of the paper to sparsity-aware online learning is threefold; first, a Generalized Thresholding (GT) operator, which relates to both convex and non-convex penalty functions, is introduced. This operator embodies, in a unified way, the majority of well-known thresholding rules which promot… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1112.0665v3-abstract-full').style.display = 'inline'; document.getElementById('1112.0665v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1112.0665v3-abstract-full" style="display: none;"> This paper studies a sparse signal recovery task in time-varying (time-adaptive) environments. The contribution of the paper to sparsity-aware online learning is threefold; first, a Generalized Thresholding (GT) operator, which relates to both convex and non-convex penalty functions, is introduced. This operator embodies, in a unified way, the majority of well-known thresholding rules which promote sparsity. Second, a non-convexly constrained, sparsity-promoting, online learning scheme, namely the Adaptive Projection-based Generalized Thresholding (APGT), is developed that incorporates the GT operator with a computational complexity that scales linearly to the number of unknowns. Third, the novel family of partially quasi-nonexpansive mappings is introduced as a functional analytic tool for treating the GT operator. By building upon the rich fixed point theory, the previous class of mappings helps us, also, to establish a link between the GT operator and a union of linear subspaces; a non-convex object which lies at the heart of any sparsity promoting technique, batch or online. Based on such a functional analytic framework, a convergence analysis of the APGT is provided. Furthermore, extensive experiments suggest that the APGT exhibits competitive performance when compared to computationally more demanding alternatives, such as the sparsity-promoting Affine Projection Algorithm (APA)- and Recursive Least Squares (RLS)-based techniques. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1112.0665v3-abstract-full').style.display = 'none'; document.getElementById('1112.0665v3-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> 29 November, 2012; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 3 December, 2011; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2011. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1102.3641">arXiv:1102.3641</a> <span> [<a href="https://arxiv.org/pdf/1102.3641">pdf</a>, <a href="https://arxiv.org/ps/1102.3641">ps</a>, <a href="https://arxiv.org/format/1102.3641">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> </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/ICC.2012.6363737">10.1109/ICC.2012.6363737 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Physical-Layer Security over Correlated Erasure Channels </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Harrison%2C+W+K">W. K. Harrison</a>, <a href="/search/cs?searchtype=author&query=Almeida%2C+J">J. Almeida</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S+W">S. W. McLaughlin</a>, <a href="/search/cs?searchtype=author&query=Barros%2C+J">J. Barros</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.3641v1-abstract-short" style="display: inline;"> We explore the additional security obtained by noise at the physical layer in a wiretap channel model setting. Security enhancements at the physical layer have been proposed recently using a secrecy metric based on the degrees of freedom that an attacker has with respect to the sent ciphertext. Prior work focused on cases in which the wiretap channel could be modeled as statistically independent p… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1102.3641v1-abstract-full').style.display = 'inline'; document.getElementById('1102.3641v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1102.3641v1-abstract-full" style="display: none;"> We explore the additional security obtained by noise at the physical layer in a wiretap channel model setting. Security enhancements at the physical layer have been proposed recently using a secrecy metric based on the degrees of freedom that an attacker has with respect to the sent ciphertext. Prior work focused on cases in which the wiretap channel could be modeled as statistically independent packet erasure channels for the legitimate receiver and an eavesdropper. In this paper, we go beyond the state-of-the-art by addressing correlated erasure events across the two communication channels. The resulting security enhancement is presented as a function of the correlation coefficient and the erasure probabilities for both channels. It is shown that security improvements are achievable by means of judicious physical-layer design even when the eavesdropper has a better channel than the legitimate receiver. The only case in which this assertion may not hold is when erasures are highly correlated across channels. However, we are able to prove that correlation cannot nullify the expected security enhancement if the channel quality of the legitimate receiver is strictly better than that of the eavesdropper. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1102.3641v1-abstract-full').style.display = 'none'; document.getElementById('1102.3641v1-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> 17 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">5 pages, 4 figures, submitted to ISIT 2011</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.3173">arXiv:1102.3173</a> <span> [<a href="https://arxiv.org/pdf/1102.3173">pdf</a>, <a href="https://arxiv.org/ps/1102.3173">ps</a>, <a href="https://arxiv.org/format/1102.3173">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> </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/TIFS.2011.2145371">10.1109/TIFS.2011.2145371 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Coding for Cryptographic Security Enhancement using Stopping Sets </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Harrison%2C+W+K">W. K. Harrison</a>, <a href="/search/cs?searchtype=author&query=Almeida%2C+J">J. Almeida</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S+W">S. W. McLaughlin</a>, <a href="/search/cs?searchtype=author&query=Barros%2C+J">J. Barros</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.3173v1-abstract-short" style="display: inline;"> In this paper we discuss the ability of channel codes to enhance cryptographic secrecy. Toward that end, we present the secrecy metric of degrees of freedom in an attacker's knowledge of the cryptogram, which is similar to equivocation. Using this notion of secrecy, we show how a specific practical channel coding system can be used to hide information about the ciphertext, thus increasing the diff… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1102.3173v1-abstract-full').style.display = 'inline'; document.getElementById('1102.3173v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1102.3173v1-abstract-full" style="display: none;"> In this paper we discuss the ability of channel codes to enhance cryptographic secrecy. Toward that end, we present the secrecy metric of degrees of freedom in an attacker's knowledge of the cryptogram, which is similar to equivocation. Using this notion of secrecy, we show how a specific practical channel coding system can be used to hide information about the ciphertext, thus increasing the difficulty of cryptographic attacks. The system setup is the wiretap channel model where transmitted data traverse through independent packet erasure channels with public feedback for authenticated ARQ (Automatic Repeat reQuest). The code design relies on puncturing nonsystematic low-density parity-check codes with the intent of inflicting an eavesdropper with stopping sets in the decoder. Furthermore, the design amplifies errors when stopping sets occur such that a receiver must guess all the channel-erased bits correctly to avoid an expected error rate of one half in the ciphertext. We extend previous results on the coding scheme by giving design criteria that reduces the effectiveness of a maximum-likelihood attack to that of a message-passing attack. We further extend security analysis to models with multiple receivers and collaborative attackers. Cryptographic security is enhanced in all these cases by exploiting properties of the physical-layer. The enhancement is accurately presented as a function of the degrees of freedom in the eavesdropper's knowledge of the ciphertext, and is even shown to be present when eavesdroppers have better channel quality than legitimate receivers. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1102.3173v1-abstract-full').style.display = 'none'; document.getElementById('1102.3173v1-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 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">13 pages, 8 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1009.3130">arXiv:1009.3130</a> <span> [<a href="https://arxiv.org/pdf/1009.3130">pdf</a>, <a href="https://arxiv.org/format/1009.3130">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</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/TIFS.2011.2148715">10.1109/TIFS.2011.2148715 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth LDPC Codes </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Subramanian%2C+A">Arunkumar Subramanian</a>, <a href="/search/cs?searchtype=author&query=Thangaraj%2C+A">Andrew Thangaraj</a>, <a href="/search/cs?searchtype=author&query=Bloch%2C+M">Matthieu Bloch</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S+W">Steven W. McLaughlin</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="1009.3130v3-abstract-short" style="display: inline;"> For an arbitrary degree distribution pair (DDP), we construct a sequence of low-density parity-check (LDPC) code ensembles with girth growing logarithmically in block-length using Ramanujan graphs. When the DDP has minimum left degree at least three, we show using density evolution analysis that the expected bit-error probability of these ensembles, when passed through a binary erasure channel wit… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1009.3130v3-abstract-full').style.display = 'inline'; document.getElementById('1009.3130v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1009.3130v3-abstract-full" style="display: none;"> For an arbitrary degree distribution pair (DDP), we construct a sequence of low-density parity-check (LDPC) code ensembles with girth growing logarithmically in block-length using Ramanujan graphs. When the DDP has minimum left degree at least three, we show using density evolution analysis that the expected bit-error probability of these ensembles, when passed through a binary erasure channel with erasure probability $蔚$, decays as $\mathcal{O}(\exp(-c_1 n^{c_2}))$ with the block-length $n$ for positive constants $c_1$ and $c_2$, as long as $蔚$ is lesser than the erasure threshold $蔚_\mathrm{th}$ of the DDP. This guarantees that the coset coding scheme using the dual sequence provides strong secrecy over the binary erasure wiretap channel for erasure probabilities greater than $1 - 蔚_\mathrm{th}$. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1009.3130v3-abstract-full').style.display = 'none'; document.getElementById('1009.3130v3-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 February, 2011; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 16 September, 2010; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2010. </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">11 pages, 4 figures. Submitted to the IEEE Transactions on Information Forensics and Security</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1004.5540">arXiv:1004.5540</a> <span> [<a href="https://arxiv.org/pdf/1004.5540">pdf</a>, <a href="https://arxiv.org/format/1004.5540">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</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/CIG.2010.5592770">10.1109/CIG.2010.5592770 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Strong Secrecy for Erasure Wiretap Channels </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Suresh%2C+A+T">Ananda T. Suresh</a>, <a href="/search/cs?searchtype=author&query=Subramanian%2C+A">Arunkumar Subramanian</a>, <a href="/search/cs?searchtype=author&query=Thangaraj%2C+A">Andrew Thangaraj</a>, <a href="/search/cs?searchtype=author&query=Bloch%2C+M">Matthieu Bloch</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Steven McLaughlin</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="1004.5540v1-abstract-short" style="display: inline;"> We show that duals of certain low-density parity-check (LDPC) codes, when used in a standard coset coding scheme, provide strong secrecy over the binary erasure wiretap channel (BEWC). This result hinges on a stopping set analysis of ensembles of LDPC codes with block length $n$ and girth $\geq 2k$, for some $k \geq 2$. We show that if the minimum left degree of the ensemble is $l_\mathrm{min}$, t… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1004.5540v1-abstract-full').style.display = 'inline'; document.getElementById('1004.5540v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1004.5540v1-abstract-full" style="display: none;"> We show that duals of certain low-density parity-check (LDPC) codes, when used in a standard coset coding scheme, provide strong secrecy over the binary erasure wiretap channel (BEWC). This result hinges on a stopping set analysis of ensembles of LDPC codes with block length $n$ and girth $\geq 2k$, for some $k \geq 2$. We show that if the minimum left degree of the ensemble is $l_\mathrm{min}$, the expected probability of block error is $\calO(\frac{1}{n^{\lceil l_\mathrm{min} k /2 \rceil - k}})$ when the erasure probability $蔚< 蔚_\mathrm{ef}$, where $蔚_\mathrm{ef}$ depends on the degree distribution of the ensemble. As long as $l_\mathrm{min} > 2$ and $k > 2$, the dual of this LDPC code provides strong secrecy over a BEWC of erasure probability greater than $1 - 蔚_\mathrm{ef}$. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1004.5540v1-abstract-full').style.display = 'none'; document.getElementById('1004.5540v1-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 April, 2010; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2010. </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">Submitted to the Information Theory Workship (ITW) 2010, Dublin</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/0905.0440">arXiv:0905.0440</a> <span> [<a href="https://arxiv.org/pdf/0905.0440">pdf</a>, <a href="https://arxiv.org/ps/0905.0440">ps</a>, <a href="https://arxiv.org/format/0905.0440">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Cryptography and Security">cs.CR</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/ISIT.2009.5205606">10.1109/ISIT.2009.5205606 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Tandem Coding and Cryptography on Wiretap Channels: EXIT Chart Analysis </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Harrison%2C+W+K">Willie K Harrison</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S+W">Steven W. McLaughlin</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="0905.0440v1-abstract-short" style="display: inline;"> Traditional cryptography assumes an eavesdropper receives an error-free copy of the transmitted ciphertext. Wyner's wiretap channel model recognizes that at the physical layer both the intended receiver and the passive eavesdropper inevitably receive an error-prone version of the transmitted message which must be corrected prior to decryption. This paper considers the implications of using both… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0905.0440v1-abstract-full').style.display = 'inline'; document.getElementById('0905.0440v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="0905.0440v1-abstract-full" style="display: none;"> Traditional cryptography assumes an eavesdropper receives an error-free copy of the transmitted ciphertext. Wyner's wiretap channel model recognizes that at the physical layer both the intended receiver and the passive eavesdropper inevitably receive an error-prone version of the transmitted message which must be corrected prior to decryption. This paper considers the implications of using both channel and cryptographic codes under the wiretap channel model in a way that enhances the \emph{information-theoretic} security for the friendly parties by keeping the information transfer to the eavesdropper small. We consider a secret-key cryptographic system with a linear feedback shift register (LFSR)-based keystream generator and observe the mutual information between an LFSR-generated sequence and the received noise-corrupted ciphertext sequence under a known-plaintext scenario. The effectiveness of a noniterative fast correlation attack, which reduces the search time in a brute-force attack, is shown to be correlated with this mutual information. For an iterative fast correlation attack on this cryptographic system, it is shown that an EXIT chart and mutual information are very good predictors of decoding success and failure by a passive eavesdropper. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0905.0440v1-abstract-full').style.display = 'none'; document.getElementById('0905.0440v1-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 May, 2009; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 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">11 pages, 5 figures, accepted at 2009 IEEE International Symposium on Information Theory (ISIT 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/0902.3286">arXiv:0902.3286</a> <span> [<a href="https://arxiv.org/pdf/0902.3286">pdf</a>, <a href="https://arxiv.org/ps/0902.3286">ps</a>, <a href="https://arxiv.org/format/0902.3286">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> MDS codes on the erasure-erasure wiretap channel </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Subramanian%2C+A">Arunkumar Subramanian</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S+W">Steven W. McLaughlin</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="0902.3286v1-abstract-short" style="display: inline;"> This paper considers the problem of perfectly secure communication on a modified version of Wyner's wiretap channel II where both the main and wiretapper's channels have some erasures. A secret message is to be encoded into $n$ channel symbols and transmitted. The main channel is such that the legitimate receiver receives the transmitted codeword with exactly $n - 谓$ erasures, where the position… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0902.3286v1-abstract-full').style.display = 'inline'; document.getElementById('0902.3286v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="0902.3286v1-abstract-full" style="display: none;"> This paper considers the problem of perfectly secure communication on a modified version of Wyner's wiretap channel II where both the main and wiretapper's channels have some erasures. A secret message is to be encoded into $n$ channel symbols and transmitted. The main channel is such that the legitimate receiver receives the transmitted codeword with exactly $n - 谓$ erasures, where the positions of the erasures are random. Additionally, an eavesdropper (wire-tapper) is able to observe the transmitted codeword with $n - 渭$ erasures in a similar fashion. This paper studies the maximum achievable information rate with perfect secrecy on this channel and gives a coding scheme using nested codes that achieves the secrecy capacity. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0902.3286v1-abstract-full').style.display = 'none'; document.getElementById('0902.3286v1-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> 18 February, 2009; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 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">Submitted to the 2009 IEEE International Symposium on Information Theory</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/0901.0275">arXiv:0901.0275</a> <span> [<a href="https://arxiv.org/pdf/0901.0275">pdf</a>, <a href="https://arxiv.org/ps/0901.0275">ps</a>, <a href="https://arxiv.org/format/0901.0275">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Cryptography and Security">cs.CR</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/ICC.2009.5199337">10.1109/ICC.2009.5199337 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Physical-Layer Security: Combining Error Control Coding and Cryptography </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Harrison%2C+W+K">Willie K Harrison</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S+W">Steven W. McLaughlin</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="0901.0275v2-abstract-short" style="display: inline;"> In this paper we consider tandem error control coding and cryptography in the setting of the {\em wiretap channel} due to Wyner. In a typical communications system a cryptographic application is run at a layer above the physical layer and assumes the channel is error free. However, in any real application the channels for friendly users and passive eavesdroppers are not error free and Wyner's wi… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0901.0275v2-abstract-full').style.display = 'inline'; document.getElementById('0901.0275v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="0901.0275v2-abstract-full" style="display: none;"> In this paper we consider tandem error control coding and cryptography in the setting of the {\em wiretap channel} due to Wyner. In a typical communications system a cryptographic application is run at a layer above the physical layer and assumes the channel is error free. However, in any real application the channels for friendly users and passive eavesdroppers are not error free and Wyner's wiretap model addresses this scenario. Using this model, we show the security of a common cryptographic primitive, i.e. a keystream generator based on linear feedback shift registers (LFSR), can be strengthened by exploiting properties of the physical layer. A passive eavesdropper can be made to experience greater difficulty in cracking an LFSR-based cryptographic system insomuch that the computational complexity of discovering the secret key increases by orders of magnitude, or is altogether infeasible. This result is shown for two fast correlation attacks originally presented by Meier and Staffelbach, in the context of channel errors due to the wiretap channel model. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0901.0275v2-abstract-full').style.display = 'none'; document.getElementById('0901.0275v2-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> 16 April, 2009; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 2 January, 2009; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 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, 5 figures. Submitted and accepted to the International Conference on Communications (ICC) 2009. v2: equivalent to the version that will be published in the conference proceedings. Has some altered notation from version 1 as well as slight changes in the wording to make the paper more readable and easier to understand</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">ACM Class:</span> H.1.1; K.6.5 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/0705.0543">arXiv:0705.0543</a> <span> [<a href="https://arxiv.org/pdf/0705.0543">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</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/ICC.2006.254899">10.1109/ICC.2006.254899 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> The Design of Efficiently-Encodable Rate-Compatible LDPC Codes </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Kim%2C+J">Jaehong Kim</a>, <a href="/search/cs?searchtype=author&query=Ramamoorthy%2C+A">Aditya Ramamoorthy</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S+W">Steven W. McLaughlin</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="0705.0543v1-abstract-short" style="display: inline;"> We present a new class of irregular low-density parity-check (LDPC) codes for moderate block lengths (up to a few thousand bits) that are well-suited for rate-compatible puncturing. The proposed codes show good performance under puncturing over a wide range of rates and are suitable for usage in incremental redundancy hybrid-automatic repeat request (ARQ) systems. In addition, these codes are li… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0705.0543v1-abstract-full').style.display = 'inline'; document.getElementById('0705.0543v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="0705.0543v1-abstract-full" style="display: none;"> We present a new class of irregular low-density parity-check (LDPC) codes for moderate block lengths (up to a few thousand bits) that are well-suited for rate-compatible puncturing. The proposed codes show good performance under puncturing over a wide range of rates and are suitable for usage in incremental redundancy hybrid-automatic repeat request (ARQ) systems. In addition, these codes are linear-time encodable with simple shift-register circuits. For a block length of 1200 bits the codes outperform optimized irregular LDPC codes and extended irregular repeat-accumulate (eIRA) codes for all puncturing rates 0.6~0.9 (base code performance is almost the same) and are particularly good at high puncturing rates where good puncturing performance has been previously difficult to achieve. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0705.0543v1-abstract-full').style.display = 'none'; document.getElementById('0705.0543v1-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 May, 2007; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2007. </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">Accepted subject to minor revision to IEEE Trans. on Comm</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/cs/0611121">arXiv:cs/0611121</a> <span> [<a href="https://arxiv.org/pdf/cs/0611121">pdf</a>, <a href="https://arxiv.org/ps/cs/0611121">ps</a>, <a href="https://arxiv.org/format/cs/0611121">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Wireless Information-Theoretic Security - Part II: Practical Implementation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Bloch%2C+M">Matthieu Bloch</a>, <a href="/search/cs?searchtype=author&query=Barros%2C+J">Joao Barros</a>, <a href="/search/cs?searchtype=author&query=Rodrigues%2C+M+R+D">Miguel R. D. Rodrigues</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S+W">Steven W. McLaughlin</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="cs/0611121v1-abstract-short" style="display: inline;"> In Part I of this two-part paper on confidential communication over wireless channels, we studied the fundamental security limits of quasi-static fading channels from the point of view of outage secrecy capacity with perfect and imperfect channel state information. In Part II, we develop a practical secret key agreement protocol for Gaussian and quasi-static fading wiretap channels. The protocol… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('cs/0611121v1-abstract-full').style.display = 'inline'; document.getElementById('cs/0611121v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="cs/0611121v1-abstract-full" style="display: none;"> In Part I of this two-part paper on confidential communication over wireless channels, we studied the fundamental security limits of quasi-static fading channels from the point of view of outage secrecy capacity with perfect and imperfect channel state information. In Part II, we develop a practical secret key agreement protocol for Gaussian and quasi-static fading wiretap channels. The protocol uses a four-step procedure to secure communications: establish common randomness via an opportunistic transmission, perform message reconciliation, establish a common key via privacy amplification, and use of the key. We introduce a new reconciliation procedure that uses multilevel coding and optimized low density parity check codes which in some cases comes close to achieving the secrecy capacity limits established in Part I. Finally, we develop new metrics for assessing average secure key generation rates and show that our protocol is effective in secure key renewal. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('cs/0611121v1-abstract-full').style.display = 'none'; document.getElementById('cs/0611121v1-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> 23 November, 2006; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2006. </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">25 pages, 11 figures, submitted to Special Issue of IEEE Trans. on Info. Theory on Information Theoretic Security</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/cs/0611120">arXiv:cs/0611120</a> <span> [<a href="https://arxiv.org/pdf/cs/0611120">pdf</a>, <a href="https://arxiv.org/ps/cs/0611120">ps</a>, <a href="https://arxiv.org/format/cs/0611120">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Wireless Information-Theoretic Security - Part I: Theoretical Aspects </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Bloch%2C+M">Matthieu Bloch</a>, <a href="/search/cs?searchtype=author&query=Barros%2C+J">Joao Barros</a>, <a href="/search/cs?searchtype=author&query=Rodrigues%2C+M+R+D">Miguel R. D. Rodrigues</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S+W">Steven W. McLaughlin</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="cs/0611120v1-abstract-short" style="display: inline;"> In this two-part paper, we consider the transmission of confidential data over wireless wiretap channels. The first part presents an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through another independent quasi-static fading channel. We define the secrecy capacity in ter… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('cs/0611120v1-abstract-full').style.display = 'inline'; document.getElementById('cs/0611120v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="cs/0611120v1-abstract-full" style="display: none;"> In this two-part paper, we consider the transmission of confidential data over wireless wiretap channels. The first part presents an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through another independent quasi-static fading channel. We define the secrecy capacity in terms of outage probability and provide a complete characterization of the maximum transmission rate at which the eavesdropper is unable to decode any information. In sharp contrast with known results for Gaussian wiretap channels (without feedback), our contribution shows that in the presence of fading information-theoretic security is achievable even when the eavesdropper has a better average signal-to-noise ratio (SNR) than the legitimate receiver - fading thus turns out to be a friend and not a foe. The issue of imperfect channel state information is also addressed. Practical schemes for wireless information-theoretic security are presented in Part II, which in some cases comes close to the secrecy capacity limits given in this paper. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('cs/0611120v1-abstract-full').style.display = 'none'; document.getElementById('cs/0611120v1-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 November, 2006; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2006. </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">27 pages, 14 figures, submitted to Special Issue of IEEE Trans. on Info. Theory on Information Theoretic Security</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/cs/0509041">arXiv:cs/0509041</a> <span> [<a href="https://arxiv.org/pdf/cs/0509041">pdf</a>, <a href="https://arxiv.org/ps/cs/0509041">ps</a>, <a href="https://arxiv.org/format/cs/0509041">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Efficient Reconciliation of Correlated Continuous Random Variables using LDPC Codes </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Bloch%2C+M">Matthieu Bloch</a>, <a href="/search/cs?searchtype=author&query=Thangaraj%2C+A">Andrew Thangaraj</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S+W">Steven W. McLaughlin</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="cs/0509041v1-abstract-short" style="display: inline;"> This paper investigates an efficient and practical information reconciliation method in the case where two parties have access to correlated continuous random variables. We show that reconciliation is a special case of channel coding and that existing coded modulation techniques can be adapted for reconciliation. We describe an explicit reconciliation method based on LDPC codes in the case of co… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('cs/0509041v1-abstract-full').style.display = 'inline'; document.getElementById('cs/0509041v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="cs/0509041v1-abstract-full" style="display: none;"> This paper investigates an efficient and practical information reconciliation method in the case where two parties have access to correlated continuous random variables. We show that reconciliation is a special case of channel coding and that existing coded modulation techniques can be adapted for reconciliation. We describe an explicit reconciliation method based on LDPC codes in the case of correlated Gaussian variables. We believe that the proposed method can improve the efficiency of quantum key distribution protocols based on continuous-spectrum quantum states. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('cs/0509041v1-abstract-full').style.display = 'none'; document.getElementById('cs/0509041v1-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 September, 2005; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2005. </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, 9 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/cs/0411012">arXiv:cs/0411012</a> <span> [<a href="https://arxiv.org/pdf/cs/0411012">pdf</a>, <a href="https://arxiv.org/ps/cs/0411012">ps</a>, <a href="https://arxiv.org/format/cs/0411012">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Capacity Analysis for Continuous Alphabet Channels with Side Information, Part II: MIMO Channels </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Fozunbal%2C+M">Majid Fozunbal</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S+W">Steven W. McLaughlin</a>, <a href="/search/cs?searchtype=author&query=Schafer%2C+R+W">Ronald W. Schafer</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="cs/0411012v1-abstract-short" style="display: inline;"> In this part, we consider the capacity analysis for wireless mobile systems with multiple antenna architectures. We apply the results of the first part to a commonly known baseband, discrete-time multiple antenna system where both the transmitter and receiver know the channel's statistical law. We analyze the capacity for additive white Gaussian noise (AWGN) channels, fading channels with full c… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('cs/0411012v1-abstract-full').style.display = 'inline'; document.getElementById('cs/0411012v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="cs/0411012v1-abstract-full" style="display: none;"> In this part, we consider the capacity analysis for wireless mobile systems with multiple antenna architectures. We apply the results of the first part to a commonly known baseband, discrete-time multiple antenna system where both the transmitter and receiver know the channel's statistical law. We analyze the capacity for additive white Gaussian noise (AWGN) channels, fading channels with full channel state information (CSI) at the receiver, fading channels with no CSI, and fading channels with partial CSI at the receiver. For each type of channels, we study the capacity value as well as issues such as the existence, uniqueness, and characterization of the capacity-achieving measures for different types of moment constraints. The results are applicable to both Rayleigh and Rician fading channels in the presence of arbitrary line-of-sight and correlation profiles. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('cs/0411012v1-abstract-full').style.display = 'none'; document.getElementById('cs/0411012v1-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, 2004; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2004. </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">Submitted to Trans. Inform. Theory</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/cs/0411011">arXiv:cs/0411011</a> <span> [<a href="https://arxiv.org/pdf/cs/0411011">pdf</a>, <a href="https://arxiv.org/ps/cs/0411011">ps</a>, <a href="https://arxiv.org/format/cs/0411011">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</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/TIT.2005.853322">10.1109/TIT.2005.853322 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Capacity Analysis for Continuous Alphabet Channels with Side Information, Part I: A General Framework </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Fozunbal%2C+M">Majid Fozunbal</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S+W">Steven W. McLaughlin</a>, <a href="/search/cs?searchtype=author&query=Schafer%2C+R+W">Ronald W. Schafer</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="cs/0411011v1-abstract-short" style="display: inline;"> Capacity analysis for channels with side information at the receiver has been an active area of interest. This problem is well investigated for the case of finite alphabet channels. However, the results are not easily generalizable to the case of continuous alphabet channels due to analytic difficulties inherent with continuous alphabets. In the first part of this two-part paper, we address an a… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('cs/0411011v1-abstract-full').style.display = 'inline'; document.getElementById('cs/0411011v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="cs/0411011v1-abstract-full" style="display: none;"> Capacity analysis for channels with side information at the receiver has been an active area of interest. This problem is well investigated for the case of finite alphabet channels. However, the results are not easily generalizable to the case of continuous alphabet channels due to analytic difficulties inherent with continuous alphabets. In the first part of this two-part paper, we address an analytical framework for capacity analysis of continuous alphabet channels with side information at the receiver. For this purpose, we establish novel necessary and sufficient conditions for weak* continuity and strict concavity of the mutual information. These conditions are used in investigating the existence and uniqueness of the capacity-achieving measures. Furthermore, we derive necessary and sufficient conditions that characterize the capacity value and the capacity-achieving measure for continuous alphabet channels with side information at the receiver. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('cs/0411011v1-abstract-full').style.display = 'none'; document.getElementById('cs/0411011v1-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, 2004; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2004. </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">Submitted to IEEE Trans. Inform. Theory</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/cs/0411006">arXiv:cs/0411006</a> <span> [<a href="https://arxiv.org/pdf/cs/0411006">pdf</a>, <a href="https://arxiv.org/ps/cs/0411006">ps</a>, <a href="https://arxiv.org/format/cs/0411006">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</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/TIT.2006.876224">10.1109/TIT.2006.876224 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Capacity Achieving Code Constructions for Two Classes of (d,k) Constraints </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Sankarasubramaniam%2C+Y">Yogesh Sankarasubramaniam</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S+W">Steven W. McLaughlin</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="cs/0411006v1-abstract-short" style="display: inline;"> In this paper, we present two low complexity algorithms that achieve capacity for the noiseless (d,k) constrained channel when k=2d+1, or when k-d+1 is not prime. The first algorithm, called symbol sliding, is a generalized version of the bit flipping algorithm introduced by Aviran et al. [1]. In addition to achieving capacity for (d,2d+1) constraints, it comes close to capacity in other cases.… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('cs/0411006v1-abstract-full').style.display = 'inline'; document.getElementById('cs/0411006v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="cs/0411006v1-abstract-full" style="display: none;"> In this paper, we present two low complexity algorithms that achieve capacity for the noiseless (d,k) constrained channel when k=2d+1, or when k-d+1 is not prime. The first algorithm, called symbol sliding, is a generalized version of the bit flipping algorithm introduced by Aviran et al. [1]. In addition to achieving capacity for (d,2d+1) constraints, it comes close to capacity in other cases. The second algorithm is based on interleaving, and is a generalized version of the bit stuffing algorithm introduced by Bender and Wolf [2]. This method uses fewer than k-d biased bit streams to achieve capacity for (d,k) constraints with k-d+1 not prime. In particular, the encoder for (d,d+2^m-1) constraints, 1\le m<\infty, requires only m biased bit streams. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('cs/0411006v1-abstract-full').style.display = 'none'; document.getElementById('cs/0411006v1-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 November, 2004; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2004. </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">16 pages, submitted to the IEEE Transactions on Information Theory</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/cs/0411003">arXiv:cs/0411003</a> <span> [<a href="https://arxiv.org/pdf/cs/0411003">pdf</a>, <a href="https://arxiv.org/ps/cs/0411003">ps</a>, <a href="https://arxiv.org/format/cs/0411003">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Cryptography and Security">cs.CR</span> </div> </div> <p class="title is-5 mathjax"> Applications of LDPC Codes to the Wiretap Channel </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/cs?searchtype=author&query=Thangaraj%2C+A">Andrew Thangaraj</a>, <a href="/search/cs?searchtype=author&query=Dihidar%2C+S">Souvik Dihidar</a>, <a href="/search/cs?searchtype=author&query=Calderbank%2C+A+R">A. R. Calderbank</a>, <a href="/search/cs?searchtype=author&query=McLaughlin%2C+S">Steven McLaughlin</a>, <a href="/search/cs?searchtype=author&query=Merolla%2C+J">Jean-Marc Merolla</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="cs/0411003v3-abstract-short" style="display: inline;"> With the advent of quantum key distribution (QKD) systems, perfect (i.e. information-theoretic) security can now be achieved for distribution of a cryptographic key. QKD systems and similar protocols use classical error-correcting codes for both error correction (for the honest parties to correct errors) and privacy amplification (to make an eavesdropper fully ignorant). From a coding perspectiv… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('cs/0411003v3-abstract-full').style.display = 'inline'; document.getElementById('cs/0411003v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="cs/0411003v3-abstract-full" style="display: none;"> With the advent of quantum key distribution (QKD) systems, perfect (i.e. information-theoretic) security can now be achieved for distribution of a cryptographic key. QKD systems and similar protocols use classical error-correcting codes for both error correction (for the honest parties to correct errors) and privacy amplification (to make an eavesdropper fully ignorant). From a coding perspective, a good model that corresponds to such a setting is the wire tap channel introduced by Wyner in 1975. In this paper, we study fundamental limits and coding methods for wire tap channels. We provide an alternative view of the proof for secrecy capacity of wire tap channels and show how capacity achieving codes can be used to achieve the secrecy capacity for any wiretap channel. We also consider binary erasure channel and binary symmetric channel special cases for the wiretap channel and propose specific practical codes. In some cases our designs achieve the secrecy capacity and in others the codes provide security at rates below secrecy capacity. For the special case of a noiseless main channel and binary erasure channel, we consider encoder and decoder design for codes achieving secrecy on the wiretap channel; we show that it is possible to construct linear-time decodable secrecy codes based on LDPC codes that achieve secrecy. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('cs/0411003v3-abstract-full').style.display = 'none'; document.getElementById('cs/0411003v3-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> 29 January, 2007; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 2 November, 2004; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2004. </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">30 pages, revised version</span> </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