Search results for "Kernel"

showing 10 items of 357 documents

Nonlinear Distribution Regression for Remote Sensing Applications

2020

In many remote sensing applications, one wants to estimate variables or parameters of interest from observations. When the target variable is available at a resolution that matches the remote sensing observations, standard algorithms, such as neural networks, random forests, or the Gaussian processes, are readily available to relate the two. However, we often encounter situations where the target variable is only available at the group level, i.e., collectively associated with a number of remotely sensed observations. This problem setting is known in statistics and machine learning as multiple instance learning (MIL) or distribution regression (DR). This article introduces a nonlinear (kern…

Signal Processing (eess.SP)FOS: Computer and information sciencesComputer Science - Machine LearningArtificial neural networkRemote sensing applicationComputer science0211 other engineering and technologies02 engineering and technologyLeast squaresRandom forestMachine Learning (cs.LG)Kernel (linear algebra)symbols.namesakeKernel (statistics)symbolsFOS: Electrical engineering electronic engineering information engineeringGeneral Earth and Planetary SciencesElectrical Engineering and Systems Science - Signal ProcessingElectrical and Electronic EngineeringGaussian processAlgorithm021101 geological & geomatics engineeringCurse of dimensionalityIEEE Transactions on Geoscience and Remote Sensing
researchProduct

Random Feature Approximation for Online Nonlinear Graph Topology Identification

2021

Online topology estimation of graph-connected time series is challenging, especially since the causal dependencies in many real-world networks are nonlinear. In this paper, we propose a kernel-based algorithm for graph topology estimation. The algorithm uses a Fourier-based Random feature approximation to tackle the curse of dimensionality associated with the kernel representations. Exploiting the fact that the real-world networks often exhibit sparse topologies, we propose a group lasso based optimization framework, which is solve using an iterative composite objective mirror descent method, yielding an online algorithm with fixed computational complexity per iteration. The experiments con…

Signal Processing (eess.SP)FOS: Computer and information sciencesComputer Science - Machine LearningComputational complexity theoryComputer scienceApproximation algorithmTopology (electrical circuits)Network topologyMachine Learning (cs.LG)Kernel (statistics)FOS: Electrical engineering electronic engineering information engineeringTopological graph theoryElectrical Engineering and Systems Science - Signal ProcessingOnline algorithmAlgorithmCurse of dimensionality
researchProduct

Inference of Spatio-Temporal Functions over Graphs via Multi-Kernel Kriged Kalman Filtering

2018

Inference of space-time varying signals on graphs emerges naturally in a plethora of network science related applications. A frequently encountered challenge pertains to reconstructing such dynamic processes, given their values over a subset of vertices and time instants. The present paper develops a graph-aware kernel-based kriged Kalman filter that accounts for the spatio-temporal variations, and offers efficient online reconstruction, even for dynamically evolving network topologies. The kernel-based learning framework bypasses the need for statistical information by capitalizing on the smoothness that graph signals exhibit with respect to the underlying graph. To address the challenge o…

Signal Processing (eess.SP)FOS: Computer and information sciencesComputer Science - Machine LearningComputational complexity theoryComputer scienceInferenceMachine Learning (stat.ML)Network scienceMultikernel02 engineering and technologyNetwork topologyLinear spanMachine Learning (cs.LG)Kernel (linear algebra)Matrix (mathematics)Statistics - Machine LearningFOS: Electrical engineering electronic engineering information engineering0202 electrical engineering electronic engineering information engineeringElectrical and Electronic EngineeringElectrical Engineering and Systems Science - Signal Processing020206 networking & telecommunicationsKalman filterSignal Processing020201 artificial intelligence & image processingLaplace operatorAlgorithm
researchProduct

Synergistic integration of optical and microwave satellite data for crop yield estimation

2019

Developing accurate models of crop stress, phenology and productivity is of paramount importance, given the increasing need of food. Earth observation (EO) remote sensing data provides a unique source of information to monitor crops in a temporally resolved and spatially explicit way. In this study, we propose the combination of multisensor (optical and microwave) remote sensing data for crop yield estimation and forecasting using two novel approaches. We first propose the lag between Enhanced Vegetation Index (EVI) derived from MODIS and Vegetation Optical Depth (VOD) derived from SMAP as a new joint metric combining the information from the two satellite sensors in a unique feature or des…

Signal Processing (eess.SP)FOS: Computer and information sciencesEarth observationCoefficient of determinationTeledetecció010504 meteorology & atmospheric sciencesEnhanced vegetation index0208 environmental biotechnologyFOS: Physical sciencesSoil Science02 engineering and technologyStatistics - Applications01 natural sciencesArticleModerate resolution imaging spectroradiometer (MODIS)Robustness (computer science)Machine learningLinear regressionFOS: Electrical engineering electronic engineering information engineeringFeature (machine learning)Kernel ridge regressionCrop yield estimationVegetation optical depthApplications (stat.AP)Electrical Engineering and Systems Science - Signal ProcessingComputers in Earth Sciences0105 earth and related environmental sciencesRemote sensingMathematics2. Zero hungerCrop yieldProcessos estocàsticsGeologyEnhanced vegetation indexAgro-ecosystems020801 environmental engineeringPhysics - Data Analysis Statistics and ProbabilityMetric (mathematics)Soil moisture active passive (SMAP)Data Analysis Statistics and Probability (physics.data-an)Imatges Processament
researchProduct

Online Non-linear Topology Identification from Graph-connected Time Series

2021

Estimating the unknown causal dependencies among graph-connected time series plays an important role in many applications, such as sensor network analysis, signal processing over cyber-physical systems, and finance engineering. Inference of such causal dependencies, often know as topology identification, is not well studied for non-linear non-stationary systems, and most of the existing methods are batch-based which are not capable of handling streaming sensor signals. In this paper, we propose an online kernel-based algorithm for topology estimation of non-linear vector autoregressive time series by solving a sparse online optimization framework using the composite objective mirror descent…

Signal Processing (eess.SP)Kernel (linear algebra)Signal processingSeries (mathematics)Autoregressive modelComputer scienceFOS: Electrical engineering electronic engineering information engineeringGraph (abstract data type)InferenceTopology (electrical circuits)Electrical Engineering and Systems Science - Signal ProcessingWireless sensor networkAlgorithm
researchProduct

Compiler Driven Automatic Kernel Context Migration for Heterogeneous Computing

2014

Computer systems provide different heterogeneous resources (e.g., GPUs, DSPs and FPGAs) that accelerate applications and that can reduce the energy consumption by using them. Usually, these resources have an isolated memory and a require target specific code to be written. There exist tools that can automatically generate target specific codes for program parts, so-called kernels. The data objects required for a target kernel execution need to be moved to the target resource memory. It is the programmers' responsibility to serialize these data objects used in the kernel and to copy them to or from the resource's memory. Typically, the programmer writes his own serializing function or uses e…

Source codeProgramming languageComputer sciencemedia_common.quotation_subjectSerializationSymmetric multiprocessor systemcomputer.software_genreData structureKernel preemptionKernel (image processing)Operating systemCompilerProgrammercomputermedia_common2014 IEEE 34th International Conference on Distributed Computing Systems
researchProduct

VIRES: A distributed open architecture for pictorial database

2006

In this paper we describe VIRES (Visual Information Retrieval Extendible System) an open distributed pictorial database for image retrieval. The retrieval methods, pictorial indexing and data are distributed over the network. VIRES has been designed as an open architecture. The system is based on the concept of distributed model via dictionary in order to reach a good versatility without changing the kernel of VIRES.

Space technologyInformation retrievalSettore INF/01 - InformaticaDistributed databaseDatabaseComputer scienceSearch engine indexingFeature extractioncomputer.software_genreDatabase indexKernel (image processing)Control and Systems EngineeringHardware and ArchitectureElectrical and Electronic EngineeringOpen architecturecomputerImage retrieval2003 IEEE International Workshop on Computer Architectures for Machine Perception
researchProduct

Multi-scale Modelling of Segmentation

2016

While listening to music, people often unwittingly break down musical pieces into constituent chunks such as verses and choruses. Music segmentation studies have suggested that some consensus regarding boundary perception exists, despite individual differences. However, neither the effects of experimental task (i.e., real-time vs. annotated segmentation), nor of musicianship on boundary perception are clear. Our study assesses musicianship effects and differences between segmentation tasks. We conducted a real-time experiment to collect segmentations by musicians and nonmusicians from nine musical pieces. In a second experiment on non-real-time segmentation, musicians indicated boundaries a…

Speech recognitionmedia_common.quotation_subject05 social sciencesKernel density estimationBoundary (topology)Pulse (music)Scale (music)050105 experimental psychologyTask (project management)03 medical and health sciences0302 clinical medicinePerception0501 psychology and cognitive sciencesActive listeningSegmentationPsychology030217 neurology & neurosurgeryMusicmedia_commonMusic Perception
researchProduct

The Dynamical Kernel Scheduler - Part 1

2015

Emerging processor architectures such as GPUs and Intel MICs provide a huge performance potential for high performance computing. However developing software using these hardware accelerators introduces additional challenges for the developer such as exposing additional parallelism, dealing with different hardware designs and using multiple development frameworks in order to use devices from different vendors. The Dynamic Kernel Scheduler (DKS) is being developed in order to provide a software layer between host application and different hardware accelerators. DKS handles the communication between the host and device, schedules task execution, and provides a library of built-in algorithms. …

Speedup010308 nuclear & particles physicsComputer sciencebusiness.industryFast Fourier transformGeneral Physics and AstronomyFOS: Physical sciencesParallel computingComputational Physics (physics.comp-ph)Supercomputer01 natural sciencesCUDASoftwareKernel (image processing)Hardware and Architecture0103 physical sciencesHardware acceleration010306 general physicsbusinessPhysics - Computational PhysicsXeon Phi
researchProduct

First Experiences on an Accurate SPH Method on GPUs

2017

It is well known that the standard formulation of the Smoothed Particle Hydrodynamics is usually poor when scattered data distribution is considered or when the approximation near the boundary occurs. Moreover, the method is computational demanding when a high number of data sites and evaluation points are employed. In this paper an enhanced version of the method is proposed improving the accuracy and the efficiency by using a HPC environment. Our implementation exploits the processing power of GPUs for the basic computational kernel resolution. The performance gain demonstrates the method to be accurate and suitable to deal with large sets of data.

SpeedupExploitGPUsComputer scienceComputer Networks and CommunicationsGPUSmoothed Particle Hydrodynamics method010103 numerical & computational mathematics01 natural sciencesComputational scienceSmoothed-particle hydrodynamicsInstruction setSettore MAT/08 - Analisi NumericaArtificial IntelligenceAccuracy; Approximation; GPUs; Kernel function; Smoothed particle hydrodynamics method; Speed-Up; Artificial Intelligence; Computer Networks and Communications; 1707; Signal Processing0101 mathematicsApproximationAccuracy1707Random access memoryLinear systemKernel functionSpeed-Up010101 applied mathematicsKernel (statistics)Signal Processing
researchProduct