大家好，又见面了，我是你们的朋友全栈君。如果您正在找激活码,请点击查看最新教程,关注关注公众号 “全栈程序员社区” 获取激活教程,可能之前旧版本教程已经失效.最新Idea2022.1教程亲测有效,一键激活。
Jetbrains全系列IDE使用 1年只要46元 售后保障 童叟无欺
typedef unsigned char UINT8;
typedef unsigned int UINT32;
static UINT8 RTable[256][256];
static UINT8 GTable[256][256][256];
static UINT8 BTable[256][256];
static void NV12_T_RGB_Table()
{
int y, u, v, res;
for (y = 0; y <= 255; y++)
for (v = 0; v <= 255; v++)
{
res = y + 1.402 * (v - 128); //r
if (res > 255) res = 255;
if (res < 0) res = 0;
RTable[y][v] = res;
}
for(y = 0; y <= 255; y++)
for(u = 0; u <= 255; u++)
for (v = 0; v <= 255; v++)
{
res = y - 0.34414 *(u - 128) - 0.71414 * (v - 128); //g
if (res > 255) res = 255;
if (res < 0) res = 0;
GTable[y][u][v] = res;
}
for(y = 0; y <= 255; y++)
for (u = 0; u <= 255; u++)
{
res = y + 1.772 * (u - 128); //b
if (res > 255) res = 255;
if (res < 0) res = 0;
BTable[y][u] = res;
}
}
static void NV12_T_BGR(unsigned int width, unsigned int height, unsigned char *yuyv, unsigned char *rgb)
{
const int nv_start = width * height;
UINT32 i, j, index = 0, rgb_index = 0;
UINT8 y, u, v;
int r, g, b, nv_index = 0;
for (i = 0; i < height; i++)
{
for (j = 0; j < width; j++) {
//nv_index = (rgb_index / 2 - width / 2 * ((i + 1) / 2)) * 2;
nv_index = (i >> 1) * width + j - j % 2;
y = yuyv[rgb_index];
u = yuyv[nv_start + nv_index];
v = yuyv[nv_start + nv_index + 1];
r = RTable[y][v];
g = GTable[y][u][v];
b = BTable[y][u];
//index = rgb_index % width + (height - i - 1) * width;
index = rgb_index % width + i * width;
rgb[index * 3 + 0] = b;
rgb[index * 3 + 1] = g;
rgb[index * 3 + 2] = r;
rgb_index++;
}
}
}
static void NV12_T_RGB(unsigned int width, unsigned int height, unsigned char *yuyv, unsigned char *rgb)
{
const int nv_start = width * height;
UINT32 i, j, index = 0, rgb_index = 0;
UINT8 y, u, v;
int r, g, b, nv_index = 0;
for (i = 0; i < height; i++)
{
for (j = 0; j < width; j++) {
//nv_index = (rgb_index / 2 - width / 2 * ((i + 1) / 2)) * 2;
nv_index = (i >> 1) * width + j - j % 2;
y = yuyv[rgb_index];
u = yuyv[nv_start + nv_index];
v = yuyv[nv_start + nv_index + 1];
r = RTable[y][v];
g = GTable[y][u][v];
b = BTable[y][u];
//index = rgb_index % width + (height - i - 1) * width;
index = rgb_index % width + i * width;
rgb[index * 3 + 0] = r;
rgb[index * 3 + 1] = g;
rgb[index * 3 + 2] = b;
rgb_index++;
}
}
}
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请联系我们举报，一经查实，本站将立刻删除。
发布者：全栈程序员-站长，转载请注明出处：https://javaforall.net/194090.html原文链接：https://javaforall.net
