Search results for "ILTER"

showing 10 items of 1040 documents

Multispectral image denoising with optimized vector non-local mean filter

2016

Nowadays, many applications rely on images of high quality to ensure good performance in conducting their tasks. However, noise goes against this objective as it is an unavoidable issue in most applications. Therefore, it is essential to develop techniques to attenuate the impact of noise, while maintaining the integrity of relevant information in images. We propose in this work to extend the application of the Non-Local Means filter (NLM) to the vector case and apply it for denoising multispectral images. The objective is to benefit from the additional information brought by multispectral imaging systems. The NLM filter exploits the redundancy of information in an image to remove noise. A …

FOS: Computer and information sciencesMulti-spectral imaging systemsComputer Vision and Pattern Recognition (cs.CV)Optimization frameworkMultispectral imageComputer Science - Computer Vision and Pattern Recognition02 engineering and technologyWhite noisePixels[SPI]Engineering Sciences [physics][ SPI ] Engineering Sciences [physics]0202 electrical engineering electronic engineering information engineeringComputer visionUnbiased risk estimatorMultispectral imageMathematicsMultispectral imagesApplied MathematicsBilateral FilterNumerical Analysis (math.NA)Non-local meansAdditive White Gaussian noiseStein's unbiased risk estimatorIlluminationComputational Theory and MathematicsRestorationImage denoisingsymbols020201 artificial intelligence & image processingNon-local mean filtersComputer Vision and Pattern RecognitionStatistics Probability and UncertaintyGaussian noise (electronic)Non- local means filtersAlgorithmsNoise reductionComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONFace Recognitionsymbols.namesakeNoise RemovalArtificial IntelligenceFOS: MathematicsParameter estimationMedian filterMathematics - Numerical AnalysisElectrical and Electronic EngineeringFusionPixelbusiness.industryVector non-local mean filter020206 networking & telecommunicationsPattern recognitionFilter (signal processing)Bandpass filters[ SPI.TRON ] Engineering Sciences [physics]/Electronics[SPI.TRON]Engineering Sciences [physics]/ElectronicsStein's unbiased risk estimators (SURE)NoiseAdditive white Gaussian noiseComputer Science::Computer Vision and Pattern RecognitionSignal ProcessingArtificial intelligenceReconstructionbusinessModel
researchProduct

Fractional Spectral Moments for Digital Simulation of Multivariate Wind Velocity Fields

2012

In this paper, a method for the digital simulation of wind velocity fields by Fractional Spectral Moment function is proposed. It is shown that by constructing a digital filter whose coefficients are the fractional spectral moments, it is possible to simulate samples of the target process as superposition of Riesz fractional derivatives of a Gaussian white noise processes. The key of this simulation technique is the generalized Taylor expansion proposed by the authors. The method is extended to multivariate processes and practical issues on the implementation of the method are reported.

FOS: Computer and information sciencesMultivariate wind velocity fieldMultivariate statisticsStatistical Mechanics (cond-mat.stat-mech)Fractional spectral momentRenewable Energy Sustainability and the EnvironmentMechanical EngineeringMathematical analysisFOS: Physical sciencesGeneralized Taylor formWhite noiseFunction (mathematics)Digital simulation of Gaussian stationary processeFractional calculuStatistics - ComputationTransfer functionWind speedFractional calculusSuperposition principleSettore ICAR/08 - Scienza Delle CostruzioniComputation (stat.CO)Condensed Matter - Statistical MechanicsLinear filterCivil and Structural EngineeringMathematics
researchProduct

Depth-Adapted CNN for RGB-D cameras

2020

Conventional 2D Convolutional Neural Networks (CNN) extract features from an input image by applying linear filters. These filters compute the spatial coherence by weighting the photometric information on a fixed neighborhood without taking into account the geometric information. We tackle the problem of improving the classical RGB CNN methods by using the depth information provided by the RGB-D cameras. State-of-the-art approaches use depth as an additional channel or image (HHA) or pass from 2D CNN to 3D CNN. This paper proposes a novel and generic procedure to articulate both photometric and geometric information in CNN architecture. The depth data is represented as a 2D offset to adapt …

FOS: Computer and information sciencesOffset (computer science)Computer scienceComputer Vision and Pattern Recognition (cs.CV)Coordinate systemComputer Science::Neural and Evolutionary ComputationComputer Science - Computer Vision and Pattern RecognitionComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION02 engineering and technologyConvolutional neural network030218 nuclear medicine & medical imaging03 medical and health sciences0302 clinical medicine0202 electrical engineering electronic engineering information engineering[INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO]Computer visionInvariant (mathematics)business.industry[INFO.INFO-RB] Computer Science [cs]/Robotics [cs.RO]020207 software engineeringWeightingSpatial coherenceComputer Science::Computer Vision and Pattern RecognitionRGB color modelArtificial intelligencebusinessLinear filter
researchProduct

