File: opencvalgorithms_private.h

package info (click to toggle)
actiona 3.10.1-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye
  • size: 7,312 kB
  • sloc: cpp: 57,403; ansic: 90; xml: 27; makefile: 19
file content (92 lines) | stat: -rw-r--r-- 3,641 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
/*
    Actiona
    Copyright (C) 2005 Jonathan Mercier-Ganady

    Actiona is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    Actiona is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program. If not, see <http://www.gnu.org/licenses/>.

    Contact : jmgr@jmgr.info
*/

#pragma once

#include "opencvalgorithms.h"

#include <opencv2/opencv.hpp>

#include <QList>

#if CV_MAJOR_VERSION == 2
namespace cv
{
    class Mat;
}

using Mat = cv::Mat;
#elif CV_MAJOR_VERSION >= 3
namespace cv
{
    class UMat;
}

using Mat = cv::UMat;
#endif

namespace ActionTools
{
    struct OpenCVAlgorithmsPrivate
    {
        bool checkInputImages(const QList<Mat> &sources, const Mat &target);

        /*=============================================================================
          FastMatchTemplate
          Performs a fast match template
          Returns: true on success, false on failure
          Parameters:
            source - source image (where we are searching)
            target - target image (what we are searching for)
            foundPointsList - contains a list of the points where the target was found
            confidencesList - contains a list of the confidence value (0-100) for each
                              found target
            matchPercentage - the minimum required match score to consider the target
                              found
            numMaxima - the maximum number of search locations to try before exiting
                        (i.e. when image is down-sampled and searched, we collect the
                        best numMaxima locations - those with the highest confidence -
                        and search the original image at these locations)
            numDownPyrs - the number of times to down-sample the image (only increase
                          this number if your images are really large)
            searchExpansion - The original source image is searched at the top locations
                              with +/- searchExpansion pixels in both the x and y
                              directions
        */
        MatchingPointList fastMatchTemplate(const QList<Mat> &sources,
                                            const Mat &target,
                                            int matchPercentage,
                                            int maximumMatches,
                                            int downPyrs,
                                            int searchExpansion,
                                            OpenCVAlgorithms::AlgorithmMethod method);

        static QVector<QPoint> multipleMinMaxLoc(const Mat &image, int maximumMatches, OpenCVAlgorithms::AlgorithmMethod method);

        static QImage toQImage(const Mat &image);
        static Mat toCVMat(const QImage &image);
        static int toOpenCVMethod(OpenCVAlgorithms::AlgorithmMethod method);

        OpenCVAlgorithms::AlgorithmError mError{OpenCVAlgorithms::NoError};
        QString mErrorString;
        QFuture<MatchingPointList> mFuture;
        QFutureWatcher<MatchingPointList> mFutureWatcher;
    };
}