Original paper: Each segment is coded as a base-tier (BT) chunk, and multiple enhancement-tier (ET) chunks. BT chunks: represent the entire 360 view at a low bit rate and are pre-fetched in a long display buffer to smooth the network jitters effectively and guarantee that any desired FOV can be rendered with minimum stalls. ET … Read morePaper Reading: View Direction and Bandwidth Adaptive 360 Degree Video Streaming using a Two-Tier System

# Category: Uncategorized

## 03102018

Gensim Tutorial: https://radimrehurek.com/gensim/models/word2vec.html Use google-news model as pre-trained model clustering based on distance matrix Question: how do we do the clustering? should cluster on the keywords? should cluster on the keywords-related words? Leg dissection demo: 18 cameras 30frames 10G 5 cameras 100 frames 6G Question: what is our task? we cannot change focal length now. … Read more03102018

## Hello

Cross entropy H(p,q) = D(p||q) + H(p) H(p) is some inherent randomness in p D(p||q) is what we care about. we can try to get D(p||q) by calculating cross entropy. Conclusion: a model is good is that it assign good approximation to the observed data. So we need to find some good q Main points: … Read moreHello

## The test speed of neural network?

Basically, the time spent on testing depends on: the complexity of the neural network For example, the fastest network should be the fully-connected network. CNN should be faster than LSTM because LSTM is sequential (sequential = slow) Currently, there are many ways to compress deep learning model (remove nodes with lighter weight) the complexity of … Read moreThe test speed of neural network?

## Commonly Used Variables in Falcor

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 |
struct ShadingAttribs { float3 P; ///< Shading hit position in world space float3 E; ///< Direction to the eye at shading hit float3 N; ///< Shading normal at shading hit float3 T; ///< Shading tangent at shading hit float3 B; ///< Shading bitangent at shading hit float2 UV; ///< Texture mapping coordinates #ifdef _MS_USER_DERIVATIVES float2 DPDX DEFAULTS(float2(0, 0)); float2 DPDY DEFAULTS(float2(0, 0)); ///< User-provided 2x2 full matrix of duv/dxy derivatives of a shading point footprint in texture space #else float lodBias DEFAULTS(0); ///< LOD bias to use when sampling textures #endif #ifdef _MS_USER_HALF_VECTOR_DERIVATIVES float2 DHDX DEFAULTS(float2(0, 0)); float2 DHDY DEFAULTS(float2(0, 0)); ///< User-defined half-vector derivatives #endif PreparedMaterialData preparedMat; ///< Copy of the original material with evaluated parameters (i.e., textures are fetched etc.) float aoFactor; }; |

## WTF! I have met this problem before, but I forget how to solve!

CMake Warning at CMakeLists.txt:390 (MESSAGE): Build of assimp_qt_viewer is disabled. Unsatisfied dendencies: Qt5 DevIL

## Useful websites

https://dillinger.io/

## 08/27/2017

Permutation: http://blog.csdn.net/hackbuteer1/article/details/6657435 Tomorrow: CORDIC FastLog Finding integer log base 2 of an integer (aka the position of the highest bit set) Find the log base 2 of an integer with the MSB N set in O(N) operations (the obvious way) Find the integer log base 2 of an integer with an 64-bit IEEE float Find … Read more08/27/2017

## 532. K-diff Pairs in an Array

Description: https://leetcode.com/problems/k-diff-pairs-in-an-array/description Code:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 |
class Solution { public: int findPairs(vector<int>& nums, int k) { if (nums.size() == 0) return 0; if (k < 0) return 0; int result = 0; if (k == 0) { sort(nums.begin(), nums.end()); int switcher = 0; for (int i = 0; i < nums.size() - 1; i++) { if (nums[i + 1] == nums[i]) { if (switcher == 0) { result++; switcher = 1; } } else { switcher = 0; } } } else { unordered_map< int, int> mapping; sort(nums.begin(), nums.end()); nums.erase(unique(nums.begin(), nums.end()), nums.end()); for (int i = 0; i < nums.size(); ++i) { mapping[nums[i]] = i; } for (int i = 0; i < nums.size(); ++i) { int target = nums[i] + k; if (mapping.find(target) != mapping.end()) result++; } } return result; } }; |

Time & Space: O(nlog(n)) & O(n)

## 217. Contains Duplicate

Description: https://leetcode.com/problems/contains-duplicate/#/description Algorithm: Use sort, very easy Don’t use sort, use a array to record the appearance of words. If a word appears for more than 1 times, return true. Code1: class Solution { public: bool containsDuplicate(vector<int>& nums) { if (nums.size() < 2) return false; sort(nums.begin(), nums.end()); for (int i = 0; i < nums.size() … Read more217. Contains Duplicate