Informatica logo


Login Register

  1. Home
  2. Issues
  3. Volume 11, Issue 3 (2000)
  4. Optimal Segmentation of Random Sequences

Informatica

Information Submit your article For Referees Help ATTENTION!
  • Article info
  • Related articles
  • More
    Article info Related articles

Optimal Segmentation of Random Sequences
Volume 11, Issue 3 (2000), pp. 243–256
Antanas Lipeika  

Authors

 
Placeholder
https://doi.org/10.3233/INF-2000-11303
Pub. online: 1 January 2000      Type: Research Article     

Received
1 July 2000
Published
1 January 2000

Abstract

This paper deals with maximum likelihood and least square segmentation of autoregressive random sequences with abruptly changing parameters. Conditional distribution of the observations has been derived. Objective function was modified to the form suitable to apply dynamic programming method for its optimization. Expressions of Bellman functions for this case were obtained. Performance of presented approach is illustrated with simulation examples and segmentation of speech signals examples.

Related articles PDF XML
Related articles PDF XML

Copyright
No copyright data available.

Keywords
optimal segmentation maximum likelihood least square dynamic programming

Metrics
since January 2020
664

Article info
views

0

Full article
views

421

PDF
downloads

178

XML
downloads

Export citation

Copy and paste formatted citation
Placeholder

Download citation in file


Share


RSS

INFORMATICA

  • Online ISSN: 1822-8844
  • Print ISSN: 0868-4952
  • Copyright © 2023 Vilnius University

About

  • About journal

For contributors

  • OA Policy
  • Submit your article
  • Instructions for Referees
    •  

    •  

Contact us

  • Institute of Data Science and Digital Technologies
  • Vilnius University

    Akademijos St. 4

    08412 Vilnius, Lithuania

    Phone: (+370 5) 2109 338

    E-mail: informatica@mii.vu.lt

    https://informatica.vu.lt/journal/INFORMATICA
Powered by PubliMill  •  Privacy policy