{"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/hierarchical-cellular-automata-for-visual","title":"Hierarchical Cellular Automata for Visual Saliency","arxiv_id":"1705.09425","date":"2017-05-26","proceeding":null,"authors":["Yao Qin","Mengyang Feng","Huchuan Lu","Garrison W. Cottrell"],"abstract":"Saliency detection, finding the most important parts of an image, has become\nincreasingly popular in computer vision. In this paper, we introduce\nHierarchical Cellular Automata (HCA) -- a temporally evolving model to\nintelligently detect salient objects. HCA consists of two main components:\nSingle-layer Cellular Automata (SCA) and Cuboid Cellular Automata (CCA). As an\nunsupervised propagation mechanism, Single-layer Cellular Automata can exploit\nthe intrinsic relevance of similar regions through interactions with neighbors.\nLow-level image features as well as high-level semantic information extracted\nfrom deep neural networks are incorporated into the SCA to measure the\ncorrelation between different image patches. With these hierarchical deep\nfeatures, an impact factor matrix and a coherence matrix are constructed to\nbalance the influences on each cell's next state. The saliency values of all\ncells are iteratively updated according to a well-defined update rule.\nFurthermore, we propose CCA to integrate multiple saliency maps generated by\nSCA at different scales in a Bayesian framework. Therefore, single-layer\npropagation and multi-layer integration are jointly modeled in our unified HCA.\nSurprisingly, we find that the SCA can improve all existing methods that we\napplied it to, resulting in a similar precision level regardless of the\noriginal results. The CCA can act as an efficient pixel-wise aggregation\nalgorithm that can integrate state-of-the-art methods, resulting in even better\nresults. Extensive experiments on four challenging datasets demonstrate that\nthe proposed algorithm outperforms state-of-the-art conventional methods and is\ncompetitive with deep learning based approaches.","url_abs":"http://arxiv.org/abs/1705.09425v1","url_pdf":"http://arxiv.org/pdf/1705.09425v1.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":"hierarchical-cellular-automata-for-visual","repo_url":"https://github.com/ArcherFMY/HCA_saliency_codes","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"saliency-detection","task_name":"Saliency Detection"}],"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":"ArcherFMY/HCA_saliency_codes","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":"44b7ca0516ba78812b556f999d7d0a5fbfe92d34a27a9b28c8e346785be5f88a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}