/src/libjxl/lib/jxl/base/matrix_ops.h
Line | Count | Source |
1 | | // Copyright (c) the JPEG XL Project Authors. All rights reserved. |
2 | | // |
3 | | // Use of this source code is governed by a BSD-style |
4 | | // license that can be found in the LICENSE file. |
5 | | |
6 | | #ifndef LIB_JXL_BASE_MATRIX_OPS_H_ |
7 | | #define LIB_JXL_BASE_MATRIX_OPS_H_ |
8 | | |
9 | | // 3x3 matrix operations. |
10 | | |
11 | | #include <array> |
12 | | #include <cmath> // abs |
13 | | #include <cstddef> |
14 | | |
15 | | #include "lib/jxl/base/status.h" |
16 | | |
17 | | namespace jxl { |
18 | | |
19 | | using Vector3 = std::array<float, 3>; |
20 | | using Vector3d = std::array<double, 3>; |
21 | | using Matrix3x3 = std::array<Vector3, 3>; |
22 | | using Matrix3x3d = std::array<Vector3d, 3>; |
23 | | |
24 | | // Computes C = A * B, where A, B, C are 3x3 matrices. |
25 | | template <typename Matrix> |
26 | 756k | void Mul3x3Matrix(const Matrix& a, const Matrix& b, Matrix& c) { |
27 | 3.02M | for (size_t x = 0; x < 3; x++) { |
28 | 2.26M | alignas(16) Vector3d temp{b[0][x], b[1][x], b[2][x]}; // transpose |
29 | 9.07M | for (size_t y = 0; y < 3; y++) { |
30 | 6.80M | c[y][x] = a[y][0] * temp[0] + a[y][1] * temp[1] + a[y][2] * temp[2]; |
31 | 6.80M | } |
32 | 2.26M | } |
33 | 756k | } |
34 | | |
35 | | // Computes C = A * B, where A is 3x3 matrix and B is vector. |
36 | | template <typename Matrix, typename Vector> |
37 | 618k | void Mul3x3Vector(const Matrix& a, const Vector& b, Vector& c) { |
38 | 2.47M | for (size_t y = 0; y < 3; y++) { |
39 | 1.85M | double e = 0; |
40 | 7.42M | for (size_t x = 0; x < 3; x++) { |
41 | 5.57M | e += static_cast<double>(a[y][x]) * b[x]; |
42 | 5.57M | } |
43 | 1.85M | c[y] = e; |
44 | 1.85M | } |
45 | 618k | } |
46 | | |
47 | | // Inverts a 3x3 matrix in place. |
48 | | template <typename Matrix> |
49 | 137k | Status Inv3x3Matrix(Matrix& matrix) { |
50 | | // Intermediate computation is done in double precision. |
51 | 137k | Matrix3x3d temp; |
52 | 137k | temp[0][0] = static_cast<double>(matrix[1][1]) * matrix[2][2] - |
53 | 137k | static_cast<double>(matrix[1][2]) * matrix[2][1]; |
54 | 137k | temp[0][1] = static_cast<double>(matrix[0][2]) * matrix[2][1] - |
55 | 137k | static_cast<double>(matrix[0][1]) * matrix[2][2]; |
56 | 137k | temp[0][2] = static_cast<double>(matrix[0][1]) * matrix[1][2] - |
57 | 137k | static_cast<double>(matrix[0][2]) * matrix[1][1]; |
58 | 137k | temp[1][0] = static_cast<double>(matrix[1][2]) * matrix[2][0] - |
59 | 137k | static_cast<double>(matrix[1][0]) * matrix[2][2]; |
60 | 137k | temp[1][1] = static_cast<double>(matrix[0][0]) * matrix[2][2] - |
61 | 137k | static_cast<double>(matrix[0][2]) * matrix[2][0]; |
62 | 137k | temp[1][2] = static_cast<double>(matrix[0][2]) * matrix[1][0] - |
63 | 137k | static_cast<double>(matrix[0][0]) * matrix[1][2]; |
64 | 137k | temp[2][0] = static_cast<double>(matrix[1][0]) * matrix[2][1] - |
65 | 137k | static_cast<double>(matrix[1][1]) * matrix[2][0]; |
66 | 137k | temp[2][1] = static_cast<double>(matrix[0][1]) * matrix[2][0] - |
67 | 137k | static_cast<double>(matrix[0][0]) * matrix[2][1]; |
68 | 137k | temp[2][2] = static_cast<double>(matrix[0][0]) * matrix[1][1] - |
69 | 137k | static_cast<double>(matrix[0][1]) * matrix[1][0]; |
70 | 137k | double det = matrix[0][0] * temp[0][0] + matrix[0][1] * temp[1][0] + |
71 | 137k | matrix[0][2] * temp[2][0]; |
72 | 137k | if (std::abs(det) < 1e-10) { |
73 | 0 | return JXL_FAILURE("Matrix determinant is too close to 0"); |
74 | 0 | } |
75 | 137k | double idet = 1.0 / det; |
76 | 551k | for (size_t j = 0; j < 3; j++) { |
77 | 1.65M | for (size_t i = 0; i < 3; i++) { |
78 | 1.24M | matrix[j][i] = temp[j][i] * idet; |
79 | 1.24M | } |
80 | 413k | } |
81 | 137k | return true; |
82 | 137k | } jxl::Status jxl::Inv3x3Matrix<std::__1::array<std::__1::array<float, 3ul>, 3ul> >(std::__1::array<std::__1::array<float, 3ul>, 3ul>&) Line | Count | Source | 49 | 137k | Status Inv3x3Matrix(Matrix& matrix) { | 50 | | // Intermediate computation is done in double precision. | 51 | 137k | Matrix3x3d temp; | 52 | 137k | temp[0][0] = static_cast<double>(matrix[1][1]) * matrix[2][2] - | 53 | 137k | static_cast<double>(matrix[1][2]) * matrix[2][1]; | 54 | 137k | temp[0][1] = static_cast<double>(matrix[0][2]) * matrix[2][1] - | 55 | 137k | static_cast<double>(matrix[0][1]) * matrix[2][2]; | 56 | 137k | temp[0][2] = static_cast<double>(matrix[0][1]) * matrix[1][2] - | 57 | 137k | static_cast<double>(matrix[0][2]) * matrix[1][1]; | 58 | 137k | temp[1][0] = static_cast<double>(matrix[1][2]) * matrix[2][0] - | 59 | 137k | static_cast<double>(matrix[1][0]) * matrix[2][2]; | 60 | 137k | temp[1][1] = static_cast<double>(matrix[0][0]) * matrix[2][2] - | 61 | 137k | static_cast<double>(matrix[0][2]) * matrix[2][0]; | 62 | 137k | temp[1][2] = static_cast<double>(matrix[0][2]) * matrix[1][0] - | 63 | 137k | static_cast<double>(matrix[0][0]) * matrix[1][2]; | 64 | 137k | temp[2][0] = static_cast<double>(matrix[1][0]) * matrix[2][1] - | 65 | 137k | static_cast<double>(matrix[1][1]) * matrix[2][0]; | 66 | 137k | temp[2][1] = static_cast<double>(matrix[0][1]) * matrix[2][0] - | 67 | 137k | static_cast<double>(matrix[0][0]) * matrix[2][1]; | 68 | 137k | temp[2][2] = static_cast<double>(matrix[0][0]) * matrix[1][1] - | 69 | 137k | static_cast<double>(matrix[0][1]) * matrix[1][0]; | 70 | 137k | double det = matrix[0][0] * temp[0][0] + matrix[0][1] * temp[1][0] + | 71 | 137k | matrix[0][2] * temp[2][0]; | 72 | 137k | if (std::abs(det) < 1e-10) { | 73 | 0 | return JXL_FAILURE("Matrix determinant is too close to 0"); | 74 | 0 | } | 75 | 137k | double idet = 1.0 / det; | 76 | 548k | for (size_t j = 0; j < 3; j++) { | 77 | 1.64M | for (size_t i = 0; i < 3; i++) { | 78 | 1.23M | matrix[j][i] = temp[j][i] * idet; | 79 | 1.23M | } | 80 | 411k | } | 81 | 137k | return true; | 82 | 137k | } |
jxl::Status jxl::Inv3x3Matrix<std::__1::array<std::__1::array<double, 3ul>, 3ul> >(std::__1::array<std::__1::array<double, 3ul>, 3ul>&) Line | Count | Source | 49 | 766 | Status Inv3x3Matrix(Matrix& matrix) { | 50 | | // Intermediate computation is done in double precision. | 51 | 766 | Matrix3x3d temp; | 52 | 766 | temp[0][0] = static_cast<double>(matrix[1][1]) * matrix[2][2] - | 53 | 766 | static_cast<double>(matrix[1][2]) * matrix[2][1]; | 54 | 766 | temp[0][1] = static_cast<double>(matrix[0][2]) * matrix[2][1] - | 55 | 766 | static_cast<double>(matrix[0][1]) * matrix[2][2]; | 56 | 766 | temp[0][2] = static_cast<double>(matrix[0][1]) * matrix[1][2] - | 57 | 766 | static_cast<double>(matrix[0][2]) * matrix[1][1]; | 58 | 766 | temp[1][0] = static_cast<double>(matrix[1][2]) * matrix[2][0] - | 59 | 766 | static_cast<double>(matrix[1][0]) * matrix[2][2]; | 60 | 766 | temp[1][1] = static_cast<double>(matrix[0][0]) * matrix[2][2] - | 61 | 766 | static_cast<double>(matrix[0][2]) * matrix[2][0]; | 62 | 766 | temp[1][2] = static_cast<double>(matrix[0][2]) * matrix[1][0] - | 63 | 766 | static_cast<double>(matrix[0][0]) * matrix[1][2]; | 64 | 766 | temp[2][0] = static_cast<double>(matrix[1][0]) * matrix[2][1] - | 65 | 766 | static_cast<double>(matrix[1][1]) * matrix[2][0]; | 66 | 766 | temp[2][1] = static_cast<double>(matrix[0][1]) * matrix[2][0] - | 67 | 766 | static_cast<double>(matrix[0][0]) * matrix[2][1]; | 68 | 766 | temp[2][2] = static_cast<double>(matrix[0][0]) * matrix[1][1] - | 69 | 766 | static_cast<double>(matrix[0][1]) * matrix[1][0]; | 70 | 766 | double det = matrix[0][0] * temp[0][0] + matrix[0][1] * temp[1][0] + | 71 | 766 | matrix[0][2] * temp[2][0]; | 72 | 766 | if (std::abs(det) < 1e-10) { | 73 | 0 | return JXL_FAILURE("Matrix determinant is too close to 0"); | 74 | 0 | } | 75 | 766 | double idet = 1.0 / det; | 76 | 3.06k | for (size_t j = 0; j < 3; j++) { | 77 | 9.19k | for (size_t i = 0; i < 3; i++) { | 78 | 6.89k | matrix[j][i] = temp[j][i] * idet; | 79 | 6.89k | } | 80 | 2.29k | } | 81 | 766 | return true; | 82 | 766 | } |
|
83 | | |
84 | | } // namespace jxl |
85 | | |
86 | | #endif // LIB_JXL_BASE_MATRIX_OPS_H_ |