Clutter Suppression for Indoor Self-Localization Systems by Iteratively Reweighted Low-Rank Plus Sparse Recovery

Jesús Sánchez-Pastor1, Udaya S K P Miriya Thanthrige2, Furkan Ilgac2

  • 1Institute of Microwave Engineering and Photonics, Technical University of Darmstadt, 64283 Darmstadt, Germany.

Summary

A novel iterative algorithm using low-rank plus sparse recovery (RPCA) effectively suppresses clutter in passive RFID-based self-localization. This method significantly improves tag detection, especially for low-Q tags, outperforming traditional time-gating techniques.

Related Concept Videos

Residuals and Least-Squares Property01:11

Residuals and Least-Squares Property

The vertical distance between the actual value of y and the estimated value of y. In other words, it measures the vertical distance between the actual data point and the predicted point on the line
If the observed data point lies above the line, the residual is positive, and the line underestimates the actual data value for y. If the observed data point lies below the line, the residual is negative, and the line overestimates the actual data value for y.
The process of fitting the best-fit...
8.1K
Reducing Line Loss01:18

Reducing Line Loss

In a three-phase circuit, line loss is an indicator of energy dissipated as heat due to the resistance of transmission lines. To address this, incorporating transformers into the system—a step-up transformer at the source and a step-down transformer at the load—is a strategic solution. Two three-phase transformers are introduced to improve this.
With a step-up transformer at the source, the voltage is increased, thereby reducing the current in the transmission lines since power loss...
217
Cluster Sampling Method01:20

Cluster Sampling Method

Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
13.1K
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
170
Quantifying and Rejecting Outliers: The Grubbs Test01:02

Quantifying and Rejecting Outliers: The Grubbs Test

Sometimes, a data set can have a recorded numerical observation that greatly  deviates from the rest of the data. Assuming that the data is normally distributed, a statistical method called the Grubbs test can be used to determine whether the observation is truly an outlier.  To perform a two-tailed Grubbs test, first, calculate the absolute difference between the outlier and the mean. Then, calculate the ratio between this difference and the standard deviation of the sample. This...
2.7K
Elastic Collisions: Case Study01:15

Elastic Collisions: Case Study

Elastic collision of a system demands conservation of both momentum and kinetic energy. To solve problems involving one-dimensional elastic collisions between two objects, the equations for conservation of momentum and conservation of internal kinetic energy can be used. For the two objects, the sum of momentum before the collision equals the total momentum after the collision. An elastic collision conserves internal kinetic energy, and so the sum of kinetic energies before the collision equals...
14.6K