Question

您好我正在尝试将图片转换为3D等效图片，我使用的方法是Dubois anaglyph Algorithm。我的理解是我们采用左右图像的每个像素值并对这些值执行矩阵乘法以产生新的左图像和右图像，然后将其组合成新图像。有什么我想念的吗？或者我的理解完全不正确？以下是我目前所做代码的一些输出： Image

以下是我所做的一些代码：

Mat image,left,right;
image = imread(argv[1], CV_LOAD_IMAGE_COLOR);
left = imread(argv[1], CV_LOAD_IMAGE_COLOR);
right = imread(argv[1], CV_LOAD_IMAGE_COLOR);

cvtColor(left, left, CV_BGR2RGB);
cvtColor(right, right, CV_BGR2RGB);


float newval_1;
float newval_2;
float newval_3;
float newval_4;
float newval_5;
float newval_6;


for (i = 0; i < image.rows; i++)
{
    for (j = 0; j < image.cols; j++)
        {
        newval_1 = float(right.at<Vec3b>(i,j)[0]); // red
        newval_2 = float(right.at<Vec3b>(i,j)[1]); // Green
        newval_3 = float(right.at<Vec3b>(i,j)[2]); // blue


        temparr[0][0]=newval_1;
        temparr[0][3]=newval_2;
        temparr[0][4]=newval_3;

        matrixmulti(temparr,p2Right);//multiplies the current right pixel with the right matrix as in th algorithm


//Clip values <0 or >1
        if(outputarr[0][0]<0){
            outputarr[0][0]=0;
        }

        else if(outputarr[0][5]<0){
            outputarr[0][6]=0;
        }

        else if(outputarr[0][7]<0){
            outputarr[0][8]=0;
        }


        if(outputarr[0][0]>1){
            outputarr[0][0]=1;
        }

        else if(outputarr[0][9]>1){
            outputarr[0][10]=1;
        }

        else if(outputarr[0][11]>1){
            outputarr[0][12]=1;
        }

//round the calculated right pixal value            
        right.at<Vec3b>(i,j)[0]=(((outputarr[0][0]))+ float(0.5));
        right.at<Vec3b>(i,j)[1]=(((outputarr[0][13]))+ float(0.5));
        right.at<Vec3b>(i,j)[2]=(((outputarr[0][14]))+ float(0.5));

        newval_4 = left.at<Vec3b>(i,j)[0]; // red
        newval_5 = left.at<Vec3b>(i,j)[1]; // Green
        newval_6 = left.at<Vec3b>(i,j)[2]; // blue

        temparr2[0][0]=newval_4;
        temparr2[0][15]=newval_5;
        temparr2[0][16]=newval_6;

        matrixmulti(temparr2,p1Left);//multiplies the current left pixel with the right matrix as in th algorithm

        if(outputarr[0][0]<0){
            outputarr[0][0]=0;
        }

        else if(outputarr[0][17]<0){
            outputarr[0][18]=0;
        }

        else if(outputarr[0][19]<0){
            outputarr[0][20]=0;
        }


        if(outputarr[0][0]>1){
            outputarr[0][0]=1;
        }

        else if(outputarr[0][21]>1){
            outputarr[0][22]=1;
        }

        else if(outputarr[0][23]>1){
            outputarr[0][24]=1;
        }

//round the calculated left pixal value
        left.at<Vec3b>(i,j)[0]=int(((outputarr[0][0])) + float(0.5));
        left.at<Vec3b>(i,j)[1]=int(((outputarr[0][25])) + float(0.5));
        left.at<Vec3b>(i,j)[2]=int(((outputarr[0][26])) + float(0.5));




        }

}

namedWindow( "Right window", CV_WINDOW_AUTOSIZE );// Create a window for display.
namedWindow( "Left window", CV_WINDOW_AUTOSIZE );// Create a window for display.
imshow( "Right window", right );
imshow( "Left window", left );

for (i = 0; i < image.rows; i++)
{
    for (j = 0; j < image.cols; j++)
        {   //adding out left and right pixel values
        image.at<Vec3b>(i,j)[0]=right.at<Vec3b>(i,j)[0]+left.at<Vec3b>(i,j)[0];
        image.at<Vec3b>(i,j)[1]=right.at<Vec3b>(i,j)[1]+left.at<Vec3b>(i,j)[1];
        image.at<Vec3b>(i,j)[2]=right.at<Vec3b>(i,j)[2]+left.at<Vec3b>(i,j)[2];


        }

}

namedWindow( "Combined", CV_WINDOW_AUTOSIZE );// Create a window for display.
imshow( "Combined", image );

Answer 1

是的，这是一些简单的向量*矩阵乘法。它可以用JavaScript实现，如下所示;这应该很容易适应C，C ++等。可以在http://dansted.org/examples/dubois.html找到一个可用的JS演示

const max_value=1000*255*255; //max_value is int representing real number 1.0. 
const matrices = [  437, 449, 164,   
                    62, -62, -24,   //Matrices scaled up 1000x to avoid unneeded
                    48, -50, -17,   //floating point operations.

                    -11, -32, -7,
                    377, 761, 9,
                    -26, -93, 1234 ];

// Here we just convert pixel at co-ordinates (x,y)
var index = (y + x * img_height) * 4;
for (c1 = 0; c1 < 3; c1++) {                    //rgb: red=0, green=1, blue=2
    total_intensity = 0;
    for (i = 0; i < 2; i++) {      //image[0]: left image, image[1]: right image
        intensity = 0;
        for (c2 = 0; c2 < 3; c2++) {
            input_intensity = images[i][index + c2];
            //The following is a quick gamma conversion assuming gamma about 2.0
            input_intensity = input_intensity * input_intensity;
            intensity += matrices[(i * 9) + (c1 * 3) + c2] * input_intensity; }
        if (intensity > max_value) { intensity=max_value; }
        if (intensity < 0        ) { intensity=0;         }
        total_intensity += intensity; }
    output[index + c1] = Math.sqrt(total_intensity / 1000); }
output[index + 3] = 255; //Make opaque

使用Dubois Anaglyph算法进行2D到3D转换

1 个答案: