{"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/3d-segmentation-with-exponential-logarithmic","title":"3D Segmentation with Exponential Logarithmic Loss for Highly Unbalanced Object Sizes","arxiv_id":"1809.00076","date":"2018-08-31","proceeding":null,"authors":["Ken C. L. Wong","Mehdi Moradi","Hui Tang","Tanveer Syeda-Mahmood"],"abstract":"With the introduction of fully convolutional neural networks, deep learning\nhas raised the benchmark for medical image segmentation on both speed and\naccuracy, and different networks have been proposed for 2D and 3D segmentation\nwith promising results. Nevertheless, most networks only handle relatively\nsmall numbers of labels (<10), and there are very limited works on handling\nhighly unbalanced object sizes especially in 3D segmentation. In this paper, we\npropose a network architecture and the corresponding loss function which\nimprove segmentation of very small structures. By combining skip connections\nand deep supervision with respect to the computational feasibility of 3D\nsegmentation, we propose a fast converging and computationally efficient\nnetwork architecture for accurate segmentation. Furthermore, inspired by the\nconcept of focal loss, we propose an exponential logarithmic loss which\nbalances the labels not only by their relative sizes but also by their\nsegmentation difficulties. We achieve an average Dice coefficient of 82% on\nbrain segmentation with 20 labels, with the ratio of the smallest to largest\nobject sizes as 0.14%. Less than 100 epochs are required to reach such\naccuracy, and segmenting a 128x128x128 volume only takes around 0.4 s.","url_abs":"http://arxiv.org/abs/1809.00076v2","url_pdf":"http://arxiv.org/pdf/1809.00076v2.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":"3d-segmentation-with-exponential-logarithmic","repo_url":"https://github.com/ibm/multimodal-3d-image-segmentation","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"brain-segmentation","task_name":"Brain Segmentation"},{"task_slug":"image-segmentation","task_name":"Image Segmentation"},{"task_slug":"medical-image-segmentation","task_name":"Medical Image Segmentation"},{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1809.00076","atlas_url":"https://app.syntology.ai/?focus=1809.00076","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":"1809.00076"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1809.00076\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1809.00076"},"call":"get_concepts_for_paper(arxiv_id=\"1809.00076\")"}],"by_repo":[{"repo":"ibm/multimodal-3d-image-segmentation","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2201.03644"],"harvested_for_calls":[{"arxiv_id":"2201.03644","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2201.03644"},"call":"get_harvested_code_for_paper(arxiv_id=\"2201.03644\")"}]}],"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":"d8b8136b5bfcbd6308a888e54068c0a170b401f4ead4f5200f95ebbad6bdba58","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}