A Novel Framework for Online Amnesic Trajectory Compression in Resource-Constrained Environments
State-of-the-art trajectory compression methods usually involve high space-time complexity or yield unsatisfactory compression rates, leading to rapid exhaustion of memory, computation, storage, and energy resources. Their ability is commonly limited when operating in a resource-constrained environm...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on knowledge and data engineering Jg. 28; H. 11; S. 2827 - 2841 |
|---|---|
| Hauptverfasser: | , , , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York
IEEE
01.11.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Schlagworte: | |
| ISSN: | 1041-4347, 1558-2191 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | State-of-the-art trajectory compression methods usually involve high space-time complexity or yield unsatisfactory compression rates, leading to rapid exhaustion of memory, computation, storage, and energy resources. Their ability is commonly limited when operating in a resource-constrained environment especially when the data volume (even when compressed) far exceeds the storage limit. Hence, we propose a novel online framework for error-bounded trajectory compression and ageing called the Amnesic Bounded Quadrant System (ABQS), whose core is the Bounded Quadrant System (BQS) algorithm family that includes a normal version (BQS), Fast version (FBQS), and a Progressive version (PBQS). ABQS intelligently manages a given storage and compresses the trajectories with different error tolerances subject to their ages. In the experiments, we conduct comprehensive evaluations for the BQS algorithm family and the ABQS framework. Using empirical GPS traces from flying foxes and cars, and synthetic data from simulation, we demonstrate the effectiveness of the standalone BQS algorithms in significantly reducing the time and space complexity of trajectory compression, while greatly improving the compression rates of the state-of-the-art algorithms (up to 45 percent). We also show that the operational time of the target resource-constrained hardware platform can be prolonged by up to 41 percent. We then verify that with ABQS, given data volumes that are far greater than storage space, ABQS is able to achieve 15 to 400 times smaller errors than the baselines. We also show that the algorithm is robust to extreme trajectory shapes. |
|---|---|
| AbstractList | State-of-the-art trajectory compression methods usually involve high space-time complexity or yield unsatisfactory compression rates, leading to rapid exhaustion of memory, computation, storage, and energy resources. Their ability is commonly limited when operating in a resource-constrained environment especially when the data volume (even when compressed) far exceeds the storage limit. Hence, we propose a novel online framework for error-bounded trajectory compression and ageing called the Amnesic Bounded Quadrant System (ABQS), whose core is the Bounded Quadrant System (BQS) algorithm family that includes a normal version (BQS), Fast version (FBQS), and a Progressive version (PBQS). ABQS intelligently manages a given storage and compresses the trajectories with different error tolerances subject to their ages. In the experiments, we conduct comprehensive evaluations for the BQS algorithm family and the ABQS framework. Using empirical GPS traces from flying foxes and cars, and synthetic data from simulation, we demonstrate the effectiveness of the standalone BQS algorithms in significantly reducing the time and space complexity of trajectory compression, while greatly improving the compression rates of the state-of-the-art algorithms (up to 45 percent). We also show that the operational time of the target resource-constrained hardware platform can be prolonged by up to 41 percent. We then verify that with ABQS, given data volumes that are far greater than storage space, ABQS is able to achieve 15 to 400 times smaller errors than the baselines. We also show that the algorithm is robust to extreme trajectory shapes. |
| Author | Shuo Shang Sommer, Philipp Jae-Gil Lee Kun Zhao Jurdak, Raja Jiajun Liu Kusy, Brano |
| Author_xml | – sequence: 1 surname: Jiajun Liu fullname: Jiajun Liu email: jiajunliu@ruc.edu.cn organization: Renmin Univ. of China, Beijing, China – sequence: 2 surname: Kun Zhao fullname: Kun Zhao email: kun.zhao@csiro.au organization: Data61, CSIRO, Pullenvale, QLD, Australia – sequence: 3 givenname: Philipp surname: Sommer fullname: Sommer, Philipp email: philipp.sommer@csiro.au organization: Data61, CSIRO, Pullenvale, QLD, Australia – sequence: 4 surname: Shuo Shang fullname: Shuo Shang email: sshang@cup.edu.cn organization: China Univ. of Pet., Beijing, China – sequence: 5 givenname: Brano surname: Kusy fullname: Kusy, Brano email: brano.kusy@csiro.au organization: Data61, CSIRO, Pullenvale, QLD, Australia – sequence: 6 surname: Jae-Gil Lee fullname: Jae-Gil Lee email: jaegil@kaist.ac.kr organization: Dept. of Knowledge Service Eng., KAIST, Daejeon, South Korea – sequence: 7 givenname: Raja surname: Jurdak fullname: Jurdak, Raja email: raja.jurdak@csiro.au organization: Data61, CSIRO, Pullenvale, QLD, Australia |
| BookMark | eNp9kU9PwzAMxSM0JP5-AMQlEucOO02b9jiNDRCISWicS0hdqWNNRtIN7duTaRMHDpzsw_vZz89nbGCdJcauEIaIUN7On-4mQwGYD0VWFqjwiJ1ilhWJwBIHsQeJiUylOmFnISwAoFAFnrL3EX9xG1ryqdcdfTv_yRvn-cwuW0t81FkKreFzrxdkeue3fOy6lacQWmd5a_krBbf2hpKxs6H3OlI1n9hN653tyPbhgh03ehno8lDP2dt0Mh8_JM-z-8fx6Dkxokz7xICWKq91Jj-kKJTQRuaAqIQwUOd1YQzpTEHZSELIM2MkQWo0QA3NhyCdnrOb_dyVd19rCn21iMZsXFlhkWKcJSGLKrVXGe9C8NRUpu11H4_ZeV9WCNUuzmoXZ7WLszrEGUn8Q65822m__Ze53jMtEf3qVSbjU4r0BzS4g00 |
| CODEN | ITKEEH |
| CitedBy_id | crossref_primary_10_1007_s11280_018_0538_5 crossref_primary_10_1016_j_future_2023_02_028 crossref_primary_10_1016_j_future_2022_07_003 crossref_primary_10_1145_3498338 crossref_primary_10_1109_TNSM_2022_3224735 crossref_primary_10_1109_ACCESS_2019_2919800 crossref_primary_10_1109_JSYST_2019_2935458 crossref_primary_10_1016_j_trc_2024_104648 crossref_primary_10_1007_s00778_019_00575_8 crossref_primary_10_1007_s00607_017_0563_8 crossref_primary_10_1007_s10707_021_00442_1 crossref_primary_10_1016_j_future_2023_05_030 crossref_primary_10_1177_15501477211050729 crossref_primary_10_1049_itr2_12187 crossref_primary_10_1109_TVT_2020_3015214 crossref_primary_10_1145_3715902 crossref_primary_10_3390_data9120140 crossref_primary_10_1016_j_engappai_2023_106892 crossref_primary_10_1002_ett_3886 crossref_primary_10_1007_s11280_022_01089_0 crossref_primary_10_1080_10095020_2025_2542979 crossref_primary_10_1109_TBDATA_2025_3570071 crossref_primary_10_1109_TKDE_2025_3579434 crossref_primary_10_1007_s10707_021_00458_7 crossref_primary_10_1007_s10707_021_00459_6 crossref_primary_10_3390_ijgi13010003 crossref_primary_10_1007_s11280_018_0544_7 crossref_primary_10_1007_s11280_018_0563_4 crossref_primary_10_1007_s11280_018_0564_3 crossref_primary_10_1007_s11280_018_0606_x crossref_primary_10_1007_s00521_021_06294_y crossref_primary_10_1007_s10619_020_07289_9 crossref_primary_10_1007_s00521_021_05812_2 crossref_primary_10_1016_j_bdr_2021_100221 crossref_primary_10_1007_s10707_022_00475_0 crossref_primary_10_1007_s11280_022_01038_x crossref_primary_10_3390_ijgi10050334 crossref_primary_10_1007_s11280_017_0496_3 crossref_primary_10_1145_3474373 |
| Cites_doi | 10.1007/s10707-013-0184-0 10.1145/1999320.1999333 10.1145/1140104.1140110 10.1109/ICDM.2001.989531 10.1007/s10707-011-0144-5 10.1098/rsif.2014.1158 10.20870/IJVR.2010.9.2.2767 10.1109/ICDE.2010.5447930 10.14778/2536206.2536221 10.1007/978-3-642-61544-3 10.1038/nature08891 10.1109/TKDE.2007.190737 10.1145/1183614.1183729 10.1109/ICDE.2004.1320009 10.2197/ipsjtrans.6.65 10.1145/1869983.1869990 10.1109/TAI.1997.632306 10.1109/SSDBM.2006.45 10.1007/978-3-540-24741-8_44 10.1109/TIP.2012.2186146 10.14778/2732939.2732940 10.1145/2422966.2422980 10.1109/TKDE.2013.77 10.1109/ICDE.2015.7113350 10.1145/2461381.2461393 10.1145/1653760.1653766 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016 |
| DBID | 97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| DOI | 10.1109/TKDE.2016.2598171 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEL CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEL url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1558-2191 |
| EndPage | 2841 |
| ExternalDocumentID | 4223975921 10_1109_TKDE_2016_2598171 7542198 |
| Genre | orig-research |
| GroupedDBID | -~X .DC 0R~ 29I 4.4 5GY 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACIWK AENEX AGQYO AGSQL AHBIQ AKQYR ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD F5P HZ~ IEDLZ IFIPE IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 UHB AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c293t-c0a476da54b42872ac46011722c0d6d8ccea5709f4e1065cc4e03ca00d0fb2ea3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 51 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000385702000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1041-4347 |
| IngestDate | Sun Nov 09 08:14:16 EST 2025 Tue Nov 18 21:01:00 EST 2025 Sat Nov 29 04:46:39 EST 2025 Wed Aug 27 02:52:16 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 11 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c293t-c0a476da54b42872ac46011722c0d6d8ccea5709f4e1065cc4e03ca00d0fb2ea3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 1831011405 |
| PQPubID | 85438 |
| PageCount | 15 |
| ParticipantIDs | ieee_primary_7542198 proquest_journals_1831011405 crossref_citationtrail_10_1109_TKDE_2016_2598171 crossref_primary_10_1109_TKDE_2016_2598171 |
| PublicationCentury | 2000 |
| PublicationDate | 2016-11-01 |
| PublicationDateYYYYMMDD | 2016-11-01 |
| PublicationDate_xml | – month: 11 year: 2016 text: 2016-11-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on knowledge and data engineering |
| PublicationTitleAbbrev | TKDE |
| PublicationYear | 2016 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref34 ref12 nath (ref28) 2009 douglas (ref8) 2011 ref15 ref14 ref31 ref30 ref11 knuth (ref32) 1997; 2 ref10 ref2 ref1 ref17 ref16 ref19 ref18 van krevelen (ref3) 2010; 9 risken (ref33) 1996 ref24 hershberger (ref9) 1992 ref23 ref26 ref25 kjærgaard (ref20) 2009 ref21 keogh (ref22) 1998 heckbert (ref29) 1995 ref27 ref7 ref4 ref6 ref5 |
| References_xml | – ident: ref10 doi: 10.1007/s10707-013-0184-0 – start-page: 15 year: 2011 ident: ref8 publication-title: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature – ident: ref16 doi: 10.1145/1999320.1999333 – ident: ref19 doi: 10.1145/1140104.1140110 – ident: ref23 doi: 10.1109/ICDM.2001.989531 – ident: ref31 doi: 10.1007/s10707-011-0144-5 – ident: ref30 doi: 10.1098/rsif.2014.1158 – start-page: 221 year: 2009 ident: ref20 article-title: Entracked: Energy-efficient robust position tracking for mobile devices publication-title: Proc 7th Int Conf Mobile Syst Appl Services – start-page: 157 year: 2009 ident: ref28 article-title: Energy efficient sensor data logging with amnesic flash storage publication-title: Proc Int Conf Inf Process Sensor Netw – volume: 2 year: 1997 ident: ref32 publication-title: The Art of Computer Programming Seminumerical Algorithms – volume: 9 year: 2010 ident: ref3 article-title: A survey of augmented reality technologies, applications and limitations publication-title: Int J Virtual Reality doi: 10.20870/IJVR.2010.9.2.2767 – ident: ref26 doi: 10.1109/ICDE.2010.5447930 – ident: ref13 doi: 10.14778/2536206.2536221 – start-page: 239 year: 1998 ident: ref22 article-title: An enhanced representation of time series which allows fast and accurate classification, clustering and relevance feedback publication-title: Proc Int'l Conf Knowledge Discovery and Data Mining – year: 1996 ident: ref33 publication-title: The Fokker-Planck Equation Methods of Solutions and Applications doi: 10.1007/978-3-642-61544-3 – ident: ref6 doi: 10.1038/nature08891 – ident: ref25 doi: 10.1109/TKDE.2007.190737 – ident: ref27 doi: 10.1145/1183614.1183729 – ident: ref24 doi: 10.1109/ICDE.2004.1320009 – ident: ref18 doi: 10.2197/ipsjtrans.6.65 – ident: ref7 doi: 10.1145/1869983.1869990 – start-page: 134 year: 1992 ident: ref9 article-title: Speeding up the Douglas-Peucker line-simplification algorithm publication-title: Proc 5th Int Symp Spatial Data Handling – ident: ref21 doi: 10.1109/TAI.1997.632306 – ident: ref17 doi: 10.1109/SSDBM.2006.45 – ident: ref34 doi: 10.1007/978-3-540-24741-8_44 – ident: ref12 doi: 10.1109/TIP.2012.2186146 – ident: ref14 doi: 10.14778/2732939.2732940 – year: 1995 ident: ref29 article-title: Survey of polygonal surface simplification algorithms[R] – ident: ref2 doi: 10.1145/2422966.2422980 – ident: ref15 doi: 10.1109/TKDE.2013.77 – ident: ref11 doi: 10.1109/ICDM.2001.989531 – ident: ref1 doi: 10.1109/ICDE.2015.7113350 – ident: ref5 doi: 10.1145/2461381.2461393 – ident: ref4 doi: 10.1145/1653760.1653766 |
| SSID | ssj0008781 |
| Score | 2.444252 |
| Snippet | State-of-the-art trajectory compression methods usually involve high space-time complexity or yield unsatisfactory compression rates, leading to rapid... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 2827 |
| SubjectTerms | ageing Algorithm design and analysis Algorithms amnesic Complexity theory Compression algorithms constant complexity Hardware Online trajectory compression resource-constrained Runtime Trajectory Wildlife |
| Title | A Novel Framework for Online Amnesic Trajectory Compression in Resource-Constrained Environments |
| URI | https://ieeexplore.ieee.org/document/7542198 https://www.proquest.com/docview/1831011405 |
| Volume | 28 |
| WOSCitedRecordID | wos000385702000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEL customDbUrl: eissn: 1558-2191 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0008781 issn: 1041-4347 databaseCode: RIE dateStart: 19890101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH7M4UEPTjfF6ZQcPInd0jZt2uPQDUEZHqbsVtuXFCazk_0C_3uT9AcTRfDUHpIQ-jXv5Uveex_AFRNhiA51LeEwYTGJiRUznliS-4kTitRHI8ny8shHo2AyCZ9qcFPlwkgpTfCZ7OpXc5cv5rjWR2U9rdaqSPIO7HDO81ytyuoG3AiSKnahOJHLeHGDadOwN364G-ggLr-r9vqBze1vPsiIqvywxMa9DBv_m9ghHBTbSNLPcT-Cmsya0CglGkixYpuwv1VvsAWvfTKab-SMDMuQLKL2rCQvN0r678rsTZEo9_VmzvI_iR4wD5TNyDQj5Vm_pWU-jbiEFGSwlSp3DM_Dwfj23iokFixUfn5lIVXI-CL2WKK5kxMj83WVOMdBKnwRIMrY4zRMmVTc0UNkkroYUypomjgydk-gns0zeQokEWgLyYMwESnzUxGkiX4yXQ9f0SK_DbT86BEW9cf1TGeR4SE0jDROkcYpKnBqw3XV5SMvvvFX45YGpmpYYNKGTolsVCzPZWRreTXFBKl39nuvc9jTY-dJhx2orxZreQG7uFlNl4tL8-d9AemZ11I |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH5BNFEPoqARRe3Bk3HQje7XkSgEAxIPaLjN7bVLMDgMvxL_e9tuIxiNiaf10G5Nv7WvX_ve-wCuGfd9tGjT4BbjBhMYGSFzI0O4TmT5PHZQS7K89N3BwBuN_KcC3K5jYYQQ2vlM1FVR3-XzKS7VUVlDqbVKkrwF2zaTpTRaa73ueq6WJJX8QrKiJnOzO0yT-o1h776t3Licutzte6ZrfrNCWlblx1qsDUyn9L-uHcJBtpEkrRT5IyiIpAylXKSBZHO2DPsbGQcr8Noig-lKTEgnd8oictdK0oSjpPUuF74xEmnA3vRp_idRL0xdZRMyTkh-2m8ooU8tLyE4aW8Eyx3Dc6c9vOsamciCgdLSLwykEhuHhzaLFHuyQmSOyhNnWUi5wz1EEdou9WMmJHu0EZmgTQwp5TSOLBE2T6CYTBNxCiTiaHLhen7EY-bE3Isj9WQqI74kRk4VaD7oAWYZyFVPJ4FmItQPFE6BwinIcKrCzbrJR5p-46_KFQXMumKGSRVqObJBNkHngakE1iQXpPbZ762uYLc7fOwH_YdB7xz21HfSEMQaFBezpbiAHVwtxvPZpf4LvwBDndqZ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Novel+Framework+for+Online+Amnesic+Trajectory+Compression+in+Resource-Constrained+Environments&rft.jtitle=IEEE+transactions+on+knowledge+and+data+engineering&rft.au=Jiajun+Liu&rft.au=Kun+Zhao&rft.au=Sommer%2C+Philipp&rft.au=Shuo+Shang&rft.date=2016-11-01&rft.pub=IEEE&rft.issn=1041-4347&rft.volume=28&rft.issue=11&rft.spage=2827&rft.epage=2841&rft_id=info:doi/10.1109%2FTKDE.2016.2598171&rft.externalDocID=7542198 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1041-4347&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1041-4347&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1041-4347&client=summon |