[关闭]
@lancelot-vim 2016-06-30T05:17:36.000000Z 字数 22159 阅读 4819

lsd-slam源码解读第五篇:DepthEstimation

lsd-slam

同样的，我希望在看这篇之前，读者已经对算法有了一定的了解，否则我估计这篇博客看起来会很吃力，如果还不太了解算法，建议先看第三篇：lsd-slam源码解读第三篇:算法解析 深度估计是整个lsd-slam最核心的部分，它和orb-slam在对深度的处理上有极大的不同，主要体现在：
orb-slam直接使用了三角化，计算得到深度，之后再进行校准
lsd-slam的方案是，初始化一个很不精确的深度（由于假设深度服从了高斯分布，因此可以选定一个均值，然后初始化一个极大的方差），当然，如果有些先验信息，这个分布可以选的比较好，可以注意到论文的深度传播部分，实际上就是根据先验知识初始化一个深度分布，之后根据观测帧，对深度分布进行修正，计算后验概率密度的过程

DepthMapPixelHypothesis

我想一个科学的研究方式应该是先阅读这个类，从名字上来看，这个类是对于深度图上每个像素的一个深度估计，它只有公有成员，成员变量分别表达了

接下来是3个构造函数，最后为了可视化，设置了一个返回rgb三个值的向量

DepthMap

这是一个很核心的类，首先我们来看构造函数DepthMap::DepthMap(int w, int h, const Eigen::Matrix3f& K)
构造函数需要传入图像的宽度以及高度，还有相机的内参，首先显然是分配内存，并且本地化相机参数

  1. width = w;
  2. height = h;
  4. activeKeyFrame = 0;
  5. activeKeyFrameIsReactivated = false;
  6. otherDepthMap = new DepthMapPixelHypothesis[width*height];
  7. currentDepthMap = new DepthMapPixelHypothesis[width*height];
  9. validityIntegralBuffer = (int*)Eigen::internal::aligned_malloc(width*height*sizeof(int));
  11. debugImageHypothesisHandling = cv::Mat(h,w, CV_8UC3);
  12. debugImageHypothesisPropagation = cv::Mat(h,w, CV_8UC3);
  13. debugImageStereoLines = cv::Mat(h,w, CV_8UC3);
  14. debugImageDepth = cv::Mat(h,w, CV_8UC3);
  16. this->K = K;
  17. fx = K(0,0);
  18. fy = K(1,1);
  19. cx = K(0,2);
  20. cy = K(1,2);
  22. KInv = K.inverse();
  23. fxi = KInv(0,0);
  24. fyi = KInv(1,1);
  25. cxi = KInv(0,2);
  26. cyi = KInv(1,2);

然后调用reset()函数，将该像素的深度估计初始化为无效

  1. void DepthMap::reset()
  2. {
  3.     for(DepthMapPixelHypothesis* pt = otherDepthMap+width*height-1; pt >= otherDepthMap; pt--)
  4.         pt->isValid = false;
  5.     for(DepthMapPixelHypothesis* pt = currentDepthMap+width*height-1; pt >= currentDepthMap; pt--)
  6.         pt->isValid = false;
  7. }

最后初始化一些其他参数，比如与计时相关的，计数相关的参数等

  1. msUpdate =  msCreate =  msFinalize = 0;
  2. msObserve =  msRegularize =  msPropagate =  msFillHoles =  msSetDepth = 0;
  3. gettimeofday(&lastHzUpdate, NULL);
  4. nUpdate = nCreate = nFinalize = 0;
  5. nObserve = nRegularize = nPropagate = nFillHoles = nSetDepth = 0;
  6. nAvgUpdate = nAvgCreate = nAvgFinalize = 0;
  7. nAvgObserve = nAvgRegularize = nAvgPropagate = nAvgFillHoles = nAvgSetDepth = 0;

void DepthMap::updateKeyframe

这个函数需要传入参考帧的指针队列，根据参考帧更新当前关键帧，是尤其重要的一个函数
首先记录最"年轻"的参考帧与最"老"的参考帧，对应算法的这个部分
2016-06-26-150213_1029x865_scrot.png-638.3kB

  1.     oldest_referenceFrame = referenceFrames.front().get();
  2.     newest_referenceFrame = referenceFrames.back().get();
  3.     referenceFrameByID.clear();
  4.     referenceFrameByID_offset = oldest_referenceFrame->id();

然后遍历所有帧，判断参考帧是不是当前关键帧，如果不是，就转换到当前关键帧，并且调用帧里面的prepareForStereoWith函数，算出需要用的投影矩阵，之后把帧这些准备好的帧压入参考帧队列,并初始化计数器

  1.     for(std::shared_ptr<Frame> frame : referenceFrames)
  2.     {
  3.         assert(frame->hasTrackingParent());
  5.         if(frame->getTrackingParent() != activeKeyFrame)
  6.         {
  7.             printf("WARNING: updating frame %d with %d, which was tracked on a different frame (%d).\nWhile this should work, it is not recommended.",
  8.                     activeKeyFrame->id(), frame->id(),
  9.                     frame->getTrackingParent()->id());
  10.         }
  12.         Sim3 refToKf;
  13.         if(frame->pose->trackingParent->frameID == activeKeyFrame->id())
  14.             refToKf = frame->pose->thisToParent_raw;
  15.         else
  16.             refToKf = activeKeyFrame->getScaledCamToWorld().inverse() *  frame->getScaledCamToWorld();
  18.         frame->prepareForStereoWith(activeKeyFrame, refToKf, K, 0);
  20.         while((int)referenceFrameByID.size() + referenceFrameByID_offset <= frame->id())
  21.             referenceFrameByID.push_back(frame.get());
  22.     }
  24.     resetCounters();

