Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Orthogonal signal correction: algorithmic aspects and properties

View through CrossRef
AbstractThe objective of this paper is to present a modified algorithm for the orthogonal signal correction (OSC) filter based on the approaches proposed by Wold, Antti, Lindgren and Öhman (Chemometrics Intell. Lab. Syst. 1998; 44: 175–185) and Fearn (Chemometrics Intell. Lab. Syst. 2000; 50: 47–52). An OSC filter consists of a trio of building blocks: weights, components and loadings, $\font\mathbfit=cmmib10\def\bfit#1{\hbox{\mathbfit #1}} {\bf \{w_{{\bfit j}}, t_{{\bfit j}}, p_{{\bfit j}}\}_{{\bfit j}=1}^{{\bfit A}}}$. The original OSC filter of Wold et al. was based on the framework of the non‐linear iterative partial least squares (NIPALS) algorithm. Adopting this approach enabled the mathematical justification for the selection of the loading vectors p j and components t j, but there was no theoretical foundation for the selection of w j. In contrast, the approach of Fearn described an objective function for the selection of the weight vectors w j, but in this case there is no theoretical justification for either p j or t j. Combining both approaches, within a NIPALS framework, enables a clear theoretical basis for the selection of all three building blocks to be established. A number of orthogonal and optimal properties of the NIPALS‐based OSC algorithm, although previously reported, are also theoretically proven. Finally, it is shown that the modified OSC algorithm is equivalent to Fearn's OSC but is interpretable as a consequence of it being presented from a NIPALS perspective. This enables the possible extension of OSC to dynamic and non‐linear systems. Copyright © 2002 John Wiley & Sons, Ltd.
Title: Orthogonal signal correction: algorithmic aspects and properties
Description:
AbstractThe objective of this paper is to present a modified algorithm for the orthogonal signal correction (OSC) filter based on the approaches proposed by Wold, Antti, Lindgren and Öhman (Chemometrics Intell.
Lab.
Syst.
1998; 44: 175–185) and Fearn (Chemometrics Intell.
Lab.
Syst.
2000; 50: 47–52).
An OSC filter consists of a trio of building blocks: weights, components and loadings, $\font\mathbfit=cmmib10\def\bfit#1{\hbox{\mathbfit #1}} {\bf \{w_{{\bfit j}}, t_{{\bfit j}}, p_{{\bfit j}}\}_{{\bfit j}=1}^{{\bfit A}}}$.
The original OSC filter of Wold et al.
was based on the framework of the non‐linear iterative partial least squares (NIPALS) algorithm.
Adopting this approach enabled the mathematical justification for the selection of the loading vectors p j and components t j, but there was no theoretical foundation for the selection of w j.
In contrast, the approach of Fearn described an objective function for the selection of the weight vectors w j, but in this case there is no theoretical justification for either p j or t j.
Combining both approaches, within a NIPALS framework, enables a clear theoretical basis for the selection of all three building blocks to be established.
A number of orthogonal and optimal properties of the NIPALS‐based OSC algorithm, although previously reported, are also theoretically proven.
Finally, it is shown that the modified OSC algorithm is equivalent to Fearn's OSC but is interpretable as a consequence of it being presented from a NIPALS perspective.
This enables the possible extension of OSC to dynamic and non‐linear systems.
Copyright © 2002 John Wiley & Sons, Ltd.

Related Results

Algorithmic Trading and AI: A Review of Strategies and Market Impact
Algorithmic Trading and AI: A Review of Strategies and Market Impact
This review explores the dynamic intersection of algorithmic trading and artificial intelligence (AI) within financial markets. It delves into the evolution, strategies, and broade...
New Orthogonal Transforms for Signal and Image Processing
New Orthogonal Transforms for Signal and Image Processing
In the paper, orthogonal transforms based on proposed symmetric, orthogonal matrices are created. These transforms can be considered as generalized Walsh–Hadamard Transforms. The s...
Optimized metrics for orthogonal combinatorial CRISPR screens
Optimized metrics for orthogonal combinatorial CRISPR screens
CRISPR screening has become a powerful technology to identify genetic dependencies with single-gene resolution. Genomic codependencies can be extracted with CRISPR perturbation scr...
The Role of Algorithmic Anthropomorphism, Transparency, and Fairness in Shaping Consumer Purchase Intentions in E-Commerce
The Role of Algorithmic Anthropomorphism, Transparency, and Fairness in Shaping Consumer Purchase Intentions in E-Commerce
Artificial intelligence (AI) is often employed in various sectors of e-commerce. Conse-quently, it becomes necessary to identify the impact of various parameters of the algorithm o...
Algorithmic Governance and Public Accountability: Audits, Transparency, and Harm
Algorithmic Governance and Public Accountability: Audits, Transparency, and Harm
Algorithmic systems are increasingly embedded in public administration, shaping decisions in areas such as social services, law enforcement, urban governance, and financial regulat...
On Graph-Orthogonal Arrays by Mutually Orthogonal Graph Squares
On Graph-Orthogonal Arrays by Mutually Orthogonal Graph Squares
During the last two centuries, after the question asked by Euler concerning mutually orthogonal Latin squares (MOLS), essential advances have been made. MOLS are considered as a co...
Orthogonal labeling
Orthogonal labeling
<div class="page" title="Page 1"><div class="layoutArea"><div class="column"><p><span>Let ∆</span><span>G </span><span>be the ...
Municipal Surveillance Regulation and Algorithmic Accountability
Municipal Surveillance Regulation and Algorithmic Accountability
A wave of recent scholarship has warned about the potential for discriminatory harms of algorithmic systems, spurring an interest in algorithmic accountability and regulation. Mean...

Back to Top