{"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/localized-fourier-analysis-for-graph-signal","title":"Localized Fourier Analysis for Graph Signal Processing","arxiv_id":"1906.04529","date":"2019-06-11","proceeding":null,"authors":["Basile de Loynes","Fabien Navarro","Baptiste Olivier"],"abstract":"We propose a new point of view in the study of Fourier analysis on graphs, taking advantage of localization in the Fourier domain. For a signal $f$ on vertices of a weighted graph $\\mathcal{G}$ with Laplacian matrix $\\mathcal{L}$, standard Fourier analysis of $f$ relies on the study of functions $g(\\mathcal{L})f$ for some filters $g$ on $I_\\mathcal{L}$, the smallest interval containing the Laplacian spectrum ${\\mathrm sp}(\\mathcal{L}) \\subset I_\\mathcal{L}$. We show that for carefully chosen partitions $I_\\mathcal{L} = \\sqcup_{1\\leq k\\leq K} I_k$ ($I_k \\subset I_\\mathcal{L}$), there are many advantages in understanding the collection $(g(\\mathcal{L}_{I_k})f)_{1\\leq k\\leq K}$ instead of $g(\\mathcal{L})f$ directly, where $\\mathcal{L}_I$ is the projected matrix $P_I(\\mathcal{L})\\mathcal{L}$. First, the partition provides a convenient modelling for the study of theoretical properties of Fourier analysis and allows for new results in graph signal analysis (\\emph{e.g.} noise level estimation, Fourier support approximation). We extend the study of spectral graph wavelets to wavelets localized in the Fourier domain, called LocLets, and we show that well-known frames can be written in terms of LocLets. From a practical perspective, we highlight the interest of the proposed localized Fourier analysis through many experiments that show significant improvements in two different tasks on large graphs, noise level estimation and signal denoising. Moreover, efficient strategies permit to compute sequence $(g(\\mathcal{L}_{I_k})f)_{1\\leq k\\leq K}$ with the same time complexity as for the computation of $g(\\mathcal{L})f$.","url_abs":"https://arxiv.org/abs/1906.04529v3","url_pdf":"https://arxiv.org/pdf/1906.04529v3.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":"localized-fourier-analysis-for-graph-signal","repo_url":"https://bitbucket.org/batistbucket/loclets","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"denoising","task_name":"Denoising"}],"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":"bitbucket.org/batistbucket/loclets","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":"14e5033b26e4ba60971eafe34d2c159d22fc44c63cefb24df4636fffbef9f3c9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}