Beyond one-hot encoding? Journey into compact encoding for large multi-class segmentation

• URL: http://arxiv.org/abs/2510.00667v1
• Date: Wed, 01 Oct 2025 08:53:39 GMT
• Title: Beyond one-hot encoding? Journey into compact encoding for large multi-class segmentation
• Authors: Aaron Kujawa, Thomas Booth, Tom Vercauteren,
• Abstract summary: We propose a family of binary encoding approaches instead of one-hot encoding to reduce the computational complexity and memory requirements to logarithmic in the number of classes.<n>We apply the methods to the use case of whole brain parcellation with 108 classes based on 3D MRI images.
• Score: 3.731545953583865
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This work presents novel methods to reduce computational and memory requirements for medical image segmentation with a large number of classes. We curiously observe challenges in maintaining state-of-the-art segmentation performance with all of the explored options. Standard learning-based methods typically employ one-hot encoding of class labels. The computational complexity and memory requirements thus increase linearly with the number of classes. We propose a family of binary encoding approaches instead of one-hot encoding to reduce the computational complexity and memory requirements to logarithmic in the number of classes. In addition to vanilla binary encoding, we investigate the effects of error-correcting output codes (ECOCs), class weighting, hard/soft decoding, class-to-codeword assignment, and label embedding trees. We apply the methods to the use case of whole brain parcellation with 108 classes based on 3D MRI images. While binary encodings have proven efficient in so-called extreme classification problems in computer vision, we faced challenges in reaching state-of-the-art segmentation quality with binary encodings. Compared to one-hot encoding (Dice Similarity Coefficient (DSC) = 82.4 (2.8)), we report reduced segmentation performance with the binary segmentation approaches, achieving DSCs in the range from 39.3 to 73.8. Informative negative results all too often go unpublished. We hope that this work inspires future research of compact encoding strategies for large multi-class segmentation tasks.

Related papers

• Binary-Gaussian: Compact and Progressive Representation for 3D Gaussian Segmentation [83.90109373769614]
  3D Gaussian Splatting (3D-GS) has emerged as an efficient 3D representation and a promising foundation for semantic tasks like segmentation.<n>We propose a coarse-to-fine binary encoding scheme for per-Gaussian category representation, which compresses each feature into a single integer via the binary-to-decimal mapping.<n>We further design a progressive training strategy that decomposes panoptic segmentation into a series of independent sub-tasks, reducing inter-class conflicts and thereby enhancing fine-grained segmentation capability.
  arXiv  Detail & Related papers  (2025-11-30T15:51:30Z)
• Fast correlated decoding of transversal logical algorithms [67.01652927671279]
  Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.<n>Recent advances have shown that by jointly decoding logical qubits in algorithms composed of logical gates, the number of syndrome extraction rounds can be reduced.<n>Here, we reform the problem of decoding circuits by directly decoding relevant logical operator products as they propagate through the circuit.
  arXiv  Detail & Related papers  (2025-05-19T18:00:00Z)
• HER-Seg: Holistically Efficient Segmentation for High-Resolution Medical Images [12.452415054883256]
  High-resolution segmentation is critical for precise disease diagnosis by extracting fine-grained morphological details.<n>Existing hierarchical encoder-decoder frameworks have demonstrated remarkable adaptability across diverse medical segmentation tasks.<n>We propose a holistically efficient framework for high-resolution medical image segmentation, called HER-Seg.
  arXiv  Detail & Related papers  (2025-04-08T16:48:57Z)
• Approximate Size Targets Are Sufficient for Accurate Semantic Segmentation [52.239136918460616]
  Extending binary class tags to approximate relative object-size distributions allows off-the-shelf architectures to solve the segmentation problem.<n>A straightforward zero-avoiding KL-divergence loss for average predictions produces segmentation accuracy comparable to the standard pixel-precise supervision.<n>Our ideas are validated on PASCAL VOC using our new human annotations of approximate object sizes.
  arXiv  Detail & Related papers  (2025-03-10T06:02:13Z)
• Decoding at the Speed of Thought: Harnessing Parallel Decoding of Lexical Units for LLMs [57.27982780697922]
  Large language models have demonstrated exceptional capability in natural language understanding and generation. However, their generation speed is limited by the inherently sequential nature of their decoding process. This paper introduces Lexical Unit Decoding, a novel decoding methodology implemented in a data-driven manner.
  arXiv  Detail & Related papers  (2024-05-24T04:35:13Z)
• Triple-Encoders: Representations That Fire Together, Wire Together [51.15206713482718]
  Contrastive Learning is a representation learning method that encodes relative distances between utterances into the embedding space via a bi-encoder. This study introduces triple-encoders, which efficiently compute distributed utterance mixtures from these independently encoded utterances. We find that triple-encoders lead to a substantial improvement over bi-encoders, and even to better zero-shot generalization than single-vector representation models.
  arXiv  Detail & Related papers  (2024-02-19T18:06:02Z)
• SparseCoder: Identifier-Aware Sparse Transformer for File-Level Code Summarization [51.67317895094664]
  This paper studies file-level code summarization, which can assist programmers in understanding and maintaining large source code projects. We propose SparseCoder, an identifier-aware sparse transformer for effectively handling long code sequences.
  arXiv  Detail & Related papers  (2024-01-26T09:23:27Z)
• SC-VAE: Sparse Coding-based Variational Autoencoder with Learned ISTA [0.6770292596301478]
  We introduce a new VAE variant, termed sparse coding-based VAE with learned ISTA (SC-VAE), which integrates sparse coding within variational autoencoder framework. Experiments on two image datasets demonstrate that our model achieves improved image reconstruction results compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-03-29T13:18:33Z)
• Does Configuration Encoding Matter in Learning Software Performance? An Empirical Study on Encoding Schemes [5.781900408390438]
  The study covers five systems, seven models, and three encoding schemes, leading to 105 cases of investigation. We empirically compared the widely used encoding schemes for software performance learning, namely label, scaled label, and one-hot encoding. Our key findings reveal that: (1) conducting trial-and-error to find the best encoding scheme in a case by case manner can be rather expensive, requiring up to 400+ hours on some models and systems; (2) the one-hot encoding often leads to the most accurate results while the scaled label encoding is generally weak on accuracy over different models; (3) conversely, the scaled label encoding tends to
  arXiv  Detail & Related papers  (2022-03-30T01:46:27Z)
• EEC: Learning to Encode and Regenerate Images for Continual Learning [9.89901717499058]
  We train autoencoders with Neural Style Transfer to encode and store images. reconstructed images from encoded episodes are replayed in order to avoid catastrophic forgetting. Our approach increases classification accuracy by 13-17% over state-of-the-art methods on benchmark datasets.
  arXiv  Detail & Related papers  (2021-01-13T06:43:10Z)
• Storing Encoded Episodes as Concepts for Continual Learning [22.387008072671005]
  Two main challenges faced by continual learning approaches are catastrophic forgetting and memory limitations on the storage of data. We propose a cognitively-inspired approach which trains autoencoders with Neural Style Transfer to encode and store images. Our approach increases classification accuracy by 13-17% over state-of-the-art methods on benchmark datasets, while requiring 78% less storage space.
  arXiv  Detail & Related papers  (2020-06-26T04:15:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.