我嘗試將 RGBA 影像轉換為 RGB 影像（每個通道 8 位無符號整數）。起初我使用 OpenCV 和以下功能
m_bufferMat.data = (uchar*) (ptr1);
m_bufferMat.convertTo(m_bufferMat, CV_8UC3);
但是對于應用程式的其他部分，我不需要使用 OpenCV，所以我嘗試自己轉換影像，因此我不需要鏈接和包含 OpenCV 庫。我能想象到的最快方法是遍歷緩沖區并將前 3 個位元組復制到另一個緩沖區，如下所示：
for(int i = 0; i < width * height; i ) {
*(ptr2 ) = *(ptr1 );
*(ptr2 ) = *(ptr1 );
*(ptr2 ) = *(ptr1 );
ptr1 ;
}
但為此我需要復制這可能不是很快。OpenCV 函式比我自己的函式快 1.5 倍。有人知道為什么嗎？我可以實作一個不需要復制的功能嗎？
uj5u.com熱心網友回復：
有很多優化可以做。這是一個測驗平臺程式來嘗試它們以及一些示例優化：
#include <iostream>
#include <string>
#include <vector>
#include <intrin.h>
#include <functional>
volatile int width = 1920;
volatile int height = 1080;
unsigned char* src = new unsigned char[width * height * 4];
unsigned char* dst = new unsigned char[width * height * 3];
unsigned char* refDst = new unsigned char[width * height * 3];
void DefaultFunc() {
auto ptr1 = src;
auto ptr2 = dst;
for (int i = 0; i < width * height; i ) {
*(ptr2 ) = *(ptr1 );
*(ptr2 ) = *(ptr1 );
*(ptr2 ) = *(ptr1 );
ptr1 ;
}
}
void NPreCalculatedFunc() {
auto ptr1 = src;
auto ptr2 = dst;
auto n = width * height;
for (int i = 0; i < n; i ) {
*(ptr2 ) = *(ptr1 );
*(ptr2 ) = *(ptr1 );
*(ptr2 ) = *(ptr1 );
ptr1 ;
}
}
void ReadFullPixelFunc() {
unsigned int* ptr1 = (unsigned int*)src;
auto ptr2 = dst;
auto n = width * height;
for (int i = 0; i < n; i ) {
auto srcPix = *(ptr1 );
*(ptr2 ) = srcPix & 0xff;
*(ptr2 ) = (srcPix >> 8) & 0xff;
*(ptr2 ) = (srcPix >> 16) & 0xff;
}
}
void ReadAndWriteFullPixelFunc() {
unsigned int* ptr1 = (unsigned int*)src;
unsigned int* ptr2 = (unsigned int*)dst;
auto n = width * height / 4;
unsigned int writeBuf = 0;
for (int i = n; i; i--) {
// by reading 4 pixels, we get to store 3 unsigned ints
auto srcPix = *(ptr1 );
writeBuf = srcPix & 0x00ffffff;
srcPix = *(ptr1 );
writeBuf |= srcPix << 24;
*(ptr2 ) = writeBuf;
writeBuf = (srcPix >> 8) & 0xffff;
srcPix = *(ptr1 );
writeBuf |= (srcPix << 16);
*(ptr2 ) = writeBuf;
writeBuf = (srcPix >> 16) & 0xff;
srcPix = *(ptr1 );
writeBuf |= (srcPix << 8);
*(ptr2 ) = writeBuf;
}
// todo: if width * height is not divisible by 4, process the last max 3 pixels here with the unoptimized loop
}
void ReadAndWriteFullPixelXmmFunc() {
unsigned int* ptr1 = (unsigned int*)src;
unsigned int* ptr2 = (unsigned int*)dst;
auto n = width * height / 4;
unsigned int writeBuf = 0;
__m128i reorder = _mm_set_epi8(0x80, 0x80, 0x80, 0x80, 14, 13, 12, 10, 9, 8, 6, 5, 4, 2, 1, 0);
for (int i = n; i; i--) {
auto srcPix4_ro = _mm_shuffle_epi8(_mm_loadu_si128((__m128i*)ptr1), reorder); // read 4 source pixels, remove alpha bytes, pack to low 12 bytes of srcPix4
ptr1 = 4;
_mm_storel_epi64((__m128i*)ptr2, srcPix4_ro); // store 2 first pixels
ptr2 = 2;
auto shifted = _mm_bsrli_si128(srcPix4_ro, 8);
_mm_storeu_si32(ptr2, shifted); // store 3rd pixel
ptr2 = 1;
}
// todo: if width * height is not divisible by 4, process the last max 3 pixels here with the unoptimized loop
}
unsigned long long PrintShortestTime(std::function<void()> f, const char *label, unsigned long long refTime) {
unsigned long long minTicks = ~0ull;
memset(dst, 0, width * height * 3);
for (int i = 0; i < 500; i ) {
auto start = __rdtsc();
f();
auto end = __rdtsc();
auto duration = end - start;
if (duration < minTicks) {
minTicks = duration;
}
}
if (memcmp(refDst, dst, width * height * 3)) { // test that we got the right answer
printf("Fail - result does not equal refrence!\n");
}
printf("%s : %llu clock cycles - %0.3lf x base implementation time\n", label, minTicks, refTime ? ((double)minTicks/(double)refTime):1.0);
return minTicks;
}
int main() {
for (int i = 0; i < width * height * 4; i ) {
src[i] = rand() & 0xff;
}
DefaultFunc();
memcpy(refDst, dst, width * height * 3);
auto refTime = PrintShortestTime(DefaultFunc, "default, unoptimized", 0);
PrintShortestTime(NPreCalculatedFunc, "n precalculated", refTime);
PrintShortestTime(ReadFullPixelFunc, "n precalculated, reading 1 pixel at a time", refTime);
PrintShortestTime(ReadAndWriteFullPixelFunc, "reading and writing ints at a time", refTime);
PrintShortestTime(ReadAndWriteFullPixelXmmFunc, "with xmm intrinsincs", refTime);
}
對我來說，在 Visual Studio & x64 或 x86 上，最后一個版本的時間大約是基本版本的 0.4 倍：
default, unoptimized : 7511848 clock cycles - 1.000 x base implementation time
n precalculated : 7383696 clock cycles - 0.983 x base implementation time
n precalculated, reading 1 pixel at a time : 7354644 clock cycles - 0.979 x base implementation time
reading and writing ints at a time : 4613816 clock cycles - 0.614 x base implementation time
with xmm intrinsincs : 3036824 clock cycles - 0.404 x base implementation time
通過展開回圈，以更大的塊寫入記憶體，可能可以進一步優化。
轉載請註明出處，本文鏈接：https://www.uj5u.com/net/348695.html