You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
122 lines
4.3 KiB
C++
122 lines
4.3 KiB
C++
/*M///////////////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
|
|
//
|
|
// By downloading, copying, installing or using the software you agree to this license.
|
|
// If you do not agree to this license, do not download, install,
|
|
// copy or use the software.
|
|
//
|
|
//
|
|
// License Agreement
|
|
// For Open Source Computer Vision Library
|
|
//
|
|
// Copyright (C) 2000-2008, Intel Corporation, all rights reserved.
|
|
// Copyright (C) 2009, Willow Garage Inc., all rights reserved.
|
|
// Third party copyrights are property of their respective owners.
|
|
//
|
|
// Redistribution and use in source and binary forms, with or without modification,
|
|
// are permitted provided that the following conditions are met:
|
|
//
|
|
// * Redistribution's of source code must retain the above copyright notice,
|
|
// this list of conditions and the following disclaimer.
|
|
//
|
|
// * Redistribution's in binary form must reproduce the above copyright notice,
|
|
// this list of conditions and the following disclaimer in the documentation
|
|
// and/or other materials provided with the distribution.
|
|
//
|
|
// * The name of the copyright holders may not be used to endorse or promote products
|
|
// derived from this software without specific prior written permission.
|
|
//
|
|
// This software is provided by the copyright holders and contributors "as is" and
|
|
// any express or implied warranties, including, but not limited to, the implied
|
|
// warranties of merchantability and fitness for a particular purpose are disclaimed.
|
|
// In no event shall the Intel Corporation or contributors be liable for any direct,
|
|
// indirect, incidental, special, exemplary, or consequential damages
|
|
// (including, but not limited to, procurement of substitute goods or services;
|
|
// loss of use, data, or profits; or business interruption) however caused
|
|
// and on any theory of liability, whether in contract, strict liability,
|
|
// or tort (including negligence or otherwise) arising in any way out of
|
|
// the use of this software, even if advised of the possibility of such damage.
|
|
//
|
|
//M*/
|
|
|
|
#ifndef OPENCV_STITCHING_UTIL_HPP
|
|
#define OPENCV_STITCHING_UTIL_HPP
|
|
|
|
#include <list>
|
|
#include "opencv2/core.hpp"
|
|
|
|
namespace cv {
|
|
namespace detail {
|
|
|
|
//! @addtogroup stitching
|
|
//! @{
|
|
|
|
class CV_EXPORTS DisjointSets
|
|
{
|
|
public:
|
|
DisjointSets(int elem_count = 0) { createOneElemSets(elem_count); }
|
|
|
|
void createOneElemSets(int elem_count);
|
|
int findSetByElem(int elem);
|
|
int mergeSets(int set1, int set2);
|
|
|
|
std::vector<int> parent;
|
|
std::vector<int> size;
|
|
|
|
private:
|
|
std::vector<int> rank_;
|
|
};
|
|
|
|
|
|
struct CV_EXPORTS GraphEdge
|
|
{
|
|
GraphEdge(int from, int to, float weight);
|
|
bool operator <(const GraphEdge& other) const { return weight < other.weight; }
|
|
bool operator >(const GraphEdge& other) const { return weight > other.weight; }
|
|
|
|
int from, to;
|
|
float weight;
|
|
};
|
|
|
|
inline GraphEdge::GraphEdge(int _from, int _to, float _weight) : from(_from), to(_to), weight(_weight) {}
|
|
|
|
|
|
class CV_EXPORTS Graph
|
|
{
|
|
public:
|
|
Graph(int num_vertices = 0) { create(num_vertices); }
|
|
void create(int num_vertices) { edges_.assign(num_vertices, std::list<GraphEdge>()); }
|
|
int numVertices() const { return static_cast<int>(edges_.size()); }
|
|
void addEdge(int from, int to, float weight);
|
|
template <typename B> B forEach(B body) const;
|
|
template <typename B> B walkBreadthFirst(int from, B body) const;
|
|
|
|
private:
|
|
std::vector< std::list<GraphEdge> > edges_;
|
|
};
|
|
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
// Auxiliary functions
|
|
|
|
CV_EXPORTS_W bool overlapRoi(Point tl1, Point tl2, Size sz1, Size sz2, Rect &roi);
|
|
CV_EXPORTS_W Rect resultRoi(const std::vector<Point> &corners, const std::vector<UMat> &images);
|
|
CV_EXPORTS_W Rect resultRoi(const std::vector<Point> &corners, const std::vector<Size> &sizes);
|
|
CV_EXPORTS_W Rect resultRoiIntersection(const std::vector<Point> &corners, const std::vector<Size> &sizes);
|
|
CV_EXPORTS_W Point resultTl(const std::vector<Point> &corners);
|
|
|
|
// Returns random 'count' element subset of the {0,1,...,size-1} set
|
|
CV_EXPORTS_W void selectRandomSubset(int count, int size, std::vector<int> &subset);
|
|
|
|
CV_EXPORTS_W int& stitchingLogLevel();
|
|
|
|
//! @}
|
|
|
|
} // namespace detail
|
|
} // namespace cv
|
|
|
|
#include "util_inl.hpp"
|
|
|
|
#endif // OPENCV_STITCHING_UTIL_HPP
|