arXiv subjects

Mikko J. Sillanpää

Publications and source records attributed to Mikko J. Sillanpää.

12 recordsLinked to original sources

arXiv2026

Unraveling Surface Chemistry of irreversible reduction of iron oxides through the Time-Resolved APXPS and Chemometrics

This work presents a study on the application of Time-Resolved Ambient Pressure X-ray Photoelectron Spectroscopy (TR-APXPS) in association with chemometric techniques, specifically Principal Component Analysis (PCA) and Multivariate Curve Resolution with Alternating Least Squares (MCR-ALS), to investigate the surface chemistry and dynamics of Fe2O3 reduction processes. The use of TR-APXPS allows for real-time monitoring of chemical changes at the surface of Iron oxides during reduction, providing valuable insights into the reaction mechanisms and kinetics involved. One key challenge in analyzing TR-APXPS data is the presence of overlapping peaks and complex spectral features, which can make accurate quantification and interpretation difficult. Traditional spectral fitting methods may struggle with these complexities and result in ambiguous or inaccurate results. However, the chemometric approaches are promising tools to overcome these challenges by extracting pure spectral profiles of individual chemical species and their temporal profiles from the complex and overlapping data. The results obtained from the TR-APXPS coupled with PCA and MCR-ALS analysis provide a detailed and precise understanding of the surface chemical changes during the Fe2O3 reduction. This includes identifying and following the formation of various intermediate species and their evolution over time, which permits later to establish correlations between surface chemistry and process conditions. The integration of both chemometric tools in TR-APXPS data analysis not only addresses the challenges associated with complex spectral features, but also contributes to a deeper understanding of the underlying chemical changes and their dynamics. The obtained results have significant implications for process optimization, material synthesis, and tailoring of material properties for specific applications.

physics.chem-ph↗

arXiv2025

Adaptive and Self-Tuning SBL with Total Variation Priors for Block-Sparse Signal Recovery

This letter addresses the problem of estimating block sparse signal with unknown group partitions in a multiple measurement vector (MMV) setup. We propose a Bayesian framework by applying an adaptive total variation (TV) penalty on the hyper-parameter space of the sparse signal. The main contributions are two-fold. 1) We extend the TV penalty beyond the immediate neighbor, thus enabling better capture of the signal structure. 2) A dynamic framework is provided to learn the penalty parameter for regularization. It is based on the statistical dependencies between the entries of tentative blocks, thus eliminating the need for fine-tuning. The superior performance of the proposed method is empirically demonstrated by extensive computer simulations with the state-of-art benchmarks. The proposed solution exhibits both excellent performance and robustness against sparsity model mismatch.

eess.SP↗

arXiv2023

Device Detection and Channel Estimation in MTC with Correlated Activity Pattern

This paper provides a solution for the activity detection and channel estimation problem in grant-free access with correlated device activity patterns. In particular, we consider a machine-type communications (MTC) network operating in event-triggered traffic mode, where the devices are distributed over clusters with an activity behaviour that exhibits both intra-cluster and inner-cluster sparsity patterns. Furthermore, to model the network's intra-cluster and inner-cluster sparsity, we propose a structured sparsity-inducing spike-and-slab prior which provides a flexible approach to encode the prior information about the correlated sparse activity pattern. Furthermore, we drive a Bayesian inference scheme based on the expectation propagation (EP) framework to solve the JUICE problem. Numerical results highlight the significant gains obtained by the proposed structured sparsity-inducing spike-and-slab prior in terms of both user identification accuracy and channel estimation performance.

eess.SP↗

arXiv2023

Hierarchical MTC User Activity Detection and Channel Estimation with Unknown Spatial Covariance

