| 1. |
- Arslan, O., et al.
(författare)
-
Algorithms to compute CM - and S-estimates for regression
- 2003
-
Ingår i: International Conference on Robust Statistics. - : Physica-Verlag Rudolf Liebig GmbH. - 3790815187 ; , s. 62-76
-
Konferensbidrag (refereegranskat)abstract
- Constrained M-estimators for regression were introduced by Mendes and Tyler in 1995 as an alternative class of robust regression estimators with high breakdown point and high asymptotic efficiency. To compute the CM-estimate, the global minimum of an objective function with an inequality constraint has to be localized. To find the S-estimate for the same problem, we instead restrict ourselves to the boundary of the feasible region. The algorithm presented for computing CM-estimates can easily be modified to compute S-estimates as well. Testing is carried out with a comparison to the algorithm SURREAL by Ruppert
|
|
| 2. |
- Bergström, Per, et al.
(författare)
-
Efficient computation of the Gauss-Newton direction when fitting NURBS using ODR
- 2012
-
Ingår i: BIT Numerical Mathematics. - : Springer Science and Business Media LLC. - 0006-3835 .- 1572-9125. ; 52:3, s. 571-588
-
Tidskriftsartikel (refereegranskat)abstract
- We consider a subproblem in parameter estimation using the Gauss-Newton algorithm with regularization for NURBS curve fitting. The NURBS curve is fitted to a set of data points in least-squares sense, where the sum of squared orthogonal distances is minimized. Control-points and weights are estimated. The knot-vector and the degree of the NURBS curve are kept constant. In the Gauss-Newton algorithm, a search direction is obtained from a linear overdetermined system with a Jacobian and a residual vector. Because of the properties of our problem, the Jacobian has a particular sparse structure which is suitable for performing a splitting of variables. We are handling the computational problems and report the obtained accuracy using different methods, and the elapsed real computational time. The splitting of variables is a two times faster method than using plain normal equations.
|
|
| 3. |
- Bergström, Per, et al.
(författare)
-
Repeated surface registration for on-line use
- 2011
-
Ingår i: The International Journal of Advanced Manufacturing Technology. - : Springer Science and Business Media LLC. - 0268-3768 .- 1433-3015. ; 54:5-8, s. 677-689
-
Tidskriftsartikel (refereegranskat)abstract
- We consider the problem of matching sets of 3D points from a measured surface to the surface of a corresponding computer-aided design (CAD) object. The problem arises in the production line where the shape of the produced items is to be compared on-line with its pre-described shape. The involved registration problem is solved using the iterative closest point (ICP) method. In order to make it suitable for on-line use, i.e., make it fast, we pre-process the surface representation of the CAD object. A data structure for this purpose is proposed and named Distance Varying Grid tree. It is based on a regular grid that encloses points sampled from the CAD surfaces. Additional finer grids are added to the vertices in the grid that are close to the sampled points. The structure is efficient since it utilizes that the sampled points are distributed on surfaces, and it provides fast identification of the sampled point that is closest to a measured point. A local linear approximation of the surface is used for improving the accuracy. Experiments are done on items produced for the body of a car. The experiments show that it is possible to reach good accuracy in the registration and decreasing the computational time by a factor 700 compared with using the common kd-tree structure.
|
|
| 4. |
- Bergström, Per, et al.
(författare)
-
Robust registration of point sets using iteratively reweighted least squares
- 2014
-
Ingår i: Computational optimization and applications. - : Springer Science and Business Media LLC. - 0926-6003 .- 1573-2894. ; 58:3, s. 543-561
-
Tidskriftsartikel (refereegranskat)abstract
- Registration of point sets is done by finding a rotation and translation that produces a best fit between a set of data points and a set of model points. We use robust M-estimation techniques to limit the influence of outliers, more specifically a modified version of the iterative closest point algorithm where we use iteratively re-weighed least squares to incorporate the robustness. We prove convergence with respect to the value of the objective function for this algorithm. A comparison is also done of different criterion functions to figure out their abilities to do appropriate point set fits, when the sets of data points contains outliers. The robust methods prove to be superior to least squares minimization in this setting.
|
|
| 5. |
- Bergström, Per, et al.
(författare)
-
Robust registration of surfaces using a refined iterative closest point algorithm with a trust region approach
- 2017
-
Ingår i: Numerical Algorithms. - : Springer. - 1017-1398 .- 1572-9265. ; 74:3, s. 755-779
-
Tidskriftsartikel (refereegranskat)abstract
- The problem of finding a rigid body transformation, which aligns a set of data points with a given surface, using a robust M-estimation technique is considered. A refined iterative closest point (ICP) algorithm is described where a minimization problem of point-to-plane distances with a proposed constraint is solved in each iteration to find an updating transformation. The constraint is derived from a sum of weighted squared point-to-point distances and forms a natural trust region, which ensures convergence. Only a minor number of additional computations are required to use it. Two alternative trust regions are introduced and analyzed. Finally, numerical results for some test problems are presented. It is obvious from these results that there is a significant advantage, with respect to convergence rate of accuracy, to use the proposed trust region approach in comparison with using point-to-point distance minimization as well as using point-to-plane distance minimization and a Newton- type update without any step size control.
|
|
| 6. |
|
|
| 7. |
|
|
| 8. |
- Edlund, Ove
(författare)
-
A software package for sparse orthogonal factorization and updating
- 2002
-
Ingår i: ACM Transactions on Mathematical Software. - : Association for Computing Machinery (ACM). - 0098-3500 .- 1557-7295. ; 28:4, s. 448-482
-
Tidskriftsartikel (refereegranskat)abstract
- Although there is good software for sparse QR factorization, there is little support for updating and downdating, something that is absolutely essential in some linear programming algorithms, for example. This article describes an implementation of sparse LQ factorization, including block triangularization, approximate minimum degree ordering, symbolic factorization, multifrontal factorization, and updating and downdating. The factor Q is not retained. The updating algorithm expands the nonzero pattern of the factor L, which is reflected in the dynamic representation of L. The block triangularization is used as an `ordering for sparsity' rather than as a prerequisite for block backward substitution. In symbolic factorization, something called `element counters' is introduced to reduce the overestimation of the number of nonzeros that the commonly used methods do. Both the approximate minimum degree ordering and the symbolic factorization are done without explicitly forming the nonzero pattern of the symmetric matrix in the corresponding normal equations. Tests show that the average time used for a single update or downdate is essentially the same as the time used for a single forward or backward substitution. Other parts of the implementation show the same range of performance as existing code, but cannot be replaced because of the special character of the systems that are solved.
|
|
| 9. |
- Edlund, Ove, et al.
(författare)
-
Algorithms for non-linear M-estimation
- 1997
-
Ingår i: Computational statistics (Zeitschrift). - 0943-4062 .- 1613-9658. ; 12:3, s. 373-383
-
Tidskriftsartikel (refereegranskat)
|
|
| 10. |
- Edlund, Ove, et al.
(författare)
-
Algorithms for robustified error-in-variables problems
- 1998
-
Ingår i: COMPSTAT [1998]. - Heidelberg : Physica-Verlag Rudolf Liebig GmbH. - 3790811319 ; , s. 293-298
-
Konferensbidrag (refereegranskat)abstract
- From the introduction: We consider the problem of fitting a model of the form $y=f(x,\beta)$ to a set of points $(x_i,y_i)$, $i=1,\dots,n$. If there are measurement or observation errors in $x$ as well as in $y$, we have the so-called errors-in-variables-problem with model equation $$y_i=f(x_i+\delta_i,\beta)+\varepsilon_i,\ i=1,\dots,n,\tag 1$$ where $\delta_i\in\bbfR^m$, $i=1,\dots,n$, are the errors in $x_i\in\bbfR^m$. Then the problem is to find a vector of parameters $\beta\in\bbfR^p$ that minimizes the errors $\varepsilon_i$ and $\delta_i$ in some loss function subject to (1). We present algorithms using more robust alternatives to the least squares criterion.\par We will further discuss, from
|
|
| 11. |
- Edlund, Ove
(författare)
-
CMregr - A Matlab software package for finding CM-Estimates for Regression
- 2004
-
Ingår i: Journal of Statistical Software. - : Foundation for Open Access Statistic. - 1548-7660. ; 10:3, s. 1-11
-
Tidskriftsartikel (refereegranskat)abstract
- This paper describes how to use the Matlab software package CMregr, and also gives some limited information on the CM-estimation problem itself. For detailed information on the algorithms used in CMregr as well as extensive testings, please refer to Arslan, Edlund & Ekblom (2002) and Edlund & Ekblom (2004).
|
|
| 12. |
- Edlund, Ove, et al.
(författare)
-
Computing the constrained M-estimates for regression
- 2005
-
Ingår i: Computational Statistics & Data Analysis. - : Elsevier BV. - 0167-9473 .- 1872-7352. ; 49:1, s. 19-32
-
Tidskriftsartikel (refereegranskat)abstract
- Constrained M-estimates for regression have been previously proposed as an alternative class of robust regression estimators with high breakdown point and high asymptotic efficiency. These are closely related to S-estimates, and it is shown that in some cases they will necessarily coincide. It has been difficult to use the CM-estimators in practice for two reasons. Adequate computational methods have been lacking and there has also been some confusion concerning the tuning parameters. Both of these problems are addressed; an updated table for choice of suitable parameter value is given, and an algorithm to compute CM-estimates for regression is presented. It can also be used to compute S-estimates. The computational problem to be solved is global optimization with an inequality constraint. The algorithm consists of two phases. The first phase is finding suitable starting values for the local optimization. The second phase, the efficient finding of a local minimum, is described in more detail. There is a MATLAB code generally available from the net. A Monte Carlo simulation is performed, using this code, to test the performance of the estimator as well as the algorithm.
|
|
| 13. |
|
|
| 14. |
|
|
| 15. |
- Edlund, Ove
(författare)
-
Linear M-estimation with bounded variables
- 1997
-
Ingår i: BIT Numerical Mathematics. - 0006-3835 .- 1572-9125. ; 37:1, s. 13-23
-
Tidskriftsartikel (refereegranskat)abstract
- A subproblem in the trust region algorithm for non-linear M-estimation by Ekblom and Madsen is to find the restricted step. It is found by calculating the M-estimator of the linearized model, subject to anL 2-norm bound on the variables. In this paper it is shown that this subproblem can be solved by applying Hebden-iterations to the minimizer of the Lagrangian function. The new method is compared with an Augmented Lagrange implementation.
|
|
| 16. |
- Edlund, Ove
(författare)
-
Solution of linear programming and non-linear regression problems using linear M-estimation methods
- 1999
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- This thesis is devoted to algorithms for solving two optimization problems, using linear M-estimation methods, and their implementation. First, an algorithm for the non-linear M-estimation problem is considered. The main idea of the algorithm is to linearize the residual function in each iteration and thus calculate the iteration step by solving a linear M- estimation problem. A 2-norm bound on the variables restricts the step size, to guarantee convergence. The other algorithm solves the dual linear programming problem by making a ``smooth'' approximation of edges and inequality constraints using quadratic functions, thus making it possible to use Newton's method to find the optimal solution. The quadratic approximation of the inequality constraint makes it a penalty function algorithm. The implementation uses sparse matrix techniques. Since it is an active set method, it is possible to reuse the old factor when calculating the new step, by up- and downdating the old factor. It is only occasionally, when the downdating fails, that the factor instead has to be found with a sparse multifrontal LQ-factorization.
|
|
| 17. |
- Michelson, Ingrid H., et al.
(författare)
-
Autumn senescence in aspen is not triggered by day length
- 2018
-
Ingår i: Physiologia Plantarum. - : John Wiley & Sons. - 0031-9317 .- 1399-3054. ; 162:1, s. 123-134
-
Tidskriftsartikel (refereegranskat)abstract
- Autumn senescence in mature aspens, grown under natural conditions, is initiated at almost the same date every year. The mechanism of such precise timing is not understood but we have previously shown that the signal must be derived from light. We studied variation in bud set and autumn senescence in a collection of 116 natural Eurasian aspen (Populus tremula) genotypes, from 12 populations in Sweden and planted in one northern and one southern common garden, to test the hypothesis that onset of autumn senescence is triggered by day length. We confirmed that, although bud set seemed to be triggered by a critical photoperiod/day length, other factors may influence it. The data on initiation of autumn senescence, on the other hand, were incompatible with the trigger being the day length per se, hence the trigger must be some other light-dependent factor.
|
|
| 18. |
- Persson, Per-Axel, et al.
(författare)
-
High-pressure polymerized C60
- 1996
-
Ingår i: Extended Abstracts of Carbon´96, European Carbon Conference, Newcastle-upon-Tyne 1996, volume 2. - : The British Carbon Group. ; , s. 746-747, s. 746-747
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)
|
|
| 19. |
- Sikveland, Rein-Ove, et al.
(författare)
-
Spontal-N : A Corpus of Interactional Spoken Norwegian
- 2010
-
Ingår i: Proc. of the Seventh conference on International Language Resources and Evaluation (LREC'10). - 9782951740860 ; , s. 2986-2991
-
Konferensbidrag (refereegranskat)abstract
- Spontal-N is a corpus of spontaneous, interactional Norwegian. To our knowledge, it is the first corpus of Norwegian in which the majority of speakers have spent significant parts of their lives in Sweden, and in which the recorded speech displays varying degrees of interference from Swedish. The corpus consists of studio quality audio- and video-recordings of four 30-minute free conversations between acquaintances, and a manual orthographic transcription of the entire material. On basis of the orthographic transcriptions, we automatically annotated approximately 50 percent of thematerial on the phoneme level, by means of a forced alignment between the acoustic signal and pronunciations listed in a dictionary. Approximately seven percent of the automatic transcription was manually corrected. Taking the manual correction as a gold standard, we evaluated several sources of pronunciation variants for the automatic transcription. Spontal-N is intended as a general purpose speech resource that is also suitable for investigating phonetic detail.
|
|
| 20. |
- Sundqvist, Bertil, et al.
(författare)
-
Physical properties of pressure polymerized C60
- 1996
-
Ingår i: Fullerenes: Recent Advances in the Chemistry and Physics of Fullerenes and Related Materials, volume 3. - Pennington, NJ : The Electrochemical Society. - 1566771625 ; , s. 1014-1028
-
Konferensbidrag (refereegranskat)abstract
- We present in this paper an overview of the physical properties of the high pressure polymerized C60 phase commonly known as "soft fcc". This phase has been studied by several methods over wide ranges in temperature T and/or pressure, p. We present here experimental information about the specific heat capacity, the thermal expansion coefficient, the lattice structure, and the thermal conductivity, and we also show results obtained by NMR and Raman spectroscopy. All data presented agree with the accepted model that the individual molecules in this phase are covalently bound to form linear molecular chains. In particular, the NMR data show clearly the presence of covalent bonds, and the Raman data exhibit several new lines at very low energies connected with chain vibrations. Thermal conductivity data obtained during polymerization show both the time dependence of the process and that polymerization occurs at lower p and T than observed previously for this phase.
|
|
