cars 1.0.0rc1__cp313-cp313-musllinux_1_2_i686.whl

cars/applications/dense_matching/cpp/dense_matching_cpp.py

@@ -0,0 +1,94 @@
+"""
+this module contains the headers of the dense_matching_cpp module.
+"""
+
+# pylint: skip-file
+
+
+def estimate_right_classif_on_left(
+    right_classif,
+    disp_map,
+    disp_mask,
+    disp_min,
+    disp_max,
+    classification_fusion_margin=-1,
+):
+    """
+    Estimate right classif on left image
+
+    :param right_classif: right classification
+    :type right_classif: np ndarray
+    :param disp_map: disparity map
+    :type disp_map: np ndarray
+    :param disp_mask: disparity mask
+    :type disp_mask: np ndarray
+    :param disp_min: disparity min
+    :type disp_min: int
+    :param disp_max: disparity max
+    :type disp_max: int
+
+    :return: right classif on left image
+    :rtype: np nadarray
+    """
+    ...
+
+
+def mask_left_classif_from_right_mask(
+    left_classif,
+    right_mask,
+    disp_min,
+    disp_max,
+    classification_fusion_margin=-1,
+):
+    """
+    Mask left classif with right mask.
+
+    :param left_classif: right classification
+    :type left_classif: np ndarray
+    :param right_mask: right mask
+    :type right_mask: np ndarray
+    :param disp_min: disparity min
+    :type disp_min: np.array type int
+    :param disp_max: disparity max
+    :type disp_max: np.array type int
+
+    :return: masked left classif
+    :rtype: np nadarray
+    """
+    ...
+
+
+def estimate_right_grid_disp_int(disp_min_grid, disp_max_grid):
+    """
+    Estimate right grid min and max for int inputs.
+    Correspond to the range of pixels that can be correlated
+    from left -> right.
+    If no left pixels can be associated to right, use global values
+
+    :param disp_min_grid: left disp min grid
+    :type disp_min_grid: numpy ndarray
+    :param disp_max_grid: left disp max grid
+    :type disp_max_grid: numpy ndarray
+
+    :return: disp_min_right_grid, disp_max_right_grid
+    :rtype: numpy ndarray, numpy ndarray
+    """
+    return None, None
+
+
+def estimate_right_grid_disp_float(disp_min_grid, disp_max_grid):
+    """
+    Estimate right grid min and max for float inputs.
+    Correspond to the range of pixels that can be correlated
+    from left -> right.
+    If no left pixels can be associated to right, use global values
+
+    :param disp_min_grid: left disp min grid
+    :type disp_min_grid: numpy ndarray
+    :param disp_max_grid: left disp max grid
+    :type disp_max_grid: numpy ndarray
+
+    :return: disp_min_right_grid, disp_max_right_grid
+    :rtype: numpy ndarray, numpy ndarray
+    """
+    return None, None

cars/applications/dense_matching/cpp/includes/dense_matching.hpp

@@ -0,0 +1,58 @@
+#ifndef DENSE_MATCHING_HPP
+#define DENSE_MATCHING_HPP
+
+#include <pybind11/numpy.h>
+#include <pybind11/stl.h>
+#include <pybind11/pybind11.h>
+
+namespace py = pybind11;
+
+/**
+ * @brief Estimate right classif on left image
+ *
+ * @param right_classif right classification
+ * @param disp_map disparity map
+ * @param disp_mask disparity mask
+ * @param disp_min disparity min
+ * @param disp_max disparity max
+ * @return right classif on left image
+ */
+py::array_t<bool> estimate_right_classif_on_left(
+    py::array_t<bool> right_classif,
+    py::array_t<float> disp_map,  
+    std::optional<py::array_t<bool>> disp_mask,
+    int disp_min,
+    int disp_max,
+    int classification_fusion_margin
+);
+
+/**
+ * @brief Mask left classif with right mask
+ *
+ * @param left_classif left classification
+ * @param right_mask right mask
+ * @param disp_min disparity min
+ * @param disp_max disparity max
+ * @return masked left classif
+ */
+py::array_t<bool> mask_left_classif_from_right_mask(
+    py::array_t<bool> left_classif,
+    py::array_t<bool> right_mask,
+    py::array_t<int> disp_min,
+    py::array_t<int> disp_max,
+    int classification_fusion_margin
+);
+
+/**
+ * @brief Estimate right grid disparities from left grid disparities
+ *
+ * @param disp_min_grid left disparity minimum grid
+ * @param disp_max_grid left disparity maximum grid
+ * @return pair of right grid minimum and maximum disparities
+ */
+template<typename T> std::pair<py::array_t<T>, py::array_t<T>> estimate_right_grid_disp(
+    py::array_t<T> disp_min_grid,
+    py::array_t<T> disp_max_grid
+);
+
+#endif  // DENSE_MATCHING_HPP

