{"url":"/dataset/pf-pascal","name":"PF-PASCAL","full_name":null,"description_markdown":"","description_withheld":null,"homepage":"https://www.di.ens.fr/willow/research/proposalflow/","introduced_date":"2017-03-21","introduced_date_note":null,"introduced_by":{"paper":"/paper/proposal-flow-semantic-correspondences-from","title":"Proposal Flow: Semantic Correspondences from Object Proposals","first_author":"Bumsub Ham","url":null},"license":null,"modalities":[],"tasks":[{"name":"Semantic correspondence","url":"/task/semantic-correspondence","datasets_with_task":"/datasets/task/semantic-correspondence"}],"languages":[],"variants":["PF-PASCAL"],"data_loaders":[{"repo":"https://github.com/rusty1s/pytorch_geometric","url":"https://pytorch-geometric.readthedocs.io/en/latest/modules/datasets.html","frameworks":["pytorch"]}],"num_papers_in_archive":60,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/semantic-correspondence-on-pf-pascal","task":"Semantic correspondence","dataset_variant":"PF-PASCAL","rows":15,"metrics":["PCK","PCK (weak)"],"first_row_in_archive_order":{"model":"DINOv2","paper":"/paper/semantic-correspondence-unified-benchmarking","metrics":{"PCK":"95.8"},"code_links":[{"title":"Visual-AI/Semantic-Correspondence","url":"https://github.com/Visual-AI/Semantic-Correspondence"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers_with_a_benchmark_row":[{"paper":"/paper/semantic-correspondence-unified-benchmarking","title":"Semantic Correspondence: Unified Benchmarking and a Strong Baseline","date":"2025-05-23","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/telling-left-from-right-identifying-geometry","title":"Telling Left from Right: Identifying Geometry-Aware Semantic Correspondence","date":"2023-11-28","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":15,"samples_ran":11,"samples_unverified":4,"pointer_only_for_licence":15,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/a-tale-of-two-features-stable-diffusion","title":"A Tale of Two Features: Stable Diffusion Complements DINO for Zero-Shot Semantic Correspondence","date":"2023-05-24","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/cost-aggregation-with-4d-convolutional-swin","title":"Cost Aggregation with 4D Convolutional Swin Transformer for Few-Shot Segmentation","date":"2022-07-22","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":20,"samples_ran":11,"samples_unverified":9,"pointer_only_for_licence":2,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/cats-boosting-cost-aggregation-with","title":"CATs++: Boosting Cost Aggregation with Convolutions and Transformers","date":"2022-02-14","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/cost-aggregation-is-all-you-need-for-few-shot","title":"Cost Aggregation Is All You Need for Few-Shot Segmentation","date":"2021-12-22","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/semantic-correspondence-with-transformers","title":"CATs: Cost Aggregation Transformers for Visual Correspondence","date":"2021-06-04","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/convolutional-hough-matching-networks","title":"Convolutional Hough Matching Networks","date":"2021-03-31","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/learning-to-compose-hypercolumns-for-visual","title":"Learning to Compose Hypercolumns for Visual Correspondence","date":"2020-07-21","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":5,"samples_ran":0,"samples_unverified":5,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/semantic-correspondence-as-an-optimal","title":"Semantic Correspondence as an Optimal Transport Problem","date":"2020-06-01","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/correspondence-networks-with-adaptive","title":"Correspondence Networks with Adaptive Neighbourhood Consensus","date":"2020-03-26","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":11,"samples_ran":2,"samples_unverified":9,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/hyperpixel-flow-semantic-correspondence-with","title":"Hyperpixel Flow: Semantic Correspondence with Multi-layer Neural Features","date":"2019-08-18","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":14,"samples_ran":0,"samples_unverified":14,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/neighbourhood-consensus-networks","title":"Neighbourhood Consensus Networks","date":"2018-10-24","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":21,"samples_ran":5,"samples_unverified":16,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}}],"syntology_totals":{"read_at":"2026-09-24T18:15:14+00:00","papers_with_samples":6,"samples_harvested":86,"samples_ran":29,"samples_unverified":57,"pointer_only_for_licence":17,"papers_with_no_sample_that_ran":2,"note":"the per-paper counts above, summed; not a rate"},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks."}