Skip to content
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

Random walks lifting (Point Cloud to Graph) #38

Open
wants to merge 3 commits into
base: main
Choose a base branch
from

Conversation

nkanak
Copy link

@nkanak nkanak commented Jul 8, 2024

GraphRandomWalksLifting

This lifting transforms point cloud data into graph representations using random walks. The method facilitates a way to capture the underlying topological features of point cloud data, something that is essential for various applications in machine learning, including computer vision and computational geometry.

Implementation

  1. Point cloud to k-NN graph:

    • The algorithm initially creates a k-nearest neighbors graph using the point cloud data. It represents each point in the cloud as a node and connects it to its k nearest neighbors based on the Euclidean distance.
  2. Edge weight calculation:

    • The edges in the k-NN graph have weights calculated by the Euclidean distances between connected points. These weights correspond to the geometric proximity of the points.
  3. Normalization of edge weights:

    • The edge weights are stochastically normalized to transition probabilities using a softmax function. Here we ensure that the transition probabilities from any node sum up to 1.
  4. Random walks:

    • Multiple random walks are conducted from each node in the graph. During these walks, transitions between nodes are affected by the normalized edge weights. The frequency of transitions between nodes is recorded. In that way, we capture the topological relationships in the data.
  5. Topological graph construction:

    • A new topological graph is constructed based on the calculated transition counts from the random walks.

Team

Copy link

Check out this pull request on  ReviewNB

See visual diffs & provide feedback on Jupyter Notebooks.


Powered by ReviewNB

@levtelyatnikov
Copy link
Member

Hello, @nkanak ! Thank you for your submission. As we near the end of the challenge, I am collecting participant info for the purpose of selecting and announcing winners. Please email me (or have one member of your team email me) at [email protected] so I can share access to the voting form. In your email, please include:

  • your first and last name (as well as any other team members)
  • the title of the method you implemented
  • the input domain of the method you implemented
  • the output domain of the method you implemented
  • your pull request number (Random walks lifting (Point Cloud to Graph) #38)

Before July 12, make sure that your submission respects all Submission Requirements laid out on the challenge page. Any submission that fails to meet this criteria will be automatically disqualified.

@gbg141 gbg141 added challenge-icml-2024 award-category-2 Lifting to Combinatorial, Hypergraph or Graph Domain award-category-3 Feature-based Lifting (including those that simultaneously leverage the connectivity) labels Jul 9, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
award-category-2 Lifting to Combinatorial, Hypergraph or Graph Domain award-category-3 Feature-based Lifting (including those that simultaneously leverage the connectivity)
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants