Multiple Change-Point Estimation With a Total Variation Penalty - Archive ouverte HAL Access content directly
Journal Articles Journal of the American Statistical Association Year : 2010

Multiple Change-Point Estimation With a Total Variation Penalty

(1) , (2)
1
2

Abstract

We propose a new approach for dealing with the estimation of the location of change-points in one-dimensional piecewise constant signals observed in white noise. Our approach consists in reframing this task in a variable selection context. We use a penalized least-square criterion with a ℓ1-type penalty for this purpose. We explain how to implement this method in practice by using the LARS / LASSO algorithm. We then prove that, in an appropriate asymptotic framework, this method provides consistent estimators of the change points with an almost optimal rate. We finally provide an improved practical version of this method by combining it with a reduced version of the dynamic programming algorithm and we successfully compare it with classical methods.

Dates and versions

hal-00923474 , version 1 (02-01-2014)

Identifiers

Cite

Zaid Harchaoui, Céline Lévy-Leduc. Multiple Change-Point Estimation With a Total Variation Penalty. Journal of the American Statistical Association, 2010, 105 (492), pp.1480-1493. ⟨10.1198/jasa.2010.tm09181⟩. ⟨hal-00923474⟩
500 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More