Filters








39,875 Hits in 4.9 sec

Binary Embedding: Fundamental Limits and Fast Algorithm [article]

Xinyang Yi, Constantine Caramanis, Eric Price
2019 arXiv   pre-print
Existing binary embedding algorithms either lack theoretical guarantees or suffer from running time O(mp).  ...  We make three contributions: (1) we establish a lower bound that shows any binary embedding oblivious to the set of points requires m = Ω(1/δ^2N) bits and a similar lower bound for non-oblivious embeddings  ...  (URP) (Algorithm 1), fast binary embedding (FBE) (Algorithm 2) and the alternative fast binary embedding (FBE-2) (Algorithm 3).  ... 
arXiv:1502.05746v2 fatcat:en3sgs47vradfjfiswvginoaiu

Binary embeddings with structured hashed projections [article]

Anna Choromanska and Krzysztof Choromanski and Mariusz Bojarski and Tony Jebara and Sanjiv Kumar and Yann LeCun
2016 arXiv   pre-print
We consider the hashing mechanism for constructing binary embeddings, that involves pseudo-random projections followed by nonlinear (sign function) mappings.  ...  Our findings build a better understanding of certain deep architectures, which contain randomly weighted and untrained layers, and yet achieve high performance on different learning tasks.  ...  Yi, X., Caramanis, C., and Price, E. Binary embedding: Fundamental limits and fast algorithm. CoRR, abs/1502.05746, 2015. Yu, F. X., Kumar, S., Gong, Y., and Chang, S.-F. Circulant binary embedding.  ... 
arXiv:1511.05212v5 fatcat:fcbm23dkb5cr3bmha2gfslwbca

On Binary Embedding using Circulant Matrices [article]

Felix X. Yu, Aditya Bhaskara, Sanjiv Kumar, Yunchao Gong, Shih-Fu Chang
2015 arXiv   pre-print
The circulant structure allows us to use Fast Fourier Transform algorithms to speed up the computation.  ...  Binary embeddings provide efficient and powerful ways to perform operations on large scale data.  ...  The methods compared are CBE-rand, CBEopt, Fast Binary Embedding (FBE), Fast Johnson-Lindenstruss Transformation (FJLT) based methods and LSH.  ... 
arXiv:1511.06480v2 fatcat:57e25lexmngghh6l47hjgxp4em

Transforming binary code for low-power embedded processors

P. Petrov, A. Orailoglu
2004 IEEE Micro  
In addition to five benchmarks (fdct, ej, mmul, tri, and sor) used in the experiments for the RNA technique, we used the lu-decomposition (lu) algorithm on a 128 × 128 matrix and the fast Fourier transform  ...  The algorithm analyzes the program binary code and transforms it to an extremely power-efficient form with the help of efficient and frugal functional transformations.  ...  His research interests include application-specific embedded processors, low-power processors, and hardwaresoftware codesign.  ... 
doi:10.1109/mm.2004.18 fatcat:x24k2hbonrgp3orzf5mpufeudq

Tensorized Projection for High-Dimensional Binary Embedding

Weixiang Hong, Jingjing Meng, Junsong Yuan
2018 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
Embedding high-dimensional visual features (d-dimensional) to binary codes (b-dimensional) has shown advantages in various vision tasks such as object recognition and image retrieval.  ...  However, generating long binary codes involves large projection matrix and high-dimensional matrix-vector multiplication, thus is memory and computationally intensive.  ...  The authors appreciate Sergey Dolgov, Dmitry Savostyanov and Ivan Oseledets for valuable discussions!  ... 
doi:10.1609/aaai.v32i1.11292 fatcat:e3mh2l6gabcelc2lmlk7s66oty

Target tracking with binary proximity sensors

N. Shrivastava, R. Mudumbai U. Madhow, S. Suri
2006 Proceedings of the 4th international conference on Embedded networked sensor systems - SenSys '06  
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits.  ...  limit of accuracy.  ...  Closing Remarks We have identified the fundamental limits of tracking performance possible with binary proximity sensors, and have provided algorithms that approach these limits.  ... 
doi:10.1145/1182807.1182833 dblp:conf/sensys/ShrivastavaMMS06 fatcat:svmlcj6szbe6xb6mqvhnu4725y

Near-Optimal Sample Complexity Bounds for Circulant Binary Embedding [article]

Samet Oymak
2016 arXiv   pre-print
While binary embedding has been studied extensively, theoretical results on fast binary embedding are rather limited.  ...  An efficient way to accomplish this is to make use of fast embedding techniques involving Fourier transform e.g. circulant matrices.  ...  There are also several works on the applications of fast binary projections in large scale image retrieval and hashing algorithms [6, 21, 24] .  ... 
arXiv:1603.03178v2 fatcat:hi52xhpbqvhhlfachnsaruwvsm

Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors [article]

Laurent Jacques, Jason N. Laska, Petros T. Boufounos, Richard G. Baraniuk
2015 arXiv   pre-print
Next, we consider reconstruction robustness to measurement errors and noise and introduce the Binary ϵ-Stable Embedding (BϵSE) property, which characterizes the robustness measurement process to sign changes  ...  On the practical side, we introduce the Binary Iterative Hard Thresholding (BIHT) algorithm for signal reconstruction from 1-bit measurements that offers state-of-the-art performance.  ...  Using these distance metrics we define the binary stable embedding.  ... 
arXiv:1104.3160v4 fatcat:sg4wu3ovevdijjruidcuydw3du

