• Aucun résultat trouvé

[PDF] Top 20 Analysis of error functions for the iterative closest point algorithm

Has 10000 "Analysis of error functions for the iterative closest point algorithm" found on our website. Below are the top 20 most common "Analysis of error functions for the iterative closest point algorithm".

Analysis of error functions for the iterative closest point algorithm

Analysis of error functions for the iterative closest point algorithm

... Work The context our work involves robotic deployments in harsh, snowy ...problem of mapping and localization in these conditions has only been investigated by a few ...publications. For example, ... Voir le document complet

85

Metric-Based Iterative Closest Point Scan Matching for Sensor Displacement Estimation

Metric-Based Iterative Closest Point Scan Matching for Sensor Displacement Estimation

... In the context of scan matching, we have presented a metric distance and all the tools necessary to be used within the ICP ...framework. The distance is defined in the ... Voir le document complet

9

The Parallel Iterative Closest Point Algorithm

The Parallel Iterative Closest Point Algorithm

... between the two data sets, and a transformation is com- puted which minimizes the mean square error ( ) of the ...correspondences. The iterations continue until either the ... Voir le document complet

10

Iterative Closest Curve: a Framework for Curvilinear Structure Registration Application to 2D/3D Coronary Arteries Registration

Iterative Closest Curve: a Framework for Curvilinear Structure Registration Application to 2D/3D Coronary Arteries Registration

... is the topological differ- ence between the data and the ...In the case of CTO, a part of a vessel or even the whole vessel is not visible in the 2D image, while it ... Voir le document complet

9

A POSTERIORI ANALYSIS OF AN ITERATIVE ALGORITHM FOR NAVIER-STOKES PROBLEM

A POSTERIORI ANALYSIS OF AN ITERATIVE ALGORITHM FOR NAVIER-STOKES PROBLEM

... posteriori error estimation, Navier-Stokes problem, iterative ...Introduction The a posteriori analysis controls the overall discretization error of a problem by providing ... Voir le document complet

17

A POSTERIORI ANALYSIS OF ITERATIVE ALGORITHMS FOR A NONLINEAR PROBLEM

A POSTERIORI ANALYSIS OF ITERATIVE ALGORITHMS FOR A NONLINEAR PROBLEM

... archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or ...not. The documents may come from teaching and research institutions in France ... Voir le document complet

22

Metrological Analysis of the DIC Ultimate Error Regime

Metrological Analysis of the DIC Ultimate Error Regime

... Ultimate Error Introduction The characterization of metrological performances of DIC techniques has been widely studied from experimental and theoretical point of ...to ... Voir le document complet

4

A Posteriori Error Analysis of the Method of Characteristics

A Posteriori Error Analysis of the Method of Characteristics

... method of characteristics was initiated in [16] as an alternative to standard space-time finite elements with or without upwinding or ...only the solution of symmetric coercive problems. On ... Voir le document complet

24

Robust normal vector estimation in 3D point clouds through iterative principal component analysis

Robust normal vector estimation in 3D point clouds through iterative principal component analysis

... reduction of the mean angle ...than the other, the second optimization allows reducing 90 times the mean angle ...angle error resulting from our algorithm on the ... Voir le document complet

41

Geometric analysis for the metropolis algorithm on Lipschitz domains

Geometric analysis for the metropolis algorithm on Lipschitz domains

... in the interval [ν j − ε, ν j + ε] is equal to m j ...from the spectrum of the operator by comparison with a ’ball walk’ on a big box B containing ...is the use of ’normal ... Voir le document complet

32

Arbitrary Precision Error Analysis for computing $\zeta(s)$ with the Cohen-Olivier algorithm: Complete description of the real case and preliminary report on the general case

Arbitrary Precision Error Analysis for computing $\zeta(s)$ with the Cohen-Olivier algorithm: Complete description of the real case and preliminary report on the general case

... that of the present paper, with the important restriction that a value of the argument s near a zero of ζ is likely to be problematic (independently from Point 1 just ... Voir le document complet

35

On the order of vanishing of modular $L$-functions at the critical point

On the order of vanishing of modular $L$-functions at the critical point

... inequality. For the proof of (12) we can assume that (r, s) = 1 by changing 0 ...(11) for in place of where xo is the principal character to the modulus ...(12). ... Voir le document complet

13

Exchange algorithm for evaluation and approximation error-optimized polynomials

Exchange algorithm for evaluation and approximation error-optimized polynomials

... Evaluation error Consider first some basic notation used for error analysis ...is the default rounding mode in IEEE-754 arithmetic [17], so that, given two FP numbers a and b, when ... Voir le document complet

31

Analysis of the convergence of iterative implicit and defect-correction algorithms for hyperbolic problems

Analysis of the convergence of iterative implicit and defect-correction algorithms for hyperbolic problems

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ... Voir le document complet

92

Sign changes of error terms related to arithmetical functions

Sign changes of error terms related to arithmetical functions

... , for 1 ≤ s ≤ R/3, and let D be the set of these ...members of D are separated by a distance of at least 2h. Let M be the number of subintervals K in D for which ... Voir le document complet

26

Improved Algebraic Algorithm On Point Projection For Bézier Curves

Improved Algebraic Algorithm On Point Projection For Bézier Curves

... step, the algebraic method is much faster that the geometric ...all the real roots, while the geometric method can prune part of invalid ...sometimes the to- tal computation time ... Voir le document complet

7

A Majorize-Minimize line search algorithm for barrier functions

A Majorize-Minimize line search algorithm for barrier functions

... at the boundary of the feasible solution domain are frequently encountered in the optimiza- tion ...an iterative descent method is used, a search along the line supported by ... Voir le document complet

32

The k closest resemblance classifier for Amazon products recommender system

The k closest resemblance classifier for Amazon products recommender system

... make the assumption that the active users will be interested in items that users similar to them have rated ...highly. The hybrid based filtering tech- niques recommend items by combining CF and CBF ... Voir le document complet

9

Iterative Analysis of Pages in Document Collections for Efficient User Interaction

Iterative Analysis of Pages in Document Collections for Efficient User Interaction

... Abstract—The analysis of sets of degraded documents, like historical ones, is error-prone and requires human help to achieve acceptable quality ...amounts of pages: none ... Voir le document complet

6

Floating-point exponential functions for DSP-enabled FPGAs

Floating-point exponential functions for DSP-enabled FPGAs

... room for improvement there. From a user point of view, the current state of the art is probably the floating-point exponential function ALTFP_EXP provided with ... Voir le document complet

9

Show all 10000 documents...