Search results for "A* algorithm"

showing 10 items of 2538 documents

Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms

1997

We introduce a new multidimensional pattern matching problem that is a natural generalization of string matching, a well studied problem1. The motivation for its algorithmic study is mainly theoretical. LetA1:n1,?,1:nd be a text matrix withN=n1?ndentries andB1:m1,?,1:mr be a pattern matrix withM=m1?mrentries, whered?r?1 (the matrix entries are taken from an ordered alphabet ?). We study the problem of checking whether somer-dimensional submatrix ofAis equal toB(i.e., adecisionquery).Acan be preprocessed andBis given on-line. We define a new data structure for preprocessingAand propose CRCW-PRAM algorithms that build it inO(logN) time withN2/nmaxprocessors, wherenmax=max(n1,?,nd), such that …

Control and OptimizationSuffix treeBlock matrixWildcard characterString searching algorithmcomputer.file_formatData structurelaw.inventionCombinatoricsComputational MathematicsMatrix (mathematics)Computational Theory and MathematicsSearch algorithmlawPattern matchingcomputerMathematicsJournal of Algorithms
researchProduct

An Adaptive Alternating Direction Method of Multipliers

2021

AbstractThe alternating direction method of multipliers (ADMM) is a powerful splitting algorithm for linearly constrained convex optimization problems. In view of its popularity and applicability, a growing attention is drawn toward the ADMM in nonconvex settings. Recent studies of minimization problems for nonconvex functions include various combinations of assumptions on the objective function including, in particular, a Lipschitz gradient assumption. We consider the case where the objective is the sum of a strongly convex function and a weakly convex function. To this end, we present and study an adaptive version of the ADMM which incorporates generalized notions of convexity and penalty…

Control and Optimizationsignal denoisingApplied Mathematicsalternating direction method of multipliersMathematics::Optimization and Controldouglas–rachford algorithmUNESCO::CIENCIAS TECNOLÓGICASManagement Science and Operations Researchcomonotonicityweakly convex functionOptimization and Control (math.OC)47H05 47N10 47J25 49M27 65K15FOS: Mathematicsfirm thresholdingMathematics - Optimization and Control
researchProduct

Time-harmonic solution for acousto-elastic interaction with controllability and spectral elements

2010

The classical way of solving the time-harmonic linear acousto-elastic wave problem is to discretize the equations with finite elements or finite differences. This approach leads to large-scale indefinite complex-valued linear systems. For these kinds of systems, it is difficult to construct efficient iterative solution methods. That is why we use an alternative approach and solve the time-harmonic problem by controlling the solution of the corresponding time dependent wave equation. In this paper, we use an unsymmetric formulation, where fluid-structure interaction is modeled as a coupling between pressure and displacement. The coupled problem is discretized in space domain with spectral el…

ControllabilityDiscretizationSpectral element methodfluid-structure interactionspectral element methodacoustic wavescoupled problemTime-harmonic solutioncontrollabilityConjugate gradient methodFluid-structure interactionTime domainCoupled problemMathematicsElastic wavesSpectral element methodelastic wavestime-harmonic solutionApplied MathematicsMathematical analysisLinear systemFinite differenceFinite element methodControllabilityComputational MathematicsAcoustic wavesConjugate gradient algorithmconjugate gradient algorithmJournal of Computational and Applied Mathematics
researchProduct

Experiments with an adaptive Bayesian restoration method

1989

Abstract This paper describes a Bayesian restoration method applied to two-dimensional measured images, whose detector response function is not completely known. The response function is assumed Gaussian with standard deviation depending on the estimate of the local density of the image. The convex hull of the K -nearest neighbours ( K NN) of each ‘on’ pixel is used to compute the local density. The method has been tested on ‘sparse’ images, with and without noise background.

Convex hullGaussianImage processingStandard deviationsymbols.namesakeArtificial IntelligenceBayesian restorationElectrical and Electronic EngineeringImage restorationK-nearest-neighbours algorithmMathematics1707PixelSettore INF/01 - Informaticabusiness.industryPattern recognitionsparse imageFunction (mathematics)Signal ProcessingsymbolsComputer Vision and Pattern RecognitionArtificial intelligenceDeconvolutionbusinessconvex hullSoftware
researchProduct

Shape-Based Features for Cat Ganglion Retinal Cells Classification

2002

This article presents a quantitative and objective approach to cat ganglion cell characterization and classification. The combination of several biologically relevant features such as diameter, eccentricity, fractal dimension, influence histogram, influence area, convex hull area, and convex hull diameter are derived from geometrical transforms and then processed by three different clustering methods (Ward’s hierarchical scheme, K-means and genetic algorithm), whose results are then combined by a voting strategy. These experiments indicate the superiority of some features and also suggest some possible biological implications.

Convex hullSettore INF/01 - InformaticaComputer sciencebusiness.industryFeature extractionPattern recognitionComputational geometryFractal dimensionbody regionsFractalHistogramSignal ProcessingGenetic algorithmComputer visionMedical imagingComputer Vision and Pattern RecognitionArtificial intelligenceElectrical and Electronic EngineeringCells classificationCluster analysisbusinessReal-Time Imaging
researchProduct