Near-Optimal Bounds for Binary Embeddings of Arbitrary Sets [article]

Samet Oymak, Ben Recht
2015 arXiv   pre-print
We also discuss faster binary embedding where one takes advantage of an initial sketching procedure based on Fast Johnson-Lindenstauss Transform.  ...  We study embedding a subset K of the unit sphere to the Hamming cube {-1,+1}^m. We characterize the tradeoff between distortion and sample complexity m in terms of the Gaussian width ω(K) of the set.  ...  BR is generously supported by ONR awards N00014-11-1-0723 and N00014-13-1-0129, NSF awards CCF-1148243 and CCF-1217058, AFOSR award FA9550-13-1-0138, and a Sloan Research Fellowship.  ... 
arXiv:1512.04433v1 fatcat:thpzmgkbunhnxghwkslwdxoio4

HBST: A Hamming Distance Embedding Binary Search Tree for Feature-Based Visual Place Recognition

Dominik Schlegel, Giorgio Grisetti
2018 IEEE Robotics and Automation Letters  
Leveraging on our prior work, in this paper we present a Hamming Distance embedding Binary Search Tree (HBST) approach for binary Descriptor Matching and Image Retrieval.  ...  HBST allows for descriptor Search and Insertion in logarithmic time by exploiting particular properties of binary Feature descriptors.  ...  Additionally, we build a voting scheme on top of this method that enables fast and robust image retrieval. A.  ... 
doi:10.1109/lra.2018.2856542 dblp:journals/ral/SchlegelG18 fatcat:tkwipnc3vrhyre6tuhi6ltl32a

Hydrodynamical Evolution of Black-Hole Binaries Embedded in AGN Discs [article]

Rixin Li, Dong Lai
2022 arXiv   pre-print
various binary mass ratios, eccentricities and background disc properties.  ...  Our findings demonstrate that the dynamics of BBHs embedded in AGN discs is quite different from that of isolated binaries in their own circumbinary discs.  ...  ACKNOWLEDGEMENTS This work has been supported in part by the NSF grant AST-2107796 and the NASA grant 80NSSC19K0444.  ... 
arXiv:2202.07633v1 fatcat:5osbo3dxqbbizhwv65f3m6xoqe

Memory optimization of dynamic binary translators for embedded systems

Apala Guha, Kim Hazelwood, Mary Lou Soffa
2012 ACM Transactions on Architecture and Code Optimization (TACO)  
Dynamic binary translators (DBTs) are becoming increasingly important because of their power and flexibility. DBT-based services are valuable for all types of platforms.  ...  Additionally, we design approaches specific to these memory-limited DBTs.  ...  Systems such as Strata [57, 65, 89] and Walkabout [27] have a goal of enabling fast production of retargetable dynamic binary translators.  ... 
doi:10.1145/2355585.2355595 fatcat:hlpbrne63fbcldcanuwjxwdgce

Tracking a moving object with a binary sensor network

Javed Aslam, Zack Butler, Florin Constantin, Valentino Crespi, George Cybenko, Daniela Rus
2003 Proceedings of the first international conference on Embedded networked sensor systems - SenSys '03  
We present an analysis of a fundamental tracking limitation under this sensor model, and show how this limitation can be overcome through the use of a single bit of proximity information at each sensor  ...  We show that a network of binary sensors has geometric properties that can be used to develop a solution for tracking with binary sensors and present resulting algorithms and simulation experiments.  ...  Support for this work was provided through NSF awards 0225446, EIA-9901589, IIS-9818299 and IIS-99812193, ONR award N00014-01-1-0675, NSF Career award CCR-0093131, the DARPA TASK program and also by the  ... 
doi:10.1145/958491.958509 dblp:conf/sensys/AslamBCCCR03 fatcat:nhj6bielfzce5m2k6imjiglod4

Tracking a moving object with a binary sensor network

Javed Aslam, Zack Butler, Florin Constantin, Valentino Crespi, George Cybenko, Daniela Rus
2003 Proceedings of the first international conference on Embedded networked sensor systems - SenSys '03  
We present an analysis of a fundamental tracking limitation under this sensor model, and show how this limitation can be overcome through the use of a single bit of proximity information at each sensor  ...  We show that a network of binary sensors has geometric properties that can be used to develop a solution for tracking with binary sensors and present resulting algorithms and simulation experiments.  ...  Support for this work was provided through NSF awards 0225446, EIA-9901589, IIS-9818299 and IIS-99812193, ONR award N00014-01-1-0675, NSF Career award CCR-0093131, the DARPA TASK program and also by the  ... 
doi:10.1145/958507.958509 fatcat:gebhzz3qhbajbatvm5qesvivqe

Exploring Embedding Methods in Binary Hyperdimensional Computing: A Case Study for Motor-Imagery based Brain-Computer Interfaces [article]

Michael Hersche, José del R. Millán, Luca Benini, Abbas Rahimi
2018 arXiv   pre-print
The main challenge is however to formulate embedding methods that map biosignal measures to a binary HD space.  ...  Key properties of brain-inspired hyperdimensional (HD) computing make it a prime candidate for energy-efficient and fast learning in biosignal processing.  ...  Acknowledgements Support was received from the ETHZ Postdoctoral Fellowship Program, the Marie Curie Actions for People COFUND Program, and the Hasler Foundation.  ... 
arXiv:1812.05705v2 fatcat:aaasebjbqzgixl2wkcarssqgju
« Previous Showing results 1 — 15 out of 39,875 results