0%

Quite Start


Project Target

In this project, we focus on the human face identified. And in this part, we use three different Nets to achieve our goal.

This project based on MTCNN to make our job works.

Quite Start

Background

The problem of the quickest descending line or shortcut is the first variational problem to appear in history and is a sign of the development of variational methods. The problem was proposed by John Bernoulli in 1696 in an open letter to his brother Jacob Bernoulli. The formulation of the problem is: let A and B are not in the same lead plane on the two points, in all the plane curve connecting A and B, to find a curve, so that only by gravity and the initial speed of the zero point from point A to point B along the curve of the shortest time required to move!


Demand

Using DP ways to solve this problem. Discrete this as grids, from the end to the start, calculate the faastest ways needs shortest times.


Mathematical Model

Let the curve be y=y(x) with coordinates as shown in Fig. 1, the mass starts moving from point O, its velocity v is related to its longitudinal coordinate:

v = 2 g y

At the point (x, y) on the curve, the velocity of the mass point is

v = d s d t = 1 + y 2 d x d t

where s denotes the arc length of the curve and t denotes the time.
阅读全文 »

Background

Introduction

本部分用于记录深度强化学习中基于策略的学习使用的梯度,用于Critic、Actor 构成的状态评估函数的梯度求解。

阅读全文 »

项目原理

基于融合学习,进行游戏公司玩家流失量预测
阅读全文 »

项目背景:出于需求微博部分大V提问信息、问题价值、问题回复以及对应回答人员的信息的爬取用于科研,不涉及反反爬内容,仅用最基本功能等。
Based on: Python 3.8


阅读全文 »