<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">JBiSE</journal-id><journal-title-group><journal-title>Journal of Biomedical Science and Engineering</journal-title></journal-title-group><issn pub-type="epub">1937-6871</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/jbise.2012.53017</article-id><article-id pub-id-type="publisher-id">JBiSE-18102</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Biomedical&amp;Life Sciences</subject></subj-group></article-categories><title-group><article-title>
 
 
  Characterization of a human brain cortical surface mesh using discrete curvature classification and digital elevation model
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>amel</surname><given-names>Aloui</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Amine</surname><given-names>Naït-Ali</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Mohamed</surname><given-names>Saber Naceur</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib></contrib-group><aff id="aff2"><addr-line>LTSIRS Laboratory, National Engineering School, Tunis, Tunisia</addr-line></aff><aff id="aff1"><addr-line>LiSSi EA, Laboratory, Université Paris-Est Créteil (UPEC), Créteil, France</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>aloui_meteo@yahoo.fr(AA)</email>;<email>naitali@u-pec.fr(AN)</email>;<email>naceurs@yahoo.fr(MSN)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>27</day><month>03</month><year>2012</year></pub-date><volume>05</volume><issue>03</issue><fpage>133</fpage><lpage>140</lpage><history><date date-type="received"><day>5</day>	<month>August</month>	<year>2011</year></date><date date-type="rev-recd"><day>9</day>	<month>October</month>	<year>2011</year>	</date><date date-type="accepted"><day>19</day>	<month>October</month>	<year>2011</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  In this paper we present a novel approach for brain surfacec characterization based on convexity and concavity analysis of cortical surface mesh. Initially, volumetric Magnetic Resonance Images (MRI) data is processed to generate a discrete representation of cortical surface using low-level segmentation tools and Level-Sets method. Afterward, pipeline procedure for brain characterization/labeling is developed. The first characterization method is based on discrete curvature classification. This is consists on estimating curvature information at each vertex in the cortical surface mesh. The second method is based on transforming the brain surface mesh into Digital Elevation Model (DEM), where each vertex is designed by its space coordinates and geometric measures related to a reference surface. In other word, it consists on analyzing the cortical surface as a topological map or an elevation map where the ridge or crest lines represent cortical gyri and valley lines represents sulci. The experimental results have shown the importance of these characterization methods for the detection of significant details related to the cortical surface.
 
