Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bryan Teague

dblp:211/9225 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2024
0000-0003-4509-9190ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Wireless sensing and localization · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless sensing and localization › network localization
cooperative localization
0.612022
Network Localization and Navigation With Scalable Inference and Efficient Operation · IEEE Trans. Mob. Comput. 2022
Wireless sensing and localization › localization algorithms
distributed localization
0.612022
Network Localization and Navigation With Scalable Inference and Efficient Operation · IEEE Trans. Mob. Comput. 2022
Wireless sensing and localization › RF sensing
ultra-wideband sensing
0.212022
Network Localization and Navigation With Scalable Inference and Efficient Operation · IEEE Trans. Mob. Comput. 2022

Methods — techniques the papers use, named apart from their topics

temporal cooperation · 0.6spatial cooperation · 0.6distributed inference · 0.6
YearPublicationVenuePosition
2024 Unstructured Simultaneous Localization and Synchronization
abstract
Dynamic networks of physical nodes that require self-localization and synchronization are on the horizon. Existing infrastructure-based positioning and timing solutions are not fully sufficient for many applications. A peer-to-peer architecture known as cooperative localization and synchronization (CLAS) is a promising alternative when infrastructure is unavailable or insufficiently accurate. Efficient solutions for small, low-cost devices and platforms will be created by blending the functions of communication, localization, and synchronization into a single paradigm. Before CLAS can be widely adopted, we believe that it is necessary to develop localization and synchronization methods that do not impose additional constraints on the wireless communication system and are able to leverage a wireless broadcast transmission modality for enhanced scalability. We propose the first CLAS data fusion algorithm capable of operating over an unstructured communication network with no requirement for a custom pairwise communication protocol or global time anchors. The algorithm utilizes transmit/receive timestamp pairs from any received message, including a broadcast, and outputs an updated joint estimate of spatial and temporal state parameters. Both centralized and distributed versions of the algorithm are shown to be accurate and robust when used in conjunction with a commercially available ultra-wideband (UWB) radio. Results are presented for both simulated timestamps and data collected with a broadcast network of UWB radios.
Paul Berestesky, Florian Meyer, Bryan Teague
ICC3
2022 Data Fusion for Radio Frequency SLAM with Robust Sampling
Erik Leitinger, Bryan Teague, Mingchao Liang, Florian Meyer
FUSION2
2022 Message Passing-Based Cooperative Localization with Embedded Particle Flow
abstract
Cooperative localization is an enabling technology for the IoT that will introduce innovative services for modern convenience and public safety. Particle-based belief propagation (BP) is a state-of-the-art method for cooperative localization. However, in large and dense cooperative localization networks, particle-based BP suffers from particle degeneracy. In this paper, we propose a new method that combines particle-based BP and particle flow (PF) and can avoid this detrimental effect. To perform operations on the graph effectively, particles are moved towards regions of high likelihood based on the solution of a partial differential equation. We show that the proposed PF-BP algorithm can significantly outperform conventional particle-based BP in accuracy and runtime.
Lukas Wielandner, Erik Leitinger, Florian Meyer, Bryan Teague, Klaus Witrisal
ICASSP4
2022 Network Localization and Navigation With Scalable Inference and Efficient Operation
abstract
Location-aware networks enable new services and applications in fields such as autonomous driving, smart cities, and the Internet-of-Things. Network localization and navigation (NLN) is a recently proposed paradigm for accurate ubiquitous localization without the need for extensive infrastructure. In NLN, devices form an interconnected network for the purpose of cooperatively localizing one another. This paper introduces Peregrine, a system that combines real-time distributed NLN algorithms with ultra-wideband (UWB) sensing and communication. The Peregrine software integrates three NLN algorithms to jointly perform 3-D localization and network operation in a technology agnostic manner, leveraging both spatial and temporal cooperation. Peregrine hardware is composed of compact low-cost devices that comprise a microprocessor and a UWB radio. The contribution of each algorithmic component is characterized through indoor network experimentation. Results show that Peregrine is robust, scalable, and capable of sub-meter accuracy in challenging wireless environments.
Bryan Teague, Zhenyu Liu 0003, Florian Meyer, Andrea Conti 0001, Moe Z. Win
IEEE Trans. Mob. Comput.1