Publications related to Lee distance

A Gapless Post-quantum Hash Proof System in the Hamming Metric

A hash proof system (HPS) is a form of implicit proof of membership to a language. Out of the very few existing post-quantum HPS, most are based on languages of ciphertexts of code-based or lattice-based cryptosystems and inherently suffer from a gap cause ...

2023

Metric learning for kernel ridge regression: assessment of molecular similarity

Friedrich Eisenbrand, Anne-Clémence Corminboeuf, Puck Elisabeth van Gerwen, Raimon Fabregat I De Aguilar-Amat

Supervised and unsupervised kernel-based algorithms widely used in the physical sciences depend upon the notion of similarity. Their reliance on pre-defined distance metrics-e.g. the Euclidean or Manhattan distance-are problematic especially when used in c ...

IOP Publishing Ltd2022

On-the-Fly ab initio Semiclassical Evaluation of Electronic Coherences in Polyatomic Molecules Reveals a Simple Mechanism of Decoherence

Jiri Vanicek, Tomislav Begusic, Nikolay Golubev

Irradiation of a molecular system by an intense laser field can trigger dynamics of both electronic and nuclear subsystems. The lighter electrons usually move on much faster, attosecond timescale but the slow nuclear rearrangement damps ultrafast electroni ...

2020

Do We Need Binary Features for 3D Reconstruction?

Pascal Fua, Xinchao Wang, Zhiye Wang, Bin Fan

Binary features have been incrementally popular in the past few years due to their low memory footprints and the efficient computation of Hamming distance between binary descriptors. They have been shown with promising results on some real time application ...

2016

LDAHash: Improved Matching with Smaller Descriptors

Pascal Fua, Christoph Strecha

SIFT-like local feature descriptors are ubiquitously employed in computer vision applications such as content-based retrieval, video analysis, copy detection, object recognition, photo tourism, and 3D reconstruction. Feature descriptors can be designed to ...

Institute of Electrical and Electronics Engineers2012

Orthogeodesic Point-Set Embedding of Trees

Radoslav Fulek, Fabrizio Frati

Let S be a set of N grid points in the plane, no two of which lie on the same horizontal or vertical line, and let G be a graph with n vertices (n

Elsevier Science Bv2011

BRIEF: Binary Robust Independent Elementary Features

Pascal Fua, Vincent Lepetit, Christoph Strecha, Michael Calonder

We propose to use binary strings as an efficient feature point descriptor, which we call BRIEF. We show that it is highly discriminative even when using relatively few bits and can be computed using simple intensity difference tests. Furthermore, the descr ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010