2012
DOI: 10.1016/j.sigpro.2012.04.004
|View full text |Cite
|
Sign up to set email alerts
|

On the identifiability problem in the presence of random nuisance parameters

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 18 publications
0
9
0
Order By: Relevance
“…It can be proved [13] that, without loss of generality, if the rotation around z is applied first, the azimuth measurement bias dθ i and the attitude bias dξ i are not identifiable and have to be merged into a single bias. Because of this geometrical coupling, we can define a single bias error as dζ i =dξ i +dθ i .…”
Section: The Absolute Grid-locking Problemmentioning
confidence: 99%
See 3 more Smart Citations
“…It can be proved [13] that, without loss of generality, if the rotation around z is applied first, the azimuth measurement bias dθ i and the attitude bias dξ i are not identifiable and have to be merged into a single bias. Because of this geometrical coupling, we can define a single bias error as dζ i =dξ i +dθ i .…”
Section: The Absolute Grid-locking Problemmentioning
confidence: 99%
“…h v v n (13) with l=1,...,N t where the registration errors appear explicitly. From the alignment equation in (13) one can infer that the two position error vectors, dt 1 and dt 2 , cannot be estimated separately but only their linear combination can be estimated.…”
Section: The Linear Least Squares Estimatormentioning
confidence: 99%
See 2 more Smart Citations
“…Typically, if an SLM has hierarchial structures [17,18], latent variables [1,16], state variables [13], nuisance parameters [19] or coupled submodels [11,12], the model may be unidentifiable. Due to the universal existence of nonidentifiability, Watanabe pointed out that "almost all learning machines are singular" [18].…”
Section: Introductionmentioning
confidence: 99%