util.hpp

00001 /*M///////////////////////////////////////////////////////////////////////////////////////
00002 //
00003 //  IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
00004 //
00005 //  By downloading, copying, installing or using the software you agree to this license.
00006 //  If you do not agree to this license, do not download, install,
00007 //  copy or use the software.
00008 //
00009 //
00010 //                          License Agreement
00011 //                For Open Source Computer Vision Library
00012 //
00013 // Copyright (C) 2000-2008, Intel Corporation, all rights reserved.
00014 // Copyright (C) 2009, Willow Garage Inc., all rights reserved.
00015 // Third party copyrights are property of their respective owners.
00016 //
00017 // Redistribution and use in source and binary forms, with or without modification,
00018 // are permitted provided that the following conditions are met:
00019 //
00020 //   * Redistribution's of source code must retain the above copyright notice,
00021 //     this list of conditions and the following disclaimer.
00022 //
00023 //   * Redistribution's in binary form must reproduce the above copyright notice,
00024 //     this list of conditions and the following disclaimer in the documentation
00025 //     and/or other materials provided with the distribution.
00026 //
00027 //   * The name of the copyright holders may not be used to endorse or promote products
00028 //     derived from this software without specific prior written permission.
00029 //
00030 // This software is provided by the copyright holders and contributors "as is" and
00031 // any express or implied warranties, including, but not limited to, the implied
00032 // warranties of merchantability and fitness for a particular purpose are disclaimed.
00033 // In no event shall the Intel Corporation or contributors be liable for any direct,
00034 // indirect, incidental, special, exemplary, or consequential damages
00035 // (including, but not limited to, procurement of substitute goods or services;
00036 // loss of use, data, or profits; or business interruption) however caused
00037 // and on any theory of liability, whether in contract, strict liability,
00038 // or tort (including negligence or otherwise) arising in any way out of
00039 // the use of this software, even if advised of the possibility of such damage.
00040 //
00041 //M*/
00042 
00043 #ifndef OPENCV_STITCHING_UTIL_HPP
00044 #define OPENCV_STITCHING_UTIL_HPP
00045 
00046 #include <list>
00047 #include "opencv2/core.hpp"
00048 
00049 namespace cv {
00050 namespace detail {
00051 
00052 //! @addtogroup stitching
00053 //! @{
00054 
00055 class CV_EXPORTS DisjointSets
00056 {
00057 public:
00058     DisjointSets(int elem_count = 0) { createOneElemSets(elem_count); }
00059 
00060     void createOneElemSets(int elem_count);
00061     int findSetByElem(int elem);
00062     int mergeSets(int set1, int set2);
00063 
00064     std::vector<int> parent;
00065     std::vector<int> size;
00066 
00067 private:
00068     std::vector<int> rank_;
00069 };
00070 
00071 
00072 struct CV_EXPORTS GraphEdge
00073 {
00074     GraphEdge(int from, int to, float weight);
00075     bool operator <(const GraphEdge& other) const { return weight < other.weight; }
00076     bool operator >(const GraphEdge& other) const { return weight > other.weight; }
00077 
00078     int from, to;
00079     float weight;
00080 };
00081 
00082 inline GraphEdge::GraphEdge(int _from, int _to, float _weight) : from(_from), to(_to), weight(_weight) {}
00083 
00084 
00085 class CV_EXPORTS Graph
00086 {
00087 public:
00088     Graph(int num_vertices = 0) { create(num_vertices); }
00089     void create(int num_vertices) { edges_.assign(num_vertices, std::list<GraphEdge>()); }
00090     int numVertices() const { return static_cast<int>(edges_.size()); }
00091     void addEdge(int from, int to, float weight);
00092     template <typename B> B forEach(B body) const;
00093     template <typename B> B walkBreadthFirst(int from, B body) const;
00094 
00095 private:
00096     std::vector< std::list<GraphEdge> > edges_;
00097 };
00098 
00099 
00100 //////////////////////////////////////////////////////////////////////////////
00101 // Auxiliary functions
00102 
00103 CV_EXPORTS bool overlapRoi(Point tl1, Point tl2, Size sz1, Size sz2, Rect &roi);
00104 CV_EXPORTS Rect resultRoi(const std::vector<Point> &corners, const std::vector<UMat> &images);
00105 CV_EXPORTS Rect resultRoi(const std::vector<Point> &corners, const std::vector<Size> &sizes);
00106 CV_EXPORTS Rect resultRoiIntersection(const std::vector<Point> &corners, const std::vector<Size> &sizes);
00107 CV_EXPORTS Point resultTl(const std::vector<Point> &corners);
00108 
00109 // Returns random 'count' element subset of the {0,1,...,size-1} set
00110 CV_EXPORTS void selectRandomSubset(int count, int size, std::vector<int> &subset);
00111 
00112 CV_EXPORTS int& stitchingLogLevel();
00113 
00114 //! @}
00115 
00116 } // namespace detail
00117 } // namespace cv
00118 
00119 #include "util_inl.hpp"
00120 
00121 #endif // OPENCV_STITCHING_UTIL_HPP