paper-with-me

홈 › Papers

Locality sensitive hashing via mechanical behavior

2023-03-09 · Emma Lejeune, Peerasait Prachaseree

From healing wounds to maintaining homeostasis in cyclically loaded tissue, living systems have a phenomenal ability to sense, store, and respond to mechanical stimuli. Broadly speaking, there is significant interest in designing engineered systems to recapitulate this incredible functionality. In engineered systems, we have seen significant recent computationally driven advances in sensing and control. And, there has been a growing interest - inspired in part by the incredible distributed and emergent functionality observed in the natural world - in exploring the ability of engineered systems to perform computation through mechanisms that are fundamentally driven by physical laws. In this work, we focus on a small segment of this broad and evolving field: locality sensitive hashing via mechanical behavior. Specifically, we will address the question: can mechanical information (i.e., loads) be transformed by mechanical systems (i.e., converted into sensor readouts) such that the mechanical system meets the requirements for a locality sensitive hash function? Overall, we not only find that mechanical systems are able to perform this function, but also that different mechanical systems vary widely in their efficacy at this task. Looking forward, we view this work as a starting point for significant future investigation into the design and optimization of mechanical systems for conveying mechanical information for downstream computing.

📄 PDF Abstract BibTeX arXiv:2304.06505

Code (1)

elejeune11/mechhs 공식 구현

Similar Papers 제목 키워드 기반

Locality-sensitive hashing in function spaces

2020-02-10 · Will Shand, Stephen Becker

We discuss the problem of performing similarity search over function spaces. To perform search over such spaces in a reasonable amount of time, we use {\it locality-sensitive hashing} (LSH). We present two methods that a…

Super-Bit Locality-Sensitive Hashing

2012-12-01 · NeurIPS 2012 12 · Jianqiu Ji, Jianmin Li, Shuicheng Yan, Bo Zhang 외

Sign-random-projection locality-sensitive hashing (SRP-LSH) is a probabilistic dimension reduction method which provides an unbiased estimate of angular similarity, yet suffers from the large variance of its estimation. …

Dimensionality ReductionRetrieval

Hashing for Similarity Search: A Survey

2014-08-13 · Jingdong Wang, Heng Tao Shen, Jingkuan Song, Jianqiu Ji

Similarity search (nearest neighbor search) is a problem of pursuing the data items whose distances to a query item are the smallest from a large database. Various methods have been developed to address this problem, and…

Survey

Falconn++: A Locality-sensitive Filtering Approach for Approximate Nearest Neighbor Search

2022-06-03 · Ninh Pham, Tao Liu

We present Falconn++, a novel locality-sensitive filtering approach for approximate nearest neighbor search on angular distance. Falconn++ can filter out potential far away points in any hash bucket \textit{before} query…

Ranking Based Locality Sensitive Hashing Enabled Cancelable Biometrics: Index-of-Max Hashing

2017-03-16 · Zhe Jin, Yen-Lung Lai, Jung-Yeon Hwang, Soo-Hyung Kim 외

In this paper, we propose a ranking based locality sensitive hashing inspired two-factor cancelable biometrics, dubbed "Index-of-Max" (IoM) hashing for biometric template protection. With externally generated random para…