Search results for "Iterative method"

showing 10 items of 135 documents

Multi-dimensional Function Approximation and Regression Estimation

2002

In this communication, we generalize the Support Vector Machines (SVM) for regression estimation and function approximation to multi-dimensional problems. We propose a multi-dimensional Support Vector Regressor (MSVR) that uses a cost function with a hyperspherical insensitive zone, capable of obtaining better predictions than using an SVM independently for each dimension. The resolution of the MSVR is achieved by an iterative procedure over the Karush-Kuhn-Tucker conditions. The proposed algorithm is illustrated by computers experiments.

Support vector machineStatistics::Machine LearningMathematical optimizationFunction approximationMean squared errorDimension (vector space)Iterative methodRegression analysisFunction (mathematics)AlgorithmRegressionMathematics
researchProduct

Currents reconstruction by means of a new 2D extrapolation matrix

2007

The equivalent currents reconstructed on the surface of an antenna from its far field measurements have a limited resolution. This is because just the visible part of the spectrum, i.e. the inner part of the circle of radius k (the wavenumber), can be obtained with this technique. The zero padding technique is used for improving the precision; however this technique does not improve the resolution and additional methods must be applied. One of the most used is the Gerchberg-Papoulis algorithm. This technique obtains the non visible spectrum from just the visible region and the maximum size of the antenna. The main disadvantage of this algorithm is that, since it is iterative, it takes a lon…

Surface (mathematics)Matrix (mathematics)Opticsbusiness.industryIterative methodExtrapolationWavenumberNear and far fieldRadiusAntenna (radio)businessAlgorithmMathematics2nd European Conference on Antennas and Propagation (EuCAP 2007)
researchProduct

Performance comparison of residual related algorithms for ToA positioning in wireless terrestrial and sensor networks

2009

©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE." Article also available from publisher: http://dx.doi.org/10.1109/WIRELESSVITAE.2009.5172462 Time of Arrival (ToA) is a popular technique for terrestrial positioning. This paper presents a comparison of ToA based residual related positioning algorithms in wireless terrestrial and sensor networks in both long range outdoor and short range indoor environments. Us…

Time of arrivalComputational complexity theoryComputer scienceIterative methodbusiness.industryVDP::Technology: 500::Information and communication technology: 550::Telecommunication: 552WirelessResidualCommunication complexitybusinessWireless sensor networkAlgorithmWeighting
researchProduct

D-Optimal Design for Parameter Estimation in Discrete-Time Nonlinear Dynamic Systems

2012

Published version of an article from the journal: Mathematical Problems in Engineering. Also available from the publisher:http://dx.doi.org/10.1155/2012/296701 An optimal input design method for parameter estimation in a discrete-time nonlinear system is presented in the paper to improve the observability and identification precision of model parameters. Determinant of the information matrix is used as the criterion function which is generally a nonconvex function about the input signals to be designed. To avoid the locally optimizing problem, a randomized designmethod is proposed bywhich a globally optimizing test plan other than input signals may be obtained. Then the randomized design ca…

VDP::Mathematics and natural science: 400::Mathematics: 410::Applied mathematics: 413Optimal designMathematical optimizationArticle SubjectComputer scienceEstimation theoryIterative methodlcsh:MathematicsGeneral MathematicsGeneral EngineeringFunction (mathematics)lcsh:QA1-939Dynamic programmingNonlinear systemDiscrete time and continuous timelcsh:TA1-2040Control theoryObservabilitylcsh:Engineering (General). Civil engineering (General)Mathematical Problems in Engineering
researchProduct

Fast nonstationary preconditioned iterative methods for ill-posed problems, with application to image deblurring

2013

We introduce a new iterative scheme for solving linear ill-posed problems, similar to nonstationary iterated Tikhonov regularization, but with an approximation of the underlying operator to be used for the Tikhonov equations. For image deblurring problems, such an approximation can be a discrete deconvolution that operates entirely in the Fourier domain. We provide a theoretical analysis of the new scheme, using regularization parameters that are chosen by a certain adaptive strategy. The numerical performance of this method turns out to be superior to state-of-the-art iterative methods, including the conjugate gradient iteration for the normal equation, with and without additional precondi…

Well-posed problemDeblurringMathematical optimizationIterative methodApplied MathematicsRegularization (mathematics)Computer Science ApplicationsTheoretical Computer ScienceTikhonov regularizationConjugate gradient methodSignal ProcessingApplied mathematicsDeconvolutionMathematical PhysicsLinear least squaresMathematics
researchProduct

