Brain Surface Conformal Mapping - Cryptography | MATH 0209A, Lab Reports of Cryptography and System Security

Material Type: Lab; Class: CRYPTOGRAPHY; Subject: Mathematics; University: University of California - Los Angeles; Term: Unknown 1989;

Typology: Lab Reports

Pre 2010

Uploaded on 08/31/2009

koofers-user-cn5-1
koofers-user-cn5-1 🇺🇸

9 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Brain Surface Conformal Mapping
Brain Surface Conformal Mapping
Xianfeng
Xianfeng Gu
Gu
1
1
,
, Yalin
Yalin Wang
Wang
2
2
, Tony F. Chan
, Tony F. Chan
2
2
, Paul M. Thompson
, Paul M. Thompson
3
3
,
, Shing
Shing-
-Tung
Tung Yau
Yau
4
4
1.
1.
Division of Engineering and Applied Science, Harvard University
Division of Engineering and Applied Science, Harvard University
2.
2.
Mathematics Department, UCLA,
Mathematics Department, UCLA,
3.
3.
Lab. Of
Lab. Of Neuro
Neuro Imaging and Brain Research Institute, UCLA School of Medicine,
Imaging and Brain Research Institute, UCLA School of Medicine,
4.
4.
Mathematics Department, Harvard University
Mathematics Department, Harvard University
, {ylwang,chan}@math.ucla.edu
ylwang,chan}@math.ucla.edu,
.
Abstract
We propose a new variational method which can find
a unique mapping between any two genus zero
manifolds by minimizing the harmonic energy of the
map. We demonstrate the feasibility of our
algorithm by applying it to the cortical surface
matching problem. We use a mesh structure to
represent the brain surface. Further constraints are
added to ensure that the conformal map is unique.
Empirical tests on MRI data show that the
mappings preserve angular relationships, are
stable in MRIs acquired at different times, and are
robust to differences in data triangulation, and
resolution. Compared with other brain surface
conformal mapping algorithms, our algorithm is
more stable and has good extensibility.
Abstract
We propose a new
We propose a new variational
variational method which can find
method which can find
a unique mapping between any two genus zero
a unique mapping between any two genus zero
manifolds by minimizing the harmonic energy of the
manifolds by minimizing the harmonic energy of the
map. We demonstrate the feasibility of our
map. We demonstrate the feasibility of our
algorithm by applying it to the cortical surface
algorithm by applying it to the cortical surface
matching problem. We use a mesh structure to
matching problem. We use a mesh structure to
represent the brain surface. Further constraints are
represent the brain surface. Further constraints are
added to ensure that the conformal map is unique.
added to ensure that the conformal map is unique.
Empirical tests on MRI data show that the
Empirical tests on MRI data show that the
mappings preserve angular relationships, are
mappings preserve angular relationships, are
stable in
stable in MRIs
MRIs acquired at different times, and are
acquired at different times, and are
robust to differences in data triangulation, and
robust to differences in data triangulation, and
resolution. Compared with other brain surface
resolution. Compared with other brain surface
conformal mapping algorithms, our algorithm is
conformal mapping algorithms, our algorithm is
more stable and has good extensibility.
more stable and has good extensibility.
Conformal Mapping
O
Any surface without holes or self-intersections can be
mapped conformally onto the sphere
O
This mapping, conformal equivalence, is one-to-one,
onto, and angle preserving
O
Locally, shape is preserved and distances and areas
are only changed by a scaling factor
O
A canonical space is useful for subsequent work
Conformal Mapping
O
Any surface without holes or self-intersections can be
mapped conformally onto the sphere
O
This mapping, conformal equivalence, is one-to-one,
onto, and angle preserving
O
Locally, shape is preserved and distances and areas
are only changed by a scaling factor
O
O
A canonical space is useful for subsequent work
A canonical space is useful for subsequent work
Conformal Mapping Properties
O
Intrinsic to geometry
O
Independent of triangulation and resolution
O
Depends on metric continuously
Conformal Mapping Properties
O
Intrinsic to geometry
O
Independent of triangulation and resolution
O
Depends on metric continuously
Genus Zero Conformal Mapping
Properties
O
Harmonic is equivalent to conformal
O
All conformal are equivalent
O
All the conformal construct a automorphism group:
Möbius group which is a linear rational group on
complex plane and a 6 dimensional group.
Genus Zero Conformal Mapping
Properties
O
Harmonic is equivalent to conformal
O
All conformal are equivalent
O
All the conformal construct a automorphism group:
Möbius group which is a linear rational group on
complex plane and a 6 dimensional group.
Algorithm Deatails
O
Harmonic energy
O
Discrete harmonic energy
O
Discrete Laplacian
Algorithm Deatails
O
Harmonic energy
O
Discrete harmonic energy
O
Discrete Laplacian
Algorithm at a Glance
O
Minimize Harmonic Energy
O
Use absolute derivative
O
All computation are on the target surface, without
projecting to complex plane
Algorithm at a Glance
O
Minimize Harmonic Energy
O
Use absolute derivative
O
All computation are on the target surface, without
projecting to complex plane
2
:SMf
M
M
dffE
σ
2
)(
=
=
Mvu uv
vfufkfE
],[
2
)()()(
)cot(cot
2
1
βα
+=
uv
k
=
Mvu uv
vfufkuf
],[
))()(()(
Spherical parameterization algorithm
for genus zero surface
O
Use Gauss map as the initial degree one map
O
Compute the gradient vector of harmonic energy on
each vertex
O
Project the gradient vector to the tangent space on S
2
at each vertex
O
Update the image of each vertex along the tangential
gradient direction
O
Normalize the mapping by shifting the center of the
mass to the sphere center
Spherical parameterization algorithm
Spherical parameterization algorithm
for genus zero surface
for genus zero surface
O
Use Gauss map as the initial degree one map
O
Compute the gradient vector of harmonic energy on
each vertex
O
Project the gradient vector to the tangent space on S
2
at each vertex
O
Update the image of each vertex along the tangential
gradient direction
O
Normalize the mapping by shifting the center of the
mass to the sphere center
Optimize the Conformal
Parameterization by Landmarks
O
We define a metric to measure the quality of the
parameterization.
O
Suppose two brain surfaces S
1
,S
2
, two conformal
parameterizations are denoted as f1: S
2
S
1
and
f2: S
2
S
2
, the matching metric is defined as
Optimize the Conformal
Optimize the Conformal
Parameterization by Landmarks
Parameterization by Landmarks
O
We define a metric to measure the quality of the
parameterization.
O
Suppose two brain surfaces S
1
,S
2
, two conformal
parameterizations are denoted as f1: S
2
S
1
and
f2: S
2
S
2
, the matching metric is defined as
=
2
2
2121
),(),(),(
S
dudvvufvufffE
O
Let
be the group of Möbius transformations. We can
compose a Möbius transformation such that
O
Landmarks are commonly used in brain mapping.
They are a set of sulcal curves manually drawn on the
brain surfaces.
O
We can use landmarks to obtain such a Möbius
transformation.
O
Let
be the group of Möbius transformations. We can
compose a Möbius transformation such that
O
Landmarks are commonly used in brain mapping.
They are a set of sulcal curves manually drawn on the
brain surfaces.
O
We can use landmarks to obtain such a Möbius
transformation.
),(min),(
2121
ζτ
ζ
DD ffEffE
=
the Conformal Parameterization by
Landmarks (Cont.)
O
Landmarks are represented as discrete point sets. We
can reduce the brain matching metric by reducing the
matching metric on landmark sets.
O
First we project the sphere onto the complex plane.
We find a Möbius transformation on the complex
plane which reduce the matching metric on landmark
sets. Then we project the results back to the sphere.
O
For a Möbius transformation on the complex plane u,
since it maps infinity to infinity, it means the north
poles of the spheres are mapped to each other.
O
Then u can be represented as a linear form az+b. Let
p
i
and q
i
, i=1 …n, are corresponding landmark points.
The functional of u can be simplified as
O
O
where z
i
is the stereo-projection of p
i
,
τ
i
is the
projection of q
i
, g is the conformal factor from the
plane to the sphere.
the Conformal Parameterization by
Landmarks (Cont.)
O
Landmarks are represented as discrete point sets. We
can reduce the brain matching metric by reducing the
matching metric on landmark sets.
O
First we project the sphere onto the complex plane.
We find a Möbius transformation on the complex
plane which reduce the matching metric on landmark
sets. Then we project the results back to the sphere.
O
For a Möbius transformation on the complex plane u,
since it maps infinity to infinity, it means the north
poles of the spheres are mapped to each other.
O
Then u can be represented as a linear form az+b. Let
p
i
and q
i
, i=1 …n, are corresponding landmark points.
The functional of u can be simplified as
O
O
where z
i
is the stereo-projection of p
i
,
τ
τ
i
i
is the
projection of q
i
, g is the conformal factor from the
plane to the sphere.
=
+=
n
iiii
bazzguE
1
2
)()(
τ
Subject
Subject Vertex #
Vertex # Face #
Face # Before
Before After
After
A
A65,538
65,538 131,072
131,072 -
--
-
B
B65,538
65,538 131,072
131,072 604.134
604.134 506.665
506.665
C
C65,538
65,538 131,072
131,072 414.803
414.803 365.325
365.325
Discussion
O
Compared with Haker’s method
[I]
, our method is more
geometric; no big distortion areas; more stable; good
extension ability (e.g. it is possible to do brain mapping
between two brains using our algorithm.)
O
Compared with Hurdal’s method
[II]
, our method preserves
angles; good mapping between brains and the canonical
space.
Discussion
O
Compared with Haker’s method
[I]
, our method is more
geometric; no big distortion areas; more stable; good
extension ability (e.g. it is possible to do brain mapping
between two brains using our algorithm.)
O
Compared with Hurdal’s method
[II]
, our method preserves
angles; good mapping between brains and the canonical
space.
Landmark Experimental Results
Landmark Experimental Results
More Genus Zero Surface Examples
More Genus Zero Surface Examples
Brief Reference
I.
S. Haker, S. Angenent, A. Tannenbaum, R. Ki kinis, g. Sapiro, and M. Halle
. “Conformal
Surface Parameterization for Texture Mapping”. IEEE Transac tions on Visualization and
Computer Graphics, 6(2):181-189, April-June 2000
II.
M.K. Hurdal, K. Stephenson, P.L. Bowers, D.W.L. Summers, and D.A. Rottenberg.
Coordinate Systems For Conformal Cerebellar Flat Maps. In NeuroImage, Vol. 11: S 467,
2000
Brief Reference
I.
S. Haker, S. Angenent, A. Tannenbaum, R. Ki kinis, g. Sapiro, and M. Halle
. “Conformal
Surface Parameterization for Texture Mapping”. IEEE Transac tions on Visualization and
Computer Graphics, 6(2):181-189, April-June 2000
II.
M.K. Hurdal, K. Stephenson, P.L. Bowers, D.W.L. Summers, and D.A. Rottenberg.
Coordinate Systems For Conformal Cerebellar Flat Maps. In NeuroImage, Vol. 11: S 467,
2000
Experimental Results
Experimental Results
Conformal mappings of surfaces with different resolutions. The original brain surface has 50,000 faces, and is
conformallymapped to a sphere, as shown in (a). Then the brain surface is simplified to 20,000 faces, and its
spherical conformal mapping is shown in (b).
Conformalitymeasu rement. The curves of iso-polar angle and iso-azimuthal angle are mapped to the
brain, and the intersection angles are measured on the brain. The histogram is illustrated.
(a) (b)
Reconstructed brain meshes and their spherical harmonic mappings. (a) and (c) are the
reconstructed surfaces for the same brain scanned at different times. Due to scanner noise
and inaccuracy in the reconstruction algorithm, there are visible geometric differences. (b)
and (d) are the spherical conformal mappings of (a) and (c) respectively; the normal
information is preserved. By the shading information, the correspondence is illustrated.
(a) (b) (c) (d)
Conformal texture mapping. The conformality is visualized by texture mapping of a che ckerboard image.

Partial preview of the text

Download Brain Surface Conformal Mapping - Cryptography | MATH 0209A and more Lab Reports Cryptography and System Security in PDF only on Docsity!

Brain Surface Conformal MappingBrain Surface Conformal Mapping

XianfengXianfeng GuGu^

,, YalinYalin WangWang^

, Tony F. Chan, Tony F. Chan^

, Paul M. Thompson, Paul M. Thompson

,, ShingShing--TungTung YauYau^

1.1. Division of Engineering and Applied Science, Harvard UniversityDivision of Engineering and Applied Science, Harvard University 2.2. Mathematics Department, UCLA,Mathematics Department, UCLA,

Lab. Of NeuroLab. OfNeuro Imaging and Brain Research Institute, UCLA School of Medicine,Imaging and Brain Research Institute, UCLA School of Medicine,

Mathematics Department, Harvard UniversityMathematics Department, Harvard University

[email protected], {[email protected], {ylwang,chan}@math.ucla.eduylwang,chan}@math.ucla.edu,, [email protected]@loni.ucla.edu,, [email protected]@math.harvard.edu..

Abstract We propose a new variational method which can find a unique mapping between any two genus zero manifolds by minimizing the harmonic energy of the map. We demonstrate the feasibility of our algorithm by applying it to the cortical surface matching problem. We use a mesh structure to represent the brain surface. Further constraints are added to ensure that the conformal map is unique. Empirical tests on MRI data show that the mappings preserve angular relationships, are stable in MRIs acquired at different times, and are robust to differences in data triangulation, and resolution. Compared with other brain surface conformal mapping algorithms, our algorithm is more stable and has good extensibility.

Abstract We propose a newWe propose a new variationalvariational method which can findmethod which can find a unique mapping between any two genus zeroa unique mapping between any two genus zero manifolds by minimizing the harmonic energy of themanifolds by minimizing the harmonic energy of the map. We demonstrate the feasibility of ourmap. We demonstrate the feasibility of our algorithm by applying it to the cortical surfacealgorithm by applying it to the cortical surface matching problem. We use a mesh structure tomatching problem. We use a mesh structure to represent the brain surface. Further constraints arerepresent the brain surface. Further constraints are added to ensure that the conformal map is unique.added to ensure that the conformal map is unique. Empirical tests on MRI data show that theEmpirical tests on MRI data show that the mappings preserve angular relationships, aremappings preserve angular relationships, are stable instable in MRIsMRIs acquired at different times, and areacquired at different times, and are robust to differences in data triangulation, androbust to differences in data triangulation, and resolution. Compared with other brain surfaceresolution. Compared with other brain surface conformal mapping algorithms, our algorithm isconformal mapping algorithms, our algorithm is more stable and has good extensibility.more stable and has good extensibility.

Conformal Mapping O Any surface without holes or self-intersections can be mapped conformally onto the sphere O This mapping, conformal equivalence, is one-to-one, onto, and angle preserving O Locally, shape is preserved and distances and areas are only changed by a scaling factor O A canonical space is useful for subsequent work

Conformal Mapping O Any surface without holes or self-intersections can be mapped conformally onto the sphere O This mapping, conformal equivalence, is one-to-one, onto, and angle preserving O Locally, shape is preserved and distances and areas are only changed by a scaling factor OO (^) A canonical space is useful for subsequent workA canonical space is useful for subsequent work

Conformal Mapping Properties O Intrinsic to geometry O Independent of triangulation and resolution O Depends on metric continuously

Conformal Mapping Properties O Intrinsic to geometry O Independent of triangulation and resolution O Depends on metric continuously

Genus Zero Conformal Mapping Properties O Harmonic is equivalent to conformal O All conformal are equivalent O All the conformal construct a automorphism group: Möbius group which is a linear rational group on complex plane and a 6 dimensional group.

Genus Zero Conformal Mapping Properties O Harmonic is equivalent to conformal O All conformal are equivalent O All the conformal construct a automorphism group: Möbius group which is a linear rational group on complex plane and a 6 dimensional group.

Algorithm Deatails O Harmonic energy

O Discrete harmonic energy

O Discrete Laplacian

Algorithm Deatails O Harmonic energy

O Discrete harmonic energy

O Discrete Laplacian

Algorithm at a Glance O Minimize Harmonic Energy O Use absolute derivative O All computation are on the target surface, without projecting to complex plane

Algorithm at a Glance O Minimize Harmonic Energy O Use absolute derivative O All computation are on the target surface, without projecting to complex plane

f : MS^2

M M

E f f d σ

2 ( )=∫ ∇

∑ ∈

uvM

E f kuv fu fv [,]

( ) () ()^2 (cot cot ) 2 =^1 α + β kuv

∑ ∈

uvM

f u kuv fu fv [,]

Spherical parameterization algorithm for genus zero surface O Use Gauss map as the initial degree one map O Compute the gradient vector of harmonic energy on each vertex O Project the gradient vector to the tangent space on S^2 at each vertex O Update the image of each vertex along the tangential gradient direction O Normalize the mapping by shifting the center of the mass to the sphere center

Spherical parameterization algorithmSpherical parameterization algorithm for genus zero surfacefor genus zero surface O Use Gauss map as the initial degree one map O Compute the gradient vector of harmonic energy on each vertex O Project the gradient vector to the tangent space on S^2 at each vertex O Update the image of each vertex along the tangential gradient direction O Normalize the mapping by shifting the center of the mass to the sphere center

Optimize the Conformal Parameterization by Landmarks O We define a metric to measure the quality of the parameterization. O Suppose two brain surfaces S^1 ,S^2 , two conformal parameterizations are denoted as f1: S^2 →S 1 and f2: S^2 →S^2 , the matching metric is defined as

Optimize the ConformalOptimize the Conformal Parameterization by LandmarksParameterization by Landmarks O We define a metric to measure the quality of the parameterization. O Suppose two brain surfaces S^1 ,S^2 , two conformal parameterizations are denoted as f1: S^2 →S 1 and f2: S^2 →S^2 , the matching metric is defined as = (^) ∫ 2 − 2 ( 1 , 2 ) 1 (,) 2 (,) S

Eff fuv fuv dudv

O Let Ω be the group of Möbius transformations. We can

compose a Möbius transformation such that

O Landmarks are commonly used in brain mapping. They are a set of sulcal curves manually drawn on the brain surfaces. O We can use landmarks to obtain such a Möbius transformation.

O Let ΩΩ be the group of Möbius transformations. We can

compose a Möbius transformation such that

O Landmarks are commonly used in brain mapping. They are a set of sulcal curves manually drawn on the brain surfaces. O We can use landmarks to obtain such a Möbius transformation.

E ( f 1 , f 2 Dτ )=minζ ∈Ω E ( f 1 , f 2 D ζ )

the Conformal Parameterization by Landmarks (Cont.) O Landmarks are represented as discrete point sets. We can reduce the brain matching metric by reducing the matching metric on landmark sets. O First we project the sphere onto the complex plane. We find a Möbius transformation on the complex plane which reduce the matching metric on landmark sets. Then we project the results back to the sphere. O For a Möbius transformation on the complex plane u, since it maps infinity to infinity, it means the north poles of the spheres are mapped to each other. O Then u can be represented as a linear form az+b. Let p (^) i and qi , i=1 …n, are corresponding landmark points. The functional of u can be simplified as

O O where z (^) i is the stereo-projection of pi , τ i is the projection of qi , g is the conformal factor from the plane to the sphere.

the Conformal Parameterization by Landmarks (Cont.) O Landmarks are represented as discrete point sets. We can reduce the brain matching metric by reducing the matching metric on landmark sets. O First we project the sphere onto the complex plane. We find a Möbius transformation on the complex plane which reduce the matching metric on landmark sets. Then we project the results back to the sphere. O For a Möbius transformation on the complex plane u, since it maps infinity to infinity, it means the north poles of the spheres are mapped to each other. O Then u can be represented as a linear form az+b. Let p (^) i and qi , i=1 …n, are corresponding landmark points. The functional of u can be simplified as

O O where z (^) i is the stereo-projection of pi , ττ ii is the projection of qi , g is the conformal factor from the plane to the sphere.

n i

E u gzi azib i 1

2 () () τ

SubjectSubject Vertex #Vertex # Face #Face # BeforeBefore AfterAfter AA 65,53865,538 131,072131,072 - - - - BB 65,53865,538 131,072131,072 604.134604.134 506.665506. CC^ 65,53865,538^ 131,072131,072^ 414.803414.803^ 365.325365.

Discussion O Compared with Haker’s method [I]^ , our method is more geometric; no big distortion areas; more stable; good extension ability (e.g. it is possible to do brain mapping between two brains using our algorithm.) O Compared with Hurdal’s method [II]^ , our method preserves angles; good mapping between brains and the canonical space.

Discussion O Compared with Haker’s method [I]^ , our method is more geometric; no big distortion areas; more stable; good extension ability (e.g. it is possible to do brain mapping between two brains using our algorithm.) O Compared with Hurdal’s method [II]^ , our method preserves angles; good mapping between brains and the canonical space.

Landmark Experimental Results Landmark Experimental Results

More Genus Zero Surface ExamplesMore Genus Zero Surface Examples

Brief Reference

I. S. Haker, S. Angenent, A. Tannenbaum, R. Kikinis, g. Sapiro, and M. Halle. “Conformal Surface Parameterization for Texture Mapping”. IEEE Transactions on Visualization and Computer Graphics, 6(2):181-189, April-June 2000 II. M.K. Hurdal, K. Stephenson, P.L. Bowers, D.W.L. Summers, and D.A. Rottenberg. Coordinate Systems For Conformal Cerebellar Flat Maps. In NeuroImage, Vol. 11: S467, 2000

Brief Reference

I. S. Haker, S. Angenent, A. Tannenbaum, R. Kikinis, g. Sapiro, and M. Halle. “Conformal Surface Parameterization for Texture Mapping”. IEEE Transactions on Visualization and Computer Graphics, 6(2):181-189, April-June 2000 II. M.K. Hurdal, K. Stephenson, P.L. Bowers, D.W.L. Summers, and D.A. Rottenberg. Coordinate Systems For Conformal Cerebellar Flat Maps. In NeuroImage, Vol. 11: S467, 2000

Experimental Results Experimental Results

Conformal mappings of surfaces with different resolutions. The original brain surface has 50,000 faces, and is conformally mapped to a sphere, as shown in (a). Then the brain surface is simplified to 20,000 faces, and its spherical conformal mapping is shown in (b).

Conformality measurement. The curves of iso-polar angle and iso-azimuthal angle are mapped to the brain, and the intersection angles are measured on the brain. The histogram is illustrated.

(a) (b)

Reconstructed brain meshes and their spherical harmonic mappings. (a) and (c) are thereconstructed surfaces for the same brain scanned at different times. Due to scanner noise and inaccuracy in the reconstruction algorithm, there are visible geometric differences. (b) and (d) are the spherical conformal mappings of (a) and (c) respectively; the normal information is preserved. By the shading information, the correspondence is illustrated.

(a) (^) (b) (c) (d)

Conformal texture mapping. The conformality is visualized by texture mapping of a checkerboard image.