{"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/181201429","title":"Automatic salt deposits segmentation: A deep learning approach","arxiv_id":"1812.01429","date":"2018-11-21","proceeding":null,"authors":["Mikhail Karchevskiy","Insaf Ashrapov","Leonid Kozinkin"],"abstract":"One of the most important applications of seismic reflection is the\nhydrocarbon exploration which is closely related to salt deposits analysis.\nThis problem is very important even nowadays due to it's non-linear nature.\nTaking into account the recent developments in deep learning networks TGS-NOPEC\nGeophysical Company hosted the Kaggle competition for salt deposits\nsegmentation problem in seismic image data. In this paper, we demonstrate the\ngreat performance of several novel deep learning techniques merged into a\nsingle neural network which achieved the 27th place (top 1%) in the mentioned\ncompetition. Using a U-Net with ResNeXt-50 encoder pre-trained on ImageNet as\nour base architecture, we implemented Spatial-Channel Squeeze & Excitation,\nLovasz loss, CoordConv and Hypercolumn methods. The source code for our\nsolution is made publicly available at\nhttps://github.com/K-Mike/Automatic-salt-deposits-segmentation.","url_abs":"http://arxiv.org/abs/1812.01429v1","url_pdf":"http://arxiv.org/pdf/1812.01429v1.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":"181201429","repo_url":"https://github.com/K-Mike/Automatic-salt-deposits-segmentation","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"181201429","repo_url":"https://github.com/woans0104/sk_project","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"deep-learning","task_name":"Deep Learning"},{"task_slug":"segmentation","task_name":"Segmentation"}],"methods":[{"method_slug":"concatenated-skip-connection","method_name":"Concatenated Skip Connection"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"coordconv","method_name":"CoordConv"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"u-net","method_name":"U-Net"}],"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":"K-Mike/Automatic-salt-deposits-segmentation","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1505.04597"],"harvested_for_calls":[{"arxiv_id":"1505.04597","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1505.04597"},"call":"get_harvested_code_for_paper(arxiv_id=\"1505.04597\")"}]},{"repo":"woans0104/sk_project","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"a188167159f01906f2054002e1824f12988c840aeaf96674de8315d2846f354f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}