#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"
-
連續複利
-
請用Random產生20個0~99的奇數(可重複),然後排序
-
py3 cpp Line sweep解Leetcode 3346 Maximum Frequency of an Element After Performing Operations I 使用 line sweep不用排序,可得線性解 [Py3解請進]
-
C++ Py3 計數排序與partial sum解Leetcode 2300 Successful Pairs of Spells and Potions Portions的極大值小於等於10萬是可進行記數排序的關鍵,既然可以採用記數排序,後面的二元搜尋也可以透過part...
-
Py3 C++ C 2pointer速解Leetcode 11Container With Most Water [Py3 code請進]
-
Py3 C++計數bitmask與2 pointers速解Leetcode2273 Find Resultant Array After Removing Anagrams 字串長度最長也只有10,四個bits一組,用bitmask解題 ----- The maximum le...
-
輸入公元n年,輸出"平年" "閏年"
沒有留言:
張貼留言