cars/applications/dense_matching/cpp/meson.build

@@ -0,0 +1,9 @@
+
+py.extension_module(
+  'dense_matching_cpp',
+  ['src/bindings.cpp', 'src/dense_matching.cpp'],
+  include_directories: ['includes'],
+  subdir: 'cars/applications/dense_matching/cpp',
+  install: true,
+  dependencies : [pybind11_dep],
+)

cars/applications/dense_matching/cpp/src/bindings.cpp

@@ -0,0 +1,13 @@
+#include "dense_matching.hpp"
+#include <pybind11/pybind11.h>
+
+namespace py = pybind11;
+
+PYBIND11_MODULE(dense_matching_cpp, m) {
+    m.doc() = "cars's pybind11 dense matching module"; // optional module docstring
+
+    m.def("estimate_right_classif_on_left", &estimate_right_classif_on_left, "");
+    m.def("mask_left_classif_from_right_mask", &mask_left_classif_from_right_mask, "");
+    m.def("estimate_right_grid_disp_int", &estimate_right_grid_disp<int>, "");
+    m.def("estimate_right_grid_disp_float", &estimate_right_grid_disp<float>, "");
+}

cars/applications/dense_matching/cpp/src/dense_matching.cpp

@@ -0,0 +1,207 @@
+#include <pybind11/numpy.h>
+#include <pybind11/stl.h>
+#include <pybind11/pybind11.h>
+#include <cmath>
+#include <optional>
+
+namespace py = pybind11;
+
+py::array_t<bool> estimate_right_classif_on_left(
+    py::array_t<bool> right_classif,
+    py::array_t<float> disp_map,
+    std::optional<py::array_t<bool>> disp_mask,
+    int disp_min,
+    int disp_max,
+    int classification_fusion_margin
+) {
+    auto r_right_classif = right_classif.unchecked<3>();
+    auto r_disp_map = disp_map.unchecked<2>();
+
+    size_t n_bands = r_right_classif.shape(0);
+    size_t n_row = r_right_classif.shape(1);
+    size_t n_col = r_right_classif.shape(2);
+
+    bool use_disp_mask = disp_mask.has_value();
+    std::unique_ptr<py::detail::unchecked_reference<bool, 2>> r_disp_mask;
+    if (use_disp_mask) {
+        r_disp_mask = std::make_unique<py::detail::unchecked_reference<bool, 2>>(
+            disp_mask.value().unchecked<2>()
+        );
+    }
+
+    py::array_t<bool> left_from_right_classif = py::array_t<bool>({n_bands, n_row, n_col});
+    auto rw_left_from_right_classif = left_from_right_classif.mutable_unchecked<3>();
+
+    for (size_t row = 0; row < n_row; row++) {
+        for (size_t col = 0; col < n_col; col++) {
+
+            // find classif
+            float fdisp = r_disp_map(row, col);
+            bool valid = use_disp_mask ? r_disp_mask->operator()(row, col) : !std::isnan(fdisp);
+
+            if (valid) {
+                // direct value
+                int disp = static_cast<int>(std::floor(fdisp));
+
+                for (size_t band = 0; band < n_bands; band++) {
+                    rw_left_from_right_classif(
+                        band, row, col
+                    ) = r_right_classif(band, row, col+disp);
+                }
+
+                continue;
+            }
+
+            // else: estimate with global range
+            for (size_t band = 0; band < n_bands; band++) {
+
+                bool found = false;
+                int margin_min = disp_min;
+                int margin_max = disp_max;
+                if (classification_fusion_margin != -1) {
+                    margin_min = -classification_fusion_margin;
+                    margin_max = classification_fusion_margin;
+                }
+                for (
+                    size_t col_classif = std::max(0, static_cast<int>(col)+margin_min);
+                    col_classif < std::min(
+                        static_cast<int>(n_col),
+                        static_cast<int>(col)+margin_max
+                    );
+                    col_classif++
+                ) {
+                    if (r_right_classif(band, row, col_classif)) {
+                        found = true;
+                        break;
+                    }
+                }
+
+                rw_left_from_right_classif(band, row, col) = found;
+            }
+
+        }
+    }
+    return left_from_right_classif;
+}
+
+py::array_t<bool> mask_left_classif_from_right_mask(
+    py::array_t<bool> left_classif,
+    py::array_t<bool> right_mask,
+    py::array_t<int> disp_min,
+    py::array_t<int> disp_max,
+    int classification_fusion_margin
+) {
+
+    auto rw_left_classif = left_classif.mutable_unchecked<3>();
+    auto r_right_mask = right_mask.unchecked<2>();
+    auto r_disp_min = disp_min.unchecked<2>();
+    auto r_disp_max = disp_max.unchecked<2>();
+
+    size_t n_bands = rw_left_classif.shape(0);
+    size_t n_row = rw_left_classif.shape(1);
+    size_t n_col = rw_left_classif.shape(2);
+
+    for (size_t row = 0; row < n_row; row++) {
+        for (size_t col = 0; col < n_col; col++) {
+
+            // estimate with global range
+            bool all_masked = true;
+            int margin_min = r_disp_min(row, col);
+            int margin_max = r_disp_max(row, col);
+            if (classification_fusion_margin != -1) {
+                margin_min = -classification_fusion_margin;
+                margin_max = classification_fusion_margin;
+            }
+            size_t lower_bound = std::max(0, static_cast<int>(col)+margin_min);
+            size_t upper_bound = std::min(
+                static_cast<int>(n_col),
+                static_cast<int>(col)+margin_max
+            );
+            for (size_t col_classif = lower_bound; col_classif < upper_bound; col_classif++) {
+                if (!r_right_mask(row, col_classif)) {
+                    all_masked = false;
+                    break;
+                }
+            }
+            
+            if (all_masked) {
+                // Remove classif
+                for (size_t band = 0; band < n_bands; band++) {
+                    rw_left_classif(band, row, col) = false;
+                }
+            }
+        }
+    }
+
+    return left_classif;
+}
+
+template<typename T> std::pair<py::array_t<T>, py::array_t<T>> estimate_right_grid_disp(
+    py::array_t<T> disp_min_grid,
+    py::array_t<T> disp_max_grid
+) {
+
+    auto r_disp_min_grid = disp_min_grid.template unchecked<2>();
+    auto r_disp_max_grid = disp_max_grid.template unchecked<2>();
+
+    size_t n_row = r_disp_min_grid.shape(0);
+    size_t n_col = r_disp_min_grid.shape(1);
+
+    T global_left_min = std::numeric_limits<T>::max();
+    // min is smallest positive value for floats, instead use lowest
+    T global_left_max = std::numeric_limits<T>::lowest(); 
+    for (size_t row = 0; row < n_row; row++) {
+        for (size_t col = 0; col < n_col; col++) {
+            global_left_min = std::min(global_left_min, r_disp_min_grid(row, col));
+            global_left_max = std::max(global_left_max, r_disp_max_grid(row, col));
+        }
+    }
+
+    py::array_t<T> disp_min_right_grid({n_row, n_col});
+    py::array_t<T> disp_max_right_grid({n_row, n_col});
+    auto rw_disp_min_right_grid = disp_min_right_grid.template mutable_unchecked<2>();
+    auto rw_disp_max_right_grid = disp_max_right_grid.template mutable_unchecked<2>();
+
+    for (size_t row = 0; row < n_row; row++) {
+        for (size_t col = 0; col < n_col; col++) {
+            T min_right = static_cast<T>(n_col);
+            T max_right = 0;
+            bool is_correlated_left = false;
+
+            for (size_t left_col = 0; left_col < n_col; left_col++) {
+                T left_min = r_disp_min_grid(row, left_col) + static_cast<T>(left_col);
+                T left_max = r_disp_max_grid(row, left_col) + static_cast<T>(left_col);
+
+                if (left_min <= static_cast<T>(col) && static_cast<T>(col) <= left_max) {
+                    is_correlated_left = true;
+                    min_right = std::min(
+                        min_right,
+                        static_cast<T>(left_col) - static_cast<T>(col)
+                    );
+                    max_right = std::max(
+                        max_right,
+                        static_cast<T>(left_col) - static_cast<T>(col)
+                    );
+                }
+            }
+
+            if (is_correlated_left) {
+                rw_disp_min_right_grid(row, col) = min_right;
+                rw_disp_max_right_grid(row, col) = max_right;
+            } else {
+                rw_disp_min_right_grid(row, col) = -global_left_max;
+                rw_disp_max_right_grid(row, col) = -global_left_min;
+            }
+        }
+    }
+
+    return std::make_pair(disp_min_right_grid, disp_max_right_grid);
+}
+
+// force compiler to create functions for int and float
+template std::pair<py::array_t<int>, py::array_t<int>> estimate_right_grid_disp<int>(
+    py::array_t<int>, py::array_t<int>
+);
+template std::pair<py::array_t<float>, py::array_t<float>> estimate_right_grid_disp<float>(
+    py::array_t<float>, py::array_t<float>
+);