Detecting informative higher-order interactions in statistically validated hypergraphs

2021

Recent empirical evidence has shown that in many real-world systems, successfully represented as networks, interactions are not limited to dyads, but often involve three or more agents at a time. These data are better described by hypergraphs, where hyperlinks encode higher-order interactions among a group of nodes. In spite of the large number of works on networks, highlighting informative hyperlinks in hypergraphs obtained from real world data is still an open problem. Here we propose an analytic approach to filter hypergraphs by identifying those hyperlinks that are over-expressed with respect to a random null hypothesis, and represent the most relevant higher-order connections. We apply…

FOS: Computer and information sciencesPhysics - Physics and SocietyComputer scienceQC1-999Open problemFOS: Physical sciencesGeneral Physics and AstronomyPhysics and Society (physics.soc-ph)Astrophysicscomputer.software_genreENCODEMethodology (stat.ME)Statistics - MethodologySocial and Information Networks (cs.SI)PhysicsComputer Science - Social and Information NetworksFilter (signal processing)HyperlinkClass (biology)Settore FIS/07 - Fisica Applicata(Beni Culturali Ambientali Biol.e Medicin)QB460-466Pairwise comparisonData miningNoise (video)Null hypothesiscomputerhigher order interactions statistical validation complex networksCommunications Physics
researchProduct

Parsimonious adaptive rejection sampling

2017

Monte Carlo (MC) methods have become very popular in signal processing during the past decades. The adaptive rejection sampling (ARS) algorithms are well-known MC technique which draw efficiently independent samples from univariate target densities. The ARS schemes yield a sequence of proposal functions that converge toward the target, so that the probability of accepting a sample approaches one. However, sampling from the proposal pdf becomes more computationally demanding each time it is updated. We propose the Parsimonious Adaptive Rejection Sampling (PARS) method, where an efficient trade-off between acceptance rate and proposal complexity is obtained. Thus, the resulting algorithm is f…

FOS: Computer and information sciencesSignal processingSequenceComputer science020208 electrical & electronic engineeringMonte Carlo methodRejection samplingUnivariateSampling (statistics)020206 networking & telecommunicationsSample (statistics)02 engineering and technologyStatistics - ComputationAdaptive filter0202 electrical engineering electronic engineering information engineeringElectrical and Electronic EngineeringAlgorithmComputation (stat.CO)Electronics Letters
researchProduct

Conditional particle filters with diffuse initial distributions

2020

Conditional particle filters (CPFs) are powerful smoothing algorithms for general nonlinear/non-Gaussian hidden Markov models. However, CPFs can be inefficient or difficult to apply with diffuse initial distributions, which are common in statistical applications. We propose a simple but generally applicable auxiliary variable method, which can be used together with the CPF in order to perform efficient inference with diffuse initial distributions. The method only requires simulatable Markov transitions that are reversible with respect to the initial distribution, which can be improper. We focus in particular on random-walk type transitions which are reversible with respect to a uniform init…

FOS: Computer and information sciencesStatistics and ProbabilityComputer scienceGaussianBayesian inferenceMarkovin ketjut02 engineering and technology01 natural sciencesStatistics - ComputationArticleTheoretical Computer ScienceMethodology (stat.ME)010104 statistics & probabilitysymbols.namesakeAdaptive Markov chain Monte Carlotilastotiede0202 electrical engineering electronic engineering information engineeringStatistical physics0101 mathematicsDiffuse initialisationHidden Markov modelComputation (stat.CO)Statistics - MethodologyState space modelHidden Markov modelbayesian inferenceMarkov chaindiffuse initialisationbayesilainen menetelmäconditional particle filtersmoothingmatemaattiset menetelmät020206 networking & telecommunicationsConditional particle filterCovariancecompartment modelRandom walkCompartment modelstate space modelComputational Theory and MathematicsAutoregressive modelsymbolsStatistics Probability and UncertaintyParticle filterSmoothingSmoothing
researchProduct

Unbiased Inference for Discretely Observed Hidden Markov Model Diffusions

2021

