{"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/harmonic-convolutional-networks-based-on","title":"Harmonic Convolutional Networks based on Discrete Cosine Transform","arxiv_id":"2001.06570","date":"2020-01-18","proceeding":null,"authors":["Matej Ulicny","Vladimir A. Krylov","Rozenn Dahyot"],"abstract":"Convolutional neural networks (CNNs) learn filters in order to capture local correlation patterns in feature space. We propose to learn these filters as combinations of preset spectral filters defined by the Discrete Cosine Transform (DCT). Our proposed DCT-based harmonic blocks replace conventional convolutional layers to produce partially or fully harmonic versions of new or existing CNN architectures. Using DCT energy compaction properties, we demonstrate how the harmonic networks can be efficiently compressed by truncating high-frequency information in harmonic blocks thanks to the redundancies in the spectral domain. We report extensive experimental validation demonstrating benefits of the introduction of harmonic blocks into state-of-the-art CNN models in image classification, object detection and semantic segmentation applications.","url_abs":"https://arxiv.org/abs/2001.06570v3","url_pdf":"https://arxiv.org/pdf/2001.06570v3.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":"harmonic-convolutional-networks-based-on","repo_url":"https://github.com/matej-ulicny/harmonic-networks","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"BSD-3-Clause"}}],"tasks":[{"task_slug":"edge-detection","task_name":"Edge Detection"},{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"object-detection","task_name":"Object Detection"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"},{"task_slug":"image-classification","task_name":"image-classification"},{"task_slug":"object-detection-1","task_name":"object-detection"}],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"average-pooling","method_name":"Average Pooling"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"discrete-cosine-transform","method_name":"Discrete Cosine Transform"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"harm-net","method_name":"Harm-Net"},{"method_slug":"harmonic-block","method_name":"Harmonic Block"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"randomhorizontalflip","method_name":"Random Horizontal Flip"},{"method_slug":"random-resized-crop","method_name":"Random Resized Crop"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"sgd","method_name":"SGD"},{"method_slug":"step-decay","method_name":"Step Decay"},{"method_slug":"weight-decay","method_name":"Weight Decay"}],"datasets_introduced":[],"methods_introduced":[{"slug":"harm-net","name":"Harm-Net","full_name":"Harm-Net"}],"results":[{"leaderboard":"/sota/image-classification-on-imagenet","task":"Image Classification","dataset":"ImageNet","model":"Harm-SE-RNX-101 64x4d (320x320, Mean-Max Pooling)","rank_in_archive_order":491,"of":1060,"metrics":{"GFLOPs":"31.4","Number of params":"88.2M","Top 1 Accuracy":"82.85%"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2001.06570","atlas_url":"https://app.syntology.ai/?focus=2001.06570","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06570"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2001.06570"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2001.06570"},"call":"get_harvested_code_for_paper(arxiv_id=\"2001.06570\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2001.06570"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2001.06570\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2001.06570"},"call":"get_concepts_for_paper(arxiv_id=\"2001.06570\")"}],"by_repo":[{"repo":"matej-ulicny/harmonic-networks","kind":"official","samples":10,"ran":10,"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2001.06570.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2001.06570.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/matej-ulicny/harmonic-networks","reach":{"status":"ok","spdx":"BSD-3-Clause"}}],"summary":{"ran":10},"n_samples":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":10,"ran":10,"n_ran_checked":10,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":10,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-25","last":"2026-09-25","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","census_is":"Syntology's function-name census ran implementations with this entry name on one shared input per bucket (the positional rank, kind and dtype of each array argument) and counted the distinct output digests (sha256 of the output rounded to 6 decimals). implementations and papers count the compared samples; distinct_outputs counts digests across all buckets; n_buckets is how many shared inputs were used. It is not a statement that any two samples compute one thing, and the name is a string, not an identity.","samples":[{"code_sha256":"d65fe0ebd97691cf","code_sha256_prefix":"d65fe0ebd97691cf","entry":"crop","repo":"matej-ulicny/harmonic-networks","repo_kind":"official","path":"bsds/models.py","file_url":"https://github.com/matej-ulicny/harmonic-networks/blob/HEAD/bsds/models.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"variable:Tensor/4/float, th:int/0/int, tw:int/0/int","fixture_out_type":"Tensor","level_recorded_at":"2026-09-25T10:06:43.451432+00:00","retrieve_with":{"tool":"get_code","code_sha256":"d65fe0ebd97691cf"},"code_page":"/code/crop","census":{"url":"/census/crop","implementations":5,"papers":5,"distinct_outputs":4,"n_buckets":4,"bucket_key":null,"bucket_index":null,"bucket_label":null},"census_bucket_fragment":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d65fe0ebd97691cf"}},{"code_sha256":"508c627527d31817","code_sha256_prefix":"508c627527d31817","entry":"cross_entropy_loss","repo":"matej-ulicny/harmonic-networks","repo_kind":"official","path":"bsds/functions.py","file_url":"https://github.com/matej-ulicny/harmonic-networks/blob/HEAD/bsds/functions.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"prediction:Tensor/2/float, label:Tensor/2/int","fixture_out_type":"Tensor","level_recorded_at":"2026-09-25T08:34:48.807261+00:00","code_page":"/code/cross-entropy-loss","census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"508c627527d31817"}},{"code_sha256":"ba9e5531aef0411f","code_sha256_prefix":"ba9e5531aef0411f","entry":"dct_filters","repo":"matej-ulicny/harmonic-networks","repo_kind":"official","path":"harmonic/modules.py","file_url":"https://github.com/matej-ulicny/harmonic-networks/blob/HEAD/harmonic/modules.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"k:int/0/int, groups:int/0/int, expand_dim:int/0/int, level:NoneType/0/?, DC:bool/0/bool, l1_norm:bool/0/bool","fixture_out_type":"Tensor","level_recorded_at":"2026-09-25T08:34:48.807261+00:00","code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"ba9e5531aef0411f"}},{"code_sha256":"be2f8db848d866ac","code_sha256_prefix":"be2f8db848d866ac","entry":"fixed_weight_cross_entropy_loss","repo":"matej-ulicny/harmonic-networks","repo_kind":"official","path":"bsds/functions.py","file_url":"https://github.com/matej-ulicny/harmonic-networks/blob/HEAD/bsds/functions.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"prediction:Tensor/2/float, label:Tensor/2/float","fixture_out_type":"Tensor","level_recorded_at":"2026-09-25T08:34:48.807261+00:00","code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"be2f8db848d866ac"}},{"code_sha256":"135486a95911e46f","code_sha256_prefix":"135486a95911e46f","entry":"interp_surgery","repo":"matej-ulicny/harmonic-networks","repo_kind":"official","path":"bsds/models.py","file_url":"https://github.com/matej-ulicny/harmonic-networks/blob/HEAD/bsds/models.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"in_channels:int/0/int, out_channels:int/0/int, h:int/0/int, w:int/0/int","fixture_out_type":"ndarray","level_recorded_at":"2026-09-25T10:06:43.451432+00:00","code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"135486a95911e46f"}},{"code_sha256":"b3d81e689671b903","code_sha256_prefix":"b3d81e689671b903","entry":"load_pretrained","repo":"matej-ulicny/harmonic-networks","repo_kind":"official","path":"bsds/utils.py","file_url":"https://github.com/matej-ulicny/harmonic-networks/blob/HEAD/bsds/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"model:callable/0/?, fname:str/0/str, optimizer:SGD/0/?","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T10:06:43.451432+00:00","code_page":"/code/load-pretrained","census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"b3d81e689671b903"}},{"code_sha256":"d252c37318502755","code_sha256_prefix":"d252c37318502755","entry":"prepare_image","repo":"matej-ulicny/harmonic-networks","repo_kind":"official","path":"bsds/data_loader.py","file_url":"https://github.com/matej-ulicny/harmonic-networks/blob/HEAD/bsds/data_loader.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"im:ndarray/3/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-25T08:34:48.807261+00:00","retrieve_with":{"tool":"get_code","code_sha256":"d252c37318502755"},"code_page":"/code/prepare-image","census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d252c37318502755"}},{"code_sha256":"ebdf723bf680cac4","code_sha256_prefix":"ebdf723bf680cac4","entry":"prepare_image_cv2","repo":"matej-ulicny/harmonic-networks","repo_kind":"official","path":"bsds/data_loader.py","file_url":"https://github.com/matej-ulicny/harmonic-networks/blob/HEAD/bsds/data_loader.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"im:ndarray/3/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-25T08:34:48.807261+00:00","retrieve_with":{"tool":"get_code","code_sha256":"ebdf723bf680cac4"},"code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"ebdf723bf680cac4"}},{"code_sha256":"e939917d68cfb910","code_sha256_prefix":"e939917d68cfb910","entry":"sigmoid_cross_entropy_loss","repo":"matej-ulicny/harmonic-networks","repo_kind":"official","path":"bsds/functions.py","file_url":"https://github.com/matej-ulicny/harmonic-networks/blob/HEAD/bsds/functions.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"prediction:Tensor/2/float, label:Tensor/2/int","fixture_out_type":"Tensor","level_recorded_at":"2026-09-25T10:06:43.451432+00:00","retrieve_with":{"tool":"get_code","code_sha256":"e939917d68cfb910"},"code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"e939917d68cfb910"}},{"code_sha256":"c9519ae7724e4642","code_sha256_prefix":"c9519ae7724e4642","entry":"upsample_filt","repo":"matej-ulicny/harmonic-networks","repo_kind":"official","path":"bsds/models.py","file_url":"https://github.com/matej-ulicny/harmonic-networks/blob/HEAD/bsds/models.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"size:int/0/int","fixture_out_type":"ndarray","level_recorded_at":"2026-09-25T08:34:48.807261+00:00","retrieve_with":{"tool":"get_code","code_sha256":"c9519ae7724e4642"},"code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c9519ae7724e4642"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"ab6948f2519e0e2a9c9f46de3e2c4dad63e08c4e4d44c4ee79f0e31e2a07a6a3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}