This paper addresses the joint user identification and channel estimation (JUICE) problem in machine-type communications under the practical spatially correlated channels model with unknown covariance matrices. Furthermore, we consider an MTC network with hierarchical user activity patterns following an event-triggered traffic mode. Therein the users are distributed over clusters with a structured sporadic activity behaviour that exhibits both cluster-level and intra-cluster sparsity patterns. To solve the JUICE problem, we first leverage the concept of strong priors and propose a hierarchical-sparsity-inducing spike-and-slab prior to model the structured sparse activity pattern. Subsequently, we derive a Bayesian inference scheme by coupling the expectation propagation (EP) algorithm with the expectation maximization (EM) framework. Second, we reformulate the JUICE as a maximum a posteriori (MAP) estimation problem and propose a computationally-efficient solution based on the alternating direction method of multipliers (ADMM). More precisely, we relax the strong spike-and-slab prior with a cluster-sparsity-promoting prior based on the long-sum penalty. We then derive an ADMM algorithm that solves the MAP problem through a sequence of closed-form updates. Numerical results highlight the significant performance significant gains obtained by the proposed algorithms, as well as their robustness against various assumptions on the users sparse activity behaviour.

eess.SP↗

arXiv2023

Sequential model correction for nonlinear inverse problems

Inverse problems are in many cases solved with optimization techniques. When the underlying model is linear, first-order gradient methods are usually sufficient. With nonlinear models, due to nonconvexity, one must often resort to second-order methods that are computationally more expensive. In this work we aim to approximate a nonlinear model with a linear one and correct the resulting approximation error. We develop a sequential method that iteratively solves a linear inverse problem and updates the approximation error by evaluating it at the new solution. This treatment convexifies the problem and allows us to benefit from established convex optimization methods. We separately consider cases where the approximation is fixed over iterations and where the approximation is adaptive. In the fixed case we show theoretically under what assumptions the sequence converges. In the adaptive case, particularly considering the special case of approximation by first-order Taylor expansion, we show that with certain assumptions the sequence converges to a critical point of the original nonconvex functional. Furthermore, we show that with quadratic objective functions the sequence corresponds to the Gauss-Newton method. Finally, we showcase numerical results superior to the conventional model correction method. We also show, that a fixed approximation can provide competitive results with considerable computational speed-up.

math.NA↗

arXiv2022

Robust multi-outcome regression with correlated covariate blocks using fused LAD-lasso

Lasso is a popular and efficient approach to simultaneous estimation and variable selection in high-dimensional regression models. In this paper, a robust LAD-lasso method for multiple outcomes is presented that addresses the challenges of non-normal outcome distributions and outlying observations. Measured covariate data from space or time, or spectral bands or genomic positions often have natural correlation structure arising from measuring distance between the covariates. The proposed multi-outcome approach includes handling of such covariate blocks by a group fusion penalty, which encourages similarity between neighboring regression coefficient vectors by penalizing their differences for example in sequential data situation. Properties of the proposed approach are first illustrated by extensive simulations, and secondly the method is applied to a real-life skewed data example on retirement behavior with heteroscedastic explanatory variables.

stat.ME↗

arXiv2022

Neural Network Kalman filtering for 3D object tracking from linear array ultrasound data

Many interventional surgical procedures rely on medical imaging to visualise and track instruments. Such imaging methods not only need to be real-time capable, but also provide accurate and robust positional information. In ultrasound applications, typically only two-dimensional data from a linear array are available, and as such obtaining accurate positional estimation in three dimensions is non-trivial. In this work, we first train a neural network, using realistic synthetic training data, to estimate the out-of-plane offset of an object with the associated axial aberration in the reconstructed ultrasound image. The obtained estimate is then combined with a Kalman filtering approach that utilises positioning estimates obtained in previous time-frames to improve localisation robustness and reduce the impact of measurement noise. The accuracy of the proposed method is evaluated using simulations, and its practical applicability is demonstrated on experimental data obtained using a novel optical ultrasound imaging setup. Accurate and robust positional information is provided in real-time. Axial and lateral coordinates for out-of-plane objects are estimated with a mean error of 0.1mm for simulated data and a mean error of 0.2mm for experimental data. Three-dimensional localisation is most accurate for elevational distances larger than 1mm, with a maximum distance of 6mm considered for a 25mm aperture.

stat.AP↗

arXiv2021

Reducing bias and alleviating the influence of excess of zeros with multioutcome adaptive LAD-lasso

