IDEAS home Printed from https://ideas.repec.org/a/taf/jnlasa/v119y2024i547p1945-1956.html
   My bibliography  Save this article

Frequency Detection and Change Point Estimation for Time Series of Complex Oscillation

Author

Listed:
  • Hau-Tieng Wu
  • Zhou Zhou

Abstract

We consider detecting the evolutionary oscillatory pattern of a signal when it is contaminated by nonstationary noises with complexly time-varying data generating mechanism. A high-dimensional dense progressive periodogram test is proposed to accurately detect all oscillatory frequencies. A further phase-adjusted local change point detection algorithm is applied in the frequency domain to detect the locations at which the oscillatory pattern changes. Our method is shown to be able to detect all oscillatory frequencies and the corresponding change points within an accurate range with a prescribed probability asymptotically. A Gaussian approximation scheme and an overlapping-block multiplier bootstrap methodology for sums of complex-valued high dimensional nonstationary time series without variance lower bounds are established, which could be of independent interest. This study is motivated by oscillatory frequency estimation and change point detection problems encountered in physiological time series analysis. An application to spindle detection and estimation in electroencephalogram recorded during sleep is used to illustrate the usefulness of the proposed methodology. Supplementary materials for this article are available online including a standardized description of the materials available for reproducing the work.

Suggested Citation

  • Hau-Tieng Wu & Zhou Zhou, 2024. "Frequency Detection and Change Point Estimation for Time Series of Complex Oscillation," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 119(547), pages 1945-1956, July.
  • Handle: RePEc:taf:jnlasa:v:119:y:2024:i:547:p:1945-1956
    DOI: 10.1080/01621459.2023.2229486
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01621459.2023.2229486
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01621459.2023.2229486?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:jnlasa:v:119:y:2024:i:547:p:1945-1956. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/UASA20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.