#include <iostream>
#include <opencv2/opencv.hpp>
#include <vector>
using namespace std;
using namespace cv;
int main()
{
cout << "Hello World!\n";
VideoCapture cap("Angel.mp4");
vector<Mat> ims;
int i = 0;
while (1)
{
Mat im;
cap >> im;
if (!im.data) break;
// cout << im.size() << endl;
resize(im, im, im.size() / 2);
ims.push_back(im);
applyColorMap(im, im, COLORMAP_CIVIDIS);
imshow("video", im);
imwrite("test" + to_string(i) + ".png", im);
i++;
waitKey(1);
}
for (int i = ims.size() - 1; i >= 0; i--) {
applyColorMap(ims[i], ims[i], COLORMAP_TWILIGHT_SHIFTED);
imshow("video", ims[i]);
imwrite("test_" + to_string(i) + ".png", ims[i]);
waitKey(1);
}
destroyAllWindows();
cap.release();
return 0;
}
herrDeng網內搜尋
自訂搜尋
Ads
2023年4月14日 星期五
C++ opencv videoCapture loop vector練習與動畫
訂閱:
張貼留言 (Atom)
熱門文章
-
url="https://www.twse.com.tw/exchangeReport/STOCK_DAY?response=json&date=20220330&stockNo=2330"
-
連續複利
-
py3 cpp Line sweep解Leetcode 3346 Maximum Frequency of an Element After Performing Operations I 使用 line sweep不用排序,可得線性解 [Py3解請進]
-
C++ py3 C Rust adjacent difference與loop速解Leetcode 1526 Minimum Number of Increments on Subarrays to Form a Target Array [Py3一行解請進]
-
Py3 C++導出遞迴公式解難題Leetcode1611 Minimum One Bit Operations to Make Integers Zero從導出公式到寫出code,一次完成解Leetcode難題 [C++一行解請進]
-
int a[]={21, 23, 57, 13 ,17, 6}; float average; average=?
-
C++ Py3 Euclidean Algorithm解Leetcode 2169 Count Operations to Obtain Zero [Py3一行解請進]
沒有留言:
張貼留言