Efficient On-line Computation of Visibility Graphs
|dc.identifier.citation||Fano Yela, Delia et al. "Online Visibility Graphs: Encoding Visibility In A Binary Search Tree". Physical Review Research, vol 2, no. 2, 2020. American Physical Society (APS), doi:10.1103/physrevresearch.2.023069. Accessed 28 May 2020.||en_US|
|dc.description.abstract||A visibility algorithm maps time series into complex networks following a simple criterion. The resulting visibility graph has recently proven to be a powerful tool for time series analysis. However its straightforward computation is time-consuming and rigid, motivating the development of more efficient algorithms. Here we present a highly efficient method to compute visibility graphs with the further benefit of flexibility: on-line computation. We propose an encoder/decoder approach, with an on-line adjustable binary search tree codec for time series as well as its corresponding decoder for visibility graphs. The empirical evidence suggests the proposed method for computation of visibility graphs offers an on-line computation solution at no additional computation time cost. The source code is available online.||en_US|
|dc.publisher||American Physical Society||en_US|
|dc.rights||This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.|
|dc.rights||Attribution 3.0 United States||*|
|dc.title||Efficient On-line Computation of Visibility Graphs||en_US|
|dc.rights.holder||© The Author(s) 2020|
|qmul.funder||Structured machine listening for soundscapes with multiple birds::EPSRC||en_US|
Files in this item
There are no files associated with this item.
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described as This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.