Zero-inflated explanatory variables are common in fields such as ecology and finance. In this paper we address the problem of having excess of zero values in some explanatory variables which are subject to multioutcome lasso-regularized variable selection. Briefly, the problem results from the failure of the lasso-type of shrinkage methods to recognize any difference between zero value occurring either in the regression coefficient or in the corresponding value of the explanatory variable. This kind of confounding will obviously increase number of false positives - all non-zero regression coefficients do not necessarily represent real outcome effects. We present here the adaptive LAD-lasso for multiple outcomes which extends the earlier work of multivariate LAD-lasso with adaptive penalization. In addition of well known property of having less biased regression coefficients, we show here how the adaptivity improves also method's ability to recover from influences of excess of zero values measured in continuous covariates.

stat.ME↗

arXiv2021

Edge computing server placement with capacitated location allocation

The deployment of edge computing infrastructure requires a careful placement of the edge servers, with an aim to improve application latencies and reduce data transfer load in opportunistic Internet of Things systems. In the edge server placement, it is important to consider computing capacity, available deployment budget, and hardware requirements for the edge servers and the underlying backbone network topology. In this paper, we thoroughly survey the existing literature in edge server placement, identify gaps and present an extensive set of parameters to be considered. We then develop a novel algorithm, called PACK, for server placement as a capacitated location-allocation problem. PACK minimizes the distances between servers and their associated access points, while taking into account capacity constraints for load balancing and enabling workload sharing between servers. Moreover, PACK considers practical issues such as prioritized locations and reliability. We evaluate the algorithm in two distinct scenarios: one with high capacity servers for edge computing in general, and one with low capacity servers for Fog computing. Evaluations are performed with a data set collected in a real-world network, consisting of both dense and sparse deployments of access points across a city area. The resulting algorithm and related tools are publicly available as open source software.

cs.NI↗

arXiv2021

Capacitated spatial clustering with multiple constraints and attributes

Capacitated spatial clustering, a type of unsupervised machine learning method, is often used to tackle problems in compressing, classifying, logistic optimization and infrastructure optimization. Depending on the application at hand, a wide set of extensions may be necessary in clustering. In this article we propose a number of novel extensions to PACK that is a novel capacitated spatial clustering method. These extensions are relocation and location preference of cluster centers, outliers, and non-spatial attributes. The strength of PACK is that it can consider all of these extensions jointly. We demonstrate the usefulness PACK with a real world example in edge computing server placement for a city region with various different set ups, where we take into consideration outliers, center placement, and non-spatial attributes. Different setups are evaluated with summary statistics on spatial proximity and attribute similarity. As a result, the similarity of the clusters was improved at best by 53%, while simultaneously the proximity degraded only 18%. In alternate scenarios, both proximity and similarity were improved. The different extensions proved to provide a valuable way to include non-spatial information into the cluster analysis, and attain better overall proximity and similarity. Furthermore, we provide easy-to-use software tools (rpack) for conducting clustering analyses.

stat.AP↗

arXiv2020

Blind hierarchical deconvolution

Deconvolution is a fundamental inverse problem in signal processing and the prototypical model for recovering a signal from its noisy measurement. Nevertheless, the majority of model-based inversion techniques require knowledge on the convolution kernel to recover an accurate reconstruction and additionally prior assumptions on the regularity of the signal are needed. To overcome these limitations, we parametrise the convolution kernel and prior length-scales, which are then jointly estimated in the inversion procedure. The proposed framework of blind hierarchical deconvolution enables accurate reconstructions of functions with varying regularity and unknown kernel size and can be solved efficiently with an empirical Bayes two-step procedure, where hyperparameters are first estimated by optimisation and other unknowns then by an analytical formula.

eess.SP↗

arXiv2016

Prioritizing covariates in the planning of future studies in the meta-analytic framework

Science can be seen as a sequential process where each new study augments evidence to the existing knowledge. To have the best prospects to make an impact in this process, a new study should be designed optimally taking into account the previous studies and other prior information. We propose a formal approach for the covariate prioritization, i.e., the decision about the covariates to be measured in a new study. The decision criteria can be based on conditional power, change of the p-value, change in lower confidence limit, Kullback-Leibler divergence, Bayes factors, Bayesian false discovery rate or difference between prior and posterior expectation. The criteria can be also used for decisions on the sample size. As an illustration, we consider covariate prioritization based on genome-wide association studies for C-reactive protein levels and make suggestions on the genes to be studied further. keywords: design; evidence-based medicine; meta-analysis; power; scientific method

stat.ME↗