{"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/unsupervised-total-variation-loss-for-semi","title":"Unsupervised Total Variation Loss for Semi-supervised Deep Learning of Semantic Segmentation","arxiv_id":"1605.01368","date":"2016-05-04","proceeding":null,"authors":["Mehran Javanmardi","Mehdi Sajjadi","Ting Liu","Tolga Tasdizen"],"abstract":"We introduce a novel unsupervised loss function for learning semantic\nsegmentation with deep convolutional neural nets (ConvNet) when densely labeled\ntraining images are not available. More specifically, the proposed loss\nfunction penalizes the L1-norm of the gradient of the label probability vector\nimage , i.e. total variation, produced by the ConvNet. This can be seen as a\nregularization term that promotes piecewise smoothness of the label probability\nvector image produced by the ConvNet during learning. The unsupervised loss\nfunction is combined with a supervised loss in a semi-supervised setting to\nlearn ConvNets that can achieve high semantic segmentation accuracy even when\nonly a tiny percentage of the pixels in the training images are labeled. We\ndemonstrate significant improvements over the purely supervised setting in the\nWeizmann horse, Stanford background and Sift Flow datasets. Furthermore, we\nshow that using the proposed piecewise smoothness constraint in the learning\nphase significantly outperforms post-processing results from a purely\nsupervised approach with Markov Random Fields (MRF). Finally, we note that the\nframework we introduce is general and can be used to learn to label other types\nof structures such as curvilinear structures by modifying the unsupervised loss\nfunction accordingly.","url_abs":"http://arxiv.org/abs/1605.01368v3","url_pdf":"http://arxiv.org/pdf/1605.01368v3.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":"unsupervised-total-variation-loss-for-semi","repo_url":"https://github.com/HiLab-git/WSL4MIS","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"unsupervised-total-variation-loss-for-semi","repo_url":"https://github.com/luoxd1996/wsl4mis","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"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":"HiLab-git/WSL4MIS","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2203.02106"],"harvested_for_calls":[{"arxiv_id":"2203.02106","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.02106"},"call":"get_harvested_code_for_paper(arxiv_id=\"2203.02106\")"}]},{"repo":"luoxd1996/wsl4mis","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2111.02403"],"harvested_for_calls":[{"arxiv_id":"2111.02403","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2111.02403"},"call":"get_harvested_code_for_paper(arxiv_id=\"2111.02403\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"83338e65febbdabe2510112899f23b05aa2b3d4ca91c507ffa3260a8bc305ac9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}