{"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/semi-orthogonal-embedding-for-efficient","title":"Semi-orthogonal Embedding for Efficient Unsupervised Anomaly Segmentation","arxiv_id":"2105.14737","date":"2021-05-31","proceeding":null,"authors":["Jin-Hwa Kim","Do-Hyeong Kim","Saehoon Yi","Taehoon Lee"],"abstract":"We present the efficiency of semi-orthogonal embedding for unsupervised anomaly segmentation. The multi-scale features from pre-trained CNNs are recently used for the localized Mahalanobis distances with significant performance. However, the increased feature size is problematic to scale up to the bigger CNNs, since it requires the batch-inverse of multi-dimensional covariance tensor. Here, we generalize an ad-hoc method, random feature selection, into semi-orthogonal embedding for robust approximation, cubically reducing the computational cost for the inverse of multi-dimensional covariance tensor. With the scrutiny of ablation studies, the proposed method achieves a new state-of-the-art with significant margins for the MVTec AD, KolektorSDD, KolektorSDD2, and mSTC datasets. The theoretical and empirical analyses offer insights and verification of our straightforward yet cost-effective approach.","url_abs":"https://arxiv.org/abs/2105.14737v1","url_pdf":"https://arxiv.org/pdf/2105.14737v1.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":"semi-orthogonal-embedding-for-efficient","repo_url":"https://github.com/jnhwkim/orthoad","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"semi-orthogonal-embedding-for-efficient","repo_url":"https://github.com/Pangoraw/SemiOrthogonal","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"semi-orthogonal-embedding-for-efficient","repo_url":"https://github.com/Ultranity/Anomaly.Paddle","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"paddle","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"anomaly-detection","task_name":"Anomaly Detection"},{"task_slug":"anomaly-segmentation","task_name":"Anomaly Segmentation"},{"task_slug":"unsupervised-anomaly-detection","task_name":"Unsupervised Anomaly Detection"},{"task_slug":"feature-selection","task_name":"feature selection"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/anomaly-detection-on-mvtec-ad","task":"Anomaly Detection","dataset":"MVTec AD","model":"Semi-orthogonal","rank_in_archive_order":135,"of":148,"metrics":{"Segmentation AUROC":"98.2"},"uses_additional_data":false},{"leaderboard":"/sota/unsupervised-anomaly-detection-on-kolektorsdd","task":"Unsupervised Anomaly Detection","dataset":"KolektorSDD","model":"Semi-orthogonal","rank_in_archive_order":1,"of":1,"metrics":{"Segmentation AUROC":"96.0"},"uses_additional_data":true},{"leaderboard":"/sota/unsupervised-anomaly-detection-on","task":"Unsupervised Anomaly Detection","dataset":"KolektorSDD2","model":"Semi-orthogonal","rank_in_archive_order":3,"of":3,"metrics":{"Segmentation AUROC":"98.1"},"uses_additional_data":true}],"syntology":{"syntology_url":"https://syntology.ai/paper/2105.14737","atlas_url":"https://app.syntology.ai/?focus=2105.14737","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2105.14737"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2105.14737\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2105.14737"},"call":"get_concepts_for_paper(arxiv_id=\"2105.14737\")"}],"by_repo":[{"repo":"jnhwkim/orthoad","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Pangoraw/SemiOrthogonal","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Ultranity/Anomaly.Paddle","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2106.08265"],"harvested_for_calls":[{"arxiv_id":"2106.08265","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.08265"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.08265\")"}]}],"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":"3b6e953f146ff30a2e3e0035304b19c7beff3fccb66e50184ea6cd69ce3c6058","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}