{"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/f-anogan-fast-unsupervised-anomaly-detection","title":"f-AnoGAN: Fast Unsupervised Anomaly Detection with Generative Adversarial Networks","arxiv_id":null,"date":"2019-01-30","proceeding":"Medical Image Analysis 2019 1","authors":["Thomas Schlegl，PhilippSeeböck，Sebastian M.Waldstein，GeorgLangs，UrsulaSchmidt-Erfurth"],"abstract":"Obtaining expert labels in clinical imaging is difficult since exhaustive annotation is time-consuming. Furthermore, not all possibly relevant markers may be known and sufficiently well described a priori to even guide annotation. While supervised learning yields good results if expert labeled training data is available, the visual variability, and thus the vocabulary of findings, we can detect and exploit, is limited to the annotated lesions. Here, we present fast AnoGAN (f-AnoGAN), a generative adversarial network (GAN) based unsupervised learning approach capable of identifying anomalous images and image segments, that can serve as imaging biomarker candidates. We build a generative model of healthy training data, and propose and evaluate a fast mapping technique of new data to the GAN’s latent space. The mapping is based on a trained encoder, and anomalies are detected via a combined anomaly score based on the building blocks of the trained model – comprising a discriminator feature residual error and an image reconstruction error. In the experiments on optical coherence tomography data, we compare the proposed method with alternative approaches, and provide comprehensive empirical evidence that f-AnoGAN outperforms alternative approaches and yields high anomaly detection accuracy. In addition, a visual Turing test with two retina experts showed that the generated images are indistinguishable from real normal retinal OCT images. The f-AnoGAN code is available at https://github.com/tSchlegl/f-AnoGAN.","url_abs":"https://www.sciencedirect.com/science/article/abs/pii/S1361841518302640","url_pdf":"https://github.com/tSchlegl/f-AnoGAN/blob/master/paper/f-AnoGAN.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":"f-anogan-fast-unsupervised-anomaly-detection","repo_url":"https://github.com/tSchlegl/f-AnoGAN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"f-anogan-fast-unsupervised-anomaly-detection","repo_url":"https://github.com/A03ki/f-AnoGAN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"f-anogan-fast-unsupervised-anomaly-detection","repo_url":"https://github.com/DannisZgggg/AnoGAN-WGAN-pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"anomaly-classification","task_name":"Anomaly Classification"},{"task_slug":"anomaly-detection","task_name":"Anomaly Detection"},{"task_slug":"anomaly-segmentation","task_name":"Anomaly Segmentation"},{"task_slug":null,"task_name":"Generative Adversarial Network"},{"task_slug":"image-reconstruction","task_name":"Image Reconstruction"},{"task_slug":"unsupervised-anomaly-detection","task_name":"Unsupervised Anomaly Detection"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"wgan","method_name":"WGAN"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/anomaly-classification-on-goodsad","task":"Anomaly Classification","dataset":"GoodsAD","model":"f-AnoGAN","rank_in_archive_order":9,"of":11,"metrics":{"AUPR":"66.6","AUROC":"62.8"},"uses_additional_data":false},{"leaderboard":"/sota/anomaly-detection-on-hyper-kvasir-dataset","task":"Anomaly Detection","dataset":"Hyper-Kvasir Dataset","model":"F-Anogan","rank_in_archive_order":5,"of":6,"metrics":{"AUC":"0.907"},"uses_additional_data":false},{"leaderboard":"/sota/anomaly-detection-on-lag","task":"Anomaly Detection","dataset":"LAG","model":"F-anoGAN","rank_in_archive_order":4,"of":5,"metrics":{"AUC":"0.778"},"uses_additional_data":false},{"leaderboard":"/sota/anomaly-detection-on-mvtec-loco-ad","task":"Anomaly Detection","dataset":"MVTec LOCO AD","model":"f-AnoGAN","rank_in_archive_order":36,"of":40,"metrics":{"Avg. Detection AUROC":"64.2","Detection AUROC (only logical)":"65.8","Detection AUROC (only structural)":"62.7","Segmentation AU-sPRO (until FPR 5%)":"33.4"},"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":[{"repo":"tSchlegl/f-AnoGAN","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"A03ki/f-AnoGAN","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1703.05921"],"harvested_for_calls":[{"arxiv_id":"1703.05921","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1703.05921"},"call":"get_harvested_code_for_paper(arxiv_id=\"1703.05921\")"}]},{"repo":"DannisZgggg/AnoGAN-WGAN-pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"ca01635fbdc81c4890f9e4279b0d816547754c8071132e085eb9c51446db2624","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}