之后是调用观测函数，这个函数实际上要向下调用threadReducer对象的reduce，然后通过boost的bind调用到了observeDepthRow函数，这无疑是一段很飘逸的代码，让我们来好好看下是如何实现的i
首先是记录时间并调用observeDepth()，完成之后记录消耗时间，并记录下本次观测

  1.     gettimeofday(&tv_start, NULL);
  2.     observeDepth();
  3.     gettimeofday(&tv_end, NULL);
  4.     msObserve = 0.9*msObserve + 0.1*((tv_end.tv_sec-tv_start.tv_sec)*1000.0f + (tv_end.tv_usec-tv_start.tv_usec)/1000.0f);
  5.     nObserve++;

observeDepth()函数实际上就一行有效代码，即

threadReducer.reduce(boost::bind(&DepthMap::observeDepthRow, this, _1, _2, _3), 3, height-3, 10);

这个函数是通过IndexThreadReduce的对象threadReducer，调用方法reduce，传入了一个函数对象(或者叫做仿函数)
this->observeDepthRow(int, int, RunningStats* ), 以及三个参数3, height-3,10

IndexThreadReduce::reduce

这个函数要求的传入参数是一个函数对象，三个int类型的整数，这个函数对象需要三个参数，分别是int,int,RunningStats*，返回值为void，这四个参数正好对应了this->observeDepthRow(int, int, RunningStats* )，3, height-3,10,
我想你读到这里，应该能够深刻体会到bind的强大之处，函数指针void()(int,int,RunningStats)和函数指针void DepthMap::observeDepthRow(int yMin, int yMax, RunningStats* stats)类型是不同的，实际如果只是简单使用一下函数指针传递，编译是无法通过的，但是bind内部维护了这个转化，让你能够轻松地使用类里面的函数
由于slam肯定使用多线程，传入的stepSize==10，所以我们可以直接跳过前面几行，进入到互斥锁，之后的操作是本地化参数

  1.     this->callPerIndex = callPerIndex;
  2.     nextIndex = first;
  3.     maxIndex = end;
  4.     this->stepSize = stepSize;

之后开始工作线程

  1.     // go worker threads!
  2.     for(int i=0;i<MAPPING_THREADS;i++)
  3.         isDone[i] = false;
  5.     // let them start!
  6.     todo_signal.notify_all();

然后运行线程，等待结束

  1.     //printf("reduce waiting for threads to finish\n");
  2.     // wait for all worker threads to signal they are done.
  3.     while(true)
  4.     {
  5.         // wait for at least one to finish
  6.         done_signal.wait(lock);
  7.         //printf("thread finished!\n");
  9.         // check if actually all are finished.
  10.         bool allDone = true;
  11.         for(int i=0;i<MAPPING_THREADS;i++)
  12.             allDone = allDone && isDone[i];
  14.         // all are finished! exit.
  15.         if(allDone)
  16.             break;
  17.     }

最后再还原线程相关参数

  1.     nextIndex = 0;
  2.     maxIndex = 0;
  3.     this->callPerIndex = boost::bind(&IndexThreadReduce::callPerIndexDefault, this, _1, _2, _3);

至于这个调用是咋调用的呢，看到这里，你应该说我晕啊，这个该死的程序咋嵌套这么麻烦。。。实际上是在下面这个地方，把他做成并行计算了

  1. void workerLoop(int idx)
  2.     {
  3.         boost::unique_lock<boost::mutex> lock(exMutex);
  5.         while(running)
  6.         {
  7.             // try to get something to do.
  8.             int todo = 0;
  9.             bool gotSomething = false;
  10.             if(nextIndex < maxIndex)
  11.             {
  12.                 // got something!
  13.                 todo = nextIndex;
  14.                 nextIndex+=stepSize;
  15.                 gotSomething = true;
  16.             }
  18.             // if got something: do it (unlock in the meantime)
  19.             if(gotSomething)
  20.             {
  21.                 lock.unlock();
  23.                 assert(callPerIndex != 0);
  25.                 RunningStats s;
  26.                 callPerIndex(todo, std::min(todo+stepSize, maxIndex), &s);
  28.                 lock.lock();
  29.                 runningStats.add(&s);
  30.             }
  32.             // otherwise wait on signal, releasing lock in the meantime.
  33.             else
  34.             {
  35.                 isDone[idx] = true;
  36.                 //printf("worker %d waiting..\n", idx);
  37.                 done_signal.notify_all();
  38.                 todo_signal.wait(lock);
  39.             }
  40.         }
  41.     }

DepthMap::observeDepthRow

现在在让我们来看线程中实际运行的函数void DepthMap::observeDepthRow(int yMin, int yMax, RunningStats* stats)，首先得到关键帧最大的梯度,然后开始循环

const float* keyFrameMaxGradBuf = activeKeyFrame->maxGradients(0);

首先还是本地化参数，之后测试是否可用，不可用(梯度太小，无效点，列入黑名单)就继续下一次

  1.     int idx = x+y*width;
  2.     DepthMapPixelHypothesis* target = currentDepthMap+idx;
  3.     bool hasHypothesis = target->isValid;
  4.     // ======== 1. check absolute grad =========
  5.     if(hasHypothesis && keyFrameMaxGradBuf[idx] < MIN_ABS_GRAD_DECREASE)
  6.     {
  7.         target->isValid = false;
  8.         continue;
  9.     }
  11.     if(keyFrameMaxGradBuf[idx] < MIN_ABS_GRAD_CREATE || target->blacklisted < MIN_BLACKLIST)
  12.         continue;

