惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

博客园 - 聂微东
MyScale Blog
MyScale Blog
The GitHub Blog
The GitHub Blog
C
Check Point Blog
M
MIT News - Artificial intelligence
U
Unit 42
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
H
Help Net Security
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
D
DataBreaches.Net
大猫的无限游戏
大猫的无限游戏
D
Docker
Last Week in AI
Last Week in AI
IT之家
IT之家
F
Fortinet All Blogs
A
About on SuperTechFans
P
Proofpoint News Feed
The Cloudflare Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
B
Blog RSS Feed
博客园_首页
月光博客
月光博客
博客园 - 司徒正美
Y
Y Combinator Blog

cs.IT updates on arXiv.org

Theoretical Limits of Language Model Alignment $f$-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregation When Semantic Communication Meets Queueing: Cross-Layer Latency and Task Fidelity Optimization Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Expert Routing for Communication-Efficient MoE via Finite Expert Banks Contextual Memory-Enhanced Source Coding for Low-SNR Communications Realizable Bayes-Consistency for General Metric Losses Leveraging Code Automorphisms for Improved Syndrome-Based Neural Decoding A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning Dueling DDQN-Based Adaptive Multi-Objective Handover Optimization for LEO Satellite Networks The Causal Description Gap: Information-Theoretic Separations Across Pearl's Hierarchy Optimization of CV-QKD Under Practical Constraints Benchmarking Wireless Representations: High-Dimensional vs. Compressed Embeddings for Efficiency and Robustness Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels SwiftChannel: Algorithm-Hardware Co-Design for Deep Learning-Based 5G Channel Estimation Evolving Token Communication with Parametric Memory Network Remote Action Generation: Remote Control with Minimal Communication The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions Stabilizing Private LASSO under Heterogeneous Covariates via Anisotropic Objective Perturbation Linear-Readout Floors and Threshold Recovery in Computation in Superposition Soft Graph Diffusion Transformer for MIMO Detection Hierarchical Federated Learning for Networked AI: From Communication Saving to Architecture-Aware Design Exponential families from a single KL identity MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairness Diffusion-OAMP for Joint Image Compression and Wireless Transmission Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
K-Means Fingerprint Clustering for Low-Complexity Floor E...
Alireza Razavi, Mikko Valkama, Elena-Simona Lohan · 2015-09-05 · via cs.IT updates on arXiv.org

Indoor localization in multi-floor buildings is an important research problem. Finding the correct floor, in a fast and efficient manner, in a shopping mall or an unknown university building can save the users' search time and can enable a myriad of Location Based Services in the future. One of the most widely spread techniques for floor estimation in multi-floor buildings is the fingerprinting-based localization using Received Signal Strength (RSS) measurements coming from indoor networks, such as WLAN and BLE. The clear advantage of RSS-based floor estimation is its ease of implementation on a multitude of mobile devices at the Application Programming Interface (API) level, because RSS values are directly accessible through API interface. However, the downside of a fingerprinting approach, especially for large-scale floor estimation and positioning solutions, is their need to store and transmit a huge amount of fingerprinting data. The problem becomes more severe when the localization is intended to be done on mobile devices which have limited memory, power, and computational resources. An alternative floor estimation method, which has lower complexity and is faster than the fingerprinting is the Weighted Centroid Localization (WCL) method. The trade-off is however paid in terms of a lower accuracy than the one obtained with traditional fingerprinting with Nearest Neighbour (NN) estimates. In this paper a novel K-means-based method for floor estimation via fingerprint clustering of WiFi and various other positioning sensor outputs is introduced. Our method achieves a floor estimation accuracy close to the one with NN fingerprinting, while significantly improves the complexity and the speed of the floor detection algorithm. The decrease in the database size is achieved through storing and transmitting only the cluster heads (CH's) and their corresponding floor labels.