Scribd
Upload
20 views2 pages

Functional Maps

1. Feature points are extracted from a document and a matrix M is computed from their descriptors to preserve the descriptors through functional maps. 2. To preserve multidimensional point descriptors, k scalar function preservation constraints can be computed, one for each dimension of the descriptor. 3. The feature points are projected onto a mesh M through the Laplace operator, resulting in a simplified mesh M' with preserved descriptors.

Uploaded by

Vivek
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
20 views2 pages

Functional Maps

1. Feature points are extracted from a document and a matrix M is computed from their descriptors to preserve the descriptors through functional maps. 2. To preserve multidimensional point descriptors, k scalar function preservation constraints can be computed, one for each dimension of the descriptor. 3. The feature points are projected onto a mesh M through the Laplace operator, resulting in a simplified mesh M' with preserved descriptors.

Uploaded by

Vivek
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

Descriptor Preservation through functional maps in order to

preserve extracted feature points

----->

1. Computing matrix M from extracted feature points.


2. Descriptor preservation: if the point descriptors are multidimensional so that f(x) ∈ R k for each
x then k scalar function preservation constraints can be computed, one for each dimension of
the descriptor.
3. Projection of feature points on mesh M through Laplace operator resulting mesh M’ (V’,E)
Algorithm
• Input: mesh M = (V,F), Output:
simplified mesh
• for edge e ∈ M do add (e,m(e)) to
queue ;
• while V’ > N and queue not empty
do (e, c) ← pop edge e with lowest
cost c from queue ;
• collapse e (for n ∈ e’s neighbors
do update n in queue ;

You might also like