Yidadaa / Issue-Blog-With-Github-Action

A well-designed blog theme based on Vuepress and hosted on Github Actions.
https://blog.simplenaive.cn/Issue-Blog-With-Github-Action/
Do What The F*ck You Want To Public License
78 stars 35 forks source link

Hello World #1

Open Yidadaa opened 4 years ago

Yidadaa commented 4 years ago

Method

In this section, we describe our unsupervised framework for monocular depth estimation. We first review the self-supervised training pipeline for monocular depth estimation, and then introduce the co-attention module and pose graph consistency loss function.

Supervision from Image Reconstruction

Following the formulation in \cite{zhou_unsupervised_2017}, the whole framework includes a DispNet and a PoseNet, the DispNet produces depth map and the PoseNet produces the relative pose between two RGB frames.

Given a sequence of consecutive frames $X_{t-1}, Xt$ and $X{t+1}$,we estimate the depth for each frame, and the relative pose for every two adjacent frames, then we get depth map $D_{t-1}, Dt, D{t+1}$ and translation matrix $T{t-1\rightarrow t}, T{t\rightarrow t+1}$.

Consider the adjacent frame pair $It$ and $I{t+1}$, once the estimated depth $Dt$ and translation matrix $T{t\rightarrow t+1}$ are available, we can project the source image $I_t$ to the next moment

$$ p(\hat{I}{t+1}) = KT{t\rightarrow t+1}D_tK^{-1}p(I_t) $$

the function $p(.)$ denotes sampling from the homogeneous coordinates of image and $K$ denotes the camera insrinsic matrix, $\hat{I}_{t+1}$ can be reconstucted using the differentiable sampling mechanism proposed in \cite{jaderberg_spatial_2015}.

Hence the problem is formulated to the minimization of a phtometric reprojection error $L_p$

$$ Lp = \alpha \left|I{t+1} - \hat{I}_{t+1}\right|1 + (1 - \alpha)SSIM(I{t+1}, \hat{I}_{t+1}) $$

$SSIM(.)$ is the structural similarity\cite{wang_image_2004} loss for evaluating the quality of image predictions, and to regularize the depth, we use a disparity image smoothness constraint as widely used in previous work\cite{mahjourian_unsupervised_2018,zhou_unsupervised_2017,garg_unsupervised_2016}

$$ L{\mathrm{s}}=\sum{x, y}\left|\partial{x} D{t}\right| e^{-\left|\partial{x} I{t}\right|}+\left|\partial{y} D{t}\right| e^{-\left|\partial{y} I{t}\right|} $$

List

Here is a list:

Code

Here is some code:

def bi_search(arr:list, x:int):
  l, r = 0, len(arr)
  while l < r:
    m = (l + r) >> 1
    if arr[m] >= x: r = m
    else: l = m + 1
  return l

Image

image

Table

A B C
123 456 789
MrThanlon commented 4 years ago

Good

imabutahersiddik commented 10 months ago

Testing comment

SH20RAJ commented 5 months ago

hii