{"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/iterative-projection-and-matching-finding","title":"Iterative Projection and Matching: Finding Structure-preserving Representatives and Its Application to Computer Vision","arxiv_id":"1811.12326","date":"2018-11-29","proceeding":"CVPR 2019 6","authors":["Mohsen Joneidi","Alireza Zaeemzadeh","Nazanin Rahnavard","Mubarak Shah"],"abstract":"The goal of data selection is to capture the most structural information from\na set of data. This paper presents a fast and accurate data selection method,\nin which the selected samples are optimized to span the subspace of all data.\nWe propose a new selection algorithm, referred to as iterative projection and\nmatching (IPM), with linear complexity w.r.t. the number of data, and without\nany parameter to be tuned. In our algorithm, at each iteration, the maximum\ninformation from the structure of the data is captured by one selected sample,\nand the captured information is neglected in the next iterations by projection\non the null-space of previously selected samples. The computational efficiency\nand the selection accuracy of our proposed algorithm outperform those of the\nconventional methods. Furthermore, the superiority of the proposed algorithm is\nshown on active learning for video action recognition dataset on UCF-101;\nlearning using representatives on ImageNet; training a generative adversarial\nnetwork (GAN) to generate multi-view images from a single-view input on CMU\nMulti-PIE dataset; and video summarization on UTE Egocentric dataset.","url_abs":"http://arxiv.org/abs/1811.12326v1","url_pdf":"http://arxiv.org/pdf/1811.12326v1.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":"iterative-projection-and-matching-finding","repo_url":"https://github.com/zaeemzadeh/Active-Learning-UCF101-IPM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"iterative-projection-and-matching-finding","repo_url":"https://github.com/zaeemzadeh/IPM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"action-recognition-in-videos","task_name":"Action Recognition"},{"task_slug":"active-learning","task_name":"Active Learning"},{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"},{"task_slug":"data-summarization","task_name":"Data Summarization"},{"task_slug":null,"task_name":"Generative Adversarial Network"},{"task_slug":"action-recognition","task_name":"Temporal Action Localization"},{"task_slug":"video-summarization","task_name":"Video Summarization"}],"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":"zaeemzadeh/Active-Learning-UCF101-IPM","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"zaeemzadeh/IPM","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"2ec73c791cc5b51b3dcf984e735cabb65fa6c43e9a172afb1486da9ba2529e63","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}