{"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-to-segment-object-candidates-via","title":"Learning to Segment Object Candidates via Recursive Neural Networks","arxiv_id":"1612.01057","date":"2016-12-04","proceeding":null,"authors":["Tianshui Chen","Liang Lin","Xian Wu","Nong Xiao","Xiaonan Luo"],"abstract":"To avoid the exhaustive search over locations and scales, current\nstate-of-the-art object detection systems usually involve a crucial component\ngenerating a batch of candidate object proposals from images. In this paper, we\npresent a simple yet effective approach for segmenting object proposals via a\ndeep architecture of recursive neural networks (ReNNs), which hierarchically\ngroups regions for detecting object candidates over scales. Unlike traditional\nmethods that mainly adopt fixed similarity measures for merging regions or\nfinding object proposals, our approach adaptively learns the region merging\nsimilarity and the objectness measure during the process of hierarchical region\ngrouping. Specifically, guided by a structured loss, the ReNN model jointly\noptimizes the cross-region similarity metric with the region merging process as\nwell as the objectness prediction. During inference of the object proposal\ngeneration, we introduce randomness into the greedy search to cope with the\nambiguity of grouping regions. Extensive experiments on standard benchmarks,\ne.g., PASCAL VOC and ImageNet, suggest that our approach is capable of\nproducing object proposals with high recall while well preserving the object\nboundaries and outperforms other existing methods in both accuracy and\nefficiency.","url_abs":"http://arxiv.org/abs/1612.01057v4","url_pdf":"http://arxiv.org/pdf/1612.01057v4.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":[],"tasks":[{"task_slug":"object","task_name":"Object"},{"task_slug":"object-detection","task_name":"Object Detection"},{"task_slug":"object-proposal-generation","task_name":"Object Proposal Generation"},{"task_slug":"object-detection-1","task_name":"object-detection"}],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"deepmask","method_name":"DeepMask"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"sgd-with-momentum","method_name":"SGD with Momentum"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"weight-decay","method_name":"Weight Decay"}],"datasets_introduced":[],"methods_introduced":[{"slug":"deepmask","name":"DeepMask","full_name":"DeepMask"}],"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":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"f3faa95dfeb0d4945683d00d36cbd7b634bfebf10bc5d928e8603d7120f2e628","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}