1. Input/OutputArray optimizations;

2. Algorithm::load/save added (moved from StatModel)
3. copyrights updated; added copyright/licensing info for ffmpeg
4. some warnings from Xcode 6.x are fixed
pull/3911/head
Vadim Pisarevsky 10 years ago
parent 44f112a9de
commit 052593c760
  1. 42
      3rdparty/ffmpeg/build_win32.txt
  2. 520
      3rdparty/ffmpeg/license.txt
  3. 74
      3rdparty/ffmpeg/readme.txt
  4. 44
      3rdparty/readme.txt
  5. 8
      LICENSE
  6. 2
      apps/traincascade/old_ml_inner_functions.cpp
  7. 73
      modules/core/include/opencv2/core.hpp
  8. 44
      modules/core/include/opencv2/core/ippasync.hpp
  9. 95
      modules/core/include/opencv2/core/mat.hpp
  10. 9
      modules/core/include/opencv2/core/mat.inl.hpp
  11. 2
      modules/core/include/opencv2/core/operations.hpp
  12. 4
      modules/core/include/opencv2/core/version.hpp
  13. 14
      modules/core/src/algorithm.cpp
  14. 14
      modules/imgproc/src/connectedcomponents.cpp
  15. 55
      modules/ml/include/opencv2/ml.hpp
  16. 2
      modules/ml/src/ann_mlp.cpp
  17. 2
      modules/ml/src/boost.cpp
  18. 2
      modules/ml/src/em.cpp
  19. 11
      modules/ml/src/inner_functions.cpp
  20. 2
      modules/ml/src/knearest.cpp
  21. 2
      modules/ml/src/lr.cpp
  22. 2
      modules/ml/src/nbayes.cpp
  23. 2
      modules/ml/src/precomp.hpp
  24. 2
      modules/ml/src/rtrees.cpp
  25. 2
      modules/ml/src/svm.cpp
  26. 2
      modules/ml/test/test_emknearestkmeans.cpp
  27. 2
      modules/ml/test/test_lr.cpp
  28. 14
      modules/ml/test/test_mltests2.cpp
  29. 18
      modules/ml/test/test_save_load.cpp
  30. 2
      modules/stitching/include/opencv2/stitching/detail/seam_finders.hpp
  31. 4
      modules/stitching/include/opencv2/stitching/detail/warpers.hpp
  32. 5
      modules/stitching/src/seam_finders.cpp
  33. 21
      modules/stitching/src/warpers.cpp
  34. 2
      modules/superres/src/optical_flow.cpp

@ -0,0 +1,42 @@
The build script is to be fixed.
Right now it assumes that 32-bit MinGW is in the system path and
64-bit mingw is installed to c:\Apps\MinGW64.
It is important that gcc is used, not g++!
Otherwise the produced DLL will likely be dependent on libgcc_s_dw2-1.dll or similar DLL.
While we want to make the DLLs with minimum dependencies: Win32 libraries + msvcrt.dll.
ffopencv.c is really a C++ source, hence -x c++ is used.
How to update opencv_ffmpeg.dll and opencv_ffmpeg_64.dll when a new version of FFMPEG is release?
1. Install 32-bit MinGW + MSYS from
http://sourceforge.net/projects/mingw/files/Automated%20MinGW%20Installer/mingw-get-inst/
Let's assume, it's installed in C:\MSYS32.
2. Install 64-bit MinGW. http://mingw-w64.sourceforge.net/
Let's assume, it's installed in C:\MSYS64
3. Copy C:\MSYS32\msys to C:\MSYS64\msys. Edit C:\MSYS64\msys\etc\fstab, change C:\MSYS32 to C:\MSYS64.
4. Now you have working MSYS32 and MSYS64 environments.
Launch, one by one, C:\MSYS32\msys\msys.bat and C:\MSYS64\msys\msys.bat to create your home directories.
4. Download ffmpeg-x.y.z.tar.gz (where x.y.z denotes the actual ffmpeg version).
Copy it to C:\MSYS{32|64}\msys\home\<loginname> directory.
5. To build 32-bit ffmpeg libraries, run C:\MSYS32\msys\msys.bat and type the following commands:
5.1. tar -xzf ffmpeg-x.y.z.tar.gz
5.2. mkdir build
5.3. cd build
5.4. ../ffmpeg-x.y.z/configure --enable-w32threads
5.5. make
5.6. make install
5.7. cd /local/lib
5.8. strip -g *.a
6. Then repeat the same for 64-bit case. The output libs: libavcodec.a etc. need to be renamed to libavcodec64.a etc.
7. Then, copy all those libs to <opencv>\3rdparty\lib\, copy the headers to <opencv>\3rdparty\include\ffmpeg_.
8. Then, go to <opencv>\3rdparty\ffmpeg, edit make.bat
(change paths to the actual paths to your msys32 and msys64 distributions) and then run make.bat

