File: registration.doxy

package info (click to toggle)
pcl 1.13.0%2Bdfsg-3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 143,524 kB
  • sloc: cpp: 518,578; xml: 28,792; ansic: 13,676; python: 334; lisp: 93; sh: 49; makefile: 30
file content (27 lines) | stat: -rw-r--r-- 1,159 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
/**
  \addtogroup registration Module registration

  \section secRegistrationPresentation Overview

Combining several datasets into a global consistent model is usually performed
using a technique called registration. The key idea is to identify
corresponding points between the data sets and find a transformation that
minimizes the distance (alignment error) between corresponding points. This
process is repeated, since correspondence search is affected by the relative
position and orientation of the data sets. Once the alignment errors fall below
a given threshold, the registration is said to be complete.

The <b>pcl_registration</b> library implements a plethora of point cloud
registration algorithms for both organized and unorganized (general purpose)
datasets.

\image html http://www.pointclouds.org/assets/images/contents/documentation/registration_outdoor.png
\image html http://www.pointclouds.org/assets/images/contents/documentation/registration_closeup.png

  \section secRegistrationRequirements Requirements
  - \ref common "common"
  - \ref kdtree "kdtree"
  - \ref sample_consensus "sample_consensus"
  - \ref features "features"

*/