{"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/learning-a-low-rank-shared-dictionary-for","title":"Learning a low-rank shared dictionary for object classification","arxiv_id":"1602.00310","date":"2016-01-31","proceeding":null,"authors":["Tiep H. Vu","Vishal Monga"],"abstract":"Despite the fact that different objects possess distinct class-specific\nfeatures, they also usually share common patterns. Inspired by this\nobservation, we propose a novel method to explicitly and simultaneously learn a\nset of common patterns as well as class-specific features for classification.\nOur dictionary learning framework is hence characterized by both a shared\ndictionary and particular (class-specific) dictionaries. For the shared\ndictionary, we enforce a low-rank constraint, i.e. claim that its spanning\nsubspace should have low dimension and the coefficients corresponding to this\ndictionary should be similar. For the particular dictionaries, we impose on\nthem the well-known constraints stated in the Fisher discrimination dictionary\nlearning (FDDL). Further, we propose a new fast and accurate algorithm to solve\nthe sparse coding problems in the learning step, accelerating its convergence.\nThe said algorithm could also be applied to FDDL and its extensions.\nExperimental results on widely used image databases establish the advantages of\nour method over state-of-the-art dictionary learning methods.","url_abs":"http://arxiv.org/abs/1602.00310v2","url_pdf":"http://arxiv.org/pdf/1602.00310v2.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":"learning-a-low-rank-shared-dictionary-for","repo_url":"https://github.com/tiepvupsu/DICTOL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"learning-a-low-rank-shared-dictionary-for","repo_url":"https://github.com/tiepvupsu/DICTOL_python","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"dictionary-learning","task_name":"Dictionary Learning"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"object","task_name":"Object"}],"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":"tiepvupsu/DICTOL","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tiepvupsu/DICTOL_python","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":"078d94d626e206ed30fcc19f70509b21547cf92458d490a47bdc5336ee3a7eb9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}