Change search

BETA
Edlund, Ove
##### Publications (10 of 13) Show all publications
Bergström, P. & Edlund, O. (2017). Robust registration of surfaces using a refined iterative closest point algorithm with a trust region approach. Numerical Algorithms, 74(3), 755-779
Open this publication in new window or tab >>Robust registration of surfaces using a refined iterative closest point algorithm with a trust region approach
2017 (English)In: Numerical Algorithms, ISSN 1017-1398, E-ISSN 1572-9265, Vol. 74, no 3, p. 755-779Article in journal (Refereed) Published
##### Abstract [en]

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.

Springer, 2017
##### National Category
Mathematical Analysis
##### Research subject
Mathematics; Experimental Mechanics
##### Identifiers
urn:nbn:se:ltu:diva-59969 (URN)10.1007/s11075-016-0170-3 (DOI)000395033800006 ()2-s2.0-84978159472 (Scopus ID)
VINNOVA
##### Note

Validerad; 2017; Nivå 2; 2017-02-24 (andbra)

Available from: 2016-10-26 Created: 2016-10-26 Last updated: 2018-11-15Bibliographically approved
Bergström, P. & Edlund, O. (2014). Robust registration of point sets using iteratively reweighted least squares (ed.). Computational optimization and applications, 58(3), 543-561
Open this publication in new window or tab >>Robust registration of point sets using iteratively reweighted least squares
2014 (English)In: Computational optimization and applications, ISSN 0926-6003, E-ISSN 1573-2894, Vol. 58, no 3, p. 543-561Article in journal (Refereed) Published
##### Abstract [en]

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.

##### National Category
Computational Mathematics
##### Research subject
Scientific Computing
##### Identifiers
urn:nbn:se:ltu:diva-3921 (URN)10.1007/s10589-014-9643-2 (DOI)000337084900002 ()2-s2.0-84904999267 (Scopus ID)1c497761-d55b-4956-85e6-e160c9668a13 (Local ID)1c497761-d55b-4956-85e6-e160c9668a13 (Archive number)1c497761-d55b-4956-85e6-e160c9668a13 (OAI)
##### Note

Validerad; 2014; 20140206 (berper)

Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-12-14Bibliographically approved
Bergström, P., Edlund, O. & Söderkvist, I. (2012). Efficient computation of the Gauss-Newton direction when fitting NURBS using ODR (ed.). Paper presented at . BIT Numerical Mathematics, 52(3), 571-588
Open this publication in new window or tab >>Efficient computation of the Gauss-Newton direction when fitting NURBS using ODR
2012 (English)In: BIT Numerical Mathematics, ISSN 0006-3835, E-ISSN 1572-9125, Vol. 52, no 3, p. 571-588Article in journal (Refereed) Published
##### Abstract [en]

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.

##### Keywords
Mathematics, numerik, Matematik
##### National Category
Computational Mathematics
##### Research subject
Scientific Computing
##### Identifiers
urn:nbn:se:ltu:diva-8758 (URN)10.1007/s10543-012-0371-7 (DOI)000308234600004 ()2-s2.0-84865746930 (Scopus ID)74aec6df-c813-471b-a9b5-df74c969c19b (Local ID)74aec6df-c813-471b-a9b5-df74c969c19b (Archive number)74aec6df-c813-471b-a9b5-df74c969c19b (OAI)
##### Note
Validerad; 2012; 20120130 (berper)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-07-10Bibliographically approved
Bergström, P., Edlund, O. & Söderkvist, I. (2011). Repeated surface registration for on-line use (ed.). Paper presented at . The International Journal of Advanced Manufacturing Technology, 54(5-8), 677-689
Open this publication in new window or tab >>Repeated surface registration for on-line use
2011 (English)In: The International Journal of Advanced Manufacturing Technology, ISSN 0268-3768, E-ISSN 1433-3015, Vol. 54, no 5-8, p. 677-689Article in journal (Refereed) Published
##### Abstract [en]

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.

