Ordinal UNLOC: Target Localization with Noisy and Incomplete Distance
Measures
- URL: http://arxiv.org/abs/2105.02671v1
- Date: Thu, 6 May 2021 13:54:31 GMT
- Title: Ordinal UNLOC: Target Localization with Noisy and Incomplete Distance
Measures
- Authors: Mahesh K. Banavar, Shandeepa Wickramasinghe, Monalisa Achalla, Jie Sun
- Abstract summary: A main challenge in target localization arises from the lack of reliable distance measures.
We develop a new computational framework to estimate the location of a target without the need for reliable distance measures.
- Score: 1.6836876499886007
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: A main challenge in target localization arises from the lack of reliable
distance measures. This issue is especially pronounced in indoor settings due
to the presence of walls, floors, furniture, and other dynamically changing
conditions such as the movement of people and goods, varying temperature, and
airflows. Here, we develop a new computational framework to estimate the
location of a target without the need for reliable distance measures. The
method, which we term Ordinal UNLOC, uses only ordinal data obtained from
comparing the signal strength from anchor pairs at known locations to the
target. Our estimation technique utilizes rank aggregation, function learning
as well as proximity-based unfolding optimization. As a result, it yields
accurate target localization for common transmission models with unknown
parameters and noisy observations that are reminiscent of practical settings.
Our results are validated by both numerical simulations and hardware
experiments.
Related papers
- Pre-training Contextual Location Embeddings in Personal Trajectories via
Efficient Hierarchical Location Representations [30.493743596793212]
Pre-training the embedding of a location generated from human mobility data has become a popular method for location based services.
Previous studies have handled less than ten thousand distinct locations, which is insufficient in the real-world applications.
We propose a Geo-Tokenizer, designed to efficiently reduce the number of locations to be trained by representing a location as a combination of several grids at different scales.
arXiv Detail & Related papers (2023-10-02T14:40:24Z) - SpatialRank: Urban Event Ranking with NDCG Optimization on
Spatiotemporal Data [55.609946936979036]
We propose a novel spatial event ranking approach named SpatialRank.
We show that SpatialRank can effectively identify the top riskiest locations of crimes and traffic accidents.
arXiv Detail & Related papers (2023-09-30T06:20:21Z) - DRAG: Divergence-based Adaptive Aggregation in Federated learning on
Non-IID Data [11.830891255837788]
Local gradient descent (SGD) is a fundamental approach in achieving communication efficiency in Federated Learning (FL)
We introduce a novel metric called degree of divergence," quantifying the angle between the local gradient and the global reference direction.
We propose the divergence-based adaptive aggregation (DRAG) algorithm, which dynamically drags" the received local updates toward the reference direction in each round without requiring extra communication overhead.
arXiv Detail & Related papers (2023-09-04T19:40:58Z) - Concrete Score Matching: Generalized Score Matching for Discrete Data [109.12439278055213]
"Concrete score" is a generalization of the (Stein) score for discrete settings.
"Concrete Score Matching" is a framework to learn such scores from samples.
arXiv Detail & Related papers (2022-11-02T00:41:37Z) - Adaptive Local-Component-aware Graph Convolutional Network for One-shot
Skeleton-based Action Recognition [54.23513799338309]
We present an Adaptive Local-Component-aware Graph Convolutional Network for skeleton-based action recognition.
Our method provides a stronger representation than the global embedding and helps our model reach state-of-the-art.
arXiv Detail & Related papers (2022-09-21T02:33:07Z) - Rethinking Spatial Invariance of Convolutional Networks for Object
Counting [119.83017534355842]
We try to use locally connected Gaussian kernels to replace the original convolution filter to estimate the spatial position in the density map.
Inspired by previous work, we propose a low-rank approximation accompanied with translation invariance to favorably implement the approximation of massive Gaussian convolution.
Our methods significantly outperform other state-of-the-art methods and achieve promising learning of the spatial position of objects.
arXiv Detail & Related papers (2022-06-10T17:51:25Z) - Real-time Outdoor Localization Using Radio Maps: A Deep Learning
Approach [59.17191114000146]
LocUNet: A convolutional, end-to-end trained neural network (NN) for the localization task.
We show that LocUNet can localize users with state-of-the-art accuracy and enjoys high robustness to inaccuracies in the estimations of radio maps.
arXiv Detail & Related papers (2021-06-23T17:27:04Z) - PDNet: Towards Better One-stage Object Detection with Prediction
Decoupling [37.83405509385431]
We propose a prediction-target-decoupled detector named PDNet to establish a more flexible detection paradigm.
With a single ResNeXt-64x4d-101 as the backbone, our detector achieves 48.7 AP with single-scale testing.
arXiv Detail & Related papers (2021-04-28T16:48:04Z) - Cross-Entropy Method Variants for Optimization [0.0]
Cross-entropy (CE) method is a popular method for optimization due to its simplicity and effectiveness.
Certain objective functions may be computationally expensive to evaluate, and the CE-method could potentially get stuck in local minima.
We introduce novel variants of the CE-method to address these concerns.
arXiv Detail & Related papers (2020-09-18T19:51:30Z) - Scope Head for Accurate Localization in Object Detection [135.9979405835606]
We propose a novel detector coined as ScopeNet, which models anchors of each location as a mutually dependent relationship.
With our concise and effective design, the proposed ScopeNet achieves state-of-the-art results on COCO.
arXiv Detail & Related papers (2020-05-11T04:00:09Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.