liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Identification of Piecewise Affine Systems Using Sum-of-Norms Regularization
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
2011 (English)In: Proceedings of the 18th IFAC World Congress, 2011, 6640-6645 p.Conference paper, Published paper (Refereed)
Abstract [en]

Systems today often consist of logic switches working besides continuous physical systems. The demand for novel hybrid system identification algorithms is therefore of growing interest and essential for the development of control algorithms for this type of systems. An important type of hybrid systems is piecewise affine systems. The identification of piecewise affine systems is here tackled by overparametrizing and assigning a regressor-parameter to each of the observations. The regressor parameters are forced to be the same if that not causes a major increase in the fit term. The formulation takes the shape of a least-squares problem with sum-of-norms regularization over regressor parameter differences, a generalization of l1-regularization. The regularization constant is used to trade off fit and the number of partitions of the model.

Place, publisher, year, edition, pages
2011. 6640-6645 p.
Keyword [en]
Hybrid systems modeling and control, Nonlinear system identification, Nonparametric methods
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:liu:diva-60984DOI: 10.3182/20110828-6-IT-1002.00611ISBN: 978-3-902661-93-7 (print)OAI: oai:DiVA.org:liu-60984DiVA: diva2:360026
Conference
18th IFAC World Congress, Milano, Italy, 28 August-2 September, 2011
Projects
CADICS
Funder
Swedish Foundation for Strategic Research Swedish Research Council
Available from: 2013-04-04 Created: 2010-11-01 Last updated: 2013-07-10Bibliographically approved
In thesis
1. Regularization for Sparseness and Smoothness: Applications in System Identification and Signal Processing
Open this publication in new window or tab >>Regularization for Sparseness and Smoothness: Applications in System Identification and Signal Processing
2010 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

In system identification, the Akaike Information Criterion (AIC) is a well known method to balance the model fit against model complexity. Regularization here acts as a price on model complexity. In statistics and machine learning, regularization has gained popularity due to modeling methods such as Support Vector Machines (SVM), ridge regression and lasso. But also when using a Bayesian approach to modeling, regularization often implicitly shows up and can be associated with the prior knowledge. Regularization has also had a great impact on many applications, and very much so in clinical imaging. In e.g., breast cancer imaging, the number of sensors is physically restricted which leads to long scantimes. Regularization and sparsity can be used to reduce that. In Magnetic Resonance Imaging (MRI), the number of scans is physically limited and to obtain high resolution images, regularization plays an important role.

Regularization shows-up in a variety of different situations and is a well known technique to handle ill-posed problems and to control for overfit. We focus on the use of regularization to obtain sparseness and smoothness and discuss novel developments relevant to system identification and signal processing.

In regularization for sparsity a quantity is forced to contain elements equal to zero, or to be sparse. The quantity could e.g., be the regression parameter vectorof a linear regression model and regularization would then result in a tool for variable selection. Sparsity has had a huge impact on neighboring disciplines, such as machine learning and signal processing, but rather limited effect on system identification. One of the major contributions of this thesis is therefore the new developments in system identification using sparsity. In particular, a novel method for the estimation of segmented ARX models using regularization for sparsity is presented. A technique for piecewise-affine system identification is also elaborated on as well as several novel applications in signal processing. Another property that regularization can be used to impose is smoothness. To require the relation between regressors and predictions to be a smooth function is a way to control for overfit. We are here particularly interested in regression problems with regressors constrained to limited regions in the regressor-space e.g., a manifold. For this type of systems we develop a new regression technique, Weight Determination by Manifold Regularization (WDMR). WDMR is inspired byapplications in biology and developments in manifold learning and uses regularization for smoothness to obtain smooth estimates. The use of regularization for smoothness in linear system identification is also discussed.

The thesis also presents a real-time functional Magnetic Resonance Imaging (fMRI) bio-feedback setup. The setup has served as proof of concept and been the foundation for several real-time fMRI studies.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2010. 89 p.
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1351
Keyword
Regularization, sparsity, smothness, lasso, l1, fMRI, bio-feedback
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-60531 (URN)978-91-7393-287-5 (ISBN)
Public defence
2010-11-26, I101, Hus I, Campus Valla, Linköping University, Linköping, 10:15 (Swedish)
Opponent
Supervisors
Available from: 2010-11-03 Created: 2010-10-16 Last updated: 2010-11-03Bibliographically approved

Open Access in DiVA

fulltext(386 kB)477 downloads
File information
File name FULLTEXT01.pdfFile size 386 kBChecksum SHA-512
cffe60a8bc6e8639f735c25dbc7fdd37267986247c485d6223d5bb198071bac6e25d0fbdd2d683a8f1a2b9d81cc81f842987fad1e4e46383804b8392b0ea26e9
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Ohlsson, HenrikLjung, Lennart

Search in DiVA

By author/editor
Ohlsson, HenrikLjung, Lennart
By organisation
Automatic ControlThe Institute of Technology
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 477 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 374 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf