Search results for "algorithm."
showing 10 items of 4617 documents
Automatic surrogate modelling technique selection based on features of optimization problems
2019
A typical scenario when solving industrial single or multiobjective optimization problems is that no explicit formulation of the problem is available. Instead, a dataset containing vectors of decision variables together with their objective function value(s) is given and a surrogate model (or metamodel) is build from the data and used for optimization and decision-making. This data-driven optimization process strongly depends on the ability of the surrogate model to predict the objective value of decision variables not present in the original dataset. Therefore, the choice of surrogate modelling technique is crucial. While many surrogate modelling techniques have been discussed in the liter…
Phase retrieval of vitreous floaters: simulation experiment
2020
Knowledge of the structure of vitreous floaters is crucial to evaluate the need for surgical removal of these floaters. We simulated the phase retrieval of microstructures simulating vitreous floaters by an algorithm PhaseLift and investigate the effects of various parameters on the retrieved phase. The object under test was modulated and the coded diffraction patterns were calculated. Next, PhaseLift was used to retrieve the phase. In the current study, we simulate the effect of Gaussian and Poison noise on the phase retrieval of pure phase objects. We apply an iterative algorithm PhaseLift for phase retrieval as this algorithm requires a very few modulating masks and is able to retrieve t…
A Domain Imbedding Method with Distributed Lagrange Multipliers for Acoustic Scattering Problems
2003
The numerical computation of acoustic scattering by bounded twodimensional obstacles is considered. A domain imbedding method with Lagrange multipliers is introduced for the solution of the Helmholtz equation with a second-order absorbing boundary condition. Distributed Lagrange multipliers are used to enforce the Dirichlet boundary condition on the scatterer. The saddle-point problem arising from the conforming finite element discretization is iteratively solved by the GMRES method with a block triangular preconditioner. Numerical experiments are performed with a disc and a semi-open cavity as scatterers.
Optimisation algorithms in the case of mineral detection using Raman Analysis
2013
Abstract Raman analysis can be used to analyse the existence of minerals in an ore sample. Especially the interest here is to analyse given ore sample rapidly, to find out what minerals it contains. Rapid analysis would enable more rapid exploration of minerals as analysis could be carried out on-site. For this study, ore samples were collected from two mines in Northern Finland, Kittila and Kevitsa. An optimisation algorithm was constructed to form a linear combination of reference spectra which best represent the measured spectrum from an ore sample. The reference spectra were collected from a public source. It was found that solving for an optimal summation of reference spectra can be a …
The Radon-Wigner Transform and Its Application to First-order Optical Systems
2009
The Radon-Wigner transform is presented as a tool for the description of 1st-order optical systems. The input/output relationships for this phase-space representation are obtained and their application in analysis and design tasks is pointed out.
Improved Quadratic Time-frequency Distributions for Detecting Inter-turn Short Circuits of PMSMs in Transient States
2020
This paper aims to improve quadratic time-frequency distributions to adapt condition monitoring of electrical machines in transient states. Short-Time Fourier transform (STFT) has been a baseline signal processing technique for detecting fault characteristic frequencies. However, limits of window sizes due to loss of frequency- or time-resolution, make it hard to capture rapid changes in frequencies. Within this study, Choi-Williams and Wigner-Ville distributions are proposed to effectively detect peaks at characteristic frequencies while still maintaining low computation time. The improved quadratic time-frequency distributions allow for generating spectrograms of a longer lasting data sig…
Application of Periodic Frames to Image Restoration
2014
In this chapter, we present examples of image restoration using periodic frames. Images to be restored were degraded by blurring, aggravated by random noise and random loss of significant number of pixels. The images are transformed by periodic frames designed in Sects. 17.2 and 17.4, which are extended to the 2D setting in a standard tensor product way. In the presented experiments, performances of different tight and semi-tight frames are compared between each other in identical conditions.
How to Improve the Reliability of Chord?
2008
In this paper we focus on Chord P2P protocol and we study the process of unexpected departures of nodes from this system. Each of such departures may effect in losing any information and in classical versions of this protocol the probability of losing some information is proportional to the quantity of information put into this system. This effect can be partially solved by gathering in the protocol multiple copies (replicas) of information. The replication mechanism was proposed by many authors. We present a detailed analysis of one variant of blind replication and show that this solution only partially solves the problem. Next we propose two less obvious modifications of the Chord protoco…
A comparison between two feature selection algorithms
2017
This article provides a comparison of two feature selection algorithms, Information Gain Thresholding and Koller and Sahami's algorithm in the context of text document classification on the Reuters Corpus Volume 1 dataset. The algorithms were evaluated by testing the performance of classifiers trained on the features they select from a given dataset. Results show that Koller and Sahami's algorithm consistently outperforms Information Gain Thresholding by capturing interactions between features and avoiding redundancy among features, although it achieves its gains through increased complexity and longer running time.
Computing variations of entropy and redundancy under nonlinear mappings not preserving the signal dimension: quantifying the efficiency of V1 cortex
2021
In computational neuroscience, the Efficient Coding Hypothesis argues that the neural organization comes from the optimization of information-theoretic goals [Barlow Proc.Nat.Phys.Lab.59]. A way to confirm this requires the analysis of the statistical performance of biological systems that have not been statistically optimized [Renart et al. Science10, Malo&Laparra Neur.Comp.10, Foster JOSA18, Gomez-Villa&Malo J.Neurophysiol.19]. However, when analyzing the information-theoretic performance, cortical magnification in the retina-cortex pathway poses a theoretical problem. Cortical magnification stands for the increase the signal dimensionality [Cowey&Rolls Exp. Brain Res.74]. Conventional mo…