{"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/algorithms-for-the-construction-of-incoherent","title":"Algorithms for the Construction of Incoherent Frames Under Various Design Constraints","arxiv_id":"1801.09678","date":"2018-06-20","proceeding":null,"authors":[],"abstract":"Unit norm finite frames are generalizations of orthonormal bases with many\napplications in signal processing. An important property of a frame is its\ncoherence, a measure of how close any two vectors of the frame are to each\nother. Low coherence frames are useful in compressed sensing applications. When\nused as measurement matrices, they successfully recover highly sparse solutions\nto linear inverse problems. This paper describes algorithms for the design of\nvarious low coherence frame types: real, complex, unital (constant magnitude)\ncomplex, sparse real and complex, nonnegative real and complex, and harmonic\n(selection of rows from Fourier matrices). The proposed methods are based on\nsolving a sequence of convex optimization problems that update each vector of\nthe frame. This update reduces the coherence with the other frame vectors,\nwhile other constraints on its entries are also imposed. Numerical experiments\nshow the effectiveness of the methods compared to the Welch bound, as well as\nother competing algorithms, in compressed sensing applications.","url_abs":"http://arxiv.org/abs/1801.09678v2","url_pdf":"http://arxiv.org/pdf/1801.09678v2.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":"algorithms-for-the-construction-of-incoherent","repo_url":"https://github.com/cristian-rusu-research/SIDCO","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"compressed-sensing","task_name":"compressed sensing"}],"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":"cristian-rusu-research/SIDCO","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":"b5d944738186f608d2be2f7cfb6f154aebd49de2eff8a09477a4045a90dd74d9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}