Mercurial > hg > orthanc-stone
annotate Framework/Toolbox/LinearAlgebra.h @ 163:8c5b24892ed2 wasm
LinearAlgebra::InvertMatrix
| author | Sebastien Jodogne <s.jodogne@gmail.com> |
|---|---|
| date | Wed, 14 Feb 2018 14:26:26 +0100 |
| parents | 197a5ddaf68c |
| children | 8d50e6be565d |
| rev | line source |
|---|---|
| 158 | 1 /** |
| 2 * Stone of Orthanc | |
| 3 * Copyright (C) 2012-2016 Sebastien Jodogne, Medical Physics | |
| 4 * Department, University Hospital of Liege, Belgium | |
| 5 * Copyright (C) 2017-2018 Osimis S.A., Belgium | |
| 6 * | |
| 7 * This program is free software: you can redistribute it and/or | |
| 8 * modify it under the terms of the GNU Affero General Public License | |
| 9 * as published by the Free Software Foundation, either version 3 of | |
| 10 * the License, or (at your option) any later version. | |
| 11 * | |
| 12 * This program is distributed in the hope that it will be useful, but | |
| 13 * WITHOUT ANY WARRANTY; without even the implied warranty of | |
| 14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
| 15 * Affero General Public License for more details. | |
| 16 * | |
| 17 * You should have received a copy of the GNU Affero General Public License | |
| 18 * along with this program. If not, see <http://www.gnu.org/licenses/>. | |
| 19 **/ | |
| 20 | |
| 21 | |
| 22 #pragma once | |
| 23 | |
| 24 // Patch for ublas in Boost 1.64.0 | |
| 25 // https://github.com/dealii/dealii/issues/4302 | |
| 26 #include <boost/version.hpp> | |
| 27 #if BOOST_VERSION >= 106300 // or 64, need to check | |
| 28 # include <boost/serialization/array_wrapper.hpp> | |
| 29 #endif | |
| 30 | |
| 31 #include <Core/DicomFormat/DicomMap.h> | |
| 32 | |
| 33 #include <boost/numeric/ublas/matrix.hpp> | |
| 34 #include <boost/numeric/ublas/vector.hpp> | |
| 35 | |
| 36 namespace OrthancStone | |
| 37 { | |
| 38 typedef boost::numeric::ublas::matrix<double> Matrix; | |
| 39 typedef boost::numeric::ublas::vector<double> Vector; | |
| 40 | |
| 41 namespace LinearAlgebra | |
| 42 { | |
| 43 void Print(const Vector& v); | |
| 44 | |
| 45 void Print(const Matrix& m); | |
| 46 | |
| 47 bool ParseVector(Vector& target, | |
| 48 const std::string& s); | |
| 49 | |
| 50 bool ParseVector(Vector& target, | |
| 51 const Orthanc::DicomMap& dataset, | |
| 52 const Orthanc::DicomTag& tag); | |
| 53 | |
| 54 void AssignVector(Vector& v, | |
| 55 double v1, | |
| 56 double v2); | |
| 57 | |
| 58 void AssignVector(Vector& v, | |
| 59 double v1, | |
| 60 double v2, | |
| 61 double v3); | |
| 62 | |
|
161
197a5ddaf68c
FiniteProjectiveCamera
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
159
diff
changeset
|
63 void AssignVector(Vector& v, |
|
197a5ddaf68c
FiniteProjectiveCamera
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
159
diff
changeset
|
64 double v1, |
|
197a5ddaf68c
FiniteProjectiveCamera
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
159
diff
changeset
|
65 double v2, |
|
197a5ddaf68c
FiniteProjectiveCamera
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
159
diff
changeset
|
66 double v3, |
|
197a5ddaf68c
FiniteProjectiveCamera
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
159
diff
changeset
|
67 double v4); |
|
197a5ddaf68c
FiniteProjectiveCamera
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
159
diff
changeset
|
68 |
| 158 | 69 inline bool IsNear(double x, |
| 70 double y, | |
| 71 double threshold) | |
| 72 { | |
| 73 return fabs(x - y) < threshold; | |
| 74 } | |
| 75 | |
| 76 bool IsNear(double x, | |
| 77 double y); | |
| 78 | |
| 79 inline bool IsCloseToZero(double x) | |
| 80 { | |
| 81 return IsNear(x, 0.0); | |
| 82 } | |
| 83 | |
| 84 void NormalizeVector(Vector& u); | |
| 85 | |
| 86 void CrossProduct(Vector& result, | |
| 87 const Vector& u, | |
| 88 const Vector& v); | |
| 89 | |
| 90 void FillMatrix(Matrix& target, | |
| 91 size_t rows, | |
| 92 size_t columns, | |
| 93 const double values[]); | |
| 94 | |
| 95 void FillVector(Vector& target, | |
| 96 size_t size, | |
| 97 const double values[]); | |
| 98 | |
| 99 void Convert(Matrix& target, | |
| 100 const Vector& source); | |
|
159
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
101 |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
102 double ComputeDeterminant(const Matrix& a); |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
103 |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
104 bool IsOrthogonalMatrix(const Matrix& q, |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
105 double threshold); |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
106 |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
107 bool IsOrthogonalMatrix(const Matrix& q); |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
108 |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
109 bool IsRotationMatrix(const Matrix& r, |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
110 double threshold); |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
111 |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
112 bool IsRotationMatrix(const Matrix& r); |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
113 |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
114 void InvertUpperTriangularMatrix(Matrix& output, |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
115 const Matrix& k); |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
116 |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
117 /** |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
118 * This function computes the RQ decomposition of a 3x3 matrix, |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
119 * using Givens rotations. Reference: Algorithm A4.1 (page 579) of |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
120 * "Multiple View Geometry in Computer Vision" (2nd edition). The |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
121 * output matrix "Q" is a rotation matrix, and "R" is upper |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
122 * triangular. |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
123 **/ |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
124 void RQDecomposition3x3(Matrix& r, |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
125 Matrix& q, |
|
0a73d76333db
populating LinearAlgebra
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
158
diff
changeset
|
126 const Matrix& a); |
|
163
8c5b24892ed2
LinearAlgebra::InvertMatrix
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
161
diff
changeset
|
127 |
|
8c5b24892ed2
LinearAlgebra::InvertMatrix
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
161
diff
changeset
|
128 void InvertMatrix(Matrix& target, |
|
8c5b24892ed2
LinearAlgebra::InvertMatrix
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
161
diff
changeset
|
129 const Matrix& source); |
| 158 | 130 }; |
| 131 } |