##### Keywords
Manufacturing engineering and work sciences - Manufacturing engineering, Produktion och arbetsvetenskap - Produktionsteknik
##### National Category
Computational Mathematics
##### Research subject
Scientific Computing
##### Identifiers
urn:nbn:se:ltu:diva-10134 (URN)10.1007/s00170-010-2950-6 (DOI)000290164500022 ()2-s2.0-79955666988 (Scopus ID)8e1867e0-d523-11df-8b36-000ea68e967b (Local ID)8e1867e0-d523-11df-8b36-000ea68e967b (Archive number)8e1867e0-d523-11df-8b36-000ea68e967b (OAI)
##### Note
Validerad; 2011; 20101011 (berper)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-07-10Bibliographically approved
Edlund, O. & Ekblom, H. (2005). Computing the constrained M-estimates for regression (ed.). Paper presented at . Computational Statistics & Data Analysis, 49(1), 19-32
Open this publication in new window or tab >>Computing the constrained M-estimates for regression
2005 (English)In: Computational Statistics & Data Analysis, ISSN 0167-9473, E-ISSN 1872-7352, Vol. 49, no 1, p. 19-32Article in journal (Refereed) Published
##### Abstract [en]

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.

##### National Category
Computational Mathematics
##### Research subject
Scientific Computing
##### Identifiers
urn:nbn:se:ltu:diva-15863 (URN)10.1016/j.csda.2004.04.012 (DOI)000227461500002 ()2-s2.0-13644261751 (Scopus ID)f6e79260-a55b-11db-8975-000ea68e967b (Local ID)f6e79260-a55b-11db-8975-000ea68e967b (Archive number)f6e79260-a55b-11db-8975-000ea68e967b (OAI)
##### Note
Validerad; 2005; 20070116 (evan)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-07-10Bibliographically approved
Edlund, O. (2004). CMregr - A Matlab software package for finding CM-Estimates for Regression (ed.). Paper presented at . Journal of Statistical Software, 10(3), 1-11
Open this publication in new window or tab >>CMregr - A Matlab software package for finding CM-Estimates for Regression
2004 (English)In: Journal of Statistical Software, ISSN 1548-7660, E-ISSN 1548-7660, Vol. 10, no 3, p. 1-11Article in journal (Refereed) Published
##### Abstract [en]

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).

##### National Category
Computational Mathematics
##### Research subject
Scientific Computing
##### Identifiers
urn:nbn:se:ltu:diva-8696 (URN)73aec9f0-5248-11dc-959a-000ea68e967b (Local ID)73aec9f0-5248-11dc-959a-000ea68e967b (Archive number)73aec9f0-5248-11dc-959a-000ea68e967b (OAI)
##### Note
Validerad; 2004; 20070824 (ysko)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2017-11-24Bibliographically approved
Arslan, O., Edlund, O. & Ekblom, H. (2003). Algorithms to compute CM - and S-estimates for regression (ed.). In: (Ed.), Rudolf Dutter; P. Filzmoser; U. Gather; P. J. Pousseeuw (Ed.), International Conference on Robust Statistics: ICORS. Paper presented at Developments in robust statistics : 23/07/2001 - 27/07/2001 (pp. 62-76). : Physica-Verlag Rudolf Liebig GmbH
Open this publication in new window or tab >>Algorithms to compute CM - and S-estimates for regression
2003 (English)In: International Conference on Robust Statistics: ICORS / [ed] Rudolf Dutter; P. Filzmoser; U. Gather; P. J. Pousseeuw, Physica-Verlag Rudolf Liebig GmbH , 2003, p. 62-76Conference paper, Published paper (Refereed)
##### Abstract [en]

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

##### Place, publisher, year, edition, pages
Physica-Verlag Rudolf Liebig GmbH, 2003
##### Series
Metrika, ISSN 0026-1335 ; 1-2
##### National Category
Computational Mathematics
##### Research subject
Scientific Computing
##### Identifiers
urn:nbn:se:ltu:diva-37223 (URN)b2e030f0-ac80-11db-aeba-000ea68e967b (Local ID)3-7908-1518-7 (ISBN)b2e030f0-ac80-11db-aeba-000ea68e967b (Archive number)b2e030f0-ac80-11db-aeba-000ea68e967b (OAI)
##### Conference
Developments in robust statistics : 23/07/2001 - 27/07/2001
##### Note
Godkänd; 2003; 20070122 (evan)Available from: 2016-10-03 Created: 2016-10-03 Last updated: 2017-11-25Bibliographically approved
Edlund, O. (2002). A software package for sparse orthogonal factorization and updating (ed.). Paper presented at . ACM Transactions on Mathematical Software, 28(4), 448-482
Open this publication in new window or tab >>A software package for sparse orthogonal factorization and updating
2002 (English)In: ACM Transactions on Mathematical Software, ISSN 0098-3500, E-ISSN 1557-7295, Vol. 28, no 4, p. 448-482Article in journal (Refereed) Published
##### Abstract [en]

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.

