Code covered by the BSD License  

Highlights from
Finite Iterative Closest Point

5.0

5.0 | 6 ratings Rate this file 65 Downloads (last 30 days) File Size: 13.37 KB File ID: #24301
image thumbnail

Finite Iterative Closest Point

by Dirk-Jan Kroon

 

29 May 2009

Iterative Closest Point using finite difference optimization to register 3D point clouds affine.

| Watch this File

File Information
Description

This function ICP_FINITE is an kind of Iterative Closest Point(ICP) registration algorithm for 3D point clouds (like vertice data of meshes ) using finite difference methods.

Normal ICP solves translation and rotation with analytical equations. By using finite difference this function can also solve resizing and shear thus affine registration.

As first step, this function sorts the static points into a grid of overlapping blocks. The block nearest to a moving point will always contain its closest static point, thus the grid allows faster registration.

MATLAB release MATLAB 7.8 (R2009a)
Tags for This File  
Everyone's Tags
Tags I've Applied
Add New Tags Please login to tag files.
Comments and Ratings (10)
23 Jul 2009 M.

Could you please put a reference for this work? Thanks a lot for uploading it.

02 Apr 2010 yu

sorry,but i cannot run it successfully. the error is
''??? Error using ==> tic
Too many output arguments......."
btw, my database contains about 40 thousand 3-D points.

expecting your reply.

14 Apr 2010 Robert

I tried running this program, and all the points on my data model were transformed to a singular point. If this could be explained, I would revise my rating. For example, put a demo up, so I can see that it works for something you worked with.

14 Apr 2010 Robert

Fixed, but a demo code would be a nice addition.

20 Apr 2010 Jacques Saade

Hi, really great work! But me too I ask if you can put a reference for the work

23 Jun 2010 Meidya Koeshardianto

nice code

09 Nov 2010 Dirk-Jan Kroon

* Jacques Saade
The code is written from scratch and not published in a paper.
You can of course reference the original paper.

13 Jan 2011 JK Hwang

Hi, Dirk-Jan Kroon. I was wondering about your nearest points searching method in your code. What is the reason why you used a grid spacing term, 'spacing=size(Points_Static,1)^(1/6)*sqrt(3);', in your code when uniform grid of points is established. Is there any reference about that?

07 Feb 2011 Alex

This code works perfectly well! Thank you for your nice and really useful work

19 Oct 2011 Ben

Can it be used for registering 2D point sets?

Please login to add a comment or rating.
Tag Activity for this File
Tag Applied By Date/Time
affine Dirk-Jan Kroon 29 May 2009 09:39:04
resize Dirk-Jan Kroon 29 May 2009 09:39:05
translate Dirk-Jan Kroon 29 May 2009 09:39:05
rotate Dirk-Jan Kroon 29 May 2009 09:39:05
rigid Dirk-Jan Kroon 29 May 2009 09:39:05
icp Dirk-Jan Kroon 29 May 2009 09:39:05
iterative closest point Dirk-Jan Kroon 29 May 2009 09:39:05
iterative Dirk-Jan Kroon 29 May 2009 09:39:05
finite difference Dirk-Jan Kroon 29 May 2009 09:39:05
registration Dirk-Jan Kroon 29 May 2009 09:39:05
vertices Dirk-Jan Kroon 29 May 2009 09:39:05
patch Dirk-Jan Kroon 29 May 2009 09:39:05
finite Dirk-Jan Kroon 29 May 2009 09:39:05
mesh Dirk-Jan Kroon 29 May 2009 09:39:05
finite Andrius 10 Nov 2010 10:32:51
icp Huang Chun-Hsiang 29 Mar 2011 08:27:34
affine C KOTESHWAR RAO 10 Jun 2011 04:30:05

Contact us at files@mathworks.com