{"url":"/sota/image-classification-on-places205","task":{"name":"Image Classification","url":"/task/image-classification","note":null},"dataset":{"name":"Places205","url":"/dataset/places205"},"category":"Computer Vision","categories":["Adversarial","Computer Vision"],"category_note":null,"description":"**Image Classification** is a fundamental task in vision recognition that aims to understand and categorize an image as a whole under a specific label. Unlike [object detection](/task/object-detection), which involves classification and location of multiple objects within an image, image classification typically pertains to single-object images. When the classification becomes highly detailed or reaches instance-level, it is often referred to as [image retrieval](/task/image-retrieval), which also involves finding similar images in a large database.\r\n\r\n\r\n<span class=\"description-source\">Source: [Metamorphic Testing for Object Detection Systems ](https://arxiv.org/abs/1912.12162)</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Top 1 Accuracy"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Top 1 Accuracy":"higher"}},"counts":{"rows":15,"rows_with_code":15,"rows_with_paper_page":15,"rows_dated":15,"rows_using_additional_data":1},"rows":[{"rank_in_archive_order":1,"model":"InternImage-H","metrics":{"Top 1 Accuracy":"71.7%"},"uses_additional_data":false,"paper_date":"2022-11-10","paper":"/paper/internimage-exploring-large-scale-vision","paper_url":"https://arxiv.org/abs/2211.05778v4","paper_title":"InternImage: Exploring Large-Scale Vision Foundation Models with Deformable Convolutions","code":"https://github.com/opengvlab/internimage","n_code_links":3,"syntology":{"n_ran":2,"n_unverified":2,"n_samples":4,"n_pointer_only_licence":0}},{"rank_in_archive_order":2,"model":"MixMIM-L","metrics":{"Top 1 Accuracy":"69.3"},"uses_additional_data":false,"paper_date":"2022-05-26","paper":"/paper/mixmim-mixed-and-masked-image-modeling-for","paper_url":"https://arxiv.org/abs/2205.13137v4","paper_title":"MixMAE: Mixed and Masked Autoencoder for Efficient Pretraining of Hierarchical Vision Transformers","code":"https://github.com/sense-x/mixmim","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"SEER (RegNet10B - finetuned - 384px)","metrics":{"Top 1 Accuracy":"69.0"},"uses_additional_data":true,"paper_date":"2022-02-16","paper":"/paper/vision-models-are-more-robust-and-fair-when","paper_url":"https://arxiv.org/abs/2202.08360v2","paper_title":"Vision Models Are More Robust And Fair When Pretrained On Uncurated Images Without Supervision","code":"https://github.com/facebookresearch/vissl","n_code_links":1,"syntology":null},{"rank_in_archive_order":4,"model":"MixMIM-B","metrics":{"Top 1 Accuracy":"68.3"},"uses_additional_data":false,"paper_date":"2022-05-26","paper":"/paper/mixmim-mixed-and-masked-image-modeling-for","paper_url":"https://arxiv.org/abs/2205.13137v4","paper_title":"MixMAE: Mixed and Masked Autoencoder for Efficient Pretraining of Hierarchical Vision Transformers","code":"https://github.com/sense-x/mixmim","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"MAE (ViT-H, 448)","metrics":{"Top 1 Accuracy":"66.8"},"uses_additional_data":false,"paper_date":"2021-11-11","paper":"/paper/masked-autoencoders-are-scalable-vision","paper_url":"https://arxiv.org/abs/2111.06377v2","paper_title":"Masked Autoencoders Are Scalable Vision Learners","code":"https://github.com/facebookresearch/mae","n_code_links":58,"syntology":{"n_ran":71,"n_unverified":66,"n_samples":137,"n_pointer_only_licence":73}},{"rank_in_archive_order":6,"model":"SEER","metrics":{"Top 1 Accuracy":"66.0"},"uses_additional_data":false,"paper_date":"2021-03-02","paper":"/paper/self-supervised-pretraining-of-visual","paper_url":"https://arxiv.org/abs/2103.01988v2","paper_title":"Self-supervised Pretraining of Visual Features in the Wild","code":"https://github.com/facebookresearch/vissl","n_code_links":1,"syntology":null},{"rank_in_archive_order":7,"model":"SAMix (ResNet-50 Supervised)","metrics":{"Top 1 Accuracy":"64.3"},"uses_additional_data":false,"paper_date":"2021-11-30","paper":"/paper/boosting-discriminative-visual-representation","paper_url":"https://arxiv.org/abs/2111.15454v3","paper_title":"Boosting Discriminative Visual Representation Learning with Scenario-Agnostic Mixup","code":"https://github.com/Westlake-AI/openmixup","n_code_links":1,"syntology":null},{"rank_in_archive_order":8,"model":"AutoMix (ResNet-50 Supervised)","metrics":{"Top 1 Accuracy":"64.1"},"uses_additional_data":false,"paper_date":"2021-03-24","paper":"/paper/automix-unveiling-the-power-of-mixup","paper_url":"https://arxiv.org/abs/2103.13027v6","paper_title":"AutoMix: Unveiling the Power of Mixup for Stronger Classifiers","code":"https://github.com/Westlake-AI/openmixup","n_code_links":3,"syntology":{"n_ran":4,"n_unverified":2,"n_samples":6,"n_pointer_only_licence":0}},{"rank_in_archive_order":9,"model":"RegNetY-128GF (Supervised)","metrics":{"Top 1 Accuracy":"62.7"},"uses_additional_data":false,"paper_date":"2021-03-02","paper":"/paper/self-supervised-pretraining-of-visual","paper_url":"https://arxiv.org/abs/2103.01988v2","paper_title":"Self-supervised Pretraining of Visual Features in the Wild","code":"https://github.com/facebookresearch/vissl","n_code_links":1,"syntology":null},{"rank_in_archive_order":10,"model":"SwAV","metrics":{"Top 1 Accuracy":"56.7%"},"uses_additional_data":false,"paper_date":"2020-06-17","paper":"/paper/unsupervised-learning-of-visual-features-by","paper_url":"https://arxiv.org/abs/2006.09882v5","paper_title":"Unsupervised Learning of Visual Features by Contrasting Cluster Assignments","code":"https://github.com/open-mmlab/mmdetection","n_code_links":18,"syntology":{"n_ran":13,"n_unverified":4,"n_samples":17,"n_pointer_only_licence":6}},{"rank_in_archive_order":11,"model":"Barlow Twins (ResNet-50)","metrics":{"Top 1 Accuracy":"54.1%"},"uses_additional_data":false,"paper_date":"2021-03-04","paper":"/paper/barlow-twins-self-supervised-learning-via","paper_url":"https://arxiv.org/abs/2103.03230v3","paper_title":"Barlow Twins: Self-Supervised Learning via Redundancy Reduction","code":"https://github.com/lightly-ai/lightly","n_code_links":24,"syntology":{"n_ran":21,"n_unverified":5,"n_samples":26,"n_pointer_only_licence":10}},{"rank_in_archive_order":12,"model":"BYOL","metrics":{"Top 1 Accuracy":"54.0"},"uses_additional_data":false,"paper_date":"2020-06-13","paper":"/paper/bootstrap-your-own-latent-a-new-approach-to","paper_url":"https://arxiv.org/abs/2006.07733v3","paper_title":"Bootstrap your own latent: A new approach to self-supervised Learning","code":"https://github.com/deepmind/deepmind-research/tree/master/byol","n_code_links":31,"syntology":{"n_ran":62,"n_unverified":17,"n_samples":79,"n_pointer_only_licence":46}},{"rank_in_archive_order":13,"model":"SimCLR","metrics":{"Top 1 Accuracy":"53.3"},"uses_additional_data":false,"paper_date":"2020-02-13","paper":"/paper/a-simple-framework-for-contrastive-learning","paper_url":"https://arxiv.org/abs/2002.05709v3","paper_title":"A Simple Framework for Contrastive Learning of Visual Representations","code":"https://github.com/tensorflow/models/tree/master/official/vision/beta/projects/simclr","n_code_links":96,"syntology":{"n_ran":79,"n_unverified":58,"n_samples":137,"n_pointer_only_licence":52}},{"rank_in_archive_order":14,"model":"ResNet-50 (Supervised)","metrics":{"Top 1 Accuracy":"53.2%"},"uses_additional_data":false,"paper_date":"2020-06-17","paper":"/paper/unsupervised-learning-of-visual-features-by","paper_url":"https://arxiv.org/abs/2006.09882v5","paper_title":"Unsupervised Learning of Visual Features by Contrasting Cluster Assignments","code":"https://github.com/open-mmlab/mmdetection","n_code_links":18,"syntology":{"n_ran":13,"n_unverified":4,"n_samples":17,"n_pointer_only_licence":6}},{"rank_in_archive_order":15,"model":"MoCo v2","metrics":{"Top 1 Accuracy":"52.9"},"uses_additional_data":false,"paper_date":"2020-03-09","paper":"/paper/improved-baselines-with-momentum-contrastive","paper_url":"https://arxiv.org/abs/2003.04297v1","paper_title":"Improved Baselines with Momentum Contrastive Learning","code":"https://github.com/open-mmlab/mmdetection","n_code_links":36,"syntology":{"n_ran":8,"n_unverified":35,"n_samples":43,"n_pointer_only_licence":10}}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":9,"rows_with_any_sample_ran":9,"distinct_papers_with_graph_line":8,"distinct_papers_with_any_sample_ran":8,"samples_over_distinct_papers":{"n_ran":260,"n_unverified":189,"n_samples":449,"n_pointer_only_licence":197,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":273,"n_unverified":193,"n_samples":466,"n_pointer_only_licence":203,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}