Simple and robust binary self-location patterns

Alfred M. Bruckstein; Tuvi Etzion; Raja Giryes; Noam Gordon; Robert J. Holt; Doron Shuldiner

doi:10.1109/TIT.2012.2191699

Simple and robust binary self-location patterns

Alfred M. Bruckstein, Tuvi Etzion, Raja Giryes, Noam Gordon, Robert J. Holt, Doron Shuldiner

Computer Science

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

A simple method to generate a 2-D binary grid pattern, which allows for absolute and accurate self-location in a finite planar region, is proposed. The pattern encodes position information in a local way so that reading a small number of its black or white pixels at any place provides sufficient data from which the location can be decoded both efficiently and robustly.

Original language	English
Article number	6172676
Pages (from-to)	4884-4889
Number of pages	6
Journal	IEEE Transactions on Information Theory
Volume	58
Issue number	7
DOIs	https://doi.org/10.1109/TIT.2012.2191699
State	Published - 2012

Keywords

M-sequences
de Bruijn sequences
self-location patterns

All Science Journal Classification (ASJC) codes

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/TIT.2012.2191699

Cite this

@article{3976ea12b9e74e9bbd2515d018ee1654,

title = "Simple and robust binary self-location patterns",

abstract = "A simple method to generate a 2-D binary grid pattern, which allows for absolute and accurate self-location in a finite planar region, is proposed. The pattern encodes position information in a local way so that reading a small number of its black or white pixels at any place provides sufficient data from which the location can be decoded both efficiently and robustly.",

keywords = "M-sequences, de Bruijn sequences, self-location patterns",

author = "Bruckstein, \{Alfred M.\} and Tuvi Etzion and Raja Giryes and Noam Gordon and Holt, \{Robert J.\} and Doron Shuldiner",

note = "Funding Information: Manuscript received May 12, 2010; revised December 18, 2011; accepted January 06, 2012. Date of publicationMarch 22, 2012; date of current version June 12, 2012. T. Etzion was supported in part by the United States–Israel Binational Science Foundation, Jerusalem, Israel, under Grant 2006097. R. Giryes was supported by the Azrieli Fellowship. R. J. Holt was supported in part by Bell Laboratories of Alcatel-Lucent.",

year = "2012",

doi = "10.1109/TIT.2012.2191699",

language = "الإنجليزيّة",

volume = "58",

pages = "4884--4889",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "7",

}

TY - JOUR

T1 - Simple and robust binary self-location patterns

AU - Bruckstein, Alfred M.

AU - Etzion, Tuvi

AU - Giryes, Raja

AU - Gordon, Noam

AU - Holt, Robert J.

AU - Shuldiner, Doron

N1 - Funding Information: Manuscript received May 12, 2010; revised December 18, 2011; accepted January 06, 2012. Date of publicationMarch 22, 2012; date of current version June 12, 2012. T. Etzion was supported in part by the United States–Israel Binational Science Foundation, Jerusalem, Israel, under Grant 2006097. R. Giryes was supported by the Azrieli Fellowship. R. J. Holt was supported in part by Bell Laboratories of Alcatel-Lucent.

PY - 2012

Y1 - 2012

N2 - A simple method to generate a 2-D binary grid pattern, which allows for absolute and accurate self-location in a finite planar region, is proposed. The pattern encodes position information in a local way so that reading a small number of its black or white pixels at any place provides sufficient data from which the location can be decoded both efficiently and robustly.

AB - A simple method to generate a 2-D binary grid pattern, which allows for absolute and accurate self-location in a finite planar region, is proposed. The pattern encodes position information in a local way so that reading a small number of its black or white pixels at any place provides sufficient data from which the location can be decoded both efficiently and robustly.

KW - M-sequences

KW - de Bruijn sequences

KW - self-location patterns

UR - http://www.scopus.com/inward/record.url?scp=84862533018&partnerID=8YFLogxK

U2 - 10.1109/TIT.2012.2191699

DO - 10.1109/TIT.2012.2191699

M3 - مقالة

SN - 0018-9448

VL - 58

SP - 4884

EP - 4889

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 7

M1 - 6172676

ER -

Simple and robust binary self-location patterns

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this