Adaptive spatial hashing with dual-domain memristive hardware

Locality-sensitive hashing is a technique for approximate similarity search, but fixed thresholds and analog encoding inefficiencies have limited its hardware implementation. This work introduces a dual-domain adaptive spatial hashing (DASH) architecture on a monolithic one-transistor-one-resistor active array operating in both digital and analog domains, with an integrated multifunctional memristor. DASH performs entropy-maximized random projection and data-driven bias adaptation in the analog domain, followed by efficient Hamming-distance computation in the digital domain. Using dual-domain vector-matrix multiplication, multidimensional inputs are compressed into binary hash codes, enabling compact similarity encoding within a unified memristive hardware platform. Experimental validation on three-dimensional-clustered synthetic data shows that DASH maintains spatial separability and improves bit entropy through adaptation. Large-scale simulations on a digit dataset demonstrate improved semantic preservation, similarity recall, and noise resilience compared to non-adaptive hashing. These results position DASH as a scalable, hardware-native solution for energy-efficient, locality-aware similarity search in edge and neuromorphic systems.

Authors

Institutions

Publication Details

Journal
Nature Communications
Published
2026-05-02
DOI
https://doi.org/10.1038/s41467-026-72743-8
Primary Topic
Advanced Image and Video Retrieval Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Adaptive spatial hashing with dual-domain memristive hardware

Cheol Seong Hwang, Sung Keun Shim, Byongwoo Park, Wonho Choi et al.
Nature Communications
Advanced Image and Video Retrieval Techniques
article

Adaptive spatial hashing with dual-domain memristive hardware

Cheol Seong Hwang, Sung Keun Shim, Byongwoo Park, Wonho Choi, N. Ghenzi, Sung Ho Kim, Sunwoo Cheong, K.-A. Son, Soo Hyung Lee, Jonghoon Shin, Dong Hoon Shin
article en

Abstract

Locality-sensitive hashing is a technique for approximate similarity search, but fixed thresholds and analog encoding inefficiencies have limited its hardware implementation. This work introduces a dual-domain adaptive spatial hashing (DASH) architecture on a monolithic one-transistor-one-resistor active array operating in both digital and analog domains, with an integrated multifunctional memristor. DASH performs entropy-maximized random projection and data-driven bias adaptation in the analog domain, followed by efficient Hamming-distance computation in the digital domain. Using dual-domain vector-matrix multiplication, multidimensional inputs are compressed into binary hash codes, enabling compact similarity encoding within a unified memristive hardware platform. Experimental validation on three-dimensional-clustered synthetic data shows that DASH maintains spatial separability and improves bit entropy through adaptation. Large-scale simulations on a digit dataset demonstrate improved semantic preservation, similarity recall, and noise resilience compared to non-adaptive hashing. These results position DASH as a scalable, hardware-native solution for energy-efficient, locality-aware similarity search in edge and neuromorphic systems.

Nature Communications
Seoul National University (KR), New Generation University College (ET), National University College (PR), National University of Avellaneda (AR)
National Research Foundation of Korea
Affordable and clean energy
Openalex Percentile: Top 9%
Advanced Image and Video Retrieval Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.