SmartMoveX on a Graph - An Inexpensive Active Badge Tracker
Measuring the locations of people in a building is an important part of ubiquitous computing. We present new hardware and software for this purpose. The hardware, called SmartMoveX, is an active badge system in which a small radio transmitter is attached to the person being tracked. Receivers placed...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 307 |
---|---|
container_issue | |
container_start_page | 299 |
container_title | |
container_volume | 2498 |
creator | Krumm, John Williams, Lyndsay Smith, Greg |
description | Measuring the locations of people in a building is an important part of ubiquitous computing. We present new hardware and software for this purpose. The hardware, called SmartMoveX, is an active badge system in which a small radio transmitter is attached to the person being tracked. Receivers placed in the building's existing offices, connected to existing PCs, transmit signal strength readings to a central PC using the building's existing computer network. Combined with the low cost of the hardware, using the existing network makes this active badge system much less expensive than many others. To compute locations based on signal strength, we gathered signal strength readings from predefined location nodes in the building. We defined a graph on these nodes, which allowed us to enforce constraints on computed movements between nodes (e.g. cannot pass through walls) and to probabilistically enforce our expectations on transitions between connected nodes. Modeling the data with a hidden Markov model, we used the Viterbi algorithm to compute optimal paths based on signal strengths over the node graph. The average location error was 3.05 meters, which compared favorably to a simple nearest neighbor algorithm's average location error of 4.57 meters. |
doi_str_mv | 10.5555/647988.741483 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>proquest_acm_b</sourceid><recordid>TN_cdi_acm_books_10_5555_647988_741483</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3072912_29_313</sourcerecordid><originalsourceid>FETCH-LOGICAL-a1423-627700901de0b143543f0c55dd27954a0ba179ff79304a295015c2acf901b79e3</originalsourceid><addsrcrecordid>eNqNkDtPAzEQhM1ThJCS_hqoOFh77fgsqoB4RAqiIEh01p7jI4Fwd9gHgn-Po-QHsM0U-83uaBg75nCu0lwMpTZFca4llwVusUNUEqQqwOA26_Eh5zmiNDubhRRDrXdZDxBEbrTEfdYzqlACBYcDNojxDdKg0FLzHrt8-qDQPTTf_iVr6oyyu0DtPMuzUZ2Na__T-jouvn02ct1Krmj26rNpIPfuwxHbq2gZ_WCjffZ8ezO9vs8nj3fj69EkJy4F5kOhNYABPvNQcplSYgVOqdlMaKMkQUlcm6rSBkGSMAq4coJclSylNh777GR9t6XoaFkFqt0i2jYsUvZfm2opePqRONxwofn88rGzvmyad-frLtDSzantfIgWQQvDhRXGIsfkOl27yH3YFR8tB7tq3q6bt-vmE3j2L9CWYeEr_ANH1Hdw</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>EBC3072912_29_313</pqid></control><display><type>conference_proceeding</type><title>SmartMoveX on a Graph - An Inexpensive Active Badge Tracker</title><source>Springer Books</source><creator>Krumm, John ; Williams, Lyndsay ; Smith, Greg</creator><contributor>Borriello, Gaetano ; Holmquist, Lars Erik ; Holmquist, Lars E ; Borriello, Gaetano</contributor><creatorcontrib>Krumm, John ; Williams, Lyndsay ; Smith, Greg ; Borriello, Gaetano ; Holmquist, Lars Erik ; Holmquist, Lars E ; Borriello, Gaetano</creatorcontrib><description>Measuring the locations of people in a building is an important part of ubiquitous computing. We present new hardware and software for this purpose. The hardware, called SmartMoveX, is an active badge system in which a small radio transmitter is attached to the person being tracked. Receivers placed in the building's existing offices, connected to existing PCs, transmit signal strength readings to a central PC using the building's existing computer network. Combined with the low cost of the hardware, using the existing network makes this active badge system much less expensive than many others. To compute locations based on signal strength, we gathered signal strength readings from predefined location nodes in the building. We defined a graph on these nodes, which allowed us to enforce constraints on computed movements between nodes (e.g. cannot pass through walls) and to probabilistically enforce our expectations on transitions between connected nodes. Modeling the data with a hidden Markov model, we used the Viterbi algorithm to compute optimal paths based on signal strengths over the node graph. The average location error was 3.05 meters, which compared favorably to a simple nearest neighbor algorithm's average location error of 4.57 meters.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540442677</identifier><identifier>ISBN: 9783540442677</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540458093</identifier><identifier>EISBN: 9783540458098</identifier><identifier>DOI: 10.5555/647988.741483</identifier><identifier>OCLC: 958523210</identifier><identifier>LCCallNum: QA76.9.U83</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer-Verlag</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Networks ; Networks -- Network types ; Networks -- Network types -- Mobile networks ; Software</subject><ispartof>Lecture notes in computer science, 2002, Vol.2498, p.299-307</ispartof><rights>2003 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3072912-l.jpg</thumbnail><link.rule.ids>310,311,780,781,785,790,791,794,4051,4052,27929</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=14881277$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Borriello, Gaetano</contributor><contributor>Holmquist, Lars Erik</contributor><contributor>Holmquist, Lars E</contributor><contributor>Borriello, Gaetano</contributor><creatorcontrib>Krumm, John</creatorcontrib><creatorcontrib>Williams, Lyndsay</creatorcontrib><creatorcontrib>Smith, Greg</creatorcontrib><title>SmartMoveX on a Graph - An Inexpensive Active Badge Tracker</title><title>Lecture notes in computer science</title><description>Measuring the locations of people in a building is an important part of ubiquitous computing. We present new hardware and software for this purpose. The hardware, called SmartMoveX, is an active badge system in which a small radio transmitter is attached to the person being tracked. Receivers placed in the building's existing offices, connected to existing PCs, transmit signal strength readings to a central PC using the building's existing computer network. Combined with the low cost of the hardware, using the existing network makes this active badge system much less expensive than many others. To compute locations based on signal strength, we gathered signal strength readings from predefined location nodes in the building. We defined a graph on these nodes, which allowed us to enforce constraints on computed movements between nodes (e.g. cannot pass through walls) and to probabilistically enforce our expectations on transitions between connected nodes. Modeling the data with a hidden Markov model, we used the Viterbi algorithm to compute optimal paths based on signal strengths over the node graph. The average location error was 3.05 meters, which compared favorably to a simple nearest neighbor algorithm's average location error of 4.57 meters.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>Networks</subject><subject>Networks -- Network types</subject><subject>Networks -- Network types -- Mobile networks</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540442677</isbn><isbn>9783540442677</isbn><isbn>3540458093</isbn><isbn>9783540458098</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2002</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNqNkDtPAzEQhM1ThJCS_hqoOFh77fgsqoB4RAqiIEh01p7jI4Fwd9gHgn-Po-QHsM0U-83uaBg75nCu0lwMpTZFca4llwVusUNUEqQqwOA26_Eh5zmiNDubhRRDrXdZDxBEbrTEfdYzqlACBYcDNojxDdKg0FLzHrt8-qDQPTTf_iVr6oyyu0DtPMuzUZ2Na__T-jouvn02ct1Krmj26rNpIPfuwxHbq2gZ_WCjffZ8ezO9vs8nj3fj69EkJy4F5kOhNYABPvNQcplSYgVOqdlMaKMkQUlcm6rSBkGSMAq4coJclSylNh777GR9t6XoaFkFqt0i2jYsUvZfm2opePqRONxwofn88rGzvmyad-frLtDSzantfIgWQQvDhRXGIsfkOl27yH3YFR8tB7tq3q6bt-vmE3j2L9CWYeEr_ANH1Hdw</recordid><startdate>20020929</startdate><enddate>20020929</enddate><creator>Krumm, John</creator><creator>Williams, Lyndsay</creator><creator>Smith, Greg</creator><general>Springer-Verlag</general><general>Springer Berlin / Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>20020929</creationdate><title>SmartMoveX on a Graph - An Inexpensive Active Badge Tracker</title><author>Krumm, John ; Williams, Lyndsay ; Smith, Greg</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a1423-627700901de0b143543f0c55dd27954a0ba179ff79304a295015c2acf901b79e3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>Networks</topic><topic>Networks -- Network types</topic><topic>Networks -- Network types -- Mobile networks</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Krumm, John</creatorcontrib><creatorcontrib>Williams, Lyndsay</creatorcontrib><creatorcontrib>Smith, Greg</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Krumm, John</au><au>Williams, Lyndsay</au><au>Smith, Greg</au><au>Borriello, Gaetano</au><au>Holmquist, Lars Erik</au><au>Holmquist, Lars E</au><au>Borriello, Gaetano</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>SmartMoveX on a Graph - An Inexpensive Active Badge Tracker</atitle><btitle>Lecture notes in computer science</btitle><date>2002-09-29</date><risdate>2002</risdate><volume>2498</volume><spage>299</spage><epage>307</epage><pages>299-307</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540442677</isbn><isbn>9783540442677</isbn><eisbn>3540458093</eisbn><eisbn>9783540458098</eisbn><abstract>Measuring the locations of people in a building is an important part of ubiquitous computing. We present new hardware and software for this purpose. The hardware, called SmartMoveX, is an active badge system in which a small radio transmitter is attached to the person being tracked. Receivers placed in the building's existing offices, connected to existing PCs, transmit signal strength readings to a central PC using the building's existing computer network. Combined with the low cost of the hardware, using the existing network makes this active badge system much less expensive than many others. To compute locations based on signal strength, we gathered signal strength readings from predefined location nodes in the building. We defined a graph on these nodes, which allowed us to enforce constraints on computed movements between nodes (e.g. cannot pass through walls) and to probabilistically enforce our expectations on transitions between connected nodes. Modeling the data with a hidden Markov model, we used the Viterbi algorithm to compute optimal paths based on signal strengths over the node graph. The average location error was 3.05 meters, which compared favorably to a simple nearest neighbor algorithm's average location error of 4.57 meters.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer-Verlag</pub><doi>10.5555/647988.741483</doi><oclcid>958523210</oclcid><tpages>9</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0302-9743 |
ispartof | Lecture notes in computer science, 2002, Vol.2498, p.299-307 |
issn | 0302-9743 1611-3349 |
language | eng |
recordid | cdi_acm_books_10_5555_647988_741483 |
source | Springer Books |
subjects | Applied sciences Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Networks Networks -- Network types Networks -- Network types -- Mobile networks Software |
title | SmartMoveX on a Graph - An Inexpensive Active Badge Tracker |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-16T13%3A35%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_acm_b&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=SmartMoveX%20on%20a%20Graph%20-%20An%20Inexpensive%20Active%20Badge%20Tracker&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Krumm,%20John&rft.date=2002-09-29&rft.volume=2498&rft.spage=299&rft.epage=307&rft.pages=299-307&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540442677&rft.isbn_list=9783540442677&rft_id=info:doi/10.5555/647988.741483&rft_dat=%3Cproquest_acm_b%3EEBC3072912_29_313%3C/proquest_acm_b%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540458093&rft.eisbn_list=9783540458098&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3072912_29_313&rft_id=info:pmid/&rfr_iscdi=true |