openCV library for Renesas RZ/A
Dependents: RZ_A2M_Mbed_samples
include/opencv2/stitching/detail/util.hpp@0:0e0631af0305, 2021-01-29 (annotated)
- Committer:
- RyoheiHagimoto
- Date:
- Fri Jan 29 04:53:38 2021 +0000
- Revision:
- 0:0e0631af0305
copied from https://github.com/d-kato/opencv-lib.
Who changed what in which revision?
User | Revision | Line number | New contents of line |
---|---|---|---|
RyoheiHagimoto | 0:0e0631af0305 | 1 | /*M/////////////////////////////////////////////////////////////////////////////////////// |
RyoheiHagimoto | 0:0e0631af0305 | 2 | // |
RyoheiHagimoto | 0:0e0631af0305 | 3 | // IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING. |
RyoheiHagimoto | 0:0e0631af0305 | 4 | // |
RyoheiHagimoto | 0:0e0631af0305 | 5 | // By downloading, copying, installing or using the software you agree to this license. |
RyoheiHagimoto | 0:0e0631af0305 | 6 | // If you do not agree to this license, do not download, install, |
RyoheiHagimoto | 0:0e0631af0305 | 7 | // copy or use the software. |
RyoheiHagimoto | 0:0e0631af0305 | 8 | // |
RyoheiHagimoto | 0:0e0631af0305 | 9 | // |
RyoheiHagimoto | 0:0e0631af0305 | 10 | // License Agreement |
RyoheiHagimoto | 0:0e0631af0305 | 11 | // For Open Source Computer Vision Library |
RyoheiHagimoto | 0:0e0631af0305 | 12 | // |
RyoheiHagimoto | 0:0e0631af0305 | 13 | // Copyright (C) 2000-2008, Intel Corporation, all rights reserved. |
RyoheiHagimoto | 0:0e0631af0305 | 14 | // Copyright (C) 2009, Willow Garage Inc., all rights reserved. |
RyoheiHagimoto | 0:0e0631af0305 | 15 | // Third party copyrights are property of their respective owners. |
RyoheiHagimoto | 0:0e0631af0305 | 16 | // |
RyoheiHagimoto | 0:0e0631af0305 | 17 | // Redistribution and use in source and binary forms, with or without modification, |
RyoheiHagimoto | 0:0e0631af0305 | 18 | // are permitted provided that the following conditions are met: |
RyoheiHagimoto | 0:0e0631af0305 | 19 | // |
RyoheiHagimoto | 0:0e0631af0305 | 20 | // * Redistribution's of source code must retain the above copyright notice, |
RyoheiHagimoto | 0:0e0631af0305 | 21 | // this list of conditions and the following disclaimer. |
RyoheiHagimoto | 0:0e0631af0305 | 22 | // |
RyoheiHagimoto | 0:0e0631af0305 | 23 | // * Redistribution's in binary form must reproduce the above copyright notice, |
RyoheiHagimoto | 0:0e0631af0305 | 24 | // this list of conditions and the following disclaimer in the documentation |
RyoheiHagimoto | 0:0e0631af0305 | 25 | // and/or other materials provided with the distribution. |
RyoheiHagimoto | 0:0e0631af0305 | 26 | // |
RyoheiHagimoto | 0:0e0631af0305 | 27 | // * The name of the copyright holders may not be used to endorse or promote products |
RyoheiHagimoto | 0:0e0631af0305 | 28 | // derived from this software without specific prior written permission. |
RyoheiHagimoto | 0:0e0631af0305 | 29 | // |
RyoheiHagimoto | 0:0e0631af0305 | 30 | // This software is provided by the copyright holders and contributors "as is" and |
RyoheiHagimoto | 0:0e0631af0305 | 31 | // any express or implied warranties, including, but not limited to, the implied |
RyoheiHagimoto | 0:0e0631af0305 | 32 | // warranties of merchantability and fitness for a particular purpose are disclaimed. |
RyoheiHagimoto | 0:0e0631af0305 | 33 | // In no event shall the Intel Corporation or contributors be liable for any direct, |
RyoheiHagimoto | 0:0e0631af0305 | 34 | // indirect, incidental, special, exemplary, or consequential damages |
RyoheiHagimoto | 0:0e0631af0305 | 35 | // (including, but not limited to, procurement of substitute goods or services; |
RyoheiHagimoto | 0:0e0631af0305 | 36 | // loss of use, data, or profits; or business interruption) however caused |
RyoheiHagimoto | 0:0e0631af0305 | 37 | // and on any theory of liability, whether in contract, strict liability, |
RyoheiHagimoto | 0:0e0631af0305 | 38 | // or tort (including negligence or otherwise) arising in any way out of |
RyoheiHagimoto | 0:0e0631af0305 | 39 | // the use of this software, even if advised of the possibility of such damage. |
RyoheiHagimoto | 0:0e0631af0305 | 40 | // |
RyoheiHagimoto | 0:0e0631af0305 | 41 | //M*/ |
RyoheiHagimoto | 0:0e0631af0305 | 42 | |
RyoheiHagimoto | 0:0e0631af0305 | 43 | #ifndef OPENCV_STITCHING_UTIL_HPP |
RyoheiHagimoto | 0:0e0631af0305 | 44 | #define OPENCV_STITCHING_UTIL_HPP |
RyoheiHagimoto | 0:0e0631af0305 | 45 | |
RyoheiHagimoto | 0:0e0631af0305 | 46 | #include <list> |
RyoheiHagimoto | 0:0e0631af0305 | 47 | #include "opencv2/core.hpp" |
RyoheiHagimoto | 0:0e0631af0305 | 48 | |
RyoheiHagimoto | 0:0e0631af0305 | 49 | namespace cv { |
RyoheiHagimoto | 0:0e0631af0305 | 50 | namespace detail { |
RyoheiHagimoto | 0:0e0631af0305 | 51 | |
RyoheiHagimoto | 0:0e0631af0305 | 52 | //! @addtogroup stitching |
RyoheiHagimoto | 0:0e0631af0305 | 53 | //! @{ |
RyoheiHagimoto | 0:0e0631af0305 | 54 | |
RyoheiHagimoto | 0:0e0631af0305 | 55 | class CV_EXPORTS DisjointSets |
RyoheiHagimoto | 0:0e0631af0305 | 56 | { |
RyoheiHagimoto | 0:0e0631af0305 | 57 | public: |
RyoheiHagimoto | 0:0e0631af0305 | 58 | DisjointSets(int elem_count = 0) { createOneElemSets(elem_count); } |
RyoheiHagimoto | 0:0e0631af0305 | 59 | |
RyoheiHagimoto | 0:0e0631af0305 | 60 | void createOneElemSets(int elem_count); |
RyoheiHagimoto | 0:0e0631af0305 | 61 | int findSetByElem(int elem); |
RyoheiHagimoto | 0:0e0631af0305 | 62 | int mergeSets(int set1, int set2); |
RyoheiHagimoto | 0:0e0631af0305 | 63 | |
RyoheiHagimoto | 0:0e0631af0305 | 64 | std::vector<int> parent; |
RyoheiHagimoto | 0:0e0631af0305 | 65 | std::vector<int> size; |
RyoheiHagimoto | 0:0e0631af0305 | 66 | |
RyoheiHagimoto | 0:0e0631af0305 | 67 | private: |
RyoheiHagimoto | 0:0e0631af0305 | 68 | std::vector<int> rank_; |
RyoheiHagimoto | 0:0e0631af0305 | 69 | }; |
RyoheiHagimoto | 0:0e0631af0305 | 70 | |
RyoheiHagimoto | 0:0e0631af0305 | 71 | |
RyoheiHagimoto | 0:0e0631af0305 | 72 | struct CV_EXPORTS GraphEdge |
RyoheiHagimoto | 0:0e0631af0305 | 73 | { |
RyoheiHagimoto | 0:0e0631af0305 | 74 | GraphEdge(int from, int to, float weight); |
RyoheiHagimoto | 0:0e0631af0305 | 75 | bool operator <(const GraphEdge& other) const { return weight < other.weight; } |
RyoheiHagimoto | 0:0e0631af0305 | 76 | bool operator >(const GraphEdge& other) const { return weight > other.weight; } |
RyoheiHagimoto | 0:0e0631af0305 | 77 | |
RyoheiHagimoto | 0:0e0631af0305 | 78 | int from, to; |
RyoheiHagimoto | 0:0e0631af0305 | 79 | float weight; |
RyoheiHagimoto | 0:0e0631af0305 | 80 | }; |
RyoheiHagimoto | 0:0e0631af0305 | 81 | |
RyoheiHagimoto | 0:0e0631af0305 | 82 | inline GraphEdge::GraphEdge(int _from, int _to, float _weight) : from(_from), to(_to), weight(_weight) {} |
RyoheiHagimoto | 0:0e0631af0305 | 83 | |
RyoheiHagimoto | 0:0e0631af0305 | 84 | |
RyoheiHagimoto | 0:0e0631af0305 | 85 | class CV_EXPORTS Graph |
RyoheiHagimoto | 0:0e0631af0305 | 86 | { |
RyoheiHagimoto | 0:0e0631af0305 | 87 | public: |
RyoheiHagimoto | 0:0e0631af0305 | 88 | Graph(int num_vertices = 0) { create(num_vertices); } |
RyoheiHagimoto | 0:0e0631af0305 | 89 | void create(int num_vertices) { edges_.assign(num_vertices, std::list<GraphEdge>()); } |
RyoheiHagimoto | 0:0e0631af0305 | 90 | int numVertices() const { return static_cast<int>(edges_.size()); } |
RyoheiHagimoto | 0:0e0631af0305 | 91 | void addEdge(int from, int to, float weight); |
RyoheiHagimoto | 0:0e0631af0305 | 92 | template <typename B> B forEach(B body) const; |
RyoheiHagimoto | 0:0e0631af0305 | 93 | template <typename B> B walkBreadthFirst(int from, B body) const; |
RyoheiHagimoto | 0:0e0631af0305 | 94 | |
RyoheiHagimoto | 0:0e0631af0305 | 95 | private: |
RyoheiHagimoto | 0:0e0631af0305 | 96 | std::vector< std::list<GraphEdge> > edges_; |
RyoheiHagimoto | 0:0e0631af0305 | 97 | }; |
RyoheiHagimoto | 0:0e0631af0305 | 98 | |
RyoheiHagimoto | 0:0e0631af0305 | 99 | |
RyoheiHagimoto | 0:0e0631af0305 | 100 | ////////////////////////////////////////////////////////////////////////////// |
RyoheiHagimoto | 0:0e0631af0305 | 101 | // Auxiliary functions |
RyoheiHagimoto | 0:0e0631af0305 | 102 | |
RyoheiHagimoto | 0:0e0631af0305 | 103 | CV_EXPORTS bool overlapRoi(Point tl1, Point tl2, Size sz1, Size sz2, Rect &roi); |
RyoheiHagimoto | 0:0e0631af0305 | 104 | CV_EXPORTS Rect resultRoi(const std::vector<Point> &corners, const std::vector<UMat> &images); |
RyoheiHagimoto | 0:0e0631af0305 | 105 | CV_EXPORTS Rect resultRoi(const std::vector<Point> &corners, const std::vector<Size> &sizes); |
RyoheiHagimoto | 0:0e0631af0305 | 106 | CV_EXPORTS Rect resultRoiIntersection(const std::vector<Point> &corners, const std::vector<Size> &sizes); |
RyoheiHagimoto | 0:0e0631af0305 | 107 | CV_EXPORTS Point resultTl(const std::vector<Point> &corners); |
RyoheiHagimoto | 0:0e0631af0305 | 108 | |
RyoheiHagimoto | 0:0e0631af0305 | 109 | // Returns random 'count' element subset of the {0,1,...,size-1} set |
RyoheiHagimoto | 0:0e0631af0305 | 110 | CV_EXPORTS void selectRandomSubset(int count, int size, std::vector<int> &subset); |
RyoheiHagimoto | 0:0e0631af0305 | 111 | |
RyoheiHagimoto | 0:0e0631af0305 | 112 | CV_EXPORTS int& stitchingLogLevel(); |
RyoheiHagimoto | 0:0e0631af0305 | 113 | |
RyoheiHagimoto | 0:0e0631af0305 | 114 | //! @} |
RyoheiHagimoto | 0:0e0631af0305 | 115 | |
RyoheiHagimoto | 0:0e0631af0305 | 116 | } // namespace detail |
RyoheiHagimoto | 0:0e0631af0305 | 117 | } // namespace cv |
RyoheiHagimoto | 0:0e0631af0305 | 118 | |
RyoheiHagimoto | 0:0e0631af0305 | 119 | #include "util_inl.hpp" |
RyoheiHagimoto | 0:0e0631af0305 | 120 | |
RyoheiHagimoto | 0:0e0631af0305 | 121 | #endif // OPENCV_STITCHING_UTIL_HPP |