Results 251 to 260 of about 701,217 (307)
Some of the next articles are maybe not open access.
Least Absolute Deviations Curve-Fitting
SIAM Journal on Scientific and Statistical Computing, 1980A method is proposed for least absolute deviation curve fitting. It may be used to obtain least absolute deviations fits of general linear regressions. As a special case it includes a minor variant of a method for fitting straight lines by least absolute deviations that was previously thought to possess no generalization.
Bloomfield, Peter, Steiger, William
openaire +2 more sources
Least‐absolute‐deviations position finding
Naval Research Logistics Quarterly, 1982AbstractPosition finding has historically been carried out by calculating the coordinates of the mean position via a least‐squares procedure based on the distance of the position from several direction lines. It has been suggested that the least‐squares procedure assigns too much weight to outliers among the set of direction lines, outliers which may ...
openaire +1 more source
Permutation Tests for Least Absolute Deviation Regression
Biometrics, 1996A permutation test based on proportionate reduction in sums of absolute deviations when passing from reduced to full parameter models is developed for testing hypotheses about least absolute deviation (LAD) estimates of conditional medians in linear regression models.
Cade, Brian S., Richards, Jon D.
openaire +2 more sources
2011
The paper discussed a new additive extension of minimum cut by simultaneously minimizing intra cluster similarity bias and inter cluster similarity, Least Absolute Deviation Cut (LAD cut). The LAD cut can be proved convergent in finite iterative steps, and its theoretical conditions that the LAD cut can work well is also presented.
Jian Yu, Liping Jing
openaire +1 more source
The paper discussed a new additive extension of minimum cut by simultaneously minimizing intra cluster similarity bias and inter cluster similarity, Least Absolute Deviation Cut (LAD cut). The LAD cut can be proved convergent in finite iterative steps, and its theoretical conditions that the LAD cut can work well is also presented.
Jian Yu, Liping Jing
openaire +1 more source
Least orthogonal absolute deviations
Computational Statistics & Data Analysis, 1988zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Exact Computation of Censored Least Absolute Deviations Estimators
SSRN Electronic Journal, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bilias, Yannis +2 more
openaire +1 more source
Least absolute deviation (LAD) image matching
ISPRS Journal of Photogrammetry and Remote Sensing, 1996Abstract The robust estimator properties of the L,-norm or least absolute deviation (LAD) is shown to provide better subpixel matching accuracy in the presence of outlier points than the least squares method widely employed for image matching applications.
M.F. Calitz, H. Rüther
openaire +1 more source
Distributed Least Absolute Deviations Estimation
Journal of Guidance, Control, and DynamicsDistributed algorithms are essential for reducing communication costs, computational complexity, and memory requirements while performing collaborative estimation using multi-agent systems. Additionally, robustness in estimators is important to prevent performance degradation when the measurement noise is non-Gaussian.
Kaushik Prabhu +3 more
openaire +1 more source
A Joint Least Squares and Least Absolute Deviation Model
IEEE Signal Processing Letters, 2019We propose a joint least squares and least absolute deviations (JOLESALAD) model, show that the proposed model can cover least absolute shrinkage and selection operator (LASSO) and two of its variants, namely the generalized LASSO (gLASSO) and the constrained LASSO (cLASSO), and prove that under a full rank condition, the JOLESALAD can be transformed ...
Junbo Duan +3 more
openaire +2 more sources
Robust object tracking using least absolute deviation
Image and Vision Computing, 2014Recently, sparse representation has been applied to object tracking, where each candidate target is approximately represented as a sparse linear combination of target templates. In this paper, we present a new tracking algorithm, which is faster and more robust than other tracking algorithms, based on sparse representation.
Jingyu Yan +3 more
openaire +1 more source