2022-02-16 13:59:14 +01:00
|
|
|
|
#pragma once
|
|
|
|
|
|
|
|
|
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
|
|
|
|
#include "bounding_box.h"
|
2022-02-17 23:15:45 +01:00
|
|
|
|
#include "frame.h"
|
|
|
|
|
|
#include "mask.h"
|
2022-02-16 13:59:14 +01:00
|
|
|
|
|
|
|
|
|
|
namespace freling {
|
|
|
|
|
|
|
2022-02-17 23:15:45 +01:00
|
|
|
|
std::vector<BoundingBox> A2(const Frame& frame, const Mask& mask);
|
|
|
|
|
|
|
|
|
|
|
|
// The normal signature for this function is the one above:
|
2022-02-16 13:59:14 +01:00
|
|
|
|
// std::vector<BoundingBox> A2(const Frame& regions);
|
|
|
|
|
|
// However, since we are mocking this algorithm we just need to fulfill this
|
|
|
|
|
|
// constraint: "We assume for the sake of simplicity, that no bounding boxe
|
|
|
|
|
|
// in B′ overlaps more than one region in F Regions".
|
|
|
|
|
|
// To do so, we need to have the original delimitation of regions.
|
|
|
|
|
|
std::vector<BoundingBox> A2(const std::vector<BoundingBox>& regions);
|
|
|
|
|
|
|
|
|
|
|
|
} // namespace freling
|