@ -0,0 +1,520 @@
Copyright (C) 2001 Fabrice Bellard
FFmpeg is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
FFmpeg 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with FFmpeg; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
==================================================================================
GNU LESSER GENERAL PUBLIC LICENSE
Version 2.1, February 1999
Copyright (C) 1991, 1999 Free Software Foundation, Inc.
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
[This is the first released version of the Lesser GPL. It also counts
as the successor of the GNU Library Public License, version 2, hence
the version number 2.1.]
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
Licenses are intended to guarantee your freedom to share and change
free software--to make sure the software is free for all its users.
This license, the Lesser General Public License, applies to some
specially designated software packages--typically libraries--of the
Free Software Foundation and other authors who decide to use it. You
can use it too, but we suggest you first think carefully about whether
this license or the ordinary General Public License is the better
strategy to use in any particular case, based on the explanations below.
When we speak of free software, we are referring to freedom of use,
not price. Our General Public Licenses are designed to make sure that
you have the freedom to distribute copies of free software (and charge
for this service if you wish); that you receive source code or can get
it if you want it; that you can change the software and use pieces of
it in new free programs; and that you are informed that you can do
these things.
To protect your rights, we need to make restrictions that forbid
distributors to deny you these rights or to ask you to surrender these
rights. These restrictions translate to certain responsibilities for
you if you distribute copies of the library or if you modify it.
For example, if you distribute copies of the library, whether gratis
or for a fee, you must give the recipients all the rights that we gave
you. You must make sure that they, too, receive or can get the source
code. If you link other code with the library, you must provide
complete object files to the recipients, so that they can relink them
with the library after making changes to the library and recompiling
it. And you must show them these terms so they know their rights.
We protect your rights with a two-step method: (1) we copyright the
library, and (2) we offer you this license, which gives you legal
permission to copy, distribute and/or modify the library.
To protect each distributor, we want to make it very clear that
there is no warranty for the free library. Also, if the library is
modified by someone else and passed on, the recipients should know
that what they have is not the original version, so that the original
author's reputation will not be affected by problems that might be
introduced by others.
Finally, software patents pose a constant threat to the existence of
any free program. We wish to make sure that a company cannot
effectively restrict the users of a free program by obtaining a
restrictive license from a patent holder. Therefore, we insist that
any patent license obtained for a version of the library must be
consistent with the full freedom of use specified in this license.
Most GNU software, including some libraries, is covered by the
ordinary GNU General Public License. This license, the GNU Lesser
General Public License, applies to certain designated libraries, and
is quite different from the ordinary General Public License. We use
this license for certain libraries in order to permit linking those
libraries into non-free programs.
When a program is linked with a library, whether statically or using
a shared library, the combination of the two is legally speaking a
combined work, a derivative of the original library. The ordinary
General Public License therefore permits such linking only if the
entire combination fits its criteria of freedom. The Lesser General
Public License permits more lax criteria for linking other code with
the library.
We call this license the "Lesser" General Public License because it
does Less to protect the user's freedom than the ordinary General
Public License. It also provides other free software developers Less
of an advantage over competing non-free programs. These disadvantages
are the reason we use the ordinary General Public License for many
libraries. However, the Lesser license provides advantages in certain
special circumstances.
For example, on rare occasions, there may be a special need to
encourage the widest possible use of a certain library, so that it becomes
a de-facto standard. To achieve this, non-free programs must be
allowed to use the library. A more frequent case is that a free
library does the same job as widely used non-free libraries. In this
case, there is little to gain by limiting the free library to free
software only, so we use the Lesser General Public License.
In other cases, permission to use a particular library in non-free
programs enables a greater number of people to use a large body of
free software. For example, permission to use the GNU C Library in
non-free programs enables many more people to use the whole GNU
operating system, as well as its variant, the GNU/Linux operating
system.
Although the Lesser General Public License is Less protective of the
users' freedom, it does ensure that the user of a program that is
linked with the Library has the freedom and the wherewithal to run
that program using a modified version of the Library.
The precise terms and conditions for copying, distribution and
modification follow. Pay close attention to the difference between a
"work based on the library" and a "work that uses the library". The
former contains code derived from the library, whereas the latter must
be combined with the library in order to run.
GNU LESSER GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License Agreement applies to any software library or other
program which contains a notice placed by the copyright holder or
other authorized party saying it may be distributed under the terms of
this Lesser General Public License (also called "this License").
Each licensee is addressed as "you".
A "library" means a collection of software functions and/or data
prepared so as to be conveniently linked with application programs
(which use some of those functions and data) to form executables.
The "Library", below, refers to any such software library or work
which has been distributed under these terms. A "work based on the
Library" means either the Library or any derivative work under
copyright law: that is to say, a work containing the Library or a
portion of it, either verbatim or with modifications and/or translated
straightforwardly into another language. (Hereinafter, translation is
included without limitation in the term "modification".)
"Source code" for a work means the preferred form of the work for
making modifications to it. For a library, complete source code means
all the source code for all modules it contains, plus any associated
interface definition files, plus the scripts used to control compilation
and installation of the library.
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running a program using the Library is not restricted, and output from
such a program is covered only if its contents constitute a work based
on the Library (independent of the use of the Library in a tool for
writing it). Whether that is true depends on what the Library does
and what the program that uses the Library does.
1. You may copy and distribute verbatim copies of the Library's
complete source code as you receive it, in any medium, provided that
you conspicuously and appropriately publish on each copy an
appropriate copyright notice and disclaimer of warranty; keep intact
all the notices that refer to this License and to the absence of any
warranty; and distribute a copy of this License along with the
Library.
You may charge a fee for the physical act of transferring a copy,
and you may at your option offer warranty protection in exchange for a
fee.
2. You may modify your copy or copies of the Library or any portion
of it, thus forming a work based on the Library, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) The modified work must itself be a software library.
b) You must cause the files modified to carry prominent notices
stating that you changed the files and the date of any change.
c) You must cause the whole of the work to be licensed at no
charge to all third parties under the terms of this License.
d) If a facility in the modified Library refers to a function or a
table of data to be supplied by an application program that uses
the facility, other than as an argument passed when the facility
is invoked, then you must make a good faith effort to ensure that,
in the event an application does not supply such function or
table, the facility still operates, and performs whatever part of
its purpose remains meaningful.
(For example, a function in a library to compute square roots has
a purpose that is entirely well-defined independent of the
application. Therefore, Subsection 2d requires that any
application-supplied function or table used by this function must
be optional: if the application does not supply it, the square
root function must still compute square roots.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Library,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Library, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote
it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Library.
In addition, mere aggregation of another work not based on the Library
with the Library (or with a work based on the Library) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may opt to apply the terms of the ordinary GNU General Public
License instead of this License to a given copy of the Library. To do
this, you must alter all the notices that refer to this License, so
that they refer to the ordinary GNU General Public License, version 2,
instead of to this License. (If a newer version than version 2 of the
ordinary GNU General Public License has appeared, then you can specify
that version instead if you wish.) Do not make any other change in
these notices.
Once this change is made in a given copy, it is irreversible for
that copy, so the ordinary GNU General Public License applies to all
subsequent copies and derivative works made from that copy.
This option is useful when you wish to copy part of the code of
the Library into a program that is not a library.
4. You may copy and distribute the Library (or a portion or
derivative of it, under Section 2) in object code or executable form
under the terms of Sections 1 and 2 above provided that you accompany
it with the complete corresponding machine-readable source code, which
must be distributed under the terms of Sections 1 and 2 above on a
medium customarily used for software interchange.
If distribution of object code is made by offering access to copy
from a designated place, then offering equivalent access to copy the
source code from the same place satisfies the requirement to
distribute the source code, even though third parties are not
compelled to copy the source along with the object code.
5. A program that contains no derivative of any portion of the
Library, but is designed to work with the Library by being compiled or
linked with it, is called a "work that uses the Library". Such a
work, in isolation, is not a derivative work of the Library, and
therefore falls outside the scope of this License.
However, linking a "work that uses the Library" with the Library
creates an executable that is a derivative of the Library (because it
contains portions of the Library), rather than a "work that uses the
library". The executable is therefore covered by this License.
Section 6 states terms for distribution of such executables.
When a "work that uses the Library" uses material from a header file
that is part of the Library, the object code for the work may be a
derivative work of the Library even though the source code is not.
Whether this is true is especially significant if the work can be
linked without the Library, or if the work is itself a library. The
threshold for this to be true is not precisely defined by law.
If such an object file uses only numerical parameters, data
structure layouts and accessors, and small macros and small inline
functions (ten lines or less in length), then the use of the object
file is unrestricted, regardless of whether it is legally a derivative
work. (Executables containing this object code plus portions of the
Library will still fall under Section 6.)
Otherwise, if the work is a derivative of the Library, you may
distribute the object code for the work under the terms of Section 6.
Any executables containing that work also fall under Section 6,
whether or not they are linked directly with the Library itself.
6. As an exception to the Sections above, you may also combine or
link a "work that uses the Library" with the Library to produce a
work containing portions of the Library, and distribute that work
under terms of your choice, provided that the terms permit
modification of the work for the customer's own use and reverse
engineering for debugging such modifications.
You must give prominent notice with each copy of the work that the
Library is used in it and that the Library and its use are covered by
this License. You must supply a copy of this License. If the work
during execution displays copyright notices, you must include the
copyright notice for the Library among them, as well as a reference
directing the user to the copy of this License. Also, you must do one
of these things:
a) Accompany the work with the complete corresponding
machine-readable source code for the Library including whatever
changes were used in the work (which must be distributed under
Sections 1 and 2 above); and, if the work is an executable linked
with the Library, with the complete machine-readable "work that
uses the Library", as object code and/or source code, so that the
user can modify the Library and then relink to produce a modified
executable containing the modified Library. (It is understood
that the user who changes the contents of definitions files in the
Library will not necessarily be able to recompile the application
to use the modified definitions.)
b) Use a suitable shared library mechanism for linking with the
Library. A suitable mechanism is one that (1) uses at run time a
copy of the library already present on the user's computer system,
rather than copying library functions into the executable, and (2)
will operate properly with a modified version of the library, if
the user installs one, as long as the modified version is
interface-compatible with the version that the work was made with.
c) Accompany the work with a written offer, valid for at
least three years, to give the same user the materials
specified in Subsection 6a, above, for a charge no more
than the cost of performing this distribution.
d) If distribution of the work is made by offering access to copy
from a designated place, offer equivalent access to copy the above
specified materials from the same place.
e) Verify that the user has already received a copy of these
materials or that you have already sent this user a copy.
For an executable, the required form of the "work that uses the
Library" must include any data and utility programs needed for
reproducing the executable from it. However, as a special exception,
the materials to be distributed need not include anything that is
normally distributed (in either source or binary form) with the major
components (compiler, kernel, and so on) of the operating system on
which the executable runs, unless that component itself accompanies
the executable.
It may happen that this requirement contradicts the license
restrictions of other proprietary libraries that do not normally
accompany the operating system. Such a contradiction means you cannot
use both them and the Library together in an executable that you
distribute.
7. You may place library facilities that are a work based on the
Library side-by-side in a single library together with other library
facilities not covered by this License, and distribute such a combined
library, provided that the separate distribution of the work based on
the Library and of the other library facilities is otherwise
permitted, and provided that you do these two things:
a) Accompany the combined library with a copy of the same work
based on the Library, uncombined with any other library
facilities. This must be distributed under the terms of the
Sections above.
b) Give prominent notice with the combined library of the fact
that part of it is a work based on the Library, and explaining
where to find the accompanying uncombined form of the same work.
8. You may not copy, modify, sublicense, link with, or distribute
the Library except as expressly provided under this License. Any
attempt otherwise to copy, modify, sublicense, link with, or
distribute the Library is void, and will automatically terminate your
rights under this License. However, parties who have received copies,
or rights, from you under this License will not have their licenses
terminated so long as such parties remain in full compliance.
9. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Library or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Library (or any work based on the
Library), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Library or works based on it.
10. Each time you redistribute the Library (or any work based on the
Library), the recipient automatically receives a license from the
original licensor to copy, distribute, link with or modify the Library
subject to these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties with
this License.
11. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Library at all. For example, if a patent
license would not permit royalty-free redistribution of the Library by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Library.
If any portion of this section is held invalid or unenforceable under any
particular circumstance, the balance of the section is intended to apply,
and the section as a whole is intended to apply in other circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
12. If the distribution and/or use of the Library is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Library under this License may add
an explicit geographical distribution limitation excluding those countries,
so that distribution is permitted only in or among countries not thus
excluded. In such case, this License incorporates the limitation as if
written in the body of this License.
13. The Free Software Foundation may publish revised and/or new
versions of the Lesser General Public License from time to time.
Such new versions will be similar in spirit to the present version,
but may differ in detail to address new problems or concerns.
Each version is given a distinguishing version number. If the Library
specifies a version number of this License which applies to it and
"any later version", you have the option of following the terms and
conditions either of that version or of any later version published by
the Free Software Foundation. If the Library does not specify a
license version number, you may choose any version ever published by
the Free Software Foundation.
14. If you wish to incorporate parts of the Library into other free
programs whose distribution conditions are incompatible with these,
write to the author to ask for permission. For software which is
copyrighted by the Free Software Foundation, write to the Free
Software Foundation; we sometimes make exceptions for this. Our
decision will be guided by the two goals of preserving the free status
of all derivatives of our free software and of promoting the sharing
and reuse of software generally.
NO WARRANTY
15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
DAMAGES.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Libraries
If you develop a new library, and you want it to be of the greatest
possible use to the public, we recommend making it free software that
everyone can redistribute and change. You can do so by permitting
redistribution under these terms (or, alternatively, under the terms of the
ordinary General Public License).
To apply these terms, attach the following notices to the library. It is
safest to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least the
"copyright" line and a pointer to where the full notice is found.
<one line to give the library's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Also add information on how to contact you by electronic and paper mail.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the library, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the
library `Frob' (a library for tweaking knobs) written by James Random Hacker.
<signature of Ty Coon>, 1 April 1990
Ty Coon, President of Vice
That's all there is to it!

@ -1,42 +1,32 @@
The build script is to be fixed. * On Linux and other Unix flavors OpenCV uses default or user-built ffmpeg/libav libraries.
Right now it assumes that 32-bit MinGW is in the system path and If user builds ffmpeg/libav from source and wants OpenCV to stay BSD library, not GPL/LGPL,
64-bit mingw is installed to c:\Apps\MinGW64. he/she should use --enabled-shared configure flag and make sure that no GPL components are
enabled (some notable examples are x264 (H264 encoder) and libac3 (Dolby AC3 audio codec)).
It is important that gcc is used, not g++! See https://www.ffmpeg.org/legal.html for details.
Otherwise the produced DLL will likely be dependent on libgcc_s_dw2-1.dll or similar DLL.
While we want to make the DLLs with minimum dependencies: Win32 libraries + msvcrt.dll. If you want to play very safe and do not want to use FFMPEG at all, regardless of whether it's installed on
your system or not, configure and build OpenCV using CMake with WITH_FFMPEG=OFF flag. OpenCV will then use
ffopencv.c is really a C++ source, hence -x c++ is used. AVFoundation (OSX), GStreamer (Linux) or other available backends supported by opencv_videoio module.
How to update opencv_ffmpeg.dll and opencv_ffmpeg_64.dll when a new version of FFMPEG is release? There is also our self-contained motion jpeg codec, which you can use without any worries.
It handles CV_FOURCC('M', 'J', 'P', 'G') streams within an AVI container (".avi").
1. Install 32-bit MinGW + MSYS from
http://sourceforge.net/projects/mingw/files/Automated%20MinGW%20Installer/mingw-get-inst/ * On Windows OpenCV uses pre-built ffmpeg binaries, built with proper flags (without GPL components) and
Let's assume, it's installed in C:\MSYS32. wrapped with simple, stable OpenCV-compatible API.
2. Install 64-bit MinGW. http://mingw-w64.sourceforge.net/ The binaries are opencv_ffmpeg.dll (version for 32-bit Windows) and
Let's assume, it's installed in C:\MSYS64 opencv_ffmpeg_64.dll (version for 64-bit Windows).
3. Copy C:\MSYS32\msys to C:\MSYS64\msys. Edit C:\MSYS64\msys\etc\fstab, change C:\MSYS32 to C:\MSYS64.
See build_win32.txt for the build instructions, if you want to rebuild opencv_ffmpeg*.dll from scratch.
4. Now you have working MSYS32 and MSYS64 environments.
Launch, one by one, C:\MSYS32\msys\msys.bat and C:\MSYS64\msys\msys.bat to create your home directories. The pre-built opencv_ffmpeg*.dll is:
* LGPL library, not BSD libraries.
4. Download ffmpeg-x.y.z.tar.gz (where x.y.z denotes the actual ffmpeg version). * Loaded at runtime by opencv_videoio module.
Copy it to C:\MSYS{32|64}\msys\home\<loginname> directory. If it succeeds, ffmpeg can be used to decode/encode videos;
otherwise, other API is used.
5. To build 32-bit ffmpeg libraries, run C:\MSYS32\msys\msys.bat and type the following commands:
If LGPL/GPL software can not be supplied with your OpenCV-based product, simply exclude
5.1. tar -xzf ffmpeg-x.y.z.tar.gz opencv_ffmpeg*.dll from your distribution; OpenCV will stay fully functional except for the ability to
5.2. mkdir build decode/encode videos using FFMPEG (though, it may still be able to do that using other API,
5.3. cd build such as Video for Windows, Windows Media Foundation or our self-contained motion jpeg codec).
5.4. ../ffmpeg-x.y.z/configure --enable-w32threads
5.5. make See license.txt for the FFMPEG copyright notice and the licensing terms.
5.6. make install
5.7. cd /local/lib
5.8. strip -g *.a
6. Then repeat the same for 64-bit case. The output libs: libavcodec.a etc. need to be renamed to libavcodec64.a etc.
7. Then, copy all those libs to <opencv>\3rdparty\lib\, copy the headers to <opencv>\3rdparty\include\ffmpeg_.
8. Then, go to <opencv>\3rdparty\ffmpeg, edit make.bat
(change paths to the actual paths to your msys32 and msys64 distributions) and then run make.bat

@ -6,41 +6,34 @@ In order to use these versions of libraries instead of system ones on UNIX syste
should use BUILD_<library_name> CMake flags (for example, BUILD_PNG for the libpng library). should use BUILD_<library_name> CMake flags (for example, BUILD_PNG for the libpng library).
------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------
libjpeg 8d (8.4) - The Independent JPEG Group's JPEG software. libjpeg The Independent JPEG Group's JPEG software.
Copyright (C) 1991-2012, Thomas G. Lane, Guido Vollbeding. Copyright (C) 1991-2012, Thomas G. Lane, Guido Vollbeding.
See IGJ home page http://www.ijg.org See IGJ home page http://www.ijg.org
for details and links to the source code for details and links to the source code
HAVE_JPEG preprocessor flag must be set to make imgcodecs use libjpeg. WITH_JPEG CMake option must be ON to add libjpeg support to imgcodecs.
On UNIX systems configure script takes care of it.
------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------
libpng 1.5.12 - Portable Network Graphics library. libpng Portable Network Graphics library.
Copyright (c) 2004, 2006-2012 Glenn Randers-Pehrson. Copyright (c) 2004, 2006-2012 Glenn Randers-Pehrson.
See libpng home page http://www.libpng.org See libpng home page http://www.libpng.org
for details and links to the source code for details and links to the source code
HAVE_PNG preprocessor flag must be set to make imgcodecs use libpng. WITH_PNG CMake option must be ON to add libpng support to imgcodecs.
On UNIX systems configure script takes care of it.
------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------
libtiff 4.0.2 - Tag Image File Format (TIFF) Software libtiff Tag Image File Format (TIFF) Software
Copyright (c) 1988-1997 Sam Leffler Copyright (c) 1988-1997 Sam Leffler
Copyright (c) 1991-1997 Silicon Graphics, Inc. Copyright (c) 1991-1997 Silicon Graphics, Inc.
See libtiff home page http://www.remotesensing.org/libtiff/ See libtiff home page http://www.remotesensing.org/libtiff/
for details and links to the source code for details and links to the source code
HAVE_TIFF preprocessor flag must be set to make imgcodecs use libtiff. WITH_TIFF CMake option must be ON to add libtiff & zlib support to imgcodecs.
On UNIX systems configure script takes care of it.
In this build support for ZIP (LZ77 compression) is turned on.
------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------
zlib 1.2.7 - General purpose LZ77 compression library zlib General purpose LZ77 compression library
Copyright (C) 1995-2012 Jean-loup Gailly and Mark Adler. Copyright (C) 1995-2012 Jean-loup Gailly and Mark Adler.
See zlib home page http://www.zlib.net See zlib home page http://www.zlib.net
for details and links to the source code for details and links to the source code
No preprocessor definition is needed to make imgcodecs use this library -
it is included automatically if either libpng or libtiff are used.
------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------
jasper-1.900.1 - JasPer is a collection of software jasper JasPer is a collection of software
(i.e., a library and application programs) for the coding (i.e., a library and application programs) for the coding
and manipulation of images. This software can handle image data in a and manipulation of images. This software can handle image data in a
variety of formats. One such format supported by JasPer is the JPEG-2000 variety of formats. One such format supported by JasPer is the JPEG-2000
@ -50,14 +43,9 @@ jasper-1.900.1 - JasPer is a collection of software
Copyright (c) 1999-2000 The University of British Columbia Copyright (c) 1999-2000 The University of British Columbia
Copyright (c) 2001-2003 Michael David Adams Copyright (c) 2001-2003 Michael David Adams
The JasPer license can be found in src/libjasper. The JasPer license can be found in libjasper.
OpenCV on Windows uses pre-built libjasper library
(lib/libjasper*). To get the latest source code,
please, visit the project homepage:
http://www.ece.uvic.ca/~mdadams/jasper/
------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------
openexr-1.7.1 - OpenEXR is a high dynamic-range (HDR) image file format developed openexr OpenEXR is a high dynamic-range (HDR) image file format developed
by Industrial Light & Magic for use in computer imaging applications. by Industrial Light & Magic for use in computer imaging applications.
Copyright (c) 2006, Industrial Light & Magic, a division of Lucasfilm Copyright (c) 2006, Industrial Light & Magic, a division of Lucasfilm
@ -66,11 +54,17 @@ openexr-1.7.1 - OpenEXR is a high dynamic-range (HDR) image file format de
The project homepage: http://www.openexr.com The project homepage: http://www.openexr.com
------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------
ffmpeg-0.8.0 - FFmpeg is a complete, cross-platform solution to record, ffmpeg FFmpeg is a complete, cross-platform solution to record,
convert and stream audio and video. It includes libavcodec - convert and stream audio and video. It includes libavcodec -
the leading audio/video codec library, and also libavformat, libavutils and the leading audio/video codec library, and also libavformat, libavutils and
other helper libraries that are used by OpenCV (in highgui module) to other helper libraries that are used by OpenCV (in videoio module) to
read and write video files. read and write video files.
The project homepage: http://ffmpeg.org/ Copyright (c) 2001 Fabrice Bellard
The project homepage: http://ffmpeg.org/.
* On Linux/OSX we link user-installed ffmpeg (or ffmpeg fork libav).
* On Windows we use pre-built ffmpeg binaries,
see opencv/3rdparty/ffmpeg/readme.txt for details and licensing information
------------------------------------------------------------------------------------ ------------------------------------------------------------------------------------

@ -7,6 +7,14 @@ copy or use the software.
For Open Source Computer Vision Library For Open Source Computer Vision Library
(3-clause BSD License) (3-clause BSD License)
Copyright (C) 2000-2015, Intel Corporation, all rights reserved.
Copyright (C) 2009-2011, Willow Garage Inc., all rights reserved.
Copyright (C) 2009-2015, NVIDIA Corporation, all rights reserved.
Copyright (C) 2010-2013, Advanced Micro Devices, Inc., all rights reserved.
Copyright (C) 2015, OpenCV Foundation, all rights reserved.
Copyright (C) 2015, Itseez 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, Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met: are permitted provided that the following conditions are met:

@ -82,7 +82,7 @@ void CvStatModel::load( const char* filename, const char* name )
{ {
CvFileStorage* fs = 0; CvFileStorage* fs = 0;
CV_FUNCNAME( "CvStatModel::load" ); CV_FUNCNAME( "CvAlgorithm::load" );
__BEGIN__; __BEGIN__;

@ -10,8 +10,10 @@
// License Agreement // License Agreement
// For Open Source Computer Vision Library // For Open Source Computer Vision Library
// //
// Copyright (C) 2000-2008, Intel Corporation, all rights reserved. // Copyright (C) 2000-2015, Intel Corporation, all rights reserved.
// Copyright (C) 2009-2011, Willow Garage Inc., all rights reserved. // Copyright (C) 2009-2011, Willow Garage Inc., all rights reserved.
// Copyright (C) 2015, OpenCV Foundation, all rights reserved.
// Copyright (C) 2015, Itseez Inc., all rights reserved.
// Third party copyrights are property of their respective owners. // Third party copyrights are property of their respective owners.
// //
// Redistribution and use in source and binary forms, with or without modification, // Redistribution and use in source and binary forms, with or without modification,
@ -2921,6 +2923,10 @@ public:
Algorithm(); Algorithm();
virtual ~Algorithm(); virtual ~Algorithm();
/** @brief Clears the algorithm state
*/
CV_WRAP virtual void clear() {}
/** @brief Stores algorithm parameters in a file storage /** @brief Stores algorithm parameters in a file storage
*/ */
virtual void write(FileStorage& fs) const { (void)fs; } virtual void write(FileStorage& fs) const { (void)fs; }
@ -2928,6 +2934,71 @@ public:
/** @brief Reads algorithm parameters from a file storage /** @brief Reads algorithm parameters from a file storage
*/ */
virtual void read(const FileNode& fn) { (void)fn; } virtual void read(const FileNode& fn) { (void)fn; }
/** @brief Returns true if the Algorithm is empty (e.g. in the very beginning or after unsuccessful read
*/
virtual bool empty() const { return false; }
/** @brief Reads algorithm from the file node
This is static template method of Algorithm. It's usage is following (in the case of SVM):
@code
Ptr<SVM> svm = Algorithm::read<SVM>(fn);
@endcode
In order to make this method work, the derived class must overwrite Algorithm::read(const
FileNode& fn) and also have static create() method without parameters
(or with all the optional parameters)
*/
template<typename _Tp> static Ptr<_Tp> read(const FileNode& fn)
{
Ptr<_Tp> obj = _Tp::create();
obj->read(fn);
return !obj->empty() ? obj : Ptr<_Tp>();
}
/** @brief Loads algorithm from the file
This is static template method of Algorithm. It's usage is following (in the case of SVM):
@code
Ptr<SVM> svm = Algorithm::load<SVM>("my_svm_model.xml");
@endcode
In order to make this method work, the derived class must overwrite Algorithm::read(const
FileNode& fn).
*/
template<typename _Tp> static Ptr<_Tp> load(const String& filename, const String& objname=String())
{
FileStorage fs(filename, FileStorage::READ);
FileNode fn = objname.empty() ? fs.getFirstTopLevelNode() : fs[objname];
Ptr<_Tp> obj = _Tp::create();
obj->read(fn);
return !obj->empty() ? obj : Ptr<_Tp>();
}
/** @brief Loads algorithm from a String
@param strModel The string variable containing the model you want to load.
This is static template method of Algorithm. It's usage is following (in the case of SVM):
@code
Ptr<SVM> svm = Algorithm::loadFromString<SVM>(myStringModel);
@endcode
*/
template<typename _Tp> static Ptr<_Tp> loadFromString(const String& strModel, const String& objname=String())
{
FileStorage fs(strModel, FileStorage::READ + FileStorage::MEMORY);
FileNode fn = objname.empty() ? fs.getFirstTopLevelNode() : fs[objname];
Ptr<_Tp> obj = _Tp::create();
obj->read(fn);
return !obj->empty() ? obj : Ptr<_Tp>();
}
/** Saves the algorithm to a file.
In order to make this method work, the derived class must implement Algorithm::write(FileStorage& fs). */
CV_WRAP virtual void save(const String& filename) const;
/** Returns the algorithm string identifier.
This string is used as top level xml/yml node tag when the object is saved to a file or string. */
CV_WRAP virtual String getDefaultName() const;
}; };
struct Param { struct Param {

@ -1,3 +1,47 @@
/*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-2015, Intel Corporation, all rights reserved.
// Copyright (C) 2009, Willow Garage Inc., all rights reserved.
// Copyright (C) 2013, OpenCV Foundation, all rights reserved.
// Copyright (C) 2015, Itseez 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_CORE_IPPASYNC_HPP__ #ifndef __OPENCV_CORE_IPPASYNC_HPP__
#define __OPENCV_CORE_IPPASYNC_HPP__ #define __OPENCV_CORE_IPPASYNC_HPP__

@ -70,7 +70,7 @@ class CV_EXPORTS _OutputArray;
It is defined as: It is defined as:
@code @code
typedef const _InputArray& InputArray; class InputArray; // = _InputArray
@endcode @endcode
where _InputArray is a class that can be constructed from `Mat`, `Mat_<T>`, `Matx<T, m, n>`, where _InputArray is a class that can be constructed from `Mat`, `Mat_<T>`, `Matx<T, m, n>`,
`std::vector<T>`, `std::vector<std::vector<T> >` or `std::vector<Mat>`. It can also be constructed `std::vector<T>`, `std::vector<std::vector<T> >` or `std::vector<Mat>`. It can also be constructed
@ -185,39 +185,42 @@ public:
_InputArray(const UMat& um); _InputArray(const UMat& um);
_InputArray(const std::vector<UMat>& umv); _InputArray(const std::vector<UMat>& umv);
virtual Mat getMat(int idx=-1) const; Mat getMat(int idx=-1) const;
virtual UMat getUMat(int idx=-1) const; UMat getUMat(int idx=-1) const;
virtual void getMatVector(std::vector<Mat>& mv) const; void getMatVector(std::vector<Mat>& mv) const;
virtual void getUMatVector(std::vector<UMat>& umv) const; void getUMatVector(std::vector<UMat>& umv) const;
virtual cuda::GpuMat getGpuMat() const; cuda::GpuMat getGpuMat() const;
virtual ogl::Buffer getOGlBuffer() const; ogl::Buffer getOGlBuffer() const;
void* getObj() const;
virtual int kind() const; int getFlags() const;
virtual int dims(int i=-1) const; void* getObj() const;
virtual int cols(int i=-1) const; Size getSz() const;
virtual int rows(int i=-1) const;
virtual Size size(int i=-1) const; int kind() const;
virtual int sizend(int* sz, int i=-1) const; int dims(int i=-1) const;
virtual bool sameSize(const _InputArray& arr) const; int cols(int i=-1) const;
virtual size_t total(int i=-1) const; int rows(int i=-1) const;
virtual int type(int i=-1) const; Size size(int i=-1) const;
virtual int depth(int i=-1) const; int sizend(int* sz, int i=-1) const;
virtual int channels(int i=-1) const; bool sameSize(const _InputArray& arr) const;
virtual bool isContinuous(int i=-1) const; size_t total(int i=-1) const;
virtual bool isSubmatrix(int i=-1) const; int type(int i=-1) const;
virtual bool empty() const; int depth(int i=-1) const;
virtual void copyTo(const _OutputArray& arr) const; int channels(int i=-1) const;
virtual void copyTo(const _OutputArray& arr, const _InputArray & mask) const; bool isContinuous(int i=-1) const;
virtual size_t offset(int i=-1) const; bool isSubmatrix(int i=-1) const;
virtual size_t step(int i=-1) const; bool empty() const;
void copyTo(const _OutputArray& arr) const;
void copyTo(const _OutputArray& arr, const _InputArray & mask) const;
size_t offset(int i=-1) const;
size_t step(int i=-1) const;
bool isMat() const; bool isMat() const;
bool isUMat() const; bool isUMat() const;
bool isMatVector() const; bool isMatVector() const;
bool isUMatVector() const; bool isUMatVector() const;
bool isMatx() const; bool isMatx() const;
virtual ~_InputArray(); ~_InputArray();
protected: protected:
int flags; int flags;
@ -303,21 +306,21 @@ public:
_OutputArray(const UMat& m); _OutputArray(const UMat& m);
_OutputArray(const std::vector<UMat>& vec); _OutputArray(const std::vector<UMat>& vec);
virtual bool fixedSize() const; bool fixedSize() const;
virtual bool fixedType() const; bool fixedType() const;
virtual bool needed() const; bool needed() const;
virtual Mat& getMatRef(int i=-1) const; Mat& getMatRef(int i=-1) const;
virtual UMat& getUMatRef(int i=-1) const; UMat& getUMatRef(int i=-1) const;
virtual cuda::GpuMat& getGpuMatRef() const; cuda::GpuMat& getGpuMatRef() const;
virtual ogl::Buffer& getOGlBufferRef() const; ogl::Buffer& getOGlBufferRef() const;
virtual cuda::HostMem& getHostMemRef() const; cuda::HostMem& getHostMemRef() const;
virtual void create(Size sz, int type, int i=-1, bool allowTransposed=false, int fixedDepthMask=0) const; void create(Size sz, int type, int i=-1, bool allowTransposed=false, int fixedDepthMask=0) const;
virtual void create(int rows, int cols, int type, int i=-1, bool allowTransposed=false, int fixedDepthMask=0) const; void create(int rows, int cols, int type, int i=-1, bool allowTransposed=false, int fixedDepthMask=0) const;
virtual void create(int dims, const int* size, int type, int i=-1, bool allowTransposed=false, int fixedDepthMask=0) const; void create(int dims, const int* size, int type, int i=-1, bool allowTransposed=false, int fixedDepthMask=0) const;
virtual void createSameSize(const _InputArray& arr, int mtype) const; void createSameSize(const _InputArray& arr, int mtype) const;
virtual void release() const; void release() const;
virtual void clear() const; void clear() const;
virtual void setTo(const _InputArray& value, const _InputArray & mask = _InputArray()) const; void setTo(const _InputArray& value, const _InputArray & mask = _InputArray()) const;
void assign(const UMat& u) const; void assign(const UMat& u) const;
void assign(const Mat& m) const; void assign(const Mat& m) const;
@ -358,13 +361,15 @@ public:
template<typename _Tp, int m, int n> _InputOutputArray(const Matx<_Tp, m, n>& matx); template<typename _Tp, int m, int n> _InputOutputArray(const Matx<_Tp, m, n>& matx);
_InputOutputArray(const UMat& m); _InputOutputArray(const UMat& m);
_InputOutputArray(const std::vector<UMat>& vec); _InputOutputArray(const std::vector<UMat>& vec);
explicit _InputOutputArray(const _OutputArray& o);
}; };
typedef const _InputArray& InputArray; typedef _InputArray InputArray;
typedef InputArray InputArrayOfArrays; typedef InputArray InputArrayOfArrays;
typedef const _OutputArray& OutputArray; typedef _OutputArray OutputArray;
typedef OutputArray OutputArrayOfArrays; typedef OutputArray OutputArrayOfArrays;
typedef const _InputOutputArray& InputOutputArray; typedef _InputOutputArray InputOutputArray;
typedef InputOutputArray InputOutputArrayOfArrays; typedef InputOutputArray InputOutputArrayOfArrays;
CV_EXPORTS InputOutputArray noArray(); CV_EXPORTS InputOutputArray noArray();

@ -7,11 +7,13 @@
// copy or use the software. // copy or use the software.
// //
// //
// License Agreement // License Agreement
// For Open Source Computer Vision Library // For Open Source Computer Vision Library
// //
// Copyright (C) 2000-2008, Intel Corporation, all rights reserved. // Copyright (C) 2000-2008, Intel Corporation, all rights reserved.
// Copyright (C) 2009, Willow Garage Inc., all rights reserved. // Copyright (C) 2009, Willow Garage Inc., all rights reserved.
// Copyright (C) 2013, OpenCV Foundation, all rights reserved.
// Copyright (C) 2015, Itseez Inc., all rights reserved.
// Third party copyrights are property of their respective owners. // Third party copyrights are property of their respective owners.
// //
// Redistribution and use in source and binary forms, with or without modification, // Redistribution and use in source and binary forms, with or without modification,
@ -61,6 +63,8 @@ inline void _InputArray::init(int _flags, const void* _obj, Size _sz)
{ flags = _flags; obj = (void*)_obj; sz = _sz; } { flags = _flags; obj = (void*)_obj; sz = _sz; }
inline void* _InputArray::getObj() const { return obj; } inline void* _InputArray::getObj() const { return obj; }
inline int _InputArray::getFlags() const { return flags; }
inline Size _InputArray::getSz() const { return sz; }
inline _InputArray::_InputArray() { init(NONE, 0); } inline _InputArray::_InputArray() { init(NONE, 0); }
inline _InputArray::_InputArray(int _flags, void* _obj) { init(_flags, _obj); } inline _InputArray::_InputArray(int _flags, void* _obj) { init(_flags, _obj); }
@ -290,6 +294,9 @@ inline _InputOutputArray::_InputOutputArray(const ogl::Buffer& buf)
inline _InputOutputArray::_InputOutputArray(const cuda::HostMem& cuda_mem) inline _InputOutputArray::_InputOutputArray(const cuda::HostMem& cuda_mem)
{ init(FIXED_TYPE + FIXED_SIZE + CUDA_HOST_MEM + ACCESS_RW, &cuda_mem); } { init(FIXED_TYPE + FIXED_SIZE + CUDA_HOST_MEM + ACCESS_RW, &cuda_mem); }
inline _InputOutputArray::_InputOutputArray(const _OutputArray& o)
{ init(o.getFlags(), o.getObj(), o.getSz()); }
//////////////////////////////////////////// Mat ////////////////////////////////////////// //////////////////////////////////////////// Mat //////////////////////////////////////////
inline inline

@ -12,6 +12,8 @@
// //
// Copyright (C) 2000-2008, Intel Corporation, all rights reserved. // Copyright (C) 2000-2008, Intel Corporation, all rights reserved.
// Copyright (C) 2009, Willow Garage Inc., all rights reserved. // Copyright (C) 2009, Willow Garage Inc., all rights reserved.
// Copyright (C) 2013, OpenCV Foundation, all rights reserved.
// Copyright (C) 2015, Itseez Inc., all rights reserved.
// Third party copyrights are property of their respective owners. // Third party copyrights are property of their respective owners.
// //
// Redistribution and use in source and binary forms, with or without modification, // Redistribution and use in source and binary forms, with or without modification,

@ -10,8 +10,10 @@
// Intel License Agreement // Intel License Agreement
// For Open Source Computer Vision Library // For Open Source Computer Vision Library
// //
// Copyright( C) 2000, Intel Corporation, all rights reserved. // Copyright( C) 2000-2015, Intel Corporation, all rights reserved.
// Copyright (C) 2011-2013, NVIDIA Corporation, all rights reserved. // Copyright (C) 2011-2013, NVIDIA Corporation, all rights reserved.
// Copyright (C) 2013, OpenCV Foundation, all rights reserved.
// Copyright (C) 2015, Itseez Inc., all rights reserved.
// Third party copyrights are property of their respective owners. // Third party copyrights are property of their respective owners.
// //
// Redistribution and use in source and binary forms, with or without modification, // Redistribution and use in source and binary forms, with or without modification,

@ -53,6 +53,20 @@ Algorithm::~Algorithm()
{ {
} }
void Algorithm::save(const String& filename) const
{
FileStorage fs(filename, FileStorage::WRITE);
fs << getDefaultName() << "{";
fs << "format" << (int)3;
write(fs);
fs << "}";
}
String Algorithm::getDefaultName() const
{
return String("my_object");
}
} }
/* End of file. */ /* End of file. */

@ -65,20 +65,20 @@ namespace cv{
}; };
struct CCStatsOp{ struct CCStatsOp{
const _OutputArray* _mstatsv; OutputArray _mstatsv;
cv::Mat statsv; cv::Mat statsv;
const _OutputArray* _mcentroidsv; OutputArray _mcentroidsv;
cv::Mat centroidsv; cv::Mat centroidsv;
std::vector<Point2ui64> integrals; std::vector<Point2ui64> integrals;
CCStatsOp(OutputArray _statsv, OutputArray _centroidsv): _mstatsv(&_statsv), _mcentroidsv(&_centroidsv){ CCStatsOp(OutputArray _statsv, OutputArray _centroidsv): _mstatsv(_statsv), _mcentroidsv(_centroidsv){
} }
inline inline
void init(int nlabels){ void init(int nlabels){
_mstatsv->create(cv::Size(CC_STAT_MAX, nlabels), cv::DataType<int>::type); _mstatsv.create(cv::Size(CC_STAT_MAX, nlabels), cv::DataType<int>::type);
statsv = _mstatsv->getMat(); statsv = _mstatsv.getMat();
_mcentroidsv->create(cv::Size(2, nlabels), cv::DataType<double>::type); _mcentroidsv.create(cv::Size(2, nlabels), cv::DataType<double>::type);
centroidsv = _mcentroidsv->getMat(); centroidsv = _mcentroidsv.getMat();
for(int l = 0; l < (int) nlabels; ++l){ for(int l = 0; l < (int) nlabels; ++l){
int *row = (int *) &statsv.at<int>(l, 0); int *row = (int *) &statsv.at<int>(l, 0);

@ -297,11 +297,12 @@ public:
COMPRESSED_INPUT=2, COMPRESSED_INPUT=2,
PREPROCESSED_INPUT=4 PREPROCESSED_INPUT=4
}; };
CV_WRAP virtual void clear();
/** @brief Returns the number of variables in training samples */ /** @brief Returns the number of variables in training samples */
CV_WRAP virtual int getVarCount() const = 0; CV_WRAP virtual int getVarCount() const = 0;
CV_WRAP virtual bool empty() const;
/** @brief Returns true if the model is trained */ /** @brief Returns true if the model is trained */
CV_WRAP virtual bool isTrained() const = 0; CV_WRAP virtual bool isTrained() const = 0;
/** @brief Returns true if the model is classifier */ /** @brief Returns true if the model is classifier */
@ -347,40 +348,6 @@ public:
*/ */
CV_WRAP virtual float predict( InputArray samples, OutputArray results=noArray(), int flags=0 ) const = 0; CV_WRAP virtual float predict( InputArray samples, OutputArray results=noArray(), int flags=0 ) const = 0;
/** @brief Loads model from the file
This is static template method of StatModel. It's usage is following (in the case of SVM):
@code
Ptr<SVM> svm = StatModel::load<SVM>("my_svm_model.xml");
@endcode
In order to make this method work, the derived class must overwrite Algorithm::read(const
FileNode& fn).
*/
template<typename _Tp> static Ptr<_Tp> load(const String& filename)
{
FileStorage fs(filename, FileStorage::READ);
Ptr<_Tp> model = _Tp::create();
model->read(fs.getFirstTopLevelNode());
return model->isTrained() ? model : Ptr<_Tp>();
}
/** @brief Loads model from a String
@param strModel The string variable containing the model you want to load.
This is static template method of StatModel. It's usage is following (in the case of SVM):
@code
Ptr<SVM> svm = StatModel::loadFromString<SVM>(myStringModel);
@endcode
*/
template<typename _Tp> static Ptr<_Tp> loadFromString(const String& strModel)
{
FileStorage fs(strModel, FileStorage::READ + FileStorage::MEMORY);
Ptr<_Tp> model = _Tp::create();
model->read(fs.getFirstTopLevelNode());
return model->isTrained() ? model : Ptr<_Tp>();
}
/** @brief Create and train model with default parameters /** @brief Create and train model with default parameters
The class must implement static `create()` method with no parameters or with all default parameter values The class must implement static `create()` method with no parameters or with all default parameter values
@ -390,14 +357,6 @@ public:
Ptr<_Tp> model = _Tp::create(); Ptr<_Tp> model = _Tp::create();
return !model.empty() && model->train(data, flags) ? model : Ptr<_Tp>(); return !model.empty() && model->train(data, flags) ? model : Ptr<_Tp>();
} }
/** Saves the model to a file.
In order to make this method work, the derived class must implement Algorithm::write(FileStorage& fs). */
CV_WRAP virtual void save(const String& filename) const;
/** Returns model string identifier.
This string is used as top level xml/yml node tag when model is saved to a file or string. */
CV_WRAP virtual String getDefaultModelName() const = 0;
}; };
/****************************************************************************************\ /****************************************************************************************\
@ -939,7 +898,7 @@ public:
/** Creates empty %EM model. /** Creates empty %EM model.
The model should be trained then using StatModel::train(traindata, flags) method. Alternatively, you The model should be trained then using StatModel::train(traindata, flags) method. Alternatively, you
can use one of the EM::train\* methods or load it from file using StatModel::load\<EM\>(filename). can use one of the EM::train\* methods or load it from file using Algorithm::load\<EM\>(filename).
*/ */
CV_WRAP static Ptr<EM> create(); CV_WRAP static Ptr<EM> create();
}; };
@ -1127,7 +1086,7 @@ public:
The static method creates empty decision tree with the specified parameters. It should be then The static method creates empty decision tree with the specified parameters. It should be then
trained using train method (see StatModel::train). Alternatively, you can load the model from trained using train method (see StatModel::train). Alternatively, you can load the model from
file using StatModel::load\<DTrees\>(filename). file using Algorithm::load\<DTrees\>(filename).
*/ */
CV_WRAP static Ptr<DTrees> create(); CV_WRAP static Ptr<DTrees> create();
}; };
@ -1181,7 +1140,7 @@ public:
/** Creates the empty model. /** Creates the empty model.
Use StatModel::train to train the model, StatModel::train to create and train the model, Use StatModel::train to train the model, StatModel::train to create and train the model,
StatModel::load to load the pre-trained model. Algorithm::load to load the pre-trained model.
*/ */
CV_WRAP static Ptr<RTrees> create(); CV_WRAP static Ptr<RTrees> create();
}; };
@ -1231,7 +1190,7 @@ public:
}; };
/** Creates the empty model. /** Creates the empty model.
Use StatModel::train to train the model, StatModel::load\<Boost\>(filename) to load the pre-trained model. */ Use StatModel::train to train the model, Algorithm::load\<Boost\>(filename) to load the pre-trained model. */
CV_WRAP static Ptr<Boost> create(); CV_WRAP static Ptr<Boost> create();
}; };
@ -1416,7 +1375,7 @@ public:
/** @brief Creates empty model /** @brief Creates empty model
Use StatModel::train to train the model, StatModel::load\<ANN_MLP\>(filename) to load the pre-trained model. Use StatModel::train to train the model, Algorithm::load\<ANN_MLP\>(filename) to load the pre-trained model.
Note that the train method has optional flags: ANN_MLP::TrainFlags. Note that the train method has optional flags: ANN_MLP::TrainFlags.
*/ */
static Ptr<ANN_MLP> create(); static Ptr<ANN_MLP> create();

@ -1294,7 +1294,7 @@ public:
return layer_sizes.empty() ? 0 : layer_sizes[0]; return layer_sizes.empty() ? 0 : layer_sizes[0];
} }
String getDefaultModelName() const String getDefaultName() const
{ {
return "opencv_ml_ann_mlp"; return "opencv_ml_ann_mlp";
} }

@ -465,7 +465,7 @@ public:
CV_WRAP_SAME_PROPERTY(float, RegressionAccuracy, impl.params) CV_WRAP_SAME_PROPERTY(float, RegressionAccuracy, impl.params)
CV_WRAP_SAME_PROPERTY_S(cv::Mat, Priors, impl.params) CV_WRAP_SAME_PROPERTY_S(cv::Mat, Priors, impl.params)
String getDefaultModelName() const { return "opencv_ml_boost"; } String getDefaultName() const { return "opencv_ml_boost"; }
bool train( const Ptr<TrainData>& trainData, int flags ) bool train( const Ptr<TrainData>& trainData, int flags )
{ {

@ -227,7 +227,7 @@ public:
return means.cols; return means.cols;
} }
String getDefaultModelName() const String getDefaultName() const
{ {
return "opencv_ml_em"; return "opencv_ml_em";
} }

@ -50,7 +50,7 @@ ParamGrid::ParamGrid(double _minVal, double _maxVal, double _logStep)
logStep = std::max(_logStep, 1.); logStep = std::max(_logStep, 1.);
} }
void StatModel::clear() {} bool StatModel::empty() const { return !isTrained(); }
int StatModel::getVarCount() const { return 0; } int StatModel::getVarCount() const { return 0; }
@ -111,15 +111,6 @@ float StatModel::calcError( const Ptr<TrainData>& data, bool testerr, OutputArra
return (float)(err / n * (isclassifier ? 100 : 1)); return (float)(err / n * (isclassifier ? 100 : 1));
} }
void StatModel::save(const String& filename) const
{
FileStorage fs(filename, FileStorage::WRITE);
fs << getDefaultModelName() << "{";
fs << "format" << (int)3;
write(fs);
fs << "}";
}
/* Calculates upper triangular matrix S, where A is a symmetrical matrix A=S'*S */ /* Calculates upper triangular matrix S, where A is a symmetrical matrix A=S'*S */
static void Cholesky( const Mat& A, Mat& S ) static void Cholesky( const Mat& A, Mat& S )
{ {

@ -496,7 +496,7 @@ public:
return impl->train(data, flags); return impl->train(data, flags);
} }
String getDefaultModelName() const { return impl->getModelName(); } String getDefaultName() const { return impl->getModelName(); }
protected: protected:
void initImpl(int algorithmType) void initImpl(int algorithmType)

@ -104,7 +104,7 @@ public:
virtual int getVarCount() const { return learnt_thetas.cols; } virtual int getVarCount() const { return learnt_thetas.cols; }
virtual bool isTrained() const { return !learnt_thetas.empty(); } virtual bool isTrained() const { return !learnt_thetas.empty(); }
virtual bool isClassifier() const { return true; } virtual bool isClassifier() const { return true; }
virtual String getDefaultModelName() const { return "opencv_ml_lr"; } virtual String getDefaultName() const { return "opencv_ml_lr"; }
protected: protected:
Mat calc_sigmoid(const Mat& data) const; Mat calc_sigmoid(const Mat& data) const;
double compute_cost(const Mat& _data, const Mat& _labels, const Mat& _init_theta); double compute_cost(const Mat& _data, const Mat& _labels, const Mat& _init_theta);

@ -443,7 +443,7 @@ public:
bool isTrained() const { return !avg.empty(); } bool isTrained() const { return !avg.empty(); }
bool isClassifier() const { return true; } bool isClassifier() const { return true; }
int getVarCount() const { return nallvars; } int getVarCount() const { return nallvars; }
String getDefaultModelName() const { return "opencv_ml_nbayes"; } String getDefaultName() const { return "opencv_ml_nbayes"; }
int nallvars; int nallvars;
Mat var_idx, cls_labels, c; Mat var_idx, cls_labels, c;

@ -290,7 +290,7 @@ namespace ml
virtual ~DTreesImpl(); virtual ~DTreesImpl();
virtual void clear(); virtual void clear();
String getDefaultModelName() const { return "opencv_ml_dtree"; } String getDefaultName() const { return "opencv_ml_dtree"; }
bool isTrained() const { return !roots.empty(); } bool isTrained() const { return !roots.empty(); }
bool isClassifier() const { return _isClassifier; } bool isClassifier() const { return _isClassifier; }
int getVarCount() const { return varType.empty() ? 0 : (int)(varType.size() - 1); } int getVarCount() const { return varType.empty() ? 0 : (int)(varType.size() - 1); }

@ -375,7 +375,7 @@ public:
RTreesImpl() {} RTreesImpl() {}
virtual ~RTreesImpl() {} virtual ~RTreesImpl() {}
String getDefaultModelName() const { return "opencv_ml_rtrees"; } String getDefaultName() const { return "opencv_ml_rtrees"; }
bool train( const Ptr<TrainData>& trainData, int flags ) bool train( const Ptr<TrainData>& trainData, int flags )
{ {

@ -2008,7 +2008,7 @@ public:
return var_count; return var_count;
} }
String getDefaultModelName() const String getDefaultName() const
{ {
return "opencv_ml_svm"; return "opencv_ml_svm";
} }

@ -576,7 +576,7 @@ protected:
// Read in // Read in
try try
{ {
em = StatModel::load<EM>(filename); em = Algorithm::load<EM>(filename);
} }
catch(...) catch(...)
{ {

@ -179,7 +179,7 @@ void CV_LRTest_SaveLoad::run( int /*start_from*/ )
// and load to another // and load to another
try try
{ {
Ptr<LogisticRegression> lr2 = StatModel::load<LogisticRegression>(filename); Ptr<LogisticRegression> lr2 = Algorithm::load<LogisticRegression>(filename);
lr2->predict(tdata->getSamples(), responses2); lr2->predict(tdata->getSamples(), responses2);
learnt_mat2 = lr2->get_learnt_thetas(); learnt_mat2 = lr2->get_learnt_thetas();
} }

@ -472,19 +472,19 @@ void CV_MLBaseTest::save( const char* filename )
void CV_MLBaseTest::load( const char* filename ) void CV_MLBaseTest::load( const char* filename )
{ {
if( modelName == CV_NBAYES ) if( modelName == CV_NBAYES )
model = StatModel::load<NormalBayesClassifier>( filename ); model = Algorithm::load<NormalBayesClassifier>( filename );
else if( modelName == CV_KNEAREST ) else if( modelName == CV_KNEAREST )
model = StatModel::load<KNearest>( filename ); model = Algorithm::load<KNearest>( filename );
else if( modelName == CV_SVM ) else if( modelName == CV_SVM )
model = StatModel::load<SVM>( filename ); model = Algorithm::load<SVM>( filename );
else if( modelName == CV_ANN ) else if( modelName == CV_ANN )
model = StatModel::load<ANN_MLP>( filename ); model = Algorithm::load<ANN_MLP>( filename );
else if( modelName == CV_DTREE ) else if( modelName == CV_DTREE )
model = StatModel::load<DTrees>( filename ); model = Algorithm::load<DTrees>( filename );
else if( modelName == CV_BOOST ) else if( modelName == CV_BOOST )
model = StatModel::load<Boost>( filename ); model = Algorithm::load<Boost>( filename );
else if( modelName == CV_RTREES ) else if( modelName == CV_RTREES )
model = StatModel::load<RTrees>( filename ); model = Algorithm::load<RTrees>( filename );
else else
CV_Error( CV_StsNotImplemented, "invalid stat model name"); CV_Error( CV_StsNotImplemented, "invalid stat model name");
} }

@ -190,17 +190,17 @@ protected:
bool isTree = modelName == CV_BOOST || modelName == CV_DTREE || modelName == CV_RTREES; bool isTree = modelName == CV_BOOST || modelName == CV_DTREE || modelName == CV_RTREES;
Ptr<StatModel> model; Ptr<StatModel> model;
if (modelName == CV_BOOST) if (modelName == CV_BOOST)
model = StatModel::load<Boost>(filename); model = Algorithm::load<Boost>(filename);
else if (modelName == CV_ANN) else if (modelName == CV_ANN)
model = StatModel::load<ANN_MLP>(filename); model = Algorithm::load<ANN_MLP>(filename);
else if (modelName == CV_DTREE) else if (modelName == CV_DTREE)
model = StatModel::load<DTrees>(filename); model = Algorithm::load<DTrees>(filename);
else if (modelName == CV_NBAYES) else if (modelName == CV_NBAYES)
model = StatModel::load<NormalBayesClassifier>(filename); model = Algorithm::load<NormalBayesClassifier>(filename);
else if (modelName == CV_SVM) else if (modelName == CV_SVM)
model = StatModel::load<SVM>(filename); model = Algorithm::load<SVM>(filename);
else if (modelName == CV_RTREES) else if (modelName == CV_RTREES)
model = StatModel::load<RTrees>(filename); model = Algorithm::load<RTrees>(filename);
if (!model) if (!model)
{ {
code = cvtest::TS::FAIL_INVALID_TEST_DATA; code = cvtest::TS::FAIL_INVALID_TEST_DATA;
@ -273,11 +273,11 @@ TEST(DISABLED_ML_SVM, linear_save_load)
{ {
Ptr<cv::ml::SVM> svm1, svm2, svm3; Ptr<cv::ml::SVM> svm1, svm2, svm3;
svm1 = StatModel::load<SVM>("SVM45_X_38-1.xml"); svm1 = Algorithm::load<SVM>("SVM45_X_38-1.xml");
svm2 = StatModel::load<SVM>("SVM45_X_38-2.xml"); svm2 = Algorithm::load<SVM>("SVM45_X_38-2.xml");
string tname = tempfile("a.xml"); string tname = tempfile("a.xml");
svm2->save(tname); svm2->save(tname);
svm3 = StatModel::load<SVM>(tname); svm3 = Algorithm::load<SVM>(tname);
ASSERT_EQ(svm1->getVarCount(), svm2->getVarCount()); ASSERT_EQ(svm1->getVarCount(), svm2->getVarCount());
ASSERT_EQ(svm1->getVarCount(), svm3->getVarCount()); ASSERT_EQ(svm1->getVarCount(), svm3->getVarCount());

@ -106,6 +106,8 @@ protected:
class CV_EXPORTS VoronoiSeamFinder : public PairwiseSeamFinder class CV_EXPORTS VoronoiSeamFinder : public PairwiseSeamFinder
{ {
public: public:
virtual void find(const std::vector<UMat> &src, const std::vector<Point> &corners,
std::vector<UMat> &masks);
virtual void find(const std::vector<Size> &size, const std::vector<Point> &corners, virtual void find(const std::vector<Size> &size, const std::vector<Point> &corners,
std::vector<UMat> &masks); std::vector<UMat> &masks);
private: private:

@ -186,14 +186,18 @@ public:
*/ */
PlaneWarper(float scale = 1.f) { projector_.scale = scale; } PlaneWarper(float scale = 1.f) { projector_.scale = scale; }
Point2f warpPoint(const Point2f &pt, InputArray K, InputArray R);
Point2f warpPoint(const Point2f &pt, InputArray K, InputArray R, InputArray T); Point2f warpPoint(const Point2f &pt, InputArray K, InputArray R, InputArray T);
virtual Rect buildMaps(Size src_size, InputArray K, InputArray R, InputArray T, OutputArray xmap, OutputArray ymap); virtual Rect buildMaps(Size src_size, InputArray K, InputArray R, InputArray T, OutputArray xmap, OutputArray ymap);
Rect buildMaps(Size src_size, InputArray K, InputArray R, OutputArray xmap, OutputArray ymap); Rect buildMaps(Size src_size, InputArray K, InputArray R, OutputArray xmap, OutputArray ymap);
Point warp(InputArray src, InputArray K, InputArray R,
int interp_mode, int border_mode, OutputArray dst);
virtual Point warp(InputArray src, InputArray K, InputArray R, InputArray T, int interp_mode, int border_mode, virtual Point warp(InputArray src, InputArray K, InputArray R, InputArray T, int interp_mode, int border_mode,
OutputArray dst); OutputArray dst);
Rect warpRoi(Size src_size, InputArray K, InputArray R);
Rect warpRoi(Size src_size, InputArray K, InputArray R, InputArray T); Rect warpRoi(Size src_size, InputArray K, InputArray R, InputArray T);
protected: protected:

@ -82,6 +82,11 @@ void PairwiseSeamFinder::run()
} }
} }
void VoronoiSeamFinder::find(const std::vector<UMat> &src, const std::vector<Point> &corners,
std::vector<UMat> &masks)
{
PairwiseSeamFinder::find(src, corners, masks);
}
void VoronoiSeamFinder::find(const std::vector<Size> &sizes, const std::vector<Point> &corners, void VoronoiSeamFinder::find(const std::vector<Size> &sizes, const std::vector<Point> &corners,
std::vector<UMat> &masks) std::vector<UMat> &masks)

@ -87,6 +87,13 @@ Point2f PlaneWarper::warpPoint(const Point2f &pt, InputArray K, InputArray R, In
return uv; return uv;
} }
Point2f PlaneWarper::warpPoint(const Point2f &pt, InputArray K, InputArray R)
{
float tz[] = {0.f, 0.f, 0.f};
Mat_<float> T(3, 1, tz);
return warpPoint(pt, K, R, T);
}
Rect PlaneWarper::buildMaps(Size src_size, InputArray K, InputArray R, OutputArray xmap, OutputArray ymap) Rect PlaneWarper::buildMaps(Size src_size, InputArray K, InputArray R, OutputArray xmap, OutputArray ymap)
{ {
return buildMaps(src_size, K, R, Mat::zeros(3, 1, CV_32FC1), xmap, ymap); return buildMaps(src_size, K, R, Mat::zeros(3, 1, CV_32FC1), xmap, ymap);
@ -155,6 +162,13 @@ Point PlaneWarper::warp(InputArray src, InputArray K, InputArray R, InputArray T
return dst_roi.tl(); return dst_roi.tl();
} }
Point PlaneWarper::warp(InputArray src, InputArray K, InputArray R,
int interp_mode, int border_mode, OutputArray dst)
{
float tz[] = {0.f, 0.f, 0.f};
Mat_<float> T(3, 1, tz);
return warp(src, K, R, T, interp_mode, border_mode, dst);
}
Rect PlaneWarper::warpRoi(Size src_size, InputArray K, InputArray R, InputArray T) Rect PlaneWarper::warpRoi(Size src_size, InputArray K, InputArray R, InputArray T)
{ {
@ -166,6 +180,13 @@ Rect PlaneWarper::warpRoi(Size src_size, InputArray K, InputArray R, InputArray
return Rect(dst_tl, Point(dst_br.x + 1, dst_br.y + 1)); return Rect(dst_tl, Point(dst_br.x + 1, dst_br.y + 1));
} }
Rect PlaneWarper::warpRoi(Size src_size, InputArray K, InputArray R)
{
float tz[] = {0.f, 0.f, 0.f};
Mat_<float> T(3, 1, tz);
return warpRoi(src_size, K, R, T);
}
void PlaneWarper::detectResultRoi(Size src_size, Point &dst_tl, Point &dst_br) void PlaneWarper::detectResultRoi(Size src_size, Point &dst_tl, Point &dst_br)
{ {

@ -224,7 +224,7 @@ namespace
void Farneback::impl(InputArray input0, InputArray input1, OutputArray dst) void Farneback::impl(InputArray input0, InputArray input1, OutputArray dst)
{ {
calcOpticalFlowFarneback(input0, input1, (InputOutputArray)dst, pyrScale_, calcOpticalFlowFarneback(input0, input1, InputOutputArray(dst), pyrScale_,
numLevels_, winSize_, numIters_, numLevels_, winSize_, numIters_,
polyN_, polySigma_, flags_); polyN_, polySigma_, flags_);
} }

Loading…
Cancel
Save