New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Removing the requirement groups to be exactly 2. #115
Comments
Hi, in our current model, a new network is needed for a new skeleton topology and this obstacle seems difficult to bypass. However, if there is a dataset for each group, it is possible to train multiple networks simultaneously in a common latent space. |
This is what I planned for multiple models, but wasn't sure. Can you tell me more about the common latent space? |
In our original implementation, we use two auto encoders. They share a common latent space, i.e., it's possible to decode the latent code from Encoder_A with Decoder_B. This latent space can be generalize to more than two auto encoders, i.e., to make it possible to decode the latent code from Encoder_i with Decoder_j. For training, one very simple solution is to train all the pairs simultaneously, but training all the pairs by random sampling should also work. |
I'm still having trouble understanding this. |
Personally I think you might need to train all pairs, like you are doing now. But it's an open problem. For example, if A<->B, A<->C and A<-> D are all well trained, since they share a common latent space, it seems all the pairs then shall work. |
This was what I used.
The idea is I can go any group to any other group both forwards and backwards. I had trouble getting the right results, but that's an evaluation / engineering problem and not a theory one. |
Hi, I am trying to remove the requirement that there are only A and B groups of skeletons.
I want there to be A, B, C, D, any number of groups.
Currently each group must have the same skeleton.
Problem 1: Support > 2 groups.
Problem 2: Support picking any pair from any group and in forwards or backwards order.
The text was updated successfully, but these errors were encountered: