Search results for "Algorithm"

showing 10 items of 4887 documents

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.

symbols.namesakeConstraint algorithmHelmholtz equationDiscretizationPreconditionerLagrange multiplierDirichlet boundary conditionMathematical analysissymbolsBoundary value problemFinite element methodMathematics
researchProduct

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 …

symbols.namesakeEngineeringMineralbusiness.industrySample (material)symbolsMineralogyOptimisation algorithmGeneral MedicineNorthern finlandLinear combinationRaman spectroscopybusinessIFAC Proceedings Volumes
researchProduct

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.

symbols.namesakeFourier transformComputer scienceHartley transformComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONsymbolsShort-time Fourier transformHarmonic wavelet transformS transformAlgorithmConstant Q transformDiscrete Fourier transformFractional Fourier transformFrontiers in Optics 2009/Laser Science XXV/Fall 2009 OSA Optics & Photonics Technical Digest
researchProduct

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…

symbols.namesakeSignal processingFourier transformQuadratic equationComputer scienceShort-time Fourier transformsymbolsCondition monitoringSpectrogramTransient (oscillation)AlgorithmVDP::Teknologi: 500::Elektrotekniske fag: 540Time–frequency analysis
researchProduct

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.

symbols.namesakeTensor productPixelComputer scienceTight frameRandom noiseRandom lossGaussian functionsymbolsAlgorithmInfinite impulse responseImage restoration
researchProduct

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…

symbols.namesakeTheoretical computer scienceSource codemedia_common.quotation_subjectComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSHash functionsymbolsPareto distributionChord (peer-to-peer)Algorithmmedia_commonMathematics
researchProduct

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.

symbols.namesakeTruncation selectionRedundancy (information theory)Computer scienceFeature extractionsymbolsMarkov processFeature selectionAlgorithm designThresholdingAlgorithmRunning time2017 21st International Conference on System Theory, Control and Computing (ICSTCC)
researchProduct

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…

symbols.namesakeWaveletRedundancy (information theory)Dimension (vector space)Computer scienceJacobian matrix and determinantsymbolsEntropy (information theory)Total correlationEfficient coding hypothesisAlgorithmCurse of dimensionalityProceedings of Entropy 2021: The Scientific Tool of the 21st Century
researchProduct

Stereotaktisten annossuunnitelmien verifiointi Compass-järjestelmällä

2016

sädehoitostereotaktinen sädehoitoalgoritmitlaskentamallitVMATstereotactic radiotherapyalgorithmsradiotherapy
researchProduct

Model selection using limiting distributions of second-order blind source separation algorithms

2015

Signals, recorded over time, are often observed as mixtures of multiple source signals. To extract relevant information from such measurements one needs to determine the mixing coefficients. In case of weakly stationary time series with uncorrelated source signals, this separation can be achieved by jointly diagonalizing sample autocovariances at different lags, and several algorithms address this task. Often the mixing estimates contain close-to-zero entries and one wants to decide whether the corresponding source signals have a relevant impact on the observations or not. To address this question of model selection we consider the recently published second-order blind identification proced…

ta112Series (mathematics)Estimation theoryModel selectionasymptotic normalitypattern identificationAsymptotic distributionInformation Criteriaoint diagonalization SOBI AsympBlind signal separationMatrix (mathematics)Control and Systems EngineeringSOBISignal Processingjoint diagonalizationComputer Vision and Pattern RecognitionElectrical and Electronic EngineeringAlgorithmSoftwareMixing (physics)MathematicsSignal Processing
researchProduct