/*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 #include "precomp.hpp" #define ENABLE_LOG 1 #if ENABLE_LOG #include #define LOG(msg) { std::cout << msg; std::cout.flush(); } #else #define LOG(msg) #endif #define LOGLN(msg) LOG(msg << std::endl) class 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 parent; std::vector size; private: std::vector rank_; }; struct GraphEdge { GraphEdge(int from, int to, float weight) : from(from), to(to), weight(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; }; class Graph { public: Graph(int num_vertices = 0) { create(num_vertices); } void create(int num_vertices) { edges_.assign(num_vertices, std::list()); } int numVertices() const { return static_cast(edges_.size()); } void addEdge(int from, int to, float weight); template B forEach(B body) const; template B walkBreadthFirst(int from, B body) const; private: std::vector< std::list > edges_; }; ////////////////////////////////////////////////////////////////////////////// // Auxiliary functions bool overlapRoi(cv::Point tl1, cv::Point tl2, cv::Size sz1, cv::Size sz2, cv::Rect &roi); cv::Rect resultRoi(const std::vector &corners, const std::vector &images); cv::Rect resultRoi(const std::vector &corners, const std::vector &sizes); cv::Point resultTl(const std::vector &corners); // Returns random 'count' element subset of the {0,1,...,size-1} set void selectRandomSubset(int count, int size, std::vector &subset); #include "util_inl.hpp" #endif // __OPENCV_STITCHING_UTIL_HPP__