Sign inGet started
Paper · arXiv

DSCH-Loss: A Dynamic Semantic Channel Objective for Deep Semantic Hashing

Semantic hashing methods for generating short binary hash codes that allow efficient approximate nearest neighbor search in high-dimensional data spaces have gained extensive consideration in recent years. Deep learning-based methods offer better semantic capturing capabilities than traditional approaches relying on manual feature engineering. Moreover, they enable a data-driven approach to semantic hashing across diverse data modalities, yielding high-quality cross-modal hash codes within a shared Hamming space. Previous work investigated the properties of this Hamming space and introduced a loss function based on predefined so-called semantic channels with fixed width and Hamming distan...

AuthorsTobias J. Bauer, Christian Riess, Daniel Loebenberger et al.
Primary categorycs.AI
Published27 July 2026
Last updated at source27 July 2026
cs.AIcs.CVcs.IR
Embed this entry
<iframe src="https://silytics.si/embed/item/c6885de9-65e2-40d8-adec-7a2cba27fe97" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.