</p></abstract><kwd-group><kwd>Brain; Curvature; DEN; Level-Sets; MRI; Mapping; Surface Mesh</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. INTRODUCTION</title><p>Segmentation of anatomical structures of the intracranial cavity is a preliminary and main step for the most analysis procedures for brain MRI images. When, the brain surface called also cortical surface is viewed, a human brain appears as a volume with a highly wrinkled boundary surface having numerous long furrows. The term sulci (plural of sulcus) is associated with these furrows and the term gyri (plural of gyrus) designates the regions between the sulci. Geometric modelling, mesh representation and mesh segmentation of anatomical structures in 3D images are becoming an increasingly important processing step. Segmentation of cortical surface should reduce the mesh into meaningful, connected pieces. “Meaningful” implies that the partitioned areas are relevant to the application at hand. In addition, visualization of brain structures such as brain surface, the segmentation allows the automatic identification and labeling of cortical sulci, which will be used in neuronavigation applications, understanding brain anatomy and function, neurosurgeon can easily track the features of interest. Also, segmented sulci from a brain mesh can serve as landmarks, which can be used to register the mesh with other brain meshes to make intra or inter-comparisons. For example, this could serve to measure brain growth and identify diseases.</p><p>The most common characterization or labeling of a cortical mesh is into sulcal and gyral regions. The brain gyri can be defined as the top surfaces of the brain folds (Ridges) or as convex regions. The barin sulci can be defined as the area within the brain folds (valleys) or as concave regions. Segmentation of a cortical surface in terms of sulci and gyri can occur in several ways. Classification or partitioning of the cortical surface in concave and convex regions can reduce the size of the Laplacian matrix, in the case of spectral analysis [<xref ref-type="bibr" rid="scirp.18102-ref1">1</xref>]. Also, it is useful to avoid the risk of main memory congestion, improve rendering speed and reduce the computational cost of rendering surface process that to be instantaneous.</p><p>In the last several years, many algorithms have been proposed in this growing area, offering several methods. For example, Rettmann’s works [<xref ref-type="bibr" rid="scirp.18102-ref2">2</xref>] involving the segmentation of sulci using watersheds. This work focuses on segmenting sulcale regions. This paper uses the geodesic depth of mesh points in the sulci regions as the height function of the watershed algorithm. Also Mangan and Whitaker [<xref ref-type="bibr" rid="scirp.18102-ref3">3</xref>] proposed an approach using the watershed algorithm for partitioning 3D surface meshes when total curvature is computed and used in segmentation.</p><p>We propose in this paper a pipeline steps for the problem of 3D mesh characterization of the brain in Magnetic Resonance Images. We have developed two techniques for cortical surface characterizing using discrete curvature computing and Digital Elevation Model (DEM). In the first technique, we segment the obtained surface meshes using a criteria based on discrete curvature. In the second technique, the cortical surface is labeled by transforming the surface mesh into Digital Elevation Model, where each vertex is designed by its space coordinates and geometric measures like orientation or altitude compared to a reference surface. In other word, it consists to analyzing the cortical surface as a topological map or an elevation map where the ridge lines represent cortical gyri and valley lines represents sulci. This last technique is done in three steps: first, extract cortical surface from volumetric brain MRI. Second, compute outer hull surface of brain using a simplified model of Level-Sets method. This outer hull surface will be used as a reference surface. Finally, Digital Elevation Model (DEM) is computed and cortical surface characterization/labeling is done.</p><p>This paper is organized as follows: in the next section, we present a 3D brain surface extraction from volumetric MR images using Level-Sets approach. In Section 3, the cortical surface characterization using discrete curvature information is described. In Section 4, we shows cortical surface labeling using Digital Elevation Model. Then, in the Section 5, we present our preliminary results by applying the proposed technique on a MRI images database. Finally, a discussion and a conclusion related to this work are given in Section 6.</p></sec><sec id="s2"><title>2. BRAIN SURFACE EXTRACTION</title><p>Manually segmentation of volumetric images is a complex process which requires lot of time and much concentration to achieve a good quality extraction of regions of interest. For this reason, it is generally interesting to deal with automatic segmentation algorithms. For this purpose, a range of methods including edge based, region based, and knowledge based have been proposed for semiautomatic or automatic detection of various anatomical brain structures. Recently, several attempts have been made to apply deformable models [4-6] to brain image analysis. Indeed, deformable models refer to a large class of computer vision methods and have proved to be successful segmentation techniques for a wide range of applications. Moreover, they constitute an appropriate framework for merging heterogeneous information and they provide a consistent geometrical representation suitable for a surface based analysis.</p><p>In some particular Level-Sets [<xref ref-type="bibr" rid="scirp.18102-ref7">7</xref>], geometric deformable models provide an elegant solution for medical images processing [8-11]. In this paper, to extract brain surface from volumetric MRI images we will use a region-competition Level-Sets method as described in [12,13]. This algorithm overcomes classical Level-Sets problems by modulating the propagation term with a signed local statistical force, leading to a stable solution.</p><p>We propose a method which operates on 3D MRI scans to extract brain surface. First, the data volume is pre-processed with an anisotropic diffusion filtering method [<xref ref-type="bibr" rid="scirp.18102-ref14">14</xref>] to reduce noise and preserve edges. Then no-brain tissues are removed from the data volume using a simple thresholding. Afterwards, a 3D binary morphological erosion and dilation process [<xref ref-type="bibr" rid="scirp.18102-ref15">15</xref>] are applied to get an initial brain surface and finally we refine brain region extraction by using region-based information into the Level-Sets framework. These computational steps are illustrated in <xref ref-type="fig" rid="fig1">Figure 1</xref>.</p><p>The aim of the third step is to extract “exactly” the cerebral cortex surface representing the interface between the Gray Matter (GM) and the Cerebrospinal fluid (CSF). For this reason, we propose to use a deformable model algorithm based on the level set technique. We propose also to drive our model by region information instead boundary information, because it is more robust. The process requires an initialization step and speed function. Theoretically, the Level-Set snake is defined as the zero Level-Set of an implicit function <img src="5-9101347\cdf73123-3f89-4b05-8a25-a85c0f479e53.jpg" /> defined on the entire volume. This function will change over the time according to the speed term F. The evolution of <img src="5-9101347\ca5fc668-81eb-4a42-8cbf-9be9b89803b5.jpg" /> is defined as in [<xref ref-type="bibr" rid="scirp.18102-ref7">7</xref>] via a partial differential equation:</p><disp-formula id="scirp.18102-formula116779"><label>(1)</label><graphic position="anchor" xlink:href="5-9101347\e8951cf1-0c48-4b1a-a0fb-6657df6f1452.jpg"  xlink:type="simple"/></disp-formula><p>The classical speed term is defined as in [16,17]:</p><disp-formula id="scirp.18102-formula116780"><label>(2)</label><graphic position="anchor" xlink:href="5-9101347\504f999b-7567-49aa-97d6-4e286735f4cc.jpg"  xlink:type="simple"/></disp-formula><p>Speed term is coupled with the image data through a multiplicative stopping term<img src="5-9101347\00e0c702-bb73-4d7d-a800-1036f9235e28.jpg" />. The curvature k and the constant force v propagate curve near the region of interest surface.</p><p>In this work, we use a simplified version of the Levelsets formulation [<xref ref-type="bibr" rid="scirp.18102-ref13">13</xref>]. The model shrinks when the boundary</p><p>encloses parts of the background, and grows when the boundary is inside the brain region. Here, the speed function usually consists in a combination of two terms: curvature term for smoothness and data term for evolution. The snake evolves using the following equation:</p><disp-formula id="scirp.18102-formula116781"><label>(3)</label><graphic position="anchor" xlink:href="5-9101347\745bd858-4723-48ac-a486-3f3427ea03aa.jpg"  xlink:type="simple"/></disp-formula><p>where D is a data term that forces the model to expand or contract toward desirable features in the input 3D MRI data. By making D positive in desired regions or negative in undesired regions. The term k is the means curvature of the surface, which forces the surface to have less area (and remain smooth), and <img src="5-9101347\52b69f08-e7ba-447e-9dca-77072a45eeea.jpg" /> is a free parameter that controls the degree of smoothness.</p><p>The speed function depends on the grayscale value input MRI data denoted D at the point x:</p><disp-formula id="scirp.18102-formula116782"><label>(4)</label><graphic position="anchor" xlink:href="5-9101347\f1b2ed53-2978-4b6e-b16e-0138f68b0ffe.jpg"  xlink:type="simple"/></disp-formula><p>where T controls the brightness of the region to be segmented and <img src="5-9101347\7ec5fb6d-2d09-43f1-bd38-b93899377f4f.jpg" /> controls the range of grayscale values around T that could be considered inside the object. A model situated on voxels with grayscale values in the interval <img src="5-9101347\2e696908-b6b1-4c56-bbf7-ee957e71ab28.jpg" /> will expand to enclose that voxel, whereas a model situated on grayscale values outside that interval will contract to exclude that voxel.</p><p>As represented in <xref ref-type="fig" rid="fig2">Figure 2</xref>, T describes the central intensity value of the region to be segmented, and <img src="5-9101347\7b763223-12ac-40a2-9f5f-ae19e4c5207f.jpg" /> describes the intensity deviation around T that is a part of the desired segmentation. Therefore if a voxel has an intensity value within the <img src="5-9101347\894714f3-ff76-45cc-bc5e-8d693c110732.jpg" /> range, the model will expand; otherwise it will contract.</p><p>Consequently, the three user parameters that need to be specified for the segmentation are T, <img src="5-9101347\ef445371-3601-4932-8aac-5d21adf51ce6.jpg" />and<img src="5-9101347\b0e238da-5b58-41c1-93c5-e640d936ce62.jpg" />. The initial surface obtained after pre-processing must be transformed into a signed distance [<xref ref-type="bibr" rid="scirp.18102-ref18">18</xref>] for the Level-Sets function is also required (<xref ref-type="fig" rid="fig3">Figure 3</xref>). The Level-Sets iteration can be terminated once <img src="5-9101347\6cd48a4a-5e93-43bb-8709-5a5a61c71c3f.jpg" /> has converged, or after a certain number of iterations.</p></sec><sec id="s3"><title>3. DISCRETE CURVATURE CLASSIFICATION</title><p>Curvatures can also be used as a height measure. The idea is that ridges and valleys have opposite signed curvatures, and the cortical surface is naturally divided between crest lines or ridges (gyri) and valley (sulci). For this reason, we compute gaussian curvature, mean curvature and the two principal curvatures, and later use them to classify the surface type of vertices. The major complication is that curvature cannot be directly evaluated for triangle meshes because it is mathematically defined for smooth surfaces only. However, discrete differential geometry operators have been developed which can estimate curvatures on traingulated manifolds [19,20]. We apply here some operators, which are derived recently by Meyer et al. [<xref ref-type="bibr" rid="scirp.18102-ref21">21</xref>], to estimate curvature information at each vertex in the mesh. We denote H and G, the Mean and the Gaussian discrete curvature operators. k<sub>1</sub> et k<sub>2</sub> the two principal curvatures operators. We calculate these operators according to the following formulae:</p><disp-formula id="scirp.18102-formula116783"><label>(5)</label><graphic position="anchor" xlink:href="5-9101347\6ad1af63-34e6-4bdf-906a-2b01535c34e6.jpg"  xlink:type="simple"/></disp-formula><p>Mean curvature</p><disp-formula id="scirp.18102-formula116784"><label>(6)</label><graphic position="anchor" xlink:href="5-9101347\a17b0691-656b-472b-b38a-69c5a02ebc6d.jpg"  xlink:type="simple"/></disp-formula><p>Gaussian curvature</p><disp-formula id="scirp.18102-formula116785"><label>(7)</label><graphic position="anchor" xlink:href="5-9101347\0c931c70-aff3-4e30-8bbf-4769e29fbec4.jpg"  xlink:type="simple"/></disp-formula><p>As shown in <xref ref-type="fig" rid="fig4">Figure 4</xref>, <img src="5-9101347\19a4b946-4062-4475-9291-710bbd96c2bb.jpg" />and <img src="5-9101347\c1555953-7147-4102-8ea4-f5bac770ca78.jpg" /> are the two angles opposite to the edge in the two triangles sharing the edge<img src="5-9101347\8dd79890-b674-40b5-9151-ef85b1cc247a.jpg" />, <img src="5-9101347\127790b0-bcc2-457b-b8c0-143ba37b9f7e.jpg" />is the angle of the <img src="5-9101347\feb8c607-b78c-4cd1-a362-f42fe00e0fe1.jpg" /> face at the vertex <img src="5-9101347\9d808f36-de4f-45cc-a8fd-d514cb4102f1.jpg" /> and <img src="5-9101347\0ce7c9e5-82be-4b7a-946d-303e35c24028.jpg" /> denotes the number of faces around this vertex. The two principal curvatures are expressed as shown by the following equations:</p><disp-formula id="scirp.18102-formula116786"><label>(8)</label><graphic position="anchor" xlink:href="5-9101347\72263d13-6619-43ff-851b-84cc091c3d2f.jpg"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.18102-formula116787"><label>(9)</label><graphic position="anchor" xlink:href="5-9101347\168dd216-dec2-4c93-8dd4-0516646ecc87.jpg"  xlink:type="simple"/></disp-formula><p>where</p><disp-formula id="scirp.18102-formula116788"><label>(10)</label><graphic position="anchor" xlink:href="5-9101347\49440e53-abe7-462e-8058-d41ead12e147.jpg"  xlink:type="simple"/></disp-formula><p>by examining discrete curvatures on triangular meshes, one can achieve the following analysis:</p><p>-&#160;&#160;&#160;&#160;&#160; Concave regions/valleys (sulci): <img src="5-9101347\caccb2c3-78d0-420e-8ba3-aa0ac458d34c.jpg" />and <img src="5-9101347\18be7742-056f-4b00-bf10-6660126d351e.jpg" /></p><p>-&#160;&#160;&#160;&#160;&#160; Convex regions/crest lines (gyrus): <img src="5-9101347\575b3102-e197-4060-b3bb-d8d072e8ba6a.jpg" />and <img src="5-9101347\aa013de1-6f5b-47c9-9639-cb30c8d78465.jpg" /></p><p>-&#160;&#160;&#160;&#160;&#160; If the H value is negative, then we have a convex behavior (gyri), otherwise it is concave (sulci).</p></sec><sec id="s4"><title>4. DIGITAL ELEVATION MODEL (DEM)</title><p>After the text edit has been completed, the paper is ready for the template. Duplicate the template file by using the Save as command, and use the naming convention prescribed by your journal for the name of your paper. In this newly created file, highlight all of the contents and import your prepared text file. You are now ready to style your paper.</p><p>In this second characterization method, we present a pipeline steps for cortical surface mesh labeling. Our</p><p>method is based on transforming the brain surface mesh into Digital Elevation Model (DEM), where each vertex is designed by its space coordinated and geometric measures like orientation or altitude related to a reference surface. In other word, it consists to analyzing the cortical surface as a topological map or an elevation map where the ridge lines represent cortical gyri and valley lines represents sulci. The cortical surface characterization process is done in two steps: first, compute outer hull surface of brain using a simplified model of Level-Sets method. This outer hull surface will be used as a reference surface. Finally, Digital Elevation Model (DEM) is computed and cortical surface characterrization/labeling is done.</p><sec id="s4_1"><title>4.1. Outer Hall Surface Extraction</title><p>An outer hull surface, which wraps the brain surface, is computed using a simplified Level-Set model. This model is given as follows:</p><disp-formula id="scirp.18102-formula116789"><label>(11)</label><graphic position="anchor" xlink:href="5-9101347\733673aa-aab1-4dac-88b9-0a478fb002fe.jpg"  xlink:type="simple"/></disp-formula><p>where V = +1 is a coefficient that controls the speed and direction of deformation (expands). This constant deformation plays the same role as the pressure force. This Levelsets model is implemented using entropy condition originally proposed in the area of interface propagation by Sethian [23,24].</p><p>After his stage, we have two discrete meshes surfaces: cortical surface denoted S and outer hull surface denoted <img src="5-9101347\e82f6b5a-34ac-4643-8c97-a000f712020d.jpg" /> as show in Figures 5 and 6.</p></sec><sec id="s4_2"><title>4.2. Digital Elevation Model Computing</title><p>We have proposed to define three geometric measures for characterizing the cortical surface as shown on <xref ref-type="fig" rid="fig5">Figure 5</xref>. These measures are assigned to each cortical surface vertex. The first measure is the minimum distance denoted between vertex on the cortical surface and the outer hull surface. The second measure is the polar angle <img src="5-9101347\9531be82-9c4f-43f7-8a9d-06b19c198eb1.jpg" /> between the normal vector related to vertex P on cortical surface and the vector<img src="5-9101347\a2f95700-dbf5-4d11-a8a0-ccf4682ef5c1.jpg" />. Finally, the third measure is the polar angle <img src="5-9101347\ba9310b8-454b-4f35-b36e-16ea6a68e001.jpg" /> between the normal vector related to vertex&#160;P on the cortical surface and the normal vector related to vertex Q on the outer hull surface. Where Q is the nearest vertex belonging to the outer surface&#160;<img src="5-9101347\0f8cc157-75f1-4350-b4f3-c1b0181ba95a.jpg" /> to vertex P on the cortical surface S. These measures are given as following:</p><sec id="s4_2_1"><title>4.2.1. Elevation of Vertex d</title><p>Each vertex of the cortical surface receives the minimum distance that separates it from the outer surface. A vertex from cortical surface will be considered belonging to sulci or gyri according to its height and according to pre-fixed threshold.</p></sec><sec id="s4_2_2"><title>4.2.2. Polar Angle α</title><p>The polar angle α is the angle between the normal vector&#160;<img src="5-9101347\69b7ddf0-487f-462f-8484-39620fba8eaf.jpg" />&#160;related to vertex P on cortical surface and the vector&#160;<img src="5-9101347\9fbf9ce1-1baf-4633-81b7-39276660a471.jpg" />.</p></sec><sec id="s4_2_3"><title>4.2.3. Polar Angle γ</title><p>The polar angle γ is the angle between the normal vector&#160;<img src="5-9101347\086d3445-4203-4853-9a7b-1b7091747997.jpg" />related to vertex P on the cortical surface and the normal vector <img src="5-9101347\89444fa1-d8cc-4473-bbab-9ef06a3b8776.jpg" /> related to vertex Q on the outer hull surface. Where Q is the nearest vertex belonging to the outer surface&#160;<img src="5-9101347\98a1811b-f30f-49d9-8d60-bf8a7a96dd22.jpg" /> to vertex P on the cortical surface S.</p></sec></sec></sec><sec id="s5"><title>5. EXPERIMENTS RESULTS</title><p>We have performed a series of experiments on brain MR images from MeDEISA database [<xref ref-type="bibr" rid="scirp.18102-ref22">22</xref>]. Results of two different labeling methods of cortical surface are given. The mesh that represents cortical brain was created from T1-weighted MRI images using level-sets method. Results of cortical surface characterization by curvature classification are depicted in <xref ref-type="fig" rid="fig7">Figure 7</xref>. Discrete curvatures are used as a height measure. So that, gyri are considered as ridges and sulci are considered as basins which have opposite signed curvatures. Each label corresponds to a different color for each curvature operator. Then, results of cortical surface characterization using geometric measures computed from brain surface and outer haul surface are depicted in Figures 8 and 9:</p><p>-&#160;&#160;&#160;&#160;&#160; <xref ref-type="fig" rid="fig8">Figure 8</xref> shows the classification result of the cortical surface into gyri and sulci using elevation of vertex.</p><p>-&#160;&#160;&#160;&#160;&#160; <xref ref-type="fig" rid="fig9">Figure 9</xref> left shows the distribution of polar angle <img src="5-9101347\1884de6c-bff0-4df4-9cab-92b5b47c7401.jpg" /> on the cortical surface, when gyri and sulci are very distinguishable and are divided into two different classes.</p><p>-&#160;&#160;&#160;&#160;&#160; <xref ref-type="fig" rid="fig9">Figure 9</xref> right shows the distribution of polar angle <img src="5-9101347\d4b6151b-5b14-46dd-8513-8edaf21b37ba.jpg" /> on the cortical surface, when gyri and sulci are very distinguishable and are divided into two different classes.</p><p>Through this classification process it will be easy to distinguish between gyri that are the surfaces top of the brain folds (ridges), and sulci that are the surface within the brain folds (basins). Each label corresponds to a different color for each geometric measure. An inherent difficultly in the interpretation of brain characterization is that there is no definition of what is correct. Some works use expert points of view from neurologists on where sulci and gyri exist. However, visual results given by Figures 7-9 can be interpreted given the idea that sulci are the surfaces within the brain folds (basins) and gyri are the surfaces at the top of the brain folds (ridges).</p></sec><sec id="s6"><title>6. CONCLUSIONS</title><p>This paper proposes novel methods to decompose cortical surface represented by triangle meshes into separate parts based sulci and gyri using geometric measures computed from cortical surface and outer hull surface of the brain. Specially, the first approach use discrete curvature as height in order to distinguish brain sulci from gyru. The second approach is based on transforming the brain surface mesh into Digital Elevation Model (DEM), where each vertex</p><p>is designed by its space coordinates and geometric measures like polar angle α, polar angle γ and elevation of vertex d related to a reference surface. After that we will have, a cortical surface as a topological map, when gyri and sulci are very distinguishable and are divided into two different classes.</p><p>Visually appealing results can be interpreted given the idea that that sulci are the surfaces within the brain folds (basins) and gyri are the surfaces at the top of the brain folds (ridges). Thus, the prospects of this work would be</p><p>to use our approach to address studies on asymmetry of brain anatomy, the inter-individual variability of brain anatomy, neurological dimension of certain mental diseases such as autism and schizophrenia, or, in the context of longitudinal studies on the characterization of brain development for healthy or pathological subject.</p></sec><sec id="s7"><title>REFERENCES</title></sec></body><back><ref-list><title>References</title><ref id="scirp.18102-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Lavoué, G. (2005) Compression de surfaces, basée sur la subdivision inverse, pour la transmission bas débit et la visualisation progressive. Thèse de Doctorat, Université Claude Bernard Lyon 1, Lyon.</mixed-citation></ref><ref id="scirp.18102-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple"> 
Mangan, A.P. and Whitaker, R. (1999) Partitioning 3d surface meshes using watershed segmentation. IEEE Transactions on Visualization and Computer Graphics, 5, 308-321. doi:10.1109/2945.817348</mixed-citation></ref><ref id="scirp.18102-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple"> 
McInerney, T. and Terzopoulos, D. (1996) Deformable models in medical image analysis: A survey. Medical Image Analysis, 1, 91-108. doi:10.1016/S1361-8415(96)80007-7</mixed-citation></ref><ref id="scirp.18102-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple"> 
Kass, M., Witkin, A. and Terzopoulos, D. (1987) Snakes: Active contour models. International Journal of Computer Vision, 1, 321-331. doi:10.1007/BF00133570</mixed-citation></ref><ref id="scirp.18102-ref5"><label>5</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname> 
Xu</surname><given-names> C.</given-names></name>,<name name-style="western"><surname> Pham</surname><given-names> D. and Prince</given-names></name>,<name name-style="western"><surname> J. </surname><given-names>  </given-names></name>,<etal>et al</etal>. (<year>2000</year>)<article-title>Image segmentation using deformable models</article-title><source> Handbook of Medical Imaging</source><volume> 2</volume>,<fpage> 129</fpage>-<lpage>174</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.18102-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple"> 
Sethian, J.A. (1996) Level set methods and fast marching methods. Cambridge University Press, Cambridge.</mixed-citation></ref><ref id="scirp.18102-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple"> 
Warfield, S.K., Kaus, M., Jolesz, F.A. and Kikinis, R. (2000) Adaptive, template moderated, spatially varying statistical classification. Medical Image Analysis, 20, 43-55. doi:10.1016/S1361-8415(00)00003-7</mixed-citation></ref><ref id="scirp.18102-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple"> 
Baillard, C., et al. (2000) Cooperation between level set techniques and 3D registration for the segmentation of brain structures. International Conference on Pattern Recognition, Barcelona, 3-8 September 2000, 991-994.</mixed-citation></ref><ref id="scirp.18102-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple"> 
Suri, J.S., Singh, S. and Reden, L. (2002) Computer vision and pattern recognition techniques for 2-D and 3-D MR cerebral cortical segmentation (Part I): A state-of-the-art review. Pattern Analysis &amp; Applications, 5, 46-764. doi:10.1007/s100440200005</mixed-citation></ref><ref id="scirp.18102-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple"> 
Liew, A.W.C. and Yan, H. (2006) Current methods in the automatic tissue segmentation of 3D magnetic reso-nance brain images. Current Medical Imaging Reviews, 2, 91-103. doi:10.2174/157340506775541604</mixed-citation></ref><ref id="scirp.18102-ref11"><label>11</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname> 
Ho</surname><given-names> S.</given-names></name>,<name name-style="western"><surname> Bullitt</surname><given-names> E. and Gerig</given-names></name>,<name name-style="western"><surname> G. </surname><given-names>  </given-names></name>,<etal>et al</etal>. (<year>2002</year>)<article-title>Level set evolution with region competition: Automatic 3-D segmentation of brain tumors</article-title><source> 16th International Conference on Pattern Recognition</source><volume> 20</volume>,<fpage> 532</fpage>-<lpage>535</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.18102-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple"> 
Lefohn, A.E., Cates, J. and Whitaker, R. (2003) Interactive, GPU-based level sets for 3D brain tumor segmentation. Medical Image Computing and Computer Assisted Intervention, 564-572.</mixed-citation></ref><ref id="scirp.18102-ref13"><label>13</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname> 
P. Perona and Malik</surname><given-names> J. </given-names></name>,<etal>et al</etal>. (<year>1990</year>)<article-title>Scale-space and edge de-tection using anisotropic diffusion</article-title><source> IEEE Transactions on Medical Imaging</source><volume> 12</volume>,<fpage> 629</fpage>-<lpage>639</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.18102-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple"> 
Serra, J.P. (1982) Image analysis and mathematical morphology. Academic Press Inc., London.</mixed-citation></ref><ref id="scirp.18102-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple"> 
Caselles, V., Kimmel, R. and Sapiro, G. (1997) Geodesic active contours. International Journal of Computer Vision, 22, 61-97. doi:10.1023/A:1007979827043</mixed-citation></ref><ref id="scirp.18102-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple"> 
Malladi, R., Sethian, J.A. and Vemuri, B.C. (1995) Shape modeling with front propagation: A level set approach. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17, 158-174. doi:10.1109/34.368173</mixed-citation></ref><ref id="scirp.18102-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple"> 
Osher, S. and Sethian, J.A. (1988) Fronts propagating with curvature dependent speed: Algorithms based on hamilton-jacobi formulations. Journal of Computational Physics, 79, 12-49. doi:10.1016/0021-9991(88)90002-2</mixed-citation></ref><ref id="scirp.18102-ref18"><label>18</label><mixed-citation publication-type="book" xlink:type="simple"> 
Hamman, B. (1993) Curvature approximation for traingulated surfaces. In: Gerald, F., et al., Eds., Geometric Modelling, Computing Supplementum, Springer-Verlag, Vienna, 139-153.</mixed-citation></ref><ref id="scirp.18102-ref19"><label>19</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname> 
Max</surname><given-names> N. </given-names></name>,<etal>et al</etal>. (<year>1999</year>)<article-title>Weights for computing vertex normals from facet normals</article-title><source> Journal of Graphics Tools</source><volume> 4</volume>,<fpage> 1</fpage>-<lpage>6</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.18102-ref20"><label>20</label><mixed-citation publication-type="other" xlink:type="simple"> 
Meyer, M., Desbrun, M. and Schroder, P. (2002) Discrete differential-geometry operators for triangulated 2-mani-folds. International Workshop on Visualization and Mathematics, Berlin.</mixed-citation></ref><ref id="scirp.18102-ref21"><label>21</label><mixed-citation publication-type="other" xlink:type="simple"> 
Medical Database for the Evaluation of Image and Signal Processing (MeDEISA), 2011. www.medeisa.net.</mixed-citation></ref><ref id="scirp.18102-ref22"><label>22</label><mixed-citation publication-type="other" xlink:type="simple"> 
Sethian, J. (1982) An analysis of flame propagation. Ph.D. Thesis, University of California, Berkeley.</mixed-citation></ref><ref id="scirp.18102-ref23"><label>23</label><mixed-citation publication-type="other" xlink:type="simple"> 
Sethian, J. (1994) Curvature flow and entropy conditions applied to grid generation. Journal of Computational Physics, 115, 440-454. doi:10.1006/jcph.1994.1209</mixed-citation></ref><ref id="scirp.18102-ref24"><label>24</label><mixed-citation publication-type="other" xlink:type="simple"> 
Rettmann, M.E., Han, X., Xu, C. and Prince, J.L. (2002) Automated sulcal segmentation using watersheds on the cortical surface. NeuroImage, 15, 329-344,</mixed-citation></ref></ref-list></back></article>