ﻻ يوجد ملخص باللغة العربية
I outline a method for estimating astrophysical parameters (APs) from multidimensional data. It is a supervised method based on matching observed data (e.g. a spectrum) to a grid of pre-labelled templates. However, unlike standard machine learning methods such as ANNs, SVMs or k-nn, this algorithm explicitly uses domain information to better weight each data dimension in the estimation. Specifically, it uses the sensitivity of each measured variable to each AP to perform a local, iterative interpolation of the grid. It avoids both the non-uniqueness problem of global regression as well as the grid resolution limitation of nearest neighbours.
The detection of electromagnetic counterparts to gravitational waves has great promise for the investigation of many scientific questions. It has long been hoped that in addition to providing extra, non-gravitational information about the sources of
Disparity estimation for binocular stereo images finds a wide range of applications. Traditional algorithms may fail on featureless regions, which could be handled by high-level clues such as semantic segments. In this paper, we suggest that appropri
Performance of parameter estimation is one of the most important issues in array signal processing. The root mean square error, probability of success, resolution probabilities, and computational complexity are frequently used indexes for evaluating
Estimating parameters of Partial Differential Equations (PDEs) is of interest in a number of applications such as geophysical and medical imaging. Parameter estimation is commonly phrased as a PDE-constrained optimization problem that can be solved i
Fitting probabilistic models to data is often difficult, due to the general intractability of the partition function. We propose a new parameter fitting method, Minimum Probability Flow (MPF), which is applicable to any parametric model. We demonstra