We develop a Bayesian inference method for diffusions observed discretely and with noise, which is free of discretisation bias. Unlike existing unbiased inference methods, our method does not rely on exact simulation techniques. Instead, our method uses standard time-discretised approximations of diffusions, such as the Euler--Maruyama scheme. Our approach is based on particle marginal Metropolis--Hastings, a particle filter, randomised multilevel Monte Carlo, and importance sampling type correction of approximate Markov chain Monte Carlo. The resulting estimator leads to inference without a bias from the time-discretisation as the number of Markov chain iterations increases. We give conver…

FOS: Computer and information sciencesStatistics and ProbabilityDiscretizationComputer scienceMarkovin ketjutInference010103 numerical & computational mathematicssequential Monte CarloBayesian inferenceStatistics - Computation01 natural sciencesMethodology (stat.ME)010104 statistics & probabilitysymbols.namesakediffuusio (fysikaaliset ilmiöt)FOS: MathematicsDiscrete Mathematics and Combinatorics0101 mathematicsHidden Markov modelComputation (stat.CO)Statistics - Methodologymatematiikkabayesilainen menetelmäApplied MathematicsProbability (math.PR)diffusionmatemaattiset menetelmätMarkov chain Monte CarloMarkov chain Monte CarloMonte Carlo -menetelmätNoiseimportance sampling65C05 (primary) 60H35 65C35 65C40 (secondary)Modeling and Simulationsymbolsmatemaattiset mallitStatistics Probability and Uncertaintymultilevel Monte CarloParticle filterAlgorithmMathematics - ProbabilityImportance samplingSIAM/ASA Journal on Uncertainty Quantification
researchProduct

Bootstrap validation of links of a minimum spanning tree

2018

We describe two different bootstrap methods applied to the detection of a minimum spanning tree obtained from a set of multivariate variables. We show that two different bootstrap procedures provide partly distinct information that can be highly informative about the investigated complex system. Our case study, based on the investigation of daily returns of a portfolio of stocks traded in the US equity markets, shows the degree of robustness and completeness of the information extracted with popular information filtering methods such as the minimum spanning tree and the planar maximally filtered graph. The first method performs a "row bootstrap" whereas the second method performs a "pair bo…

FOS: Computer and information sciencesStatistics and ProbabilityMultivariate statisticsCorrelation coefficientCovariance matrixReplicaComplex systemMinimum spanning treeCondensed Matter Physics01 natural sciencesSettore FIS/07 - Fisica Applicata(Beni Culturali Ambientali Biol.e Medicin)Minimum spanning tree Bootstrap Planar maximally filtered graph Information filtering Proximity based networks Random matrix theory010305 fluids & plasmasMethodology (stat.ME)0103 physical sciencesStatistics010306 general physicsRandom matrixStatistics - MethodologyMathematics
researchProduct

Panel Data Analysis via Mechanistic Models

2018

Panel data, also known as longitudinal data, consist of a collection of time series. Each time series, which could itself be multivariate, comprises a sequence of measurements taken on a distinct unit. Mechanistic modeling involves writing down scientifically motivated equations describing the collection of dynamic systems giving rise to the observations on each unit. A defining characteristic of panel systems is that the dynamic interaction between units should be negligible. Panel models therefore consist of a collection of independent stochastic processes, generally linked through shared parameters while also having unit-specific parameters. To give the scientist flexibility in model spe…

FOS: Computer and information sciencesStatistics and ProbabilityMultivariate statisticsSeries (mathematics)Longitudinal dataComputer science05 social sciences01 natural sciencesMethodology (stat.ME)010104 statistics & probabilityNonlinear system0502 economics and business0101 mathematicsStatistics Probability and UncertaintyParticle filterAlgorithmStatistics - Methodology050205 econometrics Panel dataSequence (medicine)Journal of the American Statistical Association
researchProduct

The invisible setting of digital space: the Facebook case

2018

La neutralidad en la red no existe. El espacio digital puede ser adaptado de forma automática al perfil de cada usuario. Sin que este tenga que identificarse, las empresas de gestión de contenidos en Internet disponen de suficientes datos de cualquier individuo para poder filtrar los resultados de su búsqueda y personalizarlos, sin previo aviso, condicionando así su experiencia en la red. Esta investigación, de carácter exploratorio, aborda en primer lugar la descripción del espacio público digital. En segundo lugar, plantea una tipología de espacios digitales que se definen en función del grado de adaptación de los contenidos al usuario. Finalmente, presenta un análisis de caso de espacio …

FacebookalgorithmPersonalizationComputer Networks and Communicationsdigital public spaceCommunicationespacio público digitalNews FeedalgoritmosFilter bubblePersonalizaciónSocietat de la informacióBurbuja de filtros
researchProduct