{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/testing-for-high-frequency-features-in-a","title":"Testing for high frequency features in a noisy signal","arxiv_id":"1911.12719","date":"2019-11-28","proceeding":null,"authors":[],"abstract":"Given nonstationary data, one generally wants to extract the trend from the\nnoise by smoothing or filtering. However, it is often important to delineate a\nthird intermediate category, that we call high frequency (HF) features: this is\nthe case in our motivating example, which consists in experimental measurements\nof the time-dynamics of depolymerising protein fibrils average size. One may\nintuitively visualise HF features as the presence of fast, possibly\nnonstationary and transient oscillations, distinct from a slowly-varying trend\nenvelope. The aim of this article is to propose an empirical definition of HF\nfeatures and construct estimators and statistical tests for their presence\naccordingly, when the data consists of a noisy nonstationary 1-dimensional\nsignal. We propose a parametric characterization in the Fourier domain of the\nHF features by defining a maximal amplitude and distance to low frequencies of\nsignificant energy. We introduce a data-driven procedure to estimate these\nparameters, and compute a p-value proxy based on a statistical test for the\npresence of HF features. The test is first conducted on simulated signals where\nthe ratio amplitude of the HF features to the level of the noise is controlled.\nThe test detects HF features even when the level of noise is five times larger\nthan the amplitude of the oscillations. In a second part, the test is conducted\non experimental data from Prion disease experiments and it confirms the\npresence of HF features in these signals with significant confidence.","url_abs":"http://arxiv.org/abs/1911.12719v1","url_pdf":"http://arxiv.org/pdf/1911.12719v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"testing-for-high-frequency-features-in-a","repo_url":"https://github.com/mmezache/HFFTest","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"high","task_name":"Vocal Bursts Intensity Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"mmezache/HFFTest","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"820b874c5fe9eee6f4935094be10fbe2f829e1376dc1b0cfbf28177cd38ba7e8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}