{"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/efficient-statistical-classification-of","title":"Efficient statistical classification of satellite measurements","arxiv_id":"1202.2194","date":"2012-02-10","proceeding":null,"authors":["Peter Mills"],"abstract":"Supervised statistical classification is a vital tool for satellite image\nprocessing. It is useful not only when a discrete result, such as feature\nextraction or surface type, is required, but also for continuum retrievals by\ndividing the quantity of interest into discrete ranges. Because of the high\nresolution of modern satellite instruments and because of the requirement for\nreal-time processing, any algorithm has to be fast to be useful. Here we\ndescribe an algorithm based on kernel estimation called Adaptive Gaussian\nFiltering that incorporates several innovations to produce superior efficiency\nas compared to three other popular methods: k-nearest-neighbour (KNN), Learning\nVector Quantization (LVQ) and Support Vector Machines (SVM). This efficiency is\ngained with no compromises: accuracy is maintained, while estimates of the\nconditional probabilities are returned. These are useful not only to gauge the\naccuracy of an estimate in the absence of its true value, but also to\nre-calibrate a retrieved image and as a proxy for a discretized continuum\nvariable. The algorithm is demonstrated and compared with the other three on a\npair of synthetic test classes and to map the waterways of the Netherlands.\nSoftware may be found at: http://libagf.sourceforge.net.","url_abs":"http://arxiv.org/abs/1202.2194v4","url_pdf":"http://arxiv.org/pdf/1202.2194v4.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":"efficient-statistical-classification-of","repo_url":"https://github.com/tommyod/KDEpy","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"BSD-3-Clause"}}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"quantization","task_name":"Quantization"}],"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":"tommyod/KDEpy","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1206.5278"],"harvested_for_calls":[{"arxiv_id":"1206.5278","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1206.5278"},"call":"get_harvested_code_for_paper(arxiv_id=\"1206.5278\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"82de0d94f21e4767c15a471e77c964922a312134b09039d999f77bc6b4d2fdfd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}