Welcome to mirror list, hosted at ThFree Co, Russian Federation.

git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorSergey Sharybin <sergey.vfx@gmail.com>2012-04-12 15:37:51 +0400
committerSergey Sharybin <sergey.vfx@gmail.com>2012-04-12 15:37:51 +0400
commite6c45cc1de178c083fbcbcc83f2438ff8575b7b0 (patch)
tree2aba57e562e958dda89c1ebbb8e012c1a594b41f /extern/libmv/ChangeLog
parentca8fd669a4ab2e1a8eb6421f8b6c815a30e2ca9c (diff)
libmv: bundle new upstream version from own branch with rigid registration implementation
Currently not used in blender code but is needed for some current work.
Diffstat (limited to 'extern/libmv/ChangeLog')
-rw-r--r--extern/libmv/ChangeLog41
1 files changed, 33 insertions, 8 deletions
diff --git a/extern/libmv/ChangeLog b/extern/libmv/ChangeLog
index ac5a404bafa..33068bddf90 100644
--- a/extern/libmv/ChangeLog
+++ b/extern/libmv/ChangeLog
@@ -1,3 +1,36 @@
+commit fa3842e472e3b9c789e47bf6d8f592aa40a84f16
+Author: Sergey Sharybin <sergey.vfx@gmail.com>
+Date: Thu Apr 12 12:32:48 2012 +0600
+
+ implementation of some basic algorithms for point cloud orientation:
+
+ - Implementation of rigid registration algorithm which searches transformation
+ form one point cloud to another assuming that points in this clouds are
+ already paired (points with the same index in different clouds belongs to
+ the same pair) which minimizes average distance between points in pairs.
+
+ Algorithm uses Levenberg-Marquardt solver to find such transformation.
+
+ Supports registration of rotation-scale-transform (which is probably most
+ common usage) and rotation only (which might be useful for basic modal
+ tripod solver).
+
+ - Implementation of Iterative-Point-Clouds algorithm which searches
+ transformation from one arbitrary point cloud to another making
+ points as closest to each other as possible.
+
+ This algorithm doesn't require points be initially paired, but for
+ good result clouds should have rough initial orientation. If they're
+ arbitrary oriented from the very beginning, algorithm might fail
+ producing good resold.
+
+ Iteration is based on building pairs of closest to each other points
+ and registering rigid transformation between them which incrementally
+ constructs final result.
+
+ TODO: building pairs might be speedup a lot using data structures like
+ AABB trees, K-D trees or so.
+
commit 9618d9a1d48bb3c28da605d9027f57a74f462785
Author: Sergey Sharybin <sergey.vfx@gmail.com>
Date: Wed Apr 11 14:17:14 2012 +0600
@@ -493,11 +526,3 @@ Author: Matthias Fauconneau <matthias.fauconneau@gmail.com>
Date: Fri Aug 19 14:59:24 2011 +0200
Expose regularization parameters (areaPenalty and conditionPenalty) in API.
-
-commit 3e84ae5fbac10451d4935418f6281a90cedace11
-Author: Matthias Fauconneau <matthias.fauconneau@gmail.com>
-Date: Fri Aug 19 14:19:27 2011 +0200
-
- Add LaplaceFilter.
- Add regularization in affine SAD Tracker (keep constant area and good condition number).
- UI: Better track display (+enable line antialiasing).