Barankin-Type Lower Bound on Multiple Change-Point Estimation

We compute lower bounds on the mean-square error of multiple change-point estimation. In this context, the parameters are discrete and the Cramer-Rao bound is not applicable. Consequently, we focus on computing the Barankin bound (BB), the greatest lower bound on the covariance of any unbiased estim...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: La Rosa, Patricio S., Renaux, Alexandre, Muravchik, Carlos Horacio, Nehorai, Arye
Formato: Articulo
Lenguaje:Inglés
Publicado: 2010
Materias:
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/127365
https://ieeexplore.ieee.org/document/5545423
Aporte de:
id I19-R120-10915-127365
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ingeniería Electrónica
Ingeniería
Barankin bound
Barankin information matrix
Loewner partial ordering
spellingShingle Ingeniería Electrónica
Ingeniería
Barankin bound
Barankin information matrix
Loewner partial ordering
La Rosa, Patricio S.
Renaux, Alexandre
Muravchik, Carlos Horacio
Nehorai, Arye
Barankin-Type Lower Bound on Multiple Change-Point Estimation
topic_facet Ingeniería Electrónica
Ingeniería
Barankin bound
Barankin information matrix
Loewner partial ordering
description We compute lower bounds on the mean-square error of multiple change-point estimation. In this context, the parameters are discrete and the Cramer-Rao bound is not applicable. Consequently, we focus on computing the Barankin bound (BB), the greatest lower bound on the covariance of any unbiased estimator, which is still valid for discrete parameters. In particular, we compute the multi-parameter version of the Hammersley- Chapman-Robbins, which is a Barankin-type lower bound. We first give the structure of the so-called Barankin information matrix (BIM) and derive a simplified form of the BB. We show that the particular case of two change points is fundamental to finding the inverse of this matrix. Several closed-form expressions of the elements of BIM are given for changes in the parameters of Gaussian and Poisson distributions. The computation of the BB requires finding the supremum of a finite set of positive definite matrices with respect to the Loewner partial ordering. Although each matrix in this set of candidates is a lower bound on the covariance matrix of the estimator, the existence of a unique supremum w.r.t. to this set, i.e., the tightest bound, might not be guaranteed. To overcome this problem, we compute a suitable minimal-upper bound to this set given by the matrix associated with the Loewner-John Ellipsoid of the set of hyper-ellipsoids associated to the set of candidate lower-bound matrices. Finally, we present some numerical examples to compare the proposed approximated BB with the performance achieved by the maximum likelihood estimator.
format Articulo
Articulo
author La Rosa, Patricio S.
Renaux, Alexandre
Muravchik, Carlos Horacio
Nehorai, Arye
author_facet La Rosa, Patricio S.
Renaux, Alexandre
Muravchik, Carlos Horacio
Nehorai, Arye
author_sort La Rosa, Patricio S.
title Barankin-Type Lower Bound on Multiple Change-Point Estimation
title_short Barankin-Type Lower Bound on Multiple Change-Point Estimation
title_full Barankin-Type Lower Bound on Multiple Change-Point Estimation
title_fullStr Barankin-Type Lower Bound on Multiple Change-Point Estimation
title_full_unstemmed Barankin-Type Lower Bound on Multiple Change-Point Estimation
title_sort barankin-type lower bound on multiple change-point estimation
publishDate 2010
url http://sedici.unlp.edu.ar/handle/10915/127365
https://ieeexplore.ieee.org/document/5545423
work_keys_str_mv AT larosapatricios barankintypelowerboundonmultiplechangepointestimation
AT renauxalexandre barankintypelowerboundonmultiplechangepointestimation
AT muravchikcarloshoracio barankintypelowerboundonmultiplechangepointestimation
AT nehoraiarye barankintypelowerboundonmultiplechangepointestimation
bdutipo_str Repositorios
_version_ 1764820451627892738