##### National Category
Computational Mathematics
##### Research subject
Scientific Computing
##### Identifiers
urn:nbn:se:ltu:diva-14374 (URN)10.1145/592843.592848 (DOI)000179844400005 ()2-s2.0-0039488522 (Scopus ID)db9d32e0-aafa-11db-aeba-000ea68e967b (Local ID)db9d32e0-aafa-11db-aeba-000ea68e967b (Archive number)db9d32e0-aafa-11db-aeba-000ea68e967b (OAI)
##### Note
Validerad; 2002; 20070123 (kani)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-07-10Bibliographically approved
Edlund, O. (1999). Solution of linear programming and non-linear regression problems using linear M-estimation methods (ed.). (Doctoral dissertation). Paper presented at . Luleå: Luleå tekniska universitet
Open this publication in new window or tab >>Solution of linear programming and non-linear regression problems using linear M-estimation methods
1999 (English)Doctoral thesis, comprehensive summary (Other academic)
##### Abstract [en]

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.

##### Place, publisher, year, edition, pages
Luleå: Luleå tekniska universitet, 1999. p. 117
##### Series
Doctoral thesis / Luleå University of Technology 1 jan 1997 → …, ISSN 1402-1544 ; 1999:17
##### National Category
Computational Mathematics
##### Research subject
Scientific Computing
##### Identifiers
urn:nbn:se:ltu:diva-26286 (URN)d8097200-763a-11db-962b-000ea68e967b (Local ID)d8097200-763a-11db-962b-000ea68e967b (Archive number)d8097200-763a-11db-962b-000ea68e967b (OAI)
##### Note
Godkänd; 1999; 20061117 (haneit)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2017-11-24Bibliographically approved
Edlund, O. & Ekblom, H. (1998). Algorithms for robustified error-in-variables problems (ed.). In: (Ed.), Roger Payne; Peter Green (Ed.), COMPSTAT [1998]: proceedings in computational statistics ; 13th symposium held in Bristol, Great Britain, 1998 ; with 61 tables. Paper presented at COMPSTAT : 24/08/1998 - 28/08/1998 (pp. 293-298). Heidelberg: Physica-Verlag Rudolf Liebig GmbH
Open this publication in new window or tab >>Algorithms for robustified error-in-variables problems
1998 (English)In: COMPSTAT [1998]: proceedings in computational statistics ; 13th symposium held in Bristol, Great Britain, 1998 ; with 61 tables / [ed] Roger Payne; Peter Green, Heidelberg: Physica-Verlag Rudolf Liebig GmbH , 1998, p. 293-298Conference paper, Published paper (Refereed)
##### Abstract [en]

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

##### Place, publisher, year, edition, pages
Heidelberg: Physica-Verlag Rudolf Liebig GmbH, 1998
##### National Category
Computational Mathematics
##### Research subject
Scientific Computing
##### Identifiers
urn:nbn:se:ltu:diva-38368 (URN)cbd8b9b0-88b1-11dd-9d47-000ea68e967b (Local ID)3-7908-1131-9 (ISBN)cbd8b9b0-88b1-11dd-9d47-000ea68e967b (Archive number)cbd8b9b0-88b1-11dd-9d47-000ea68e967b (OAI)
##### Conference
COMPSTAT : 24/08/1998 - 28/08/1998
##### Note
Godkänd; 1998; 20080922 (ysko)Available from: 2016-10-03 Created: 2016-10-03 Last updated: 2017-11-25Bibliographically approved

#### Search in DiVA

Show all publications