2 Hits in 2.8 sec

Fast Computation of Sliding Discrete Tchebichef Moments and Its Application in Duplicated Regions Detection

Beijing Chen, Gouenou Coatrieux, Jiasong Wu, Zhifang Dong, Jean Louis Coatrieux, Huazhong Shu
2015 IEEE Transactions on Signal Processing  
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 [12] for sharing their code and dataset as well as their helpful suggestions.  ... 
doi:10.1109/tsp.2015.2451107 fatcat:dmiq44eiqzgh5fwlouixzwzhku

HiPPO: Recurrent Memory with Optimal Polynomial Projections [article]

Albert Gu, Tri Dao, Stefano Ermon, Atri Rudra, Christopher Re
2020 arXiv   pre-print
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