A parametric analysis of the transient behavior of lightning protection systems

2005

The paper have the purpose of investigate the influence of different parameters to enable better understanding of the transient performance of complex lightning protection systems (LPS). Lightning discharges constitute the major source of atmospheric or natural noise that can interfere with electric and electronic installations. The electromagnetic characterisation of the LPS environment plays a fundamental role in order to prevent unwanted coupling phenomena that may generate abnormal signals, electric stresses dangerous for the insulation of electric components, disruptive discharges and danger to persons. The model, developed by the authors, is based on a field-approach: the numerical so…

Cooley–Tukey FFT algorithmEngineeringSignal generatorGroundbusiness.industryAcousticsSoil resistivityImpulse (physics)Electric-field integral equationProtection systemLightningFrequency domainElectric groundingElectronic engineeringbusinessLightning protection
researchProduct

Area-efficient FPGA-based FFT processor

2003

A novel architecture for computing the fast Fourier transform on programmable devices is presented. Main results indicate that the use of one CORDIC operator to perform the multiplication by all the ‘twiddle factors’ sequentially leads to an area saving up to 35% with respect to other cores.

Cooley–Tukey FFT algorithmSplit-radix FFT algorithmComputer sciencebusiness.industryFast Fourier transformPrime-factor FFT algorithmMultiplicationElectrical and Electronic EngineeringCORDICField-programmable gate arraybusinessTwiddle factorComputer hardwareElectronics Letters
researchProduct

Mammographic images segmentation based on chaotic map clustering algorithm

2013

Background: This work investigates the applicability of a novel clustering approach to the segmentation of mammographic digital images. The chaotic map clustering algorithm is used to group together similar subsets of image pixels resulting in a medically meaningful partition of the mammography. Methods: The image is divided into pixels subsets characterized by a set of conveniently chosen features and each of the corresponding points in the feature space is associated to a map. A mutual coupling strength between the maps depending on the associated distance between feature space points is subsequently introduced. On the system of maps, the simulated evolution through chaotic dynamics leads…

Cooperative behaviorClustering algorithmsComputer scienceFeature vectorCorrelation clusteringPhysics::Medical PhysicsMass lesionsMicrocalcificationsImage processingBreast NeoplasmsDigital imageSegmentationBreast cancerImage Processing Computer-AssistedCluster AnalysisHumansRadiology Nuclear Medicine and imagingSegmentationComputer visionCluster analysisFeaturesPixelChaotic maps Clustering algorithms Cooperative behavior Segmentation Mammography Features Mass lesions Microcalcifications Breast cancerbusiness.industrySegmentation-based object categorizationCalcinosisSettore FIS/07 - Fisica Applicata(Beni Culturali Ambientali Biol.e Medicin)Radiographic Image EnhancementChaotic mapsRadiology Nuclear Medicine and imagingComputer Science::Computer Vision and Pattern RecognitionFemaleArtificial intelligencebusinessAlgorithmsMammographyResearch Article
researchProduct

Decentralized Coordination System for Multiple AGVs in a Structured Environment

2011

Abstract In this paper, we propose a decentralized coordination algorithm for safe and efficient management of a group of mobile robots following predefined paths in a dynamic industrial environment. The proposed algorithm is based on shared resources and proved to guarantee ordered traffic flows avoiding collisions and deadlocks. In consistency with the model of distributed robotic systems (DRS), no centralized mechanism, synchronized clock, shared memory or ground support is needed. A local inter-robot communication is required among a small number of spatially adjacent robotic units.

Coordination algorithms0209 industrial biotechnologyEngineeringbusiness.industryDistributed computingMobile robot0102 computer and information sciences02 engineering and technologyGround support01 natural sciencesComputer Science::RoboticsConsistency (database systems)020901 industrial engineering & automationRobotic systemsShared memorySettore ING-INF/04 - Automatica010201 computation theory & mathematicsCollision avoidance distributed control autonomous vehiclesbusiness
researchProduct

Robust coordinated control algorithm for multiple marine vessels with external disturbances

2013

Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2013/597195 Open Access The problem of coordinated control for multiple marine vessels in the presence of external disturbances is considered in this paper. A robust coordinated control algorithm is proposed for multiple marine vessels. The proposed robust coordinated control algorithm is divided into two parts. The first part develops an extended state observer to estimate the disturbances of marine vessels. The second part presents a robust coordinated control algorithm based on the output of the extended state observer. Furthermore, the rob…

Coordination algorithmsSurface (mathematics)EngineeringControl algorithmArticle Subjectbusiness.industrylcsh:MathematicsGeneral MathematicsControl (management)General EngineeringControl engineeringlcsh:QA1-939lcsh:TA1-2040Control theoryTrajectoryState observerVDP::Matematikk og Naturvitenskap: 400::Matematikk: 410::Anvendt matematikk: 413lcsh:Engineering (General). Civil engineering (General)businessControl methods
researchProduct