rects.hpp

浏览该文件的文档.

/*
 * @Description: 矩形列表类，头文件以及实现
 * @Version:
 * @Autor: LL
 * @date: 2023-12-03
 * @LastEditors: LL
 * @LastEditTime: 2024-05-20
 */
#ifndef COMMON_RECTS_HPP
#define COMMON_RECTS_HPP
 
#include <iostream>
#include <opencv2/core.hpp>
 
#include "common/base/disjoint_set.hpp"
#include "common/base/list.hpp"
#include "common/base/rect.hpp"
 
namespace cm {
 
class Rects : public List<Rect> {
   public:
    using List<Rect>::List;     // 复制构造函数
    
    Rects() = default;
    Rects(const Rects& rects) = default;
    Rects(const std::vector<cv::Rect>& rects);
    Rects(const std::vector<cv::Vec4i>& rects);
    Rects(const std::vector<std::vector<int>>& rects);
    ~Rects() = default;
 
    Rects& operator=(const std::vector<cv::Rect>& rects);
    Rects& operator=(const std::vector<cv::Vec4i>& rects);
    Rects& operator=(const std::vector<std::vector<int>>& rects);
 
    Rect MergeRects() const;
    Rects& MergeRects(int horizontal_min_distance = 0, int vertical_min_distance = 0);
    Rects& FilterInvalidRects(int min_width = 1, int min_height = 1);
};
 
inline Rects::Rects(const std::vector<cv::Rect>& rects) {
    for (auto& rect : rects)
        this->emplace_back(rect.x, rect.y, rect.width, rect.height);
}
 
inline Rects::Rects(const std::vector<cv::Vec4i>& rects) {
    for (auto& rect : rects)
        this->emplace_back(rect[0], rect[1], rect[2], rect[3]);
}
 
inline Rects::Rects(const std::vector<std::vector<int>>& rects) {
    for (auto& rect : rects)
        this->emplace_back(rect[0], rect[1], rect[2], rect[3]);
}
 
inline Rects& Rects::operator=(const std::vector<cv::Rect>& rects) {
    this->clear();
    for(auto& rect:rects)
        this->emplace_back(rect.x, rect.y, rect.width, rect.height);
    return *this;
}
 
inline Rects& Rects::operator=(const std::vector<cv::Vec4i>& rects) {
    this->clear();
    for (auto& rect : rects)
        this->emplace_back(rect[0], rect[1], rect[2], rect[3]);
    return *this;
}
 
inline Rects& Rects::operator=(const std::vector<std::vector<int>>& rects) {
    this->clear();
    for (auto& rect : rects)
        this->emplace_back(rect[0], rect[1], rect[2], rect[3]);
    return *this;
}
 
inline Rect Rects::MergeRects() const {
    Rect new_rect;
 
    // 计算矩形最小x坐标
    new_rect.x = this->Min([](const Rect& rect1, const Rect rect2) { return rect1.x < rect2.x; })->x;
 
    // 计算矩形最小y坐标
    new_rect.y = this->Min([](const Rect& rect1, const Rect rect2) { return rect1.y < rect2.y; })->y;
 
    // 计算矩形最大x坐标
    auto rect = *this->Max([](const Rect& rect1, const Rect rect2) { return rect1.x + rect1.width < rect2.x + rect2.width; });
    new_rect.width = rect.x + rect.width - new_rect.x;
 
    // 计算矩形最大y坐标
    rect = *this->Max([](const Rect& rect1, const Rect rect2) { return rect1.y + rect1.height < rect2.y + rect2.height; });
    new_rect.height = rect.y + rect.height - new_rect.y;
 
    return new_rect;
}
 
inline Rects& Rects::MergeRects(int horizontal_min_distance, int vertical_min_distance) {
    auto& rects = *this;  // 矩形列表
 
    // 获取矩形数量
    int num_rects = this->size();
 
    // 如果矩形数量小于等于1
    if (num_rects <= 1)
        return rects;
 
    // 建立一个矩形列表并查集
    DisjointSet<Rect> disjoint_set(rects);
 
    // 合并所有相邻矩形框
    disjoint_set.UnionAll([&horizontal_min_distance, &vertical_min_distance](const Rect& rect1, const Rect& rect2) {
        return rect1.IsIntersect(rect2, INTERSECT_XY, Rect::Margin(vertical_min_distance, horizontal_min_distance));
    });
 
    // 清空原来矩形列表
    this->clear();
 
    // 遍历所有可合并矩形的集合
    for (auto& rects_collection : disjoint_set.GetAllCollections())
        this->emplace_back(static_cast<const Rects&>(rects_collection).MergeRects());
 
    return rects;
}
 
inline Rects& Rects::FilterInvalidRects(int min_width, int min_height) {
    *this = std::move(this->Filter([=](const Rect& rect) {
        return rect.width >= min_width && rect.height >= min_height;
    }));  // 更新矩形列表类
 
    return *this;
}
 
}  // namespace cm
 
#endif