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

Voronoi Lifting (Pointcloud to Hypergraph) #34

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

Conversation

PatRyg99
Copy link

@PatRyg99 PatRyg99 commented Jul 6, 2024

Description

This lifting builds Voronoi hypergraph based on the given pointcloud through support set sampled with Farthest-Point Sampling (FPS). Formally, Voronoi graph $G = (V, E)$ of point cloud $\mathcal{X}$ based on the support point set $\mathcal{Y}$ is built in following fashion:

$V = \mathcal{X} ∪ \mathcal{Y}$
$E = \{ (x, y) \in \mathcal{X} \times \mathcal{Y} \ | \ argmin_{y \in \mathcal{Y}}(d(x, y)) \ \text{for all} \ x \in \mathcal{X} \}$, where $d(\cdot, \cdot)$ is a distance metric

In this lifting procedure $\mathcal{Y} \subseteq \mathcal{X}$ is sampled via FPS, and $d(\cdot, \cdot)$ is Euclidean distance metric. Since we built a hypergraph instead of a graph there is exactly one hyperedge $H_{y_i}$ for every $y_i \in \mathcal{Y}$ (representing the Voronoi cluster for point $y_i$) and it is defined in the following way:

$H_{y_i} = \{x_0, x_1, ..., x_k, y_i\}$, where $(x_j, y_i) \in E$

Visualization of Voronoi lifting on stanford bunny (each color cluster is a different hyperedge):
Screenshot 2024-07-06 at 18 55 00

Authors & references

This lifting is adapted from Suk et al. LaB-GATr (GitHub repo).

Implemented by team MIA-UT: Julian Suk (@sukjulian), Patryk Rygiel (@PatRyg99)

Copy link

Check out this pull request on  ReviewNB

See visual diffs & provide feedback on Jupyter Notebooks.


Powered by ReviewNB

@PatRyg99 PatRyg99 changed the title Voronoi Lifting (Pointcloud to Graph) Voronoi Lifting (Pointcloud to Hypergraph) Jul 8, 2024
@levtelyatnikov
Copy link
Contributor

levtelyatnikov commented Jul 8, 2024

Hello, @PatRyg99 ! 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 (Voronoi Lifting (Pointcloud to Hypergraph) #34)

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 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) Winner Awarded submission
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants