dash-3d-tmp
/
phd
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Some modifs

This commit is contained in:
Thomas Forgione 2019-10-09 16:12:11 +02:00
parent 05db88ddb0
commit e3c05c9ccd
No known key found for this signature in database
GPG Key ID: 203DAEA747F48F41
4 changed files with 55 additions and 24 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
src/dash-3d/client.tex
View File

@ -172,13 +172,18 @@ Algorithm~\ref{d3:next-segment} details how our DASH client makes decisions.
\SetKwFunction{Argmax}{argmax} \SetKwFunction{Argmax}{argmax}
\SetKwFunction{Filter}{filter} \SetKwFunction{Filter}{filter}
\SetKwFunction{EstimateNetwork}{estimate\_network\_parameters} \SetKwFunction{EstimateNetwork}{estimate\_network\_parameters}
\SetKwFunction{Append}{append}
\Input{Current index $i$, time $t_i$, viewpoint $v(t_i)$, buffer of already downloaded \texttt{segments} $\mathcal{B}_i$, MPD} \Input{Current index $i$, time $t_i$, viewpoint $v(t_i)$, buffer of already downloaded \texttt{segments} $\mathcal{B}_i$, MPD}
\Output{Next segment $s^{*}_i$ to request, updated buffer $\mathcal{B}_{i+1}$} \Output{Next segment $s^{*}_i$ to request, updated buffer $\mathcal{B}_{i+1}$}
\BlankLine{}
(\Bw, \Rtt) \leftarrow{} \EstimateNetwork{}\; (\Bw, \Rtt) \leftarrow{} \EstimateNetwork{}\;
\Candidates\leftarrow{}\AllSegments\newline\makebox[1cm]{}.\Filter{$\Segment\rightarrow\Segment\notin\DownloadedSegments\land\Segment\in\Frustum$}\; \BlankLine{}
\Candidates\leftarrow{} \AllSegments\newline\makebox[1cm]{}.\Filter{$\Segment\rightarrow\Segment\notin\DownloadedSegments$}\newline\makebox[1cm]{}.\Filter{$\Segment\rightarrow\Segment\in\Frustum$}\;
\BlankLine{}
\Segment\leftarrow{} \Argmax{\Candidates, \Segment\rightarrow{} $\Omega\left(\mathcal{U}(\Segment)\right)$}\; \Segment\leftarrow{} \Argmax{\Candidates, \Segment\rightarrow{} $\Omega\left(\mathcal{U}(\Segment)\right)$}\;
\DownloadedSegments.\Append{\Segment}\;
{\caption{Algorithm to identify the next segment to query\label{d3:next-segment}}} {\caption{Algorithm to identify the next segment to query\label{d3:next-segment}}}
\end{algorithm} \end{algorithm}

12
src/foreword/3d-model.tex
View File

