{"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/deep-clustering-via-joint-convolutional","title":"Deep Clustering via Joint Convolutional Autoencoder Embedding and Relative Entropy Minimization","arxiv_id":"1704.06327","date":"2017-04-20","proceeding":"ICCV 2017 10","authors":["Kamran Ghasedi Dizaji","Amirhossein Herandi","Cheng Deng","Weidong Cai","Heng Huang"],"abstract":"Image clustering is one of the most important computer vision applications,\nwhich has been extensively studied in literature. However, current clustering\nmethods mostly suffer from lack of efficiency and scalability when dealing with\nlarge-scale and high-dimensional data. In this paper, we propose a new\nclustering model, called DEeP Embedded RegularIzed ClusTering (DEPICT), which\nefficiently maps data into a discriminative embedding subspace and precisely\npredicts cluster assignments. DEPICT generally consists of a multinomial\nlogistic regression function stacked on top of a multi-layer convolutional\nautoencoder. We define a clustering objective function using relative entropy\n(KL divergence) minimization, regularized by a prior for the frequency of\ncluster assignments. An alternating strategy is then derived to optimize the\nobjective by updating parameters and estimating cluster assignments.\nFurthermore, we employ the reconstruction loss functions in our autoencoder, as\na data-dependent regularization term, to prevent the deep embedding function\nfrom overfitting. In order to benefit from end-to-end optimization and\neliminate the necessity for layer-wise pretraining, we introduce a joint\nlearning framework to minimize the unified clustering and reconstruction loss\nfunctions together and train all network layers simultaneously. Experimental\nresults indicate the superiority and faster running time of DEPICT in\nreal-world clustering tasks, where no labeled data is available for\nhyper-parameter tuning.","url_abs":"http://arxiv.org/abs/1704.06327v3","url_pdf":"http://arxiv.org/pdf/1704.06327v3.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":"deep-clustering-via-joint-convolutional","repo_url":"https://github.com/herandy/DEPICT","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"deep-clustering","task_name":"Deep Clustering"},{"task_slug":"image-clustering","task_name":"Image Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-clustering-on-cmu-pie","task":"Image Clustering","dataset":"CMU-PIE","model":"DEPICT","rank_in_archive_order":2,"of":4,"metrics":{"Accuracy":"0.850","NMI":"0.964"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-cub-birds","task":"Image Clustering","dataset":"CUB Birds","model":"DEPICT-Large","rank_in_archive_order":2,"of":4,"metrics":{"Accuracy":"0.061","NMI":"0.297"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-cub-birds","task":"Image Clustering","dataset":"CUB Birds","model":"DEPICT","rank_in_archive_order":3,"of":4,"metrics":{"Accuracy":"0.061","NMI":"0.290"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-frgc","task":"Image Clustering","dataset":"FRGC","model":"DEPICT","rank_in_archive_order":1,"of":3,"metrics":{"Accuracy":"0.432","NMI":"0.583"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-stanford-cars","task":"Image Clustering","dataset":"Stanford Cars","model":"DEPICT","rank_in_archive_order":3,"of":5,"metrics":{"Accuracy":"0.063","NMI":"0.329"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-stanford-cars","task":"Image Clustering","dataset":"Stanford Cars","model":"DEPICT-Large","rank_in_archive_order":4,"of":5,"metrics":{"Accuracy":"0.062","NMI":"0.330"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-stanford-dogs","task":"Image Clustering","dataset":"Stanford Dogs","model":"DEPICT-Large","rank_in_archive_order":2,"of":4,"metrics":{"Accuracy":"0.054","NMI":"0.183"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-stanford-dogs","task":"Image Clustering","dataset":"Stanford Dogs","model":"DEPICT","rank_in_archive_order":3,"of":4,"metrics":{"Accuracy":"0.052","NMI":"0.182"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-youtube-faces-db","task":"Image Clustering","dataset":"YouTube Faces DB","model":"DEPICT","rank_in_archive_order":3,"of":4,"metrics":{"Accuracy":"0.611","NMI":"0.802"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1704.06327","atlas_url":"https://app.syntology.ai/?focus=1704.06327","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":"1704.06327"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1704.06327\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1704.06327"},"call":"get_concepts_for_paper(arxiv_id=\"1704.06327\")"}],"by_repo":[{"repo":"herandy/DEPICT","kind":"official","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":"219fbae5da072c28622015437c864f7b7a7521e88fb36568105fc9a98d4fbc8c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}