Bar Code Scanning -- An Inverse Problem for Words

Add to your list(s) Download to your calendar using vCal

• Santosa, F (University of Minnesota)
• Friday 16 December 2011, 16:00-16:30
• Seminar Room 1, Newton Institute.

If you have a question about this talk, please contact Mustapha Amrani.

Inverse Problems

Bar codes are ubiquitous—they are used to identify products in stores, parts in a warehouse, and books in a library, etc. In this talk, the speaker will describe how information is encoded in a bar code and how it is read by a scanner. The presentation will go over how the decoding process, from scanner signal to coded information, can be formulated as an inverse problem. The inverse problem involves finding the “word” hidden in the signal. What makes this inverse problem, and the approach to solve it, somewhat unusual is that the unknown has a finite number of states.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

• All CMS events
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 1, Newton Institute
• bld31

Note that ex-directory lists are not shown.