Automatic classification of tissues using T1 and T2 relaxation times from prostate MRI: a step toward generation of PET/MR attenuation map

2015

This paper presents a new methodology providing the first step towards generating attenuation maps for PET/MR systems based solely on MR information. The new method segments and classifies the attenuation-differing regions of the patient's pelvis based on acquired T 1 - and T 2 -weighted MR data sets and anatomical-based knowledge by computing the tissue specific T 1 and T 2 relaxation times, using a robust implementation of the weighted fuzzy C-means algorithm and applying a novel process to detect bones. We have demonstrated the feasibility of this approach by correctly segmenting and classifying six differing regions of structural and anatomical importance: fat, muscle, prostate, air, ba…

[ INFO.INFO-IM ] Computer Science [cs]/Medical ImagingComputer sciencebusiness.industryAttenuation[INFO.INFO-IM] Computer Science [cs]/Medical ImagingRelaxation (iterative method)Pattern recognition030218 nuclear medicine & medical imaging03 medical and health sciences0302 clinical medicinemedicine.anatomical_structure[INFO.INFO-TI] Computer Science [cs]/Image Processing [eess.IV]ProstateT2 relaxation[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV][ INFO.INFO-TI ] Computer Science [cs]/Image Processingmedicine[INFO.INFO-IM]Computer Science [cs]/Medical ImagingArtificial intelligencebusiness030217 neurology & neurosurgeryComputingMilieux_MISCELLANEOUS
researchProduct

Applying logistic regression to relevance feedback in image retrieval systems

2007

This paper deals with the problem of image retrieval from large image databases. A particularly interesting problem is the retrieval of all images which are similar to one in the user's mind, taking into account his/her feedback which is expressed as positive or negative preferences for the images that the system progressively shows during the search. Here we present a novel algorithm for the incorporation of user preferences in an image retrieval system based exclusively on the visual content of the image, which is stored as a vector of low-level features. The algorithm considers the probability of an image belonging to the set of those sought by the user, and models the logit of this prob…

business.industryIterative methodLinear modelRelevance feedbackPattern recognitioncomputer.software_genreImage (mathematics)Set (abstract data type)Artificial IntelligenceSignal ProcessingRelevance (information retrieval)Computer Vision and Pattern RecognitionArtificial intelligenceData miningbusinessCluster analysisImage retrievalcomputerSoftwareMathematicsPattern Recognition
researchProduct

Computer-Aided Simulation of Die Filling Processes

1989

Summary A numerical method for analysing the filling of axisymmetrical dies of complex shape is proposed. The method, which is a further development of a LP finite element model, is able to take into account the contact conditions directly in the mathematical formulation of the problem. In such a way the solution of the die filling process is obtained by solving a LP problem, avoiding problems of numerical convergence and the heavier calculations requested by other iterative methods.

business.product_categoryIterative methodComputer scienceMechanical EngineeringNumerical analysisProcess (computing)Mechanical engineeringIndustrial and Manufacturing EngineeringFinite element methodDevelopment (topology)Convergence (routing)Die (manufacturing)Applied mathematicsComputer aided simulationbusinessCIRP Annals
researchProduct

RELAXATION METHODS FOR STUDYING MACROMOLECULAR MOTION IN THE BULK

1982

Abstract Macromolecular motion in amorphous and partially crystalline polymers is discussed in the light of recent relaxation experiments with particular emphasis on NMR methods. Polystyrene and polyethylene serve as pertinent examples where a considerable amount of new experimental data provides a bysis for better understanding molecular processes below and above the glass transition, and in the melt.

chemistry.chemical_classificationchemistry.chemical_compoundMaterials sciencechemistryChemical physicsRelaxation (iterative method)Organic chemistryPolymerPolystyrenePolyethyleneGlass transitionMacromoleculeAmorphous solid
researchProduct

Guaranteed error bounds for linear algebra problems and a class of Picard-Lindelöf iteration methods

2012

This study focuses on iteration methods based on the Banach fixed point theorem and a posteriori error estimates of Ostrowski. Their application for systems of linear simultaneous equations, bounded linear operators, as well as integral and differential equations is considered. The study presents a new version of the Picard–Lindelöf method for ordinary differential equations (ODEs) supplied with guaranteed and explicitly computable upper bounds of the approximation error. The estimates derived in the thesis take into account interpolation and integration errors and, therefore, provide objective information on the accuracy of computed approximations.

iterointireliabilityiterative methodComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONthe Picard–Lindelöf methodguaranteed boundsError estimatesluotettavuus
researchProduct