On Solving Ambiguity Resolution with Robust Chinese Remainder Theorem for Multiple Numbers

06/29/2018
by   Hanshen Xiao, et al.
0

Chinese Remainder Theorem (CRT) is a powerful approach to solve ambiguity resolution related problems such as undersampling frequency estimation and phase unwrapping which are widely applied in localization. Recently, the deterministic robust CRT for multiple numbers (RCRTMN) was proposed, which can reconstruct multiple integers with unknown relationship of residue correspondence via generalized CRT and achieves robustness to bounded errors simultaneously. Naturally, RCRTMN sheds light on CRT-based estimation for multiple objectives. In this paper, two open problems arising that how to introduce statistical methods into RCRTMN and deal with arbitrary errors introduced in residues are solved. We propose the extended version of RCRTMN assisted with Maximum Likelihood Estimation (MLE), which can tolerate unrestricted errors and bring considerable improvement in robustness.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/28/2018

Statistical Robust Chinese Remainder Theorem for Multiple Numbers: Wrapped Gaussian Mixture Model

Generalized Chinese Remainder Theorem (CRT) has been shown to be a power...
research
10/01/2016

Radial Velocity Retrieval for Multichannel SAR Moving Targets with Time-Space Doppler De-ambiguity

In this paper, with respect to multichannel synthetic aperture radars (S...
research
06/05/2016

Relaxation of the EM Algorithm via Quantum Annealing

The EM algorithm is a novel numerical method to obtain maximum likelihoo...
research
01/31/2020

Exact and Robust Reconstruction of Integer Vectors Based on Multidimensional Chinese Remainder Theorem (MD-CRT)

The robust Chinese remainder theorem (CRT) has been recently proposed fo...
research
10/02/2018

Super-Resolution via Conditional Implicit Maximum Likelihood Estimation

Single-image super-resolution (SISR) is a canonical problem with diverse...
research
10/17/2019

Calculating Optimistic Likelihoods Using (Geodesically) Convex Optimization

A fundamental problem arising in many areas of machine learning is the e...

Please sign up or login with your details

Forgot password? Click here to reset