{"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/sparse-feature-fidelity-for-perceptual-image","title":"Sparse Feature Fidelity for Perceptual Image Quality Assessment","arxiv_id":null,"date":"2013-10-01","proceeding":"IEEE Transactions on Image Processing 2013 10","authors":["Hua-Wen Chang","Hua Yang","Yong Gan","Ming-Hui Wang"],"abstract":"The prediction of an image quality metric (IQM) should be consistent with subjective human evaluation. As the human visual system (HVS) is critical to visual perception, modeling of the HVS is regarded as the most suitable way to achieve perceptual quality predictions. Sparse coding that is equivalent to independent component analysis (ICA) can provide a very good description of the receptive fields of simple cells in the primary visual cortex, which is the most important part of the HVS. With this inspiration, a quality metric called sparse feature fidelity (SFF) is proposed for full-reference image quality assessment (IQA) on the basis of transformation of images into sparse representations in the primary visual cortex. The proposed method is based on the sparse features that are acquired by a feature detector, which is trained on samples of natural images by an ICA algorithm. In addition, two strategies are designed to simulate the properties of the visual perception: 1) visual attention and 2) visual threshold. The computation of SFF has two stages: training and fidelity computation, in addition, the fidelity computation consists of two components: feature similarity and luminance correlation. The feature similarity measures the structure differences between the two images, whereas the luminance correlation evaluates brightness distortions. SFF also reflects the chromatic properties of the HVS, and it is very effective for color IQA. The experimental results on five image databases show that SFF has a better performance in matching subjective ratings compared with the leading IQMs.","url_abs":"https://ieeexplore.ieee.org/document/6525380/authors#authors","url_pdf":"https://ieeexplore.ieee.org/document/6525380/authors#authors","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":[],"tasks":[{"task_slug":"full-reference-image-quality-assessment","task_name":"Full reference image quality assessment"},{"task_slug":"full-reference-image-quality-assessment-2","task_name":"Full-Reference Image Quality Assessment"},{"task_slug":"image-quality-assessment","task_name":"Image Quality Assessment"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/full-reference-image-quality-assessment-on-4","task":"Full reference image quality assessment","dataset":"DRIQ","model":"SFF","rank_in_archive_order":2,"of":10,"metrics":{"PLCC":"0.8420","SRCC":"0.8342"},"uses_additional_data":false},{"leaderboard":"/sota/full-reference-image-quality-assessment-on-3","task":"Full reference image quality assessment","dataset":"ESPL","model":"SFF","rank_in_archive_order":9,"of":11,"metrics":{"PLCC":"0.8179","SRCC":"0.8127"},"uses_additional_data":false},{"leaderboard":"/sota/full-reference-image-quality-assessment-on","task":"Full reference image quality assessment","dataset":"TID2008","model":"SFF","rank_in_archive_order":8,"of":13,"metrics":{"PLCC":"0.8717","SRCC":"0.8767"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"af131e292375a655d3dfa67d67b6b190fb0e4322d2524f0bcf04653153d6229f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}