A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
In this paper, we present an efficient algorithm for the fast computation of one-dimensional and two-dimensional sliding discrete Tchebichef moments. ... We further theoretically establish the complexity of our fast algorithm and illustrate its interest within the framework of digital forensics and more precisely the detection of duplicated regions in an ... Christlein and C. Riess  for sharing their code and dataset as well as their helpful suggestions. ...doi:10.1109/tsp.2015.2451107 fatcat:dmiq44eiqzgh5fwlouixzwzhku
HiPPO-LegS enjoys the theoretical benefits of timescale robustness, fast updates, and bounded gradients. ... We introduce a general framework (HiPPO) for the online compression of continuous signals and discrete time series by projection onto polynomial bases. ... Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views, policies, or endorsements, either expressed or implied ...arXiv:2008.07669v2 fatcat:2xlv4fqydrhj7g7sisfnrpxn3i