然后计算深度(如果没有深度就创建，有深度就更新）

  1. if(!hasHypothesis)
  2.     success = observeDepthCreate(x, y, idx, stats);
  3. else
  4.     success = observeDepthUpdate(x, y, idx, keyFrameMaxGradBuf, stats);

bool DepthMap::observeDepthCreate

老样子，首先是本地化参数，然后检测是不是可用，我就不细说了，之后是对极线的计算
调用makeAndCheckEPL函数
首先计算epl

  1.     float epx = - fx * ref->thisToOther_t[0] + ref->thisToOther_t[2]*(x - cx);
  2.     float epy = - fy * ref->thisToOther_t[1] + ref->thisToOther_t[2]*(y - cy);

这里相当于是把相对于点(每个点都算了一次，可以注意到，前面分了很多线程，凑起来正好每个点都计算了一次)的平移投影做了拉伸，投影到了图像上，然后加上了点的坐标，但是都必须投影到同一个平面上，所以乘以了深度值，得到了表达那个点的"向量线段"，由于假设了旋转影响小，所以只有平移的投影，应该是对应了论文这个部分
2016-06-29-104808_457x118_scrot.png-32.2kB

然后是想判断这个极线的角度和梯度的角度是不是足够小（当然在这之前还检测了一下长度达不到达标），如果足够小，那么就返回极限的归一化向量

  1.     // ======== check epl length =========
  2.     float eplLengthSquared = epx*epx+epy*epy;
  3.     if(eplLengthSquared < MIN_EPL_LENGTH_SQUARED)
  4.     {
  5.         if(enablePrintDebugInfo) stats->num_observe_skipped_small_epl++;
  6.         return false;
  7.     }
  10.     // ===== check epl-grad magnitude ======
  11.     float gx = activeKeyFrameImageData[idx+1] - activeKeyFrameImageData[idx-1];
  12.     float gy = activeKeyFrameImageData[idx+width] - activeKeyFrameImageData[idx-width];
  13.     float eplGradSquared = gx * epx + gy * epy;
  14.     eplGradSquared = eplGradSquared*eplGradSquared / eplLengthSquared;  // square and norm with epl-length
  16.     if(eplGradSquared < MIN_EPL_GRAD_SQUARED)
  17.     {
  18.         if(enablePrintDebugInfo) stats->num_observe_skipped_small_epl_grad++;
  19.         return false;
  20.     }
  23.     // ===== check epl-grad angle ======
  24.     if(eplGradSquared / (gx*gx+gy*gy) < MIN_EPL_ANGLE_SQUARED)
  25.     {
  26.         if(enablePrintDebugInfo) stats->num_observe_skipped_small_epl_angle++;
  27.         return false;
  28.     }
  31.     // ===== DONE - return "normalized" epl =====
  32.     float fac = GRADIENT_SAMPLE_DIST / sqrt(eplLengthSquared);
  33.     *pepx = epx * fac;
  34.     *pepy = epy * fac;

之后的工作是调用了一个极度复杂的函数DepthMap::doLineStereo，为了看懂这个函数，把我折磨地死去活来，现在让我们来看下这个函数是如何工作的

float DepthMap::doLineStereo

  1.     float error = doLineStereo(
  2.             new_u,new_v,epx,epy,
  3.             0.0f, 1.0f, 1.0f/MIN_DEPTH,
  4.             refFrame, refFrame->image(0),
  5.             result_idepth, result_var, result_eplLength, stats);

首先这是调用，从调用上来看，传入了当前点的坐标，极线的单位向量，最小深度(0.0)，当前深度(1.0)，最大深度(1/MIN_DEPTH,当前参考帧，当前参考帧的最底层图像，然后传入3个数据记录结果，最后是运行状态
进入函数之后，首先计算的是当前点在参考帧上的投影极线信息，先从图像投影到空间，然后从这一帧的相机坐标向参考帧转换，最后加上平移

  1.     Eigen::Vector3f KinvP = Eigen::Vector3f(fxi*u+cxi,fyi*v+cyi,1.0f);
  2.     Eigen::Vector3f pInf = referenceFrame->K_otherToThis_R * KinvP;
  3.     Eigen::Vector3f pReal = pInf / prior_idepth + referenceFrame->K_otherToThis_t;

之后确定极线起点和终点，我估计这里计算这个的目的是想要判断最大搜索范围是不是在图像梯度可算范围内

  1.     float rescaleFactor = pReal[2] * prior_idepth;
  3.     float firstX = u - 2*epxn*rescaleFactor;
  4.     float firstY = v - 2*epyn*rescaleFactor;
  5.     float lastX = u + 2*epxn*rescaleFactor;
  6.     float lastY = v + 2*epyn*rescaleFactor;

后面很明显有判断范围，以及判断了缩放范围，再下来调用了getInterpolatedElement函数，计算了下图像在该点的值，实际上就是插值，函数体如下

  1. inline float getInterpolatedElement(const float* const mat, const float x, const float y, const int width)
  2. {
  3.     //stats.num_pixelInterpolations++;
  5.     int ix = (int)x;
  6.     int iy = (int)y;
  7.     float dx = x - ix;
  8.     float dy = y - iy;
  9.     float dxdy = dx*dy;
  10.     const float* bp = mat +ix+iy*width;
  13.     float res =   dxdy * bp[1+width]
  14.                 + (dy-dxdy) * bp[width]
  15.                 + (dx-dxdy) * bp[1]
  16.                 + (1-dx-dy+dxdy) * bp[0];
  18.     return res;
  19. }

然后计算最"近"的点

  1.     Eigen::Vector3f pClose = pInf + referenceFrame->K_otherToThis_t*max_idepth;
  2.     // if the assumed close-point lies behind the
  3.     // image, have to change that.
  4.     if(pClose[2] < 0.001f)
  5.     {
  6.         max_idepth = (0.001f-pInf[2]) / referenceFrame->K_otherToThis_t[2];
  7.         pClose = pInf + referenceFrame->K_otherToThis_t*max_idepth;
  8.     }
  9.     pClose = pClose / pClose[2]; // pos in new image of point (xy), assuming max_idepth

之后计算最"远"的点

  1.     Eigen::Vector3f pFar = pInf + referenceFrame->K_otherToThis_t*min_idepth;
  2.     // if the assumed far-point lies behind the image or closter than the near-point,
  3.     // we moved past the Point it and should stop.
  4.     if(pFar[2] < 0.001f || max_idepth < min_idepth)
  5.     {
  6.         if(enablePrintDebugInfo) stats->num_stereo_inf_oob++;
  7.         return -1;
  8.     }
  9.     pFar = pFar / pFar[2]; // pos in new image of point (xy), assuming min_idepth

得到极线线段，并归一化

  1.     // calculate increments in which we will step through the epipolar line.
  2.     // they are sampleDist (or half sample dist) long
  3.     float incx = pClose[0] - pFar[0];
  4.     float incy = pClose[1] - pFar[1];
  5.     float eplLength = sqrt(incx*incx+incy*incy);
  6.     if(!eplLength > 0 || std::isinf(eplLength)) return -4;
  8.     incx *= GRADIENT_SAMPLE_DIST/eplLength;
  9.     incy *= GRADIENT_SAMPLE_DIST/eplLength;

然后拓展长度，以及搜索宽度，确保这两个点都在图像内部

  1.     // extend one sample_dist to left & right.
  2.     pFar[0] -= incx;
  3.     pFar[1] -= incy;
  4.     pClose[0] += incx;
  5.     pClose[1] += incy;
  8.     // make epl long enough (pad a little bit).
  9.     if(eplLength < MIN_EPL_LENGTH_CROP)
  10.     {
  11.         float pad = (MIN_EPL_LENGTH_CROP - (eplLength)) / 2.0f;
  12.         pFar[0] -= incx*pad;
  13.         pFar[1] -= incy*pad;
  15.         pClose[0] += incx*pad;
  16.         pClose[1] += incy*pad;
  17.     }
  19.     // if inf point is outside of image: skip pixel.
  20.     if(
  21.             pFar[0] <= SAMPLE_POINT_TO_BORDER ||
  22.             pFar[0] >= width-SAMPLE_POINT_TO_BORDER ||
  23.             pFar[1] <= SAMPLE_POINT_TO_BORDER ||
  24.             pFar[1] >= height-SAMPLE_POINT_TO_BORDER)
  25.     {
  26.         if(enablePrintDebugInfo) stats->num_stereo_inf_oob++;
  27.         return -1;
  28.     }
  32.     // if near point is outside: move inside, and test length again.
  33.     if(
  34.             pClose[0] <= SAMPLE_POINT_TO_BORDER ||
  35.             pClose[0] >= width-SAMPLE_POINT_TO_BORDER ||
  36.             pClose[1] <= SAMPLE_POINT_TO_BORDER ||
  37.             pClose[1] >= height-SAMPLE_POINT_TO_BORDER)
  38.     {
  39.         if(pClose[0] <= SAMPLE_POINT_TO_BORDER)
  40.         {
  41.             float toAdd = (SAMPLE_POINT_TO_BORDER - pClose[0]) / incx;
  42.             pClose[0] += toAdd * incx;
  43.             pClose[1] += toAdd * incy;
  44.         }
  45.         else if(pClose[0] >= width-SAMPLE_POINT_TO_BORDER)
  46.         {
  47.             float toAdd = (width-SAMPLE_POINT_TO_BORDER - pClose[0]) / incx;
  48.             pClose[0] += toAdd * incx;
  49.             pClose[1] += toAdd * incy;
  50.         }
  52.         if(pClose[1] <= SAMPLE_POINT_TO_BORDER)
  53.         {
  54.             float toAdd = (SAMPLE_POINT_TO_BORDER - pClose[1]) / incy;
  55.             pClose[0] += toAdd * incx;
  56.             pClose[1] += toAdd * incy;
  57.         }
  58.         else if(pClose[1] >= height-SAMPLE_POINT_TO_BORDER)
  59.         {
  60.             float toAdd = (height-SAMPLE_POINT_TO_BORDER - pClose[1]) / incy;
  61.             pClose[0] += toAdd * incx;
  62.             pClose[1] += toAdd * incy;
  63.         }
  65.         // get new epl length
  66.         float fincx = pClose[0] - pFar[0];
  67.         float fincy = pClose[1] - pFar[1];
  68.         float newEplLength = sqrt(fincx*fincx+fincy*fincy);
  70.         // test again
  71.         if(
  72.                 pClose[0] <= SAMPLE_POINT_TO_BORDER ||
  73.                 pClose[0] >= width-SAMPLE_POINT_TO_BORDER ||
  74.                 pClose[1] <= SAMPLE_POINT_TO_BORDER ||
  75.                 pClose[1] >= height-SAMPLE_POINT_TO_BORDER ||
  76.                 newEplLength < 8.0f
  77.                 )
  78.         {
  79.             if(enablePrintDebugInfo) stats->num_stereo_near_oob++;
  80.             return -1;
  81.         }
  84.     }

得到远点的图像信息

  1. float cpx = pFar[0];
  2. float cpy =  pFar[1];
  4. float val_cp_m2 = getInterpolatedElement(referenceFrameImage,cpx-2.0f*incx, cpy-2.0f*incy, width);
  5. float val_cp_m1 = getInterpolatedElement(referenceFrameImage,cpx-incx, cpy-incy, width);
  6. float val_cp = getInterpolatedElement(referenceFrameImage,cpx, cpy, width);
  7. float val_cp_p1 = getInterpolatedElement(referenceFrameImage,cpx+incx, cpy+incy, width);
  8. float val_cp_p2;

然后开始搜索，初始化计数信息

  1.     int loopCounter = 0;
  2.     float best_match_x = -1;
  3.     float best_match_y = -1;
  4.     float best_match_err = 1e50;
  5.     float second_best_match_err = 1e50;
  7.     // best pre and post errors.
  8.     float best_match_errPre=NAN, best_match_errPost=NAN, best_match_DiffErrPre=NAN, best_match_DiffErrPost=NAN;
  9.     bool bestWasLastLoop = false;
  11.     float eeLast = -1; // final error of last comp.
  13.     // alternating intermediate vars
  14.     float e1A=NAN, e1B=NAN, e2A=NAN, e2B=NAN, e3A=NAN, e3B=NAN, e4A=NAN, e4B=NAN, e5A=NAN, e5B=NAN;
  16.     int loopCBest=-1, loopCSecond =-1;

之后开始循环搜索，只要没有走到终点pClose或者loopCounter == 0就不断循环，以搜索误差最小的那个匹配点，我们把通过几何计算然后插值得到的那个点的信息作为标准信息，进行搜索，并计算误差

  1. // interpolate one new point
  2. val_cp_p2 = getInterpolatedElement(referenceFrameImage,cpx+2*incx, cpy+2*incy, width);
  4. // hacky but fast way to get error and differential error: switch buffer variables for last loop.
  5. float ee = 0;
  6. if(loopCounter%2==0)
  7. {
  8.     // calc error and accumulate sums.
  9.     e1A = val_cp_p2 - realVal_p2;ee += e1A*e1A;
  10.     e2A = val_cp_p1 - realVal_p1;ee += e2A*e2A;
  11.     e3A = val_cp - realVal;      ee += e3A*e3A;
  12.     e4A = val_cp_m1 - realVal_m1;ee += e4A*e4A;
  13.     e5A = val_cp_m2 - realVal_m2;ee += e5A*e5A;
  14. }
  15. else
  16. {
  17.     // calc error and accumulate sums.
  18.     e1B = val_cp_p2 - realVal_p2;ee += e1B*e1B;
  19.     e2B = val_cp_p1 - realVal_p1;ee += e2B*e2B;
  20.     e3B = val_cp - realVal;      ee += e3B*e3B;
  21.     e4B = val_cp_m1 - realVal_m1;ee += e4B*e4B;
  22.     e5B = val_cp_m2 - realVal_m2;ee += e5B*e5B;
  23. }

然后判断是否误差更小，如果是，那么设置新的信息

  1. if(ee < best_match_err)
  2. {   
  3.     // put to second-best
  4.     second_best_match_err=best_match_err;
  5.     loopCSecond = loopCBest;
  7.     // set best.
  8.     best_match_err = ee;
  9.     loopCBest = loopCounter;
  11.     best_match_errPre = eeLast;
  12.     best_match_DiffErrPre = e1A*e1B + e2A*e2B + e3A*e3B + e4A*e4B + e5A*e5B;
  13.     best_match_errPost = -1;
  14.     best_match_DiffErrPost = -1;
  16.     best_match_x = cpx;
  17.     best_match_y = cpy;
  18.     bestWasLastLoop = true;
  19. }

否则，如果上次循环是"好"的匹配循环，那么设置上次匹配的"好"参数

  1. if(bestWasLastLoop)
  2. {
  3.     best_match_errPost = ee;
  4.     best_match_DiffErrPost = e1A*e1B + e2A*e2B + e3A*e3B + e4A*e4B + e5A*e5B;
  5.     bestWasLastLoop = false;
  6. }

如果上次匹配不好，再判断它的误差是不是比次一个等级的匹配好，如果好，就设置，不好就算了

  1. if(ee < second_best_match_err)
  2. {
  3.     second_best_match_err=ee;
  4.     loopCSecond = loopCounter;
  5. }

然后更新参数，进行下次循环

  1. eeLast = ee;
  2. val_cp_m2 = val_cp_m1; val_cp_m1 = val_cp; val_cp = val_cp_p1; val_cp_p1 = val_cp_p2;
  4. if(enablePrintDebugInfo) stats->num_stereo_comparisons++;
  6. cpx += incx;
  7. cpy += incy;
  9. loopCounter++;

循环完毕之后，自然找到了极线上匹配的最好的点，然后自然要判断和不合法，不合法就别继续了
这个判断分两部分，第一部分是判断误差是不是够小了，第二部分是判断匹配上的是不是够多

  1. // if error too big, will return -3, otherwise -2.
  2. if(best_match_err > 4.0f*(float)MAX_ERROR_STEREO)
  3. {
  4.     if(enablePrintDebugInfo) stats->num_stereo_invalid_bigErr++;
  5.     return -3;
  6. }
  9. // check if clear enough winner
  10. if(abs(loopCBest - loopCSecond) > 1.0f && MIN_DISTANCE_ERROR_STEREO * best_match_err > second_best_match_err)
  11. {
  12.     if(enablePrintDebugInfo) stats->num_stereo_invalid_unclear_winner++;
  13.     return -2;
  14. }

之后自然是计算准确的匹配(使用亚像素)
首先计算梯度(计算了一半)，然后判断各种各样的不合法情况
只有两种情况是可用的，即
1. gradPre_pre和gradPre_this不同号且gradPost_post和gradPost_this同号。认为前插可用
2. 上一种条件不满足情况下gradPost_post和gradPost_this不同号，认为后插值可用

然后这里就在做插值工作，得到亚像素的匹配误差

  1. if(interpPre)
  2. {
  3.     float d = gradPre_this / (gradPre_this - gradPre_pre);
  4.     best_match_x -= d*incx;
  5.     best_match_y -= d*incy;
  6.     best_match_err = best_match_err - 2*d*gradPre_this - (gradPre_pre - gradPre_this)*d*d;
  7.     if(enablePrintDebugInfo) stats->num_stereo_interpPre++;
  8.     didSubpixel = true;
  10. }
  11. else if(interpPost)
  12. {
  13.     float d = gradPost_this / (gradPost_this - gradPost_post);
  14.     best_match_x += d*incx;
  15.     best_match_y += d*incy;
  16.     best_match_err = best_match_err + 2*d*gradPost_this + (gradPost_post - gradPost_this)*d*d;
  17.     if(enablePrintDebugInfo) stats->num_stereo_interpPost++;
  18.     didSubpixel = true;
  19. }

于是就要做采样准备了，5个点，就论文这里
2016-06-29-170056_475x44_scrot.png-12.8kB

  1.     // sampleDist is the distance in pixel at which the realVal's were sampled
  2.     float sampleDist = GRADIENT_SAMPLE_DIST*rescaleFactor;
  4.     float gradAlongLine = 0;
  5.     float tmp = realVal_p2 - realVal_p1;  gradAlongLine+=tmp*tmp;
  6.     tmp = realVal_p1 - realVal;  gradAlongLine+=tmp*tmp;
  7.     tmp = realVal - realVal_m1;  gradAlongLine+=tmp*tmp;
  8.     tmp = realVal_m1 - realVal_m2;  gradAlongLine+=tmp*tmp;
  10.     gradAlongLine /= sampleDist*sampleDist;
  12.     // check if interpolated error is OK. use evil hack to allow more error if there is a lot of gradient.
  13.     if(best_match_err > (float)MAX_ERROR_STEREO + sqrtf( gradAlongLine)*20)
  14.     {
  15.         if(enablePrintDebugInfo) stats->num_stereo_invalid_bigErr++;
  16.         return -3;
  17.     }

之后总算开始计算深度了，当然还有一会儿要用到的alpha
2016-06-29-170739_103x59_scrot.png-1.6kB
这个计算公式是用了向量的分量进行计算，首先的比较是看哪个分量比较精确用哪个（长点好，视差大）

  1. float oldX = fxi*best_match_x+cxi;
  2. float nominator = (oldX*referenceFrame->otherToThis_t[2] - referenceFrame->otherToThis_t[0]);
  3. float dot0 = KinvP.dot(referenceFrame->otherToThis_R_row0);
  4. float dot2 = KinvP.dot(referenceFrame->otherToThis_R_row2);
  6. idnew_best_match = (dot0 - oldX*dot2) / nominator;
  7. alpha = incx*fxi*(dot0*referenceFrame->otherToThis_t[2] - dot2*referenceFrame->otherToThis_t[0]) / (nominator*nominator);

其实这个公式我是一下没看懂的，看了下大神做的公式推导，才明白过来，直接上截图
2016-06-29-174809_1488x941_scrot.png-186.5kB
2016-06-29-174842_1483x641_scrot.png-89.4kB
2016-06-29-174907_1334x837_scrot.png-158.8kB
2016-06-29-174944_1498x494_scrot.png-108.7kB
2016-06-29-175013_1405x474_scrot.png-58.8kB

后面部分在算协方差了，公式就在论文上，都比较简单，就略过了，请读者自行研究，之后就可以回到updateKeyFrame了

实际上上面那个部分结束之后，你发现整个DepthMap的函数已经差不多了。接下来我们来看下面的调用regularizeDepthMap

  1.     //if(rand()%10==0)
  2.     {
  3.         gettimeofday(&tv_start, NULL);
  4.         regularizeDepthMapFillHoles();
  5.         gettimeofday(&tv_end, NULL);
  6.         msFillHoles = 0.9*msFillHoles + 0.1*((tv_end.tv_sec-tv_start.tv_sec)*1000.0f + (tv_end.tv_usec-tv_start.tv_usec)/1000.0f);
  7.         nFillHoles++;
  8.     }
  10.     gettimeofday(&tv_start, NULL);
  11.     regularizeDepthMap(false, VAL_SUM_MIN_FOR_KEEP);
  12.     gettimeofday(&tv_end, NULL);
  13.     msRegularize = 0.9*msRegularize + 0.1*((tv_end.tv_sec-tv_start.tv_sec)*1000.0f + (tv_end.tv_usec-tv_start.tv_usec)/1000.0f);
  14.     nRegularize++;

这里主要是调用了两个函数regularizeDepthMapFillHoles和regularizeDepthMap，就按照调用顺序依次介绍吧

DepthMap::regularizeDepthMapFillHoles

这个函数又是bind映射机制，前面已经讲过了如何进行的，这里我们就直接进入函数regularizeDepthMapFillHolesRow

  1. const float* keyFrameMaxGradBuf = activeKeyFrame->maxGradients(0);

本地化梯度参数，进入循环

  1. int idx = x+y*width;
  2. DepthMapPixelHypothesis* dest = otherDepthMap + idx;
  3. if(dest->isValid) continue;
  4. if(keyFrameMaxGradBuf[idx]<MIN_ABS_GRAD_DECREASE) continue;

然后判断那块区域有效点的数据是否足够多

  1. int* io = validityIntegralBuffer + idx;
  2. int val = io[2+2*width] - io[2-3*width] - io[-3+2*width] + io[-3-3*width];

我估计这里看起来又是一段莫名其妙理解不能的代码，我在这里讲解一下
首先我们来看这个东西是在哪里初始化的，请看DepthMap::buildRegIntegralBufferRow1函数

  1. void DepthMap::buildRegIntegralBufferRow1(int yMin, int yMax, RunningStats* stats)
  2. {
  3.     // ============ build inegral buffers
  4.     int* validityIntegralBufferPT = validityIntegralBuffer+yMin*width;
  5.     DepthMapPixelHypothesis* ptSrc = currentDepthMap+yMin*width;
  6.     for(int y=yMin;y<yMax;y++)
  7.     {
  8.         int validityIntegralBufferSUM = 0;
  10.         for(int x=0;x<width;x++)
  11.         {
  12.             if(ptSrc->isValid)
  13.                 validityIntegralBufferSUM += ptSrc->validity_counter;
  15.             *(validityIntegralBufferPT++) = validityIntegralBufferSUM;
  16.             ptSrc++;
  17.         }
  18.     }
  19. }

你会发现，validityIntegralBuffer实际上记录了到当前位置所有的有效点的和，那么上面那一段加加减减（int val = io[2+2*width] - io[2-3*width] - io[-3+2*width] + io[-3-3*width]）是干嘛呢，请看下图
加加减减.png-122.9kB
首先是那个大区域，减去红色的，减去蓝色的，再加上绿色的，是不是就只剩下的未填色部分了呢？
因此这里实际上统计了未填色部分的有效点的总数，然后下面在判断满不满足要求，满足之后进行接下来的操作
然后是这段代码：

  1. DepthMapPixelHypothesis* s1max = otherDepthMap + (x-2) + (y+3)*width;
  2. for (DepthMapPixelHypothesis* s1 = otherDepthMap + (x-2) + (y-2)*width; s1 < s1max; s1+=width)
  3.     for(DepthMapPixelHypothesis* source = s1; source < s1+5; source++)
  4.     {
  5.         if(!source->isValid) continue;
  7.         sumIdepthObs += source->idepth /source->idepth_var;
  8.         sumIVarObs += 1.0f/source->idepth_var;
  9.         num++;
  10.     }
  12. float idepthObs = sumIdepthObs / sumIVarObs;
  13. idepthObs = UNZERO(idepthObs);
  15. currentDepthMap[idx] =
  16.     DepthMapPixelHypothesis(
  17.         idepthObs,
  18.         VAR_RANDOM_INIT_INITIAL,
  19.         0);

实际上这里就是算了一下加权平均，没啥特别的，然后把估计更新了进去，实际上就是预测了一些未知区域(洞)的深度，注意这个预测是要在周围都比较好的基础上才进行

DepthMap::regularizeDepthMap

多的废话我已经不想说了，既然能看到这个部分，足见读者编程水平已经不低，多的废话我就不说了，这个函数用和之前一样的线程机制调用了DepthMap::regularizeDepthMapRow，这个函数使用了模板技术，它有是否要移除遮挡的两个版本，在预编译期已经生成，函数本身蛮简单的，其实就是算一个加权平均，关键代码如下：

  1. for(int y=yMin;y<yMax;y++)
  2. {
  3.     for(int x=regularize_radius;x<width-regularize_radius;x++)
  4.     {
  5.         DepthMapPixelHypothesis* dest = currentDepthMap + x + y*width;
  6.         DepthMapPixelHypothesis* destRead = otherDepthMap + x + y*width;
  8.         float sum=0, val_sum=0, sumIvar=0;//, min_varObs = 1e20;
  9.         int numOccluding = 0, numNotOccluding = 0;
  11.         for(int dx=-regularize_radius; dx<=regularize_radius;dx++)
  12.             for(int dy=-regularize_radius; dy<=regularize_radius;dy++)
  13.             {
  14.                 DepthMapPixelHypothesis* source = destRead + dx + dy*width;
  16.                 if(!source->isValid) continue;
  18.                 float diff =source->idepth - destRead->idepth;
  19.                 if(DIFF_FAC_SMOOTHING*diff*diff > source->idepth_var + destRead->idepth_var)
  20.                     continue;
  22.                 val_sum += source->validity_counter;
  24.                 float distFac = (float)(dx*dx+dy*dy)*regDistVar;
  25.                 float ivar = 1.0f/(source->idepth_var + distFac);
  27.                 sum += source->idepth * ivar;
  28.                 sumIvar += ivar;
  29.             }
  31.         if(val_sum < validityTH)
  32.         {
  33.             dest->isValid = false;
  34.             continue;
  35.         }
  37.         sum = sum / sumIvar;
  38.         sum = UNZERO(sum);
  40.         // update!
  41.         dest->idepth_smoothed = sum;
  42.         dest->idepth_var_smoothed = 1.0f/sumIvar;
  43.     }
  44. }

调用完这个函数后，实际上DepthMap::updateKeyframe中干活的部分就都结束了，剩下都是一些记录工作和调试选项的工作，请读者自行阅读

void DepthMap::propagateDepth

实际上到了这里，我应该讲清楚的是createKeyFrame函数，但是这个函数和上面那个函数重叠部分太多，之后一个关键函数，就是DepthMap::propagateDepth了，我就简单说下这个深度传播的函数，省的和前面的部分重复

  1. for(DepthMapPixelHypothesis* pt = otherDepthMap+width*height-1; pt >= otherDepthMap; pt--)
  2. {
  3.     pt->isValid = false;
  4.     pt->blacklisted = 0;
  5. }

首先当然是初始化工作，代码如上，然后是本地化参数

  1. SE3 oldToNew_SE3 = se3FromSim3(new_keyframe->pose->thisToParent_raw).inverse();
  2. Eigen::Vector3f trafoInv_t = oldToNew_SE3.translation().cast<float>();
  3. Eigen::Matrix3f trafoInv_R = oldToNew_SE3.rotationMatrix().matrix().cast<float>();
  6. const bool* trackingWasGood = new_keyframe->getTrackingParent() == activeKeyFrame ? new_keyframe->refPixelWasGoodNoCreate() : 0;
  9. const float* activeKFImageData = activeKeyFrame->image(0);
  10. const float* newKFMaxGrad = new_keyframe->maxGradients(0);
  11. const float* newKFImageData = new_keyframe->image(0);

首先的到新坐标下的当前点，同时算出深度和图像上的位置

  1. Eigen::Vector3f pn = (trafoInv_R * Eigen::Vector3f(x*fxi + cxi,y*fyi + cyi,1.0f)) / source->idepth_smoothed + trafoInv_t;
  3. float new_idepth = 1.0f / pn[2];
  5. float u_new = pn[0]*new_idepth*fx + cx;
  6. float v_new = pn[1]*new_idepth*fy + cy;

然后得到最大梯度，以及最好的估计目标

  1. int newIDX = (int)(u_new+0.5f) + ((int)(v_new+0.5f))*width;
  2. float destAbsGrad = newKFMaxGrad[newIDX];
  4. ...
  6. DepthMapPixelHypothesis* targetBest = otherDepthMap +  newIDX;

之后计算新的方差
2016-06-30-114326_447x94_scrot.png-7.9kB

  1. float idepth_ratio_4 = new_idepth / source->idepth_smoothed;
  2. idepth_ratio_4 *= idepth_ratio_4;
  3. idepth_ratio_4 *= idepth_ratio_4;

然后去除遮挡，策略是如果之前那个bestTarget是有效的，如果一下子变化特别大，那么认为是被遮挡了

  1. // check for occlusion
  2. if(targetBest->isValid)
  3. {
  4.     // if they occlude one another, one gets removed.
  5.     float diff = targetBest->idepth - new_idepth;
  6.     if(DIFF_FAC_PROP_MERGE*diff*diff >
  7.         new_var +
  8.         targetBest->idepth_var)
  9.     {
  10.         if(new_idepth < targetBest->idepth)
  11.         {
  12.             if(enablePrintDebugInfo) runningStats.num_prop_occluded++;
  13.             continue;
  14.         }
  15.         else
  16.         {
  17.             if(enablePrintDebugInfo) runningStats.num_prop_occluded++;
  18.             targetBest->isValid = false;
  19.         }
  20.     }
  21. }

之后是更新深度信息，如果bestTarget是无效的，那么创建一个新的估计

  1. *targetBest = DepthMapPixelHypothesis(
  2.         new_idepth,
  3.         new_var,
  4.         source->validity_counter);

如果是有效的，需要先merge，再更新，实际上就是使用了扩散卡尔曼滤波，最后再更新到当前深度,实际上就是对应论文这个部分
2016-06-30-120716_610x61_scrot.png-18.1kB
2016-06-30-120621_621x200_scrot.png-31.3kB

  1. // merge idepth ekf-style
  2. float w = new_var / (targetBest->idepth_var + new_var);
  3. float merged_new_idepth = w*targetBest->idepth + (1.0f-w)*new_idepth;
  5. // merge validity
  6. int merged_validity = source->validity_counter + targetBest->validity_counter;
  7. if(merged_validity > VALIDITY_COUNTER_MAX+(VALIDITY_COUNTER_MAX_VARIABLE))
  8.     merged_validity = VALIDITY_COUNTER_MAX+(VALIDITY_COUNTER_MAX_VARIABLE);
  10. *targetBest = DepthMapPixelHypothesis(
  11.         merged_new_idepth,
  12.         1.0f/(1.0f/targetBest->idepth_var + 1.0f/new_var),
  13.         merged_validity);
  15. ...
  17. // swap!
  18. std::swap(currentDepthMap, otherDepthMap);

深度部分的代码就写到这里，这部分难度特别大，几乎不能做朋友，想要真正了解他，还需要反复阅读，反复和论文对照，才能真正理解

添加新批注
在作者公开此批注前，只有你和作者可见。
回复批注