Method, system and software for the registration of data sets

• US 20050207674A1
• Filed: 03/16/2005
• Published: 09/22/2005
• Est. Priority Date: 03/16/2004
• Status: Abandoned Application

• Current Assignee: Applied Research Associates New Zealand Limited
• Original Assignee: Applied Research Associates New Zealand Limited
• Inventors: Fright, William Richard
• Application Number:
  US11/080,656
• Publication Number:
  US 20050207674A1
• Time in Patent Office: Days
• US Class Current: 382/294
• CPC Class Codes: G06T 7/33 using feature-based methods
• CPC Class Codes: G06V 10/752 Contour matching
• CPC Class Codes: G06V 20/64 Three-dimensional objects

Abstract

The present invention relates to a method, system and software for registration of a subject data set with a reference data set. The method of the invention includes the steps of: specifying three or more landmarks (1, 2, 3) in a first data set (8); specifying three or more corresponding landmarks (4, 5, 6) in a second data set (7); registering the first data set to the second data set using the landmarks; for at least one of the landmarks (1), determining a first patch (40) around the landmark (1) and a second patch (43) around the corresponding landmark (4); and refining the registration between the first and second data set using the patches (40, 43). A system and software for registration of a subject data set (7) with a reference data set (8) are also disclosed.

Claims

1. A method of registering a first data set with a second data set, including the steps of:

i) specifying three or more landmarks in a first data set;

ii) specifying three or more corresponding landmarks in a second data set;

iii) registering the first data set to the second data set using the landmarks;

iv) for at least one of the landmarks, determining a first patch around the landmark and a second patch around the corresponding landmark; and

v) refining the registration between the first and second data set using the patches.

2. A method as claimed in claim 1 wherein the data sets relate to a 3D model.

3. A method as claimed in claim 2 wherein the data sets relate to a surface 3D model.

4. A method as claimed in claim 3 wherein the registration process in step (iii) is a direct registration method.

5. A method as claimed in claim 4 wherein the refinement process in step (v) utilises an iterative registration method.

6. A method as claimed in claim 5 wherein the landmark is approximately in the centre of the patch.

7. A method as claimed in claim 5 wherein the user specifies each landmark and corresponding landmark.

8. A method as claimed in claim 5 wherein the relative position of the landmarks of the first data set is not precisely the same as the relative position of the landmarks of the second data set.

9. A method as claimed in claim 8 wherein at least one of the patches is a subset of the data contained within a sphere.

10. A method as claimed in claim 9 wherein the radius of the sphere is related to the residual mean error resulting from the registration process in step (iii).

11. A method as claimed in claim 10 wherein the radius of the sphere is specified by the user.

12. A method as claimed in claim 9 wherein the refinement process in step (v) includes matching points in the patch of the first data set with points in the patch of the second data set.

13. A method as claimed in claim 12 wherein the points are interpolated on the surface of the patch of one of the data sets.

14. A method as claimed in claim 13 wherein the surface is interpolated using a spline.

15. A method as claimed in claim 14 wherein the spline is a polyharmonic spline.

16. A method as claimed in claim 15 wherein the polyharmonic spline is a biharmonic spline.

17. A method as claimed in claim 16 wherein the points of one data set are matched with the intersection of the normal vectors of those points with the interpolated surface of the patch of the other data set.

18. A method as claimed in claim 17 wherein the registration process in step (iii) utilises singular value decomposition.

19. A method as claimed in claim 17 wherein the refinement process in step (v) utilises iterative closest point.

20. A method as claimed in claim 17 wherein at least one of the patches is specified by the user.

21. A method as claimed in claim 20 wherein at least one of the patches is specified by the user graphically.

22. A method as claimed in claim 17 wherein at least one of the patches is specified by an arbitrary boundary curve.

23. A method as claimed in claim 22 wherein at least one of the patches is a subset of the data contained within a projection from an arbitrary boundary curve.

24. A method as claimed in claim 17 wherein the refinement process in step (v) includes registration of surface attribute data, such as surface colour.

25. A method as claimed in claim 2 wherein the data sets relate to a volume 3D model

26. A method as claimed in claim 6 wherein the landmarks are specified automatically.

27. A method as claimed in claim 26 wherein the landmarks are specified using automatic feature recognition.

28. A method as claimed in claim 17 wherein the size of all patches is equal.

34. A system arranged for performing the method of claim 1.

35. Software arranged for performing the method of claim 1.

36. Storage media arranged to store software as claimed in claim 35.

29. A system for registering a first data set with a second data set, including:

i) a memory for storing a first and a second data set;

ii) an input device arranged for receiving input which specifies three or more landmarks in the first data set and three or more corresponding landmarks in the second data set; and

iii) a processor arranged for registering the first data set to the second data set using the landmarks, then for at least one of the landmarks, determining a first patch around the landmark and a second patch around the corresponding landmark, and then for refining the registration between the first and second data set using the patches.

30. A system as claimed in claim 29, wherein a direct registration method is used to register the first data set to the second data set using landmarks.

37. Software arranged for performing the system of claim 29.

38. Storage media arranged to store software as claimed in claim 37.

31. Software for registering a first data set with a second data set, including:

i) a code portion arranged for storing and retrieving a first and second data set from a memory;

ii) a code portion arranged for receiving input which specifies three or more landmarks in the first data set and three or more corresponding landmarks in the second data set;

iii) a code portion arranged for registering the first data set to the second data set using the landmarks;

iv) a code portion arranged for determining, for at least one of the landmarks, a first patch around the landmark and a second patch around the corresponding landmark; and

v) a code portion arranged for refining the registration between the first and second data set using the patches.

32. Software as claimed in claim 31, wherein a direct registration method is used to register the first data set to the second data using the landmarks.

33. Storage media arranged to store software as claimed in claim 32.