Papers › SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentation
SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentation
Vijay Badrinarayanan, Alex Kendall, Roberto Cipolla
We present a novel and practical deep fully convolutional neural network architecture for semantic pixel-wise segmentation termed SegNet. This core trainable segmentation engine consists of an encoder network, a corresponding decoder network followed by a pixel-wise classification layer. The architecture of the encoder network is topologically identical to the 13 convolutional layers in the VGG16 network. The role of the decoder network is to map the low resolution encoder feature maps to full input resolution feature maps for pixel-wise classification. The novelty of SegNet lies is in the manner in which the decoder upsamples its lower resolution input feature map(s). Specifically, the decoder uses pooling indices computed in the max-pooling step of the corresponding encoder to perform non-linear upsampling. This eliminates the need for learning to upsample. The upsampled maps are sparse and are then convolved with trainable filters to produce dense feature maps. We compare our proposed architecture with the widely adopted FCN and also with the well known DeepLab-LargeFOV, DeconvNet architectures. This comparison reveals the memory versus accuracy trade-off involved in achieving good segmentation performance. SegNet was primarily motivated by scene understanding applications. Hence, it is designed to be efficient both in terms of memory and computational time during inference. It is also significantly smaller in the number of trainable parameters than other competing architectures. We also performed a controlled benchmark of SegNet and other architectures on both road scenes and SUN RGB-D indoor scene segmentation tasks. We show that SegNet provides good performance with competitive inference time and more efficient inference memory-wise as compared to other architectures. We also provide a Caffe implementation of SegNet and a web demo at http://mi.eng.cam.ac.uk/projects/segnet/.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1511.00561")
Code
Syntology Ran 9 of 44 code samples harvested from 12 repositories linked to this paper; 35 have no recorded run. Of those that ran: 1 ran · honoured contract; 4 ran · our draft was wrong; 4 ran · fixture could not drive it.
By repository: community (archive-listed): 43 samples from 12 repositories, 9 ran; 1 identical to code first harvested elsewhere. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
74 repositories listed; official and paper-mentioned ones first.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
44 samples harvested; 9 ran; 1 honoured the contract we drafted; 35 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.
Licence: 10 of the 44 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from 12 repositories linked to this paper, official or community; each sample names its own and says which. Some samples are identical code Syntology first harvested from another repository; for those, this paper's copy is not located and its licence is not recorded. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.
Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
7325c49fd8c6a7d2 · report
4ec8631991fae595 · report
eace8acc6bfee2e6 · report
80de7e105070c5b7 · report
9d053840bc397be9 · report
d86fb168246b16a4 · report
7581c2186e8870c9 · report
eecd13ae0661bcaf · report
35e373ea432491af · report
807f23923a6eb4e1 · report
6a7975f53763eeef · report
a1d04ea51bb872f2 · report
03463ecdf9e70d76 · report
7fc806a2509f7a7e · report
624eb0ac1badcf7f · report
5d696e2d1f2c2b9e · report
cab93d9ad6b469a3 · report
5ff542951a6359ce · report
92f5e49a373e08f0 · report
95079d767c0c7214 · report
ddd1131b789bbfb0 · report
2e0587128b7f5e9a · report
bec448f4c2f902ba · report
f36542af7f46dc5a · report
d2d560d2c8feddab · report
be1229f36bea96c7 · report
86c04511b1dbfb39 · report
bb462d56c80b083e · report
0d25fc166440440b · report
600dd344d089e843 · report
cb04888030b50b8c · report
550a9e8414c59ec3 · report
2210664c358e7dcc · report
ca2f73eb2c5eeed4 · report
788ec85b5552dcd3 · report
cde96b08dba3ed5b · report
68499977d8a4a9a0 · report
30b17a657dbf8347 · report
784e6075b2fd2666 · report
e10f25445d9bac8f · report
1aed685456751cb8 · report
8d55b0910755412f · report
f45f876903ecc96b · report
9bf5955c8ae6f932 · report
Tasks
Results from the paper archive 2025-07-28
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
Introduced by this paper: SegNet
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections