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.
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!
Using DP ways to solve this problem. Discrete this as grids, from the end to the start, calculate the faastest ways needs shortest times.
Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub.