Giter VIP home page Giter VIP logo

koh's Introduction

koh's People

Contributors

geronymos avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar

Forkers

5l1v3r1

koh's Issues

Change face-tracking engine

Problem

Mediapipe is primarely for tracking faces in 3d-space and it is good at that, but on sertain facial expressions (mouth wide open) the face-mesh does not open the mouth as wide as it really is.

Solution

Two-dimensional tracking has proofen itself worthy with applications like FaceRig. A famous python library for tracking face in two dimensions is dlib.

Implement virtual camera

Problem

To come true to the claim Virtual camera that displays closest face match from a data set we need to implement it.

Solution

Maybe use pyvirtualcam

Debbugging / time improvement

Problem

The programm takes a lot if start-up time and also lags in general with larger datasets and if you chose to match the whole face.

Solution

See what functions take the most amount if time, so they could be improved.

There are a couple of libraries for python that can measure the time a funtion takes and created a report either in the console or as a file you could see in a web-interface.

Normalized face match

Problem

With small datasets it is less likely to find a image in the dataset that matched the webcam well.

Solution

Normalize the match, so that it ignores the size and orientation of the face.

In the output either only show the normalized webcam and the normalized match. Or transform the image if the match and apply the size and rotation of the webcams face to the match.

Improve face-matching algorithm

How it works now

Now the faces are matched by calculating the average distance fom a point of the webcam-face to a point of a face of the dataset. This goes on for every point in the face and every face in the dataset. This list of distances then get sorted. The first result (with least distance) gets choosen as a match.

Problem

The sorting may need a lot of time. After we have the match with the least distance, we do not need the other faces in the list.

Solution

Replace the sort-function with replace or even just use a variable and set it if the new comparison has a smaller distance than the one that is in the function.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.