@ -85,15 +85,15 @@ A typical 3D renderer follows Algorithm~\ref{f:renderer}.
\SetKwFunction{Draw}{draw} \SetKwFunction{Draw}{draw}
\tcc{Initialization} \tcc{Initialization}
\For{\Object\in\Scene}{% \For{$\Object\in\Scene$}{%
\LoadGeometry(\Object.\Geometry)\; \LoadGeometry{\Object.\Geometry}\;
\LoadTexture(\Object.\Texture)\; \LoadTexture{\Object.\Texture}\;
} }
\BlankLine% \BlankLine%
\BlankLine% \BlankLine%
\tcc{Render loop} \tcc{Render loop}
\While{\True}{% \While{\True}{%
\For{\Object\in\Scene}{% \For{$\Object\in\Scene$}{%
\BindTexture{\Object.\Texture}\; \BindTexture{\Object.\Texture}\;
\Draw{\Object.\Geometry}\; \Draw{\Object.\Geometry}\;
} }
@ -135,8 +135,8 @@ Algorithm~\ref{f:frustum-culling} is a variation of Algorithm~\ref{f:renderer} w
\tcc{Initialization} \tcc{Initialization}
\For{$\Object\in\Scene$}{% \For{$\Object\in\Scene$}{%
\LoadGeometry(\Object.\Geometry)\; \LoadGeometry{\Object.\Geometry}\;
\LoadTexture(\Object.\Texture)\; \LoadTexture{\Object.\Texture}\;
} }
\BlankLine% \BlankLine%
\BlankLine% \BlankLine%

6
src/main.tex
View File

@ -58,6 +58,12 @@ This version was compiled on \today{} at \currenttime{}.
\input{plan} \input{plan}
\newpage
\listoffigures%
\listoftables%
\listofalgorithms%
\lstlistoflistings%
\bibliography{src/bib.bib} \bibliography{src/bib.bib}
\end{document} \end{document}

54
src/system-bookmarks/bookmark.tex
View File

@ -227,30 +227,50 @@ The three first values in the supplemental property are the camera position coor
We build on the loader introduced in Algorithm~\ref{d3:next-segment} to implement a client adaptation logic. We build on the loader introduced in Algorithm~\ref{d3:next-segment} to implement a client adaptation logic.
We include a bookmark adaptation logic such that (i) when a bookmark is hovered for the first time, the corresponding images (see Listing~\ref{sb:bookmark-as}) are downloaded, and (ii) when a bookmark is clicked, we switch from utility $\mathcal{U}$ to optimized utility $\mathcal{U}^*$ to determine which segments to download next. We include a bookmark adaptation logic such that (i) when a bookmark is hovered for the first time, the corresponding images (see Listing~\ref{sb:bookmark-as}) are downloaded, and (ii) when a bookmark is clicked, we switch from utility $\mathcal{U}$ to optimized utility $\mathcal{U}^*$ to determine which segments to download next.
\newcommand\mycommfont[1]{\footnotesize\ttfamily\textcolor{blue}{#1}}
\SetCommentSty{mycommfont}
\SetNoFillComment%
\begin{algorithm}[th] \begin{algorithm}[th]
\SetKwInOut{Input}{input} \SetKwInOut{Input}{input}
\SetKwInOut{Output}{output} \SetKwInOut{Output}{output}
\Input{Current index $i$, time $t_i$, viewpoint $v(t_i)$, buffer of already downloaded \texttt{segments} $\mathcal{B}_i$, MPD}
\Output{Next segment $s^{*}_i$ to request, updated buffer $\mathcal{B}_{i+1}$}
\SetAlgoLined%
{- Estimate the bandwidth $\widehat{BW_i}$ and RTT $\widehat{\tau_i}$ \;}
{- Among all \texttt{segments} that are not already downloaded $s \in \mathcal{S} \backslash \mathcal{B}_i$, % \;} \SetKw{Continue}{continue}
% {- \SetKwData{Bw}{bw\_estimation}
keep the ones inside the upcoming viewing frustums $\mathcal{FC}=\mathbb{FC}(\widehat{v}(t_i)), t\in [t_i, t_i+\chi]$ thanks to a viewpoint predictor $t_i \rightarrow \hat{v}(t_i)$, a temporal horizon $\chi$ and a frustum culling operator $\mathbb{FC}$ \;} \SetKwData{Rtt}{rtt\_estimation}
\SetKwData{Segment}{best\_segment}
\SetKwData{Candidates}{candidates}
\SetKwData{AllSegments}{all\_segments}
\SetKwData{DownloadedSegments}{downloaded\_segments}
\SetKwData{Frustum}{frustum}
\SetKwFunction{Argmax}{argmax}
\SetKwFunction{Filter}{filter}
\SetKwFunction{EstimateNetwork}{estimate\_network\_parameters}
\SetKwFunction{Append}{append}
\Input{Current index $i$, time $t_i$, viewpoint $v(t_i)$, buffer of already downloaded \texttt{segments}, MPD}
\Output{Next segment to request, updated buffer}
\BlankLine{}
{- Optimize a criterion $\Omega$ based on $\mathcal{U}$ values and well chosen viewpoint $v(t_i)$ to select the next segment to query } \uIf{bookmark clicking}{%
{\begin{equation*} \uIf{not optimal order fetched}{%
s^{*}_i= \argmax{s \in \mathcal{S} \backslash \mathcal{B}_i \cap \mathcal{FC}} \Omega_{\theta_i} \Big(\mathcal{U}(s,v(t_i))\Big) \label{sb:eq1} \Return{} optimal order segment\;
\end{equation*} \\ }
given parameters $\theta_i$ that gathers both online parameters $(i,t_i,v(t_i),\widehat{BW_i}, \widehat{\tau_i}, \mathcal{B}_i)$ and offline metadata;} \Else{%
\Return{} next segment\;
}
}
\Else{%
\tcc{Loading policy from previous chapter}
(\Bw, \Rtt) \leftarrow{} \EstimateNetwork{}\;
{- Update the buffer $\mathcal{B}_{i+1}$ for the next decision: $s^{*}_i$ and lowest \texttt{representations} of $s^{*}_i$ are considered downloaded\;} \BlankLine{}
{- \Return{segment $s^{*}_i$, buffer $\mathcal{B}_{i+1}$}\;} \Candidates\leftarrow{} \AllSegments\newline\makebox[1cm]{}.\Filter{$\Segment\rightarrow\Segment\notin\DownloadedSegments$}\newline\makebox[1cm]{}.\Filter{$\Segment\rightarrow\Segment\in\Frustum$}\;
\BlankLine{}
\Segment\leftarrow{} \Argmax{\Candidates, \Segment\rightarrow{} $\Omega\left(\mathcal{U}(\Segment)\right)$}\;
\DownloadedSegments.\Append{\Segment}\;
\Return\Segment;
{\caption{Algorithm to identify the next segment to query\label{sb:next-segment}}}
{\caption{Algorithm to identify the next segment to query\label{sb:next-segment}}} }
\end{algorithm} \end{algorithm}
\todo[inline]{to be modified to include bookmarks}