Bar Code Scanning -- An Inverse Problem for Words
Duration: 30 mins 50 secs
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Santosa, F (University of Minnesota)
Friday 16 December 2011, 16:00-16:30 |
|---|
| Created: | 2011-12-19 12:48 |
|---|---|
| Collection: | Inverse Problems |
| Publisher: | Isaac Newton Institute |
| Copyright: | Santosa, F |
| Language: | eng (English) |
| Abstract: | 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. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.84 Mbits/sec | 427.67 MB | View | Download | |
| WebM | 640x360 | 828.02 kbits/sec | 186.59 MB | View | Download | |
| Flash Video | 484x272 | 568.9 kbits/sec | 128.48 MB | View | Download | |
| iPod Video | 480x270 | 506.4 kbits/sec | 114.36 MB | View | Download | |
| MP3 | 44100 Hz | 125.05 kbits/sec | 28.04 MB | Listen | Download | |
| Auto * | (Allows browser to choose a format it supports) | |||||