Improving tissue segmentation of human brain MRI through preprocessing by the Gegenbauer reconstruction method

Size: px
Start display at page:

Download "Improving tissue segmentation of human brain MRI through preprocessing by the Gegenbauer reconstruction method"

Transcription

1 NeuroIage 20 (2003) Iproving tissue segentation of huan brain MRI through preprocessing by the Gegenbauer reconstruction ethod Rick Archibald, a, * Kewei Chen, b Anne Gelb, c and Roseary Renaut c a The Center for Syste Science and Engineering Research, Arizona State University, Tepe, AZ , USA b Saaritan PET Center, Good Saaritan Regional Medical Center, E. McDowell Road, Phoenix, AZ 85006, USA c Departent of Matheatics and Statistics, Arizona State University, Tepe, AZ , USA Received 5 Septeber 2002; revised 24 March 2003; accepted 24 April 2003 Abstract The Gegenbauer iage reconstruction ethod, previously shown to iprove the quality of agnetic resonance iages, is utilized in this study as a segentation preprocessing step. It is deonstrated that, for all siulated and real agnetic resonance iages used in this study, the Gegenbauer reconstruction ethod iproves the accuracy of segentation. Although it is ore desirable to use the k-space data for the Gegenbauer reconstruction ethod, only inforation acquired fro MR iages is necessary for the reconstruction, aking the procedure copletely self-contained and viable for all huan brain segentation algoriths Elsevier Inc. All rights reserved. Keywords: Segentation; Brain extraction; Edge detection; Gegenbauer reconstruction; Noise. Introduction * Corresponding author. E-ail address: archi@ath.la.asu.edu (R. Archibald). Magnetic resonance iaging (MRI) is a noninvasive procedure that has proven to be an effective tool in the study of the huan brain. The inforation that MRI provides has greatly increased knowledge of noral and diseased anatoy for edical research and is a critical coponent in diagnosis and treatent planning. Iage segentation algoriths for the delineation of 3D anatoical structures, or tissue types, play an iportant role in nuerous research and clinical studies, involving the visualization and quantitative analyzes of anatoical and functional cortical structures (Worth et al., 997; Dale et al., 999; Van Essen et al., 999; Joshi et al., 999). Guided neural surgery using segented agnetic resonance iages has grown in popularity in treating brain-related diseases such as epilepsy and stroke (Khoo et al., 997; Roux et al., 997; Le Bihan, 2000; Taylor, 995). Functional visualization, in which a segented brain can provide an anatoical fraework, has eerged as a proising approach in neuroscience research and in neurosurgical planning owing to the advanceent of brain function studies using functional MRI (fmri) (Kwong et al., 992; Ogawa et al., 992; Liu et al., 2000; Logothetis et al., 200) and positron eission toography (PET) (Chen et al., 200). The segentation of brain iages is also widely used in cortical surface apping, volue easureent, tissue classification and differentiation, functional and orphological adaptation assessent, and characterization of neurological disorders such as ultiple sclerosis, stroke, and Alzheier s disease (Rusinek et al., 99; Suckling et al., 999; Le Goualher, 2000). Moreover, brain segentation is also a required preliinary step for any other iage-processing procedures, such as brain registration, warping (Leieux, 998; Ghanei et al., 2000; Joshi et al., 997), and voxel-based orphoetry (Ashburner and Friston, 2000). The fact that any applications depend on accurate brain segentation has inspired uch work for its iproveent. The focus of this study is to iprove segentation through the use of the Gegenbauer reconstruction ethod as a preprocessing step. The Gegenbauer reconstruction ethod is a high-resolution ethod, introduced by Gottlieb et al. (992), and established as an effective reconstruction /03/$ see front atter 2003 Elsevier Inc. All rights reserved. doi:0.06/s053-89(03)00260-x

2 490 R. Archibald et al. / NeuroIage 20 (2003) ethod for agnetic resonance iaging by Archibald and Gelb (2002a). Using siulated brain phanto data (Brainweb, 2003) and data fro real patients, this study shows that the Gegenbauer reconstruction ethod iproves the quality of the MRI data and the subsequent brain tissue aps generated by SPM (SPM Website, 2003) segentation algorith. 2. Methods 2. Segentation preprocessing using the Gegenbauer reconstruction ethod The Gegenbauer reconstruction ethod, introduced by Gottlieb et al. (992), is a high-resolution iage reconstruction technique which is capable of reconstructing iages with exponential accuracy, including the edges of structures in the iage, without blurring features, hence itigating a coon proble associated with iage filtering. Since the locations of the edges are needed to deterine the regions of soothness in which the iages can be reconstructed (Gottlieb and Shu, 997), a critical first step in all high-resolution reconstruction is edge detection. Edge detection is achieved by a cobination of the edge detection procedure designed by Gelb and Tador (999), (2000a), with the iniization procedure introduced by Archibald and Gelb (2002a). The edge detection and Gegenbauer reconstruction ethods are briefly outlined in the Appendix under sections 6. and 6.2. As described under these sections, the eployent of the FFT algorith for the both edge detection and the Gegenbauer reconstruction ethod ensures that the speed of coputation is of the order of conventional FFT iage reconstruction. 2.2 Windowed reconstructed data Given the Fourier reconstruction of an iage it is possible to deterine the edges via the concentration ethod (Gelb and Tador, 999). Once the edges are known, highresolution iage reconstruction of the entire iage is achieved by using the Gegenbauer reconstruction ethod in each sooth region. Typically the edge detection and Gegenbauer reconstruction procedures require knowledge of the original Fourier coefficients (or k space data), which are ibedded (Liang and Lauterbur, 2000) in RF signal collected during a MR acquisition. However, often what is available to the researchers/physicians are the windowed (or filtered) Fourier reconstruction data, i.e., the conventional MRI data. Although less desirable, this still provides sufficient inforation for both the edge detection and Gegenbauer reconstruction procedures. Proofs of the previous stateent are given in the Appendix in order to deonstrate the broad application of the Gegenbauer reconstruction ethod to MR iaging segentation. This study uses only windowed reconstructed data in order to deonstrate the effectiveness of the edge detection and Gegenbauer reconstruction procedures on conventional MRI data. 2.3 Segentation Segentation was perfored using the well-known Statistical Paraetric Mapping (SPM) progra developed by the ethodology group at the Wellcoe Departent of Cognitive Neurology (SPM Website, 2003). Statistical Paraetric Mapping is publically available software used to test hypotheses about [neuro]iaging data fro single photon eission coputed toography (SPECT), PET, and fmri. Of particular interest to this study is the segentation progra bundled in this software. SPM segents spatially noralized iages into gray atter (GM), white atter (WM), and cerebrospinal fluid (CSF), using a odified ixture odel cluster analysis technique (Ashburner and Friston, 997), and is extended to include a correction for iage intensity nonunifority (Ashburner and Friston, 2000) that arises fro various sources in MR iaging. The version of SPM used in this study was SPM2b. The default settings were used in segentation and brain extraction. This version, copared to previous versions, has iproved segentation and brain extraction utilities, for which details are outlined on the SPM website (SPM Website, 2003). We note that other segentation algoriths (Liang et al., 994; Schroeter et al., 998; Aizenberg et al., 998; Wu et al., 998) when used in conjunction with Gegenbauer reconstruction as a preprocessing step, including SPM99, produce results siilar to those presented in this study (Archibald, 2002). Therefore we conclude that the accuracy of general segentation is iproved by using the Gegenbauer ethod as a presegentation step. 3. Experiental ethods 3. Data acquisition: MNI digital brain phanto The effect of the Gegenbauer reconstruction ethod on the results of brain tissue segentation was evaluated for siulated MRI scans (Brainweb, 2003) of a MNI digital brain phanto (Kwan et al., 996; Cocosco et al., 997; Collins et al., 998). Brainweb is aintained by the Brain Iaging Center at the Montreal Neurological Institute. The siulated MRI data were generated with noise levels of 5, 7, and 9%, with intensity non-unifority (INU) of 20 and 40%. Ten iages were generated for each cobination of noise and intensity non-unifority, for a total of 60 rando iages generated by Brainweb (2003). Each generated iage siulated a T-weighted single channel MRI scan using the SFLASH (spoiled FLASH) pulse sequence collected in the transverse direction. The paraeters for each generated iage were as follows: TR, 8 s; TE, 0 s; flip angle, 30 ; FOV, ; nuber of slices (contig-

3 uous), 256; slice thickness, ; in-slice resolution. 3.2 Data acquisition: real data We used real MRI data fro six consenting noral healthy subjects. Their MR data were acquired using a.5 T Signa syste (General Electric, Milwaukee, WI) and T-weighted, three-diensional pulse sequence (radio frequency-spoiled gradient recall acquisition in the steady state (SPGR), repetition tie, 33 s; echo tie, 5 s;, 30 ; nuber of excitations, ; field of view, 24 c; iaging atrix, ; slice thickness,.5 ; scan tie, 3:36 in). The MR data set consisted of 24 contiguous horizontal slices with an in-plane voxel diension of 0.94 by Validation: MNI digital brain phanto The probability aps for GM and WM for each MNI digital brain phanto that is generated by SPM segentation are copared to the corresponding true tissue probability ap using the average absolute value nor over all voxels, where the nor is defined for an arbitrary iage A N x N y N z as A N x N x N y N z i x N y i y N z a ix,iy,iz. () i z An error easureent is calculated for a given segented tissue probability ap, P S, and the Brainweb truth tissue probability ap P T as EP T, P S P T P S. (2) Note that in addition to tissue probability aps, Brainweb also provides a discrete tissue index ap. Using the tissue index ap as ground truth is ost appropriate in the evaluation of binary segentation. This study analyzes the probability aps generated by SPM, where it is appropriate to use Brainweb s tissue probability aps as ground truth. The index (Dice coefficient) is a paraeter that has frequently been reported in the literature (Collins et al., 999; Van Leeput et al., 999; Shattuck et al., 200) to evaluate the siilarity of two iages. Given two binary iages, S and S 2, the index is calculated as S, S 2 2S S 2 S S 2. (3) Since probability aps are not binary iages, a threshold is applied in order to use the index as a ethod to copare the SPM segented tissue aps to ground truth. For a given segented tissue probability ap, P S, and the Brainweb truth tissue probability ap, P T, two binary iages that represent the body of the tissue are generated by setting each pixel, p, of both probability aps to a new threshold value, s tb,as R. Archibald et al. / NeuroIage 20 (2003) , if p 0.95 s tb 0, else. (4) For these two binary iages the index (3) is calculated, which, in this case, easures how well the segented tissue probability ap approxiates the body of the tissue. Siilarly for a given segented tissue probability ap, P S, and the Brainweb truth tissue probability ap, P T, two different binary iages that represent the boundary or partial volue region are generated by setting each pixel, p, of both probability aps to a new threshold value, s pv,as, if 0.05 p 0.95 s pv 0, else. (5) The index (3) is calculated for these two binary iages and in this case easures how well the segented tissue probability ap approxiates the partial volue region of the tissue. The thresholds defined above allow coparisons of the core and partial value regions of the gray/white tissue atter ore specifically. Therefore, we refer to this ethod as the local easureent. Different thresholds, other than 0.95 and 0.05, have been applied yielding siilar results. 3.4 Validation: real data Since ground truth tissue aps are not available for real MR data, the quality of the SPM segented tissue probability aps via Gegenbauer reconstruction preprocessing was assessed by visually inspecting the quality of the extracted brain cortical surface. The SPM brain extraction utility relies exclusively on segented data to estiate the brain cortical surface. It is assued in this study that visually apparent artifacts in brain extraction, which are reduced through the utilization of the Gegenbauer reconstruction ethod as a presegentation step, deonstrate the ability of this ethod not only to iprove brain extraction but also to iprove segentation. Thus the Gegenbauer reconstruction ethod as a presegentation step is validated for real data in this study by analyzing visually apparent brain extraction artifacts. 4. Results 4. Global error easureents Table displays the average tissue probability ap error easureent (2) for each cobination of noise and intensity non-unifority for both gray atter and white atter tissue. Using the Gegenbauer reconstruction ethod as a segentation preprocessing step reduces the error easureent for each cobination of noise and intensity nonunifority for both tissue types. As the level of noise increases, so does the average aount of error reduction between the original reconstruction and the Gegenbauer

4 492 R. Archibald et al. / NeuroIage 20 (2003) Table Tissue probability ap error easureent (2) statistics for randoly generated MNI digital brain phantos Noise (%) INU (%) Tissue Gray atter White atter Original Gegenbauer Original Gegenbauer Coparison between each segented probability ap for original and Gegenbauer iage reconstruction. All values are ultiplied by 0 2 and are written in the forat of ean standard deviation. reconstruction. The segentation iproveent using Gegenbauer reconstruction is statistically significant for each noise level and inhoogenity level cobination (P 0.05 paired t test). The P values decreased with the level of noise and are of the order 0 5 for the 9% noise level. Depicted in Figs. and 2 are gray atter and white atter segented probability aps for the original and Gegenbauer iage reconstruction of a particular randoly generated MNI digital brain phanto with a 9% level of noise and 40% intensity non-unifority. Visually it can be seen that there is a difference in the accuracy of the probability aps when Gegenbauer reconstruction is used as a segentation preprocessing step. 4.2 Local error easureents Table 2 displays the average tissue probability ap error easureent (2) for each cobination of noise and intensity non-unifority for both gray atter and white atter tissue, where each probability ap is restricted to its partial volue region, which is defined in (5). The results irror Table in the sense that it is evident that by using the Gegenbauer reconstruction ethod as a segentation preprocessing step, the error easureent is reduced for each cobination of noise and intensity non-unifority for both tissue types. Siilarly, it is noticed that as the level of noise increases, the average aount of error reduction between Fig.. Gray atter segented probability aps for the original and Gegenbauer iage reconstruction of a particular randoly generated MNI digital brain phanto with a 9% level of noise and 40% intensity non-unifority.

5 R. Archibald et al. / NeuroIage 20 (2003) Fig. 2. White atter segented probability aps for the original and Gegenbauer iage reconstruction of a particular randoly generated MNI digital brain phanto with a 9% level of noise and 40% intensity non-unifority. the original reconstruction and the Gegenbauer reconstruction for the partial volue region grows. The segentation iproveent using Gegenbauer reconstruction is statistically significant for each noise level and inhoogenity level cobination (P 0.0 paired t test). The P values decreased with the level of noise and are of the order 0 6 for the 9% noise level Siilarity easureent In order to deterine the index (3), binary iages ust be generated fro each segented probability ap. The tissue body region (4) and partial volue region (5) are the generated binary iages used to calculate the siilarity coefficients. Depicted in Figs. 3 and 4 are gray atter and white atter partial volue region binary iages of the segented probability aps for the original and Gegenbauer iage reconstruction of a particular randoly generated MNI digital brain phanto with a 9% level of noise and 40% intensity non-unifority. There is a visual difference in the accuracy of the binary iages of the probability aps when Gegenbauer reconstruction is used as a segentation preprocessing step. Table 3 displays the index for the partial volue region binary iages generated fro both gray atter and white atter segented probability aps. Siilarly, Table 4 displays the index for the tissue body region binary iages Table 2 Tissue probability ap restricted to the partial volue region (5) error easureent (2) statistics for randoly generated MNI digital brain phantos Noise (%) INU (%) Tissue Gray atter White atter Original Gegenbauer Original Gegenbauer Coparison between each segented probability ap restricted to the partial volue region (5) for original and Gegenbauer iage reconstruction. All values are ultiplied by 0 2 and are written in the forat of ean standard deviation.

6 494 R. Archibald et al. / NeuroIage 20 (2003) Fig. 3. Gray atter partial volue region binary iage (5) generated fro the segented probability aps for the original and Gegenbauer iage reconstruction of a particular randoly generated MNI digital brain phanto with a 9% level of noise and 40% intensity non-unifority. Fig. 4. White atter partial volue region binary iage (5) generated fro the segented probability aps for the original and Gegenbauer iage reconstruction of a particular randoly generated MNI digital brain phanto with a 9% level of noise and 40% intensity non-unifority.

7 R. Archibald et al. / NeuroIage 20 (2003) Table 3 The index (3) statistics for tissue partial volue region binary iages (5) generated fro tissue probability aps of MNI digital brain phantos Noise (%) INU (%) Tissue Gray White Original Gegenbauer Original Gegenbauer Coparison between tissue partial volue region binary iages (5) generated fro the segented probability ap for original and Gegenbauer iage reconstruction. All values are written in the forat of ean standard deviation. generated fro both gray atter and white atter segented probability aps. Typically it is considered that 0.7 indicates excellent agreent (Bartko, 99) in binary iages. It is noted that in any instances, particularly for white atter tissue, the use of the Gegenbauer ethod as a preprocessing step iproves the index beyond the critical value of 0.7, establishing that this preprocessing step has the ability to iprove siilarity between the segented tissue probability aps and ground truth so that it is possible to conclude excellent agreent. The index also has erit in the fact that it provides a value that can be used to copare the siilarities between two easureent pairs (Zijdenbos et al., 994), which is the priary reason it is used in this study. It can been seen that there is significant iproveent in the index coefficient for each tissue type and for all cobinations of noise and intensity non-unifority. Furtherore, the iproveent of both siilarity coefficients between the original and Gegenbauer reconstruction increases with the noise level. The iproveent is even ore draatic for the siilarity coefficients than for the error easureents. Using a Wilcoxon signed rank test, the significance level is P 0.0 for every cobination of noise and intensity non-unifority. 4.3 Real data evaluation It has been reported that artifacts in brain extraction include nonbrain tissue such as scalp in the final extracted iage. In our study, we find that four of six extractions presented this artifact, with severity varying fro sub ject to subject. Fig. 5 displays the results of SPM brain extraction of one particular subject, where the view on the right utilized the Gegenbauer reconstruction ethod as a presegentation step. It is deonstrated that all visually apparent artifacts are reduced by using the Gegenbauer ethod. Siilar results were obtained with all subjects in this study with visually apparent artifacts. Additionally for all six subjects, no new visually apparent artifacts were generated. 5. Discussion and conclusion As is deonstrated in section 4, the use of the Gegenbauer reconstruction ethod as a segentation preprocessing step significantly iproves the quality of the probability aps generated fro SPM segentation for both gray and white tissue. This iproveent can be understood in ters of the differences in filtered Fourier reconstruction, which is Table 4 The index (3) statistics for tissue body binary iages (4) generated fro tissue probability aps of MNI digital brain phantos Noise (%) INU (%) Tissue Gray White Original Gegenbauer Original Gegenbauer Coparison between tissue body binary iages (4) generated fro the segented probability ap for original and Gegenbauer iage reconstruction. All values are written in the forat of ean standard deviation.

8 496 R. Archibald et al. / NeuroIage 20 (2003) Fig. 5. SPM brain extraction of one particular subject, where the picture on the right used the Gegenbauer reconstruction ethod as a presegentation step. the traditional ethod of reconstruction for MRI, and the Gegenbauer reconstruction. The filtered Fourier ethod is the iage reconstruction technique used for the real and siulated data in this study. Filters are often introduced to dapen the high-frequency odes which reduce the effects of Gibbs ringing artifact and noise. Filtering is a violation of the data consistency constraint, but is tolerated in order to reduce the Gibbs ringing artifact (Liang and Lauterbur, 2000) and suppress noise. There is iportant inforation that is carried in the high-frequency odes that pertain to finer features of the reconstructed iage. The Gegenbauer reconstruction ethod, introduced by Gottlieb et al. (992), does not violate the data consistency constraint and is capable of reconstructing piecewise sooth functions in sooth intervals with exponential accuracy up to the edges of the interval without blurring the features at the boundaries. This is reflected in section 4.2, in the iproveent of both the tissue partial volue region and the tissue body region. The Gegenbauer reconstruction ethod s ability to reconstruct sharp boundaries is suggestive of the iniization of visual artifacts in brain extraction in section 4.3. Noise prevalent in MRI spectral data is an ipedient to iage reconstruction. This noise is difficult to quantify and cannot be systeatically reoved. A preliinary investigation was conducted by Archibald and Gelb (2002b) to address the effects of noisy spectral data on the ability of the concentration ethod to locate edges and the Gegenbauer ethod to reconstruct iages. As deonstrated throughout section 4, the application of the edge detection and highresolution reconstruction ethods discussed in this paper not only recovers iages with very high accuracy, but is also robust in the presence of noise and additionally reduces the effects of noise. Fig. 6 depicts the ethod for ipleenting Gegenbauer reconstruction as a presegentation step. In order not to violate the data consistency constraint, k-space data should be used for both edge detection and Gegenbauer reconstruction prior to segentation. Often it is the case that only reconstructed data are available; thus this study deonstrates the viability of using reconstructed data for edge detection and Gegenbauer reconstruction to iprove the results of segentation. This research opens new directions in the application of high-resolution techniques in the field of MRI. Acknowledgents Fig. 6. Flow chart of the Gegenbauer reconstruction ethod as a segentation preprocessing step. The authors of this work were supported in part by the Arizona Center for Alzheier s Disease Research (R. Archibald, K. Chen, A. Gelb, and R. Renaut), the Center for Syste Science and Engineering Research at Arizona State University (R. Archibald and A. Gelb), the Departent of

9 R. Archibald et al. / NeuroIage 20 (2003) Matheatics and Statistics at Arizona State University (R. Archibald, K. Chen, A. Gelb, and R. Renaut), the John von Neuann visiting Professorship of the Zentru Matheatik, Technische Universitaet Muenchen (R. Renaut), NSF Grant DMS (R. Renaut), and NSF Grant DMS (A. Gelb). 6. Appendix Section 2. discuses the boundary detection and highresolution reconstruction ethod used in this paper, which are described in greater detail below in sections 6. and 6.2. Both the edge detection and reconstruction ethod require the knowledge of k-space data. Often, as is the case with this study, what is known are the windowed reconstructed data, and therefore it is proven in section 6.3 that using the windowed reconstructed data will only inially affect the results of the Gegenbauer reconstruction ethod. However, we stress that knowledge of the unfiltered k-space data is preferable in order to satisfy the data consistency constraint (Liang and Lauterbur, 2000). 6. Edge detection The concentration edge detection ethod is first described for one diension. Define the jup function [f](x) for a piecewise sooth function as [f](x) f (x) f (x), where f (x) are the right and left side liits of the function at x, f (x) li x3x f(x). Note that [f](x) is 0 away fro a discontinuity and is the value of the jup at a discontinuity. It is shown in Gelb and Tadon (999) that the concentration ethod for detecting jup discontinuities is easily ipleented in the discrete case as N T N fx : i kn sgnk k N 2 f ke ikx 3 fx, as N 3. (6) Here f k are the discrete Fourier coefficients coputed using the fast Fourier transfor (FFT) algorith fro given discrete data f(xj), xj j/n, j 0,..., 2N, as f k 2N 2Nc k j0 f x j e ikxj, c k 2, if k N,, otherwise, and () is deterined in Gelb and Tador (999) as (7) 2 sin, (8) where () is a continuous concentration factor that satisfies C 2 0, and noralized so that 0 d. There are several exaples of adissible concentration factors discussed in Gelb and Tador (999). The exponential concentration factor, where ce, (9) c exp (0) d is particularly effective, as it takes full advantage of the spectral data by rapidly converging away fro the discontinuities. The paraeter is freely chosen, with a typical value 6. We note that when the data given are k-space data, the edge detection ethod (6) can be directly applied and easily calculated with the FFT algorith. In order to deterine the exact intervals of soothness, which is iperative for high-resolution reconstruction, the concentration ethod (6) ust be further enhanced to pinpoint the edges exactly. For this purpose, an edge enhanceent procedure based on a separation of scales has been constructed by Gelb and Tador (2000b), E N T N fx T N fx, if N q/2 T N fx q J crit, 0, if N q/2 T N fx q J crit. () Here J crit is an O() global threshold paraeter signifying the inial aplitude for the jup discontinuity not to be negligible. Since (6) actually locates the neighborhoods of the discontinuities, the exact jup locations are deterined as the corresponding locations of the largest aplitudes E J crit in each neighborhood of adissible jups (i.e., where E J crit ). Note that J crit should be chosen to be consistent with the variation and scaling of the function. Experients show that the paraeter q 2 is adequate for enhanceent. The nonlinear enhanceent procedure (Gelb and Tador, 2000) works well when the discontinuities are located far enough fro each other. (Experientally, the neighborhood of a discontinuity is approxiately 5x.) When the discontinuities are extreely close together, as is the case for MRI scans, where two neighboring pixels ay contain discontinuities, a ore refined procedure near the locations of the discontinuities ust be eployed. We adopt a iniization procedure (Archibald and Gelb, 2002a) given by

10 498 R. Archibald et al. / NeuroIage 20 (2003) where and in M,ai,b i ax x T N hx : in M,ai,b i ax x T N fx M a i 2 T N gx; b i, (2) h x : f x M a i 2 g x; b i (3) i g x; b i x, if x b i, x, if b i x. (4) Since h(x) is a sooth function, T N [h](x) 3 0, and therefore the correct iniization of (2) yields the nuber of discontinuities, M, with the associated positions, b i, and agnitudes, a i, for i,...,m, of the function f. The edge detection ethod and iniization process can be extended to detect the size and position of discontinuities of a ultiple diensional function by holding all but one diension fixed and deterining the edges as a function of the fixed coordinates. This three-diensional procedure is used for all iages processed in this paper. The eployent of the FFT algorith for the boundary detection procedure ensures that the speed of coputation is of the order of the three-diensional FFT. i 6.2 Gegenbauer reconstruction ethod The Gegenbauer reconstruction ethod was developed by Gottlieb et al. (992) and extended in a litany of articles (consult Gottlieb and Shu (997) for references). It is a powerful tool that recovers piecewise sooth functions with spectral accuracy up to the edges in each sooth interval and can therefore be used to copletely eliinate the Gibbs ringing artifact without coproising high resolution at the edges. Let us first introduce the Gegenbauer reconstruction ethod for a one-diensional piecewise sooth function f(x). The Gegenbauer reconstruction ethod is perfored on each sooth interval [a, b] [, ]. Specifically, define a local variable [, ] such that x(), where b a/2 and b a/2. The Gegenbauer reconstruction is then based on the Fourier approxiation of f(x) in[a, b], N f N x f N f ke ik, (5) kn where f k is defined in (7) and is coputed by g x g l C l, (6) l0 where the Gegenbauer polynoial C n (x) is an orthogonal polynoial of order n that satisfies x 2 2C k xc n xdx h n, k n, 0, k n, where (for 0) with h n C n C n 2 n (7), (8) n 2 n!2. (9) The approxiate Gegenbauer coefficients, g l h l are coputed by the FFT algorith as where 2 2f N xc l d, (20) kn g l c,l, k e ik f k, (2) kn if k 0, c,l, k, i l l J l k 2, if k 0. k (22) Here J l (k) is the Bessel function. It is noted here that soe sooth intervals ay consist of too few points to construct an approxiation. The Gegenbauer reconstruction requires at least a theoretical iniu of points to for an approxiation (Gottlieb and Orszag, 977). Therefore, in these intervals, the values at each grid point are assued constant and equivalent to the values deterined at the edges by the edge detection ethod (Archibald and Gelb, 2002a). The paraeters and depend upon the nuber of points, N I, in the subinterval that is reconstructed. A specific requireent is that N I. Recent work deonstrates how the paraeters and can be optiized for a particular subdoain (Gelb, 2003). For siplicity, we choose the paraeters such that with ax, in ax, N I 4, (23) where [N I /4] is the nearest integer to N I /4, and ax 2. The Gegenbauer reconstruction ethod can be directly extended to ultiple diensions by perforing reconstruc-

11 R. Archibald et al. / NeuroIage 20 (2003) tion in sooth regions. The reconstruction will have exponential accuracy up to the edges of each sooth region. Three-diensional Gegenbauer reconstruction is used for all the iages processed in this paper. The coputational cost of the Gegenbauer reconstruction ethod is of the order of the three-diensional FFT. We note that different values can be chosen for and in each diension, which can be optiized by the size of the particular subdoain as deonstrated in Gelb (2003). However, for siplicity we adopt the paraeters for each diension according to (23). Convergence analysis of the Gegenbauer reconstruction ethod for the one-diensional case is provided in the next section. 6.3 Windowed transfored data in edge detection One factor contributing to the Gibbs ringing artifact for piecewise sooth functions is the slow decay rate of the Fourier expansion coefficients (Gottlieb and Orszag, 977). A window (or filter) increases the rate of decay by attenuating the higher order coefficients, which in turn controls the effects of the Gibbs oscillations. The windowed discrete Fourier reconstruction is coputed as N f w N x w k f ke ikx, (24) kn where w k w(k/n) is a window function. Given reconstructed data on equally spaced points the inverse transfor will result in the spectral data f kw w k f k, (25) where w is the widow function used in reconstruction. An edge detection procedure designed by Gelb and Tador (999, 2000a), and briefly outlined in section 6. uses Fourier coefficients to deterine boundaries. In this study, the k-space data are not available but rather the windowed k-space data are known (25). Theore 6. proves that the inforation required for high-resolution reconstruction, naely, the position of edges, is preserved if windowed k-space data are used in the edge detection procedure provided that the window function satisfies two basic requireents. The first requireent is that the window function, w, is w C 2 0,. This is the case with all coonly used widowed functions used to eliinate the Gibbs ringing artifact (Gottlieb and Shu, 997). The second requireent is that 0 w d 0, where is the concentration factor used in the edge detection ethod. The flexibility in the choice of the concentration factor allows adissible window functions. In this paper the window function used by Brainweb is a sinc function (Kwan et al., 999), and we use a exponential concentration factor (9) in edge detection, which together satisfy both requireents. Theore 6. Using spectral data (25) in the concentration ethod (6) preserves the positions of the jup discontinuities, provided that and w C w d 0, (26) :0 w C 2 0,. (27) Proof. Using the spectral data (25) the concentration ethod (6) will becoe N T,w N fx : i kn sgnk k w e ikx Define the function N 2 f k N i sgnkw k kn k N 2 f keikx. (28) w w, (29) C w where C w is defined in (26). Since w C 2 (0, ) and is a concentration factor, and w C w 0 C 2 0,, w d w d. (30) C w C w0 Thus w is a concentration factor. Hence and i C w N kn sgnkw k k N 2 f ke ikx 3 fx (3) T N,w fx 3 C w fx. (32) Thus it is possible to deterine the position of the discon-

12 500 R. Archibald et al. / NeuroIage 20 (2003) tinuities. The size of the jups will be off by a factor of C w, but is acceptable since only the positions of the jups are necessary in Gegenbauer reconstruction. 6.4 Filtered transfored data in the Gegenbauer reconstruction ethod As shown in Gottlieb et al. (992), if f(x) is an arbitrary L 2 function on [, ], then the error in the ax nor ax x f x g l C l x ax x f x l0 fˆl C l x ax x fˆl C l x l0 l0 g l C l x RE, l0 TE,, N (33) is exponentially convergent for N, where (2/27)e. The proof provided in Gottlieb et al. (992) shows that both the regularization error (RE) and the truncation error (TE) are exponentially convergent. If it is assued that what is known is the windowed reconstruction (24), then the error in the ax nor becoes where ax x f x g,w l C l x ax x f x l0 fˆl C l x ax x fˆl C l x l0 l0 g,w l C l x, (34) l0 g,w l h l x 2 2f N w xc l xdx. (35) If the error in (34) reains exponentially convergent, then the Gegenbauer reconstruction ethod utilizing the coefficients (35) generated fro the windowed Fourier reconstruction will still yield high accuracy. The following theore is a slight odification of the theore in Gottlieb et al. (992) that proves the exponential convergence of the truncation error in (34). Specifically all of the original arguents for the exponential convergence proof are the sae. Theore 6.2 If f(x) isanl 2 function on [, ], then there exists a constant A which is independent of,, and N, such that the truncation error defined as TE,, N ax x fˆl g,w l C l x, (36) l0 satisfies the estiate TE,, N A 2!2 2 where w is a window (or filter) function. N, (37) Proof. Before we prove the theore for an arbitrary L 2 function on [, ], consider the special function f(x) e inx with n N. For this special case f N w (x) 0 and we obtain fˆl g,w l C l x C l x h l x 2 2e inx C l xdx. (38) In Batean (953; p. 23) there is an explicit expression for (38) given by h l x 2 2e inx C l xdx 2 n i l l J l n. (39) Here J (x) is the Bessel function. Since J (x) for all x and 0 (Abraowitz and Stegun, 970; p. 362), we have, for 0 l, fˆl g,w lc l x C l n 2 i l l l l 2 l!2 n 2 2!2 n 2, (40) where in the second step we used the forula l 2 C l, 0, (4) l!2 and in the last step we used the fact that (l )(l 2)/l! is a increasing function of. We now return to the general function f(x), which by Gottlieb and Shu (997) satisfies

13 f x f w N x w n f ne inx. (42) nn Since w is a filter function it is uniforly bounded with w n. (43) Also, since f(x) isanl 2 function, its Fourier coefficients f n are uniforly bounded. Hence w n f n f n A. (44) Therefore, using the result for the special case e inx in (40) yields fˆl g,w l C l x 2 A!2 Ã nn 2!2 2 n 2 N for all 0 l. We can now estiate the truncation error (36) by TE,, N ax 0leql ax x fˆl g,w l C l x ax 0leql fˆl g,w l C l A 2!2 (45) N 2, (46) where in the second step we used the fact that C l (x) C l () for all x (Batean, 953; p. 206), and in the third step we used (45). The regularization error, RE(, ), reains unchanged and proof of its exponential convergence can be found in Gottlieb and Shu (997). References Abraowitz, M., Stegun, I.A., 970. Handbook of Matheatical Functions. Dover, New York. Aizenberg, I.N., Aizenberg, N.N., Gotko, E.S., Sochka, V.A., 998. Medical iage processing using neural networks based on ulti-values and universal binary neurons. SPIE Conference on iage processing, San Diego, California. Archibald, R., Boundary Detection and Reconstruction in Magnetic Resonance Iaging. Thesis, Arizona State University. Archibald, R., Gelb, A., 2002a. A ethod to reduce the Gibbs ringing artifact in MRI scans while keeping tissue boundary integrity. IEEE Trans. Med. Iaging 2, Archibald, R., Gelb, A., 2002b. Reducing the effects of noise in boundary detection. J. Sci. Coput. 7, Ashburner, J., Friston, K.J., 997. Multiodal iage coregistration and partitioning A unified fraework. NeuroIage 6, Ashburner, J., Friston, K.J., Voxel-based orphoetry the ethods. NeuroIage, R. Archibald et al. / NeuroIage 20 (2003) Bartko, J.J., 99. Measureent and reliability: statistical thinking considerations. Schizophrenia Bull. 7, Batean, H., 953. Higher Transcendental Functions, Vol. 2. McGraw Hill, New York. Chen, J.L., Gunn, S.R., Nixon, M.S., Gunn, R.N., 200. Markov rando field odels for segentation of PET iages. Proc. Infor. Processing Med. Iaging 2082, Cocosco, C.A., Kollokian, V., Kwan, R.K.-S., Evans, A.C., 997. Brain Web: online interface to a 3D MRI siulated brain database. Neuro- Iage 5(4), part 2/4, S425. Collins, D.L., Zijdenbos, A.P., Baaré, W.F., Evans, A.C., 999. ANIMAL INSECT: Iproved cortical structure segentation, in: Kuba, A., Sáal, M., Todd-Pokropek, A. (Eds.), Lecture Notes in Coputer Science, Proceedings of the 6th International Conference on Inforation Processing in Medical Iaging, Vol. 63, Springer-Verlag, Berlin/Heidelberg, pp Collins, D.L., Zijdenbos, A.P., Kollokian, V., Sled, J.G., Kabani, N.J., Holes, C.J., Evans, A.C., 998. Design and construction of a realistic digital brain phanto. IEEE Trans. Med. Iaging 7 (3), Dale, A.M., Fischi, B., Sereno, M.I., 999. Cortical surface-based analysis. I. Segentation and surface reconstruction. NeuroIage 9, Gelb, A., Paraeter optiization and reduction of round off error for the Gegenbauer reconstruction ethod. Subitted for publication. Gelb, A., Tador, E., 999. Detection of edges in spectral data. Appl. Coput. Haronic Anal. 7, Gelb, A., Tador, E., 2000a. Detection of edges in spectral data II: nonlinear enhanceent. SIAM J. Nuer. Anal. 38, Gelb, A., Tador, E., 2000b. Spectral reconstruction of piecewise sooth functions fro their discrete data. Math. Modelling Nuer. Anal. Ghanei, A., Soltanian-Zadeh, H., Jacobs, M.A., Patel, S., Boundarybased warping of brain MR iages. J. Magn. Reson. Iaging 2, Gottlieb, D., Shu, C.W., Soloonoff, A., Vandeven, H., 992. On the Gibbs phenoenon I: recovering exponential accuracy fro the Fourier partial su of a nonperiodic analytic function. J. Cop. Appl. Math. 43, Gottlieb, D., Orszag, S., 977. Nuerical Analysis of Spectral Methods: Theory and Applications. SIAM, Philadelphia. Gottlieb, D., Shu, C.W., 997. On the Gibbs phenoenon and its resolution. SIAM Rev. 39, Joshi, M., Cui, J., Doolittle, K., Joshi, S., Van Essen, D., Wang, L., Miller, M.I., 999. Brain segentation and the generation of cortical surfaces. NeuroIage 9, Joshi, S., Miller, M., Grenander, U., 997. On the geoetry and shape of brain sub-aifolds. Int. J. Patt. Rec. Art. Intel., Khoo, V.S., Dearnaley, D.P., Finnigan, D.J., Padhani, A., Tanner, S.F., Leach, M.O., 997. Magnetic resonance iaging: consideration and applica-tions in radiotherapy treatent planning. Radiother. Oncol. 42, 5. Kwan, R.K-S., Evans, A.C., Pike, G.B., 996. An extensible MRI siulator for post-processing evaluation, in: Lexture Notes in Coputer Science, Springer-Verlag/Berlin, Vol. 3, pp Kwan, R.K-S., Evans, A.C., Pike, G.B., 999. MRI Siulation-based evaluation of iage-processing and classification ethods. IEEE Trans. Med. Iaging 8, Kwong, K.K., Belliveau, J.W., Chesler, D.A., Goldberg, I.E., Weisskoff, R.M., Poncelet, B.P., Kennedy, D.N., Hoppel, B.E., Cohen, M.S., Turner, R., et al. Dynaic agnetic resonance iaging of huan brain activity during priary sensory stiulation. Proc. Natl. Acad. Sci. USA 89, Le Bihan, D., What to expect fro MRI in the investigation of the central nercous syste? C. R. Acad. Sci Ser. III 323, Le Goualher, G., Argenti, A.M., Duye, M., Baaré, W.F., Hulshoff Pol, H.E., Boosa, D.I., Zouaoui, A., Barillot, C., Evans, A.C., Statistical sulcal shape coparisons: application to the detection of genetic encoding of the central sulcus shape. NeuroIage,

14 502 R. Archibald et al. / NeuroIage 20 (2003) Leieux, L., Wieshann, U.C., Moran, N.F., Fish, D.R., Shorvon, S.D., 998. The detection and significance of subtle changes in ixed-signal brain lesions by serial MRI scan atching and spatial noralization. Med. Iaging Anal. 2, Liang, Z., Lauterbur, P., Principles of Magnetic Resonance Iaging: A Signal Processing Perspective. IEEE Press, New York. Liang, Z., MacFall, J.R., Harrington, D.P., 994. Paraeter estiation and tissue segentation for ultispectral MR iages. IEEE Trans. Med. Iaging 3, Lui, J.Z., Dai, T.H., Elster, T.H., Sahgal, V., Brown, R.W., Yue, G.H., Siultaneous easureent of huan joint force, surface electroyo-gras, and functional MRI-easured brain activation. J. Neurosci. Methods 0, Logothetis, N.K., Pauls, J., Augath, M., Trinath, T., Oelterann, A., 200. Neurophysiological investigation of the basis of the fmri signal. Nature 42, McConnell Brain Iaging Centre Montréal Neurological Institute MRI Siulator. (0 January 2003). Ogawa, S., Tank, D.W., Menon, R., Ellerann, J.M., Ki, S.G., Merkle, H., Ugurbil, K., 992. Intrinsic signal changes accopanying sensory stiulation: functional brain apping with agnetic resonance iaging. Proc. Natl. Acad. Sci. USA 89, Roux, F.E., Ranjeva, J.P., Boulanouar, K., Manelfe, C., Sabatier, J., Treoulet, M., Berry, I., 997. Motor functional MRI for presurgical evaluation of cerebral tuors. Stereotact. Funct. Neurosurg. 68, 06. Rusinek, H., De Leon, M.J., George, A.E., Stylopouoplos, L.A., Chandra, R., Sith, G., Rand, T., Mourino, M., Kowalski, H., 99. Alzheier disease: easuring loss of cerebral gray atter with MR iaging. Radiology 78, Schroeter, P., Vesin, J., Langenberger, T., Meuli, R., 998. Robust paraeter estiation of intensity distributions for brain agnetic resonance iages. IEEE Trans. Med. Iaging 7 (2), Shattuck, D.W., Sandor-Leahy, R.S., Schaper, K.A., Rottenberg, D.A., Leahy, R.M., 200. Magnetic resonance iage tissue classification using a partial volue odel. NeuroIage 3, Statistical Paraetric Mapping. Wellcoe Departent of Cognitive Neurology (2 January 2003). Suckling, J., Sigundsson, T., Greenwood, K., Bullore, E.T., 999. A odified fuzzy clustering algorith for operator independent brain tissue classification of dual echo MR iages. Magn. Reson. Iaging 7, Taylor, P., 995. Invited review: coputer aids for decision-aking in diagnostic radiology a literature review. Br. J. Radiol. 68, Van Essen, D.C., Drury, H.A., Anderson, C.H An autoated ethod for reconstructing coplex surfaces, including the cerebral cortex. Soc. Neurosci. Abstr. 25. Van Leeput, K., Maes, F., Vandereulen, D., Suetens, P., 999. Autoated odel-based tissue classification of MR iages of the brain. IEEE Trans. Med. Iaging 8,

Data pre-processing framework in SPM. Bogdan Draganski

Data pre-processing framework in SPM. Bogdan Draganski Data pre-processing fraework in SPM Bogdan Draganski Outline Why do we need pre-processing? Overview Structural MRI pre-processing fmri pre-processing Why do we need pre-processing? What do we want? Reason

More information

Image Processing for fmri John Ashburner. Wellcome Trust Centre for Neuroimaging, 12 Queen Square, London, UK.

Image Processing for fmri John Ashburner. Wellcome Trust Centre for Neuroimaging, 12 Queen Square, London, UK. Iage Processing for fmri John Ashburner Wellcoe Trust Centre for Neuroiaging, 12 Queen Square, London, UK. Contents * Preliinaries * Rigid-Body and Affine Transforations * Optiisation and Objective Functions

More information

Signal, Noise and Preprocessing*

Signal, Noise and Preprocessing* Translational Neuroodeling Unit SNR & Preproc Teporal Spatial General Realign Coreg Noralise Sooth Signal, Noise and Preprocessing* Methods and Models for fmri Analysis Septeber 25 th, 2015 Lars Kasper,

More information

The optimization design of microphone array layout for wideband noise sources

The optimization design of microphone array layout for wideband noise sources PROCEEDINGS of the 22 nd International Congress on Acoustics Acoustic Array Systes: Paper ICA2016-903 The optiization design of icrophone array layout for wideband noise sources Pengxiao Teng (a), Jun

More information

The Australian National University, Canberra Australia

The Australian National University, Canberra Australia Iproved Precision in the Measureent of Longitudinal Global and Regional Voluetric Changes via a Novel MRI Gradient Distortion Characterization and Correction Technique Vladiir S. Fonov 1, Andrew Janke

More information

Preprocessing I: Within Subject John Ashburner

Preprocessing I: Within Subject John Ashburner Preprocessing I: Within Subject John Ashburner Pre-processing Overview Statistics or whatever fmri tie-series Anatoical MRI Teplate Soothed Estiate Spatial Nor Motion Correct Sooth Coregister 11 21 31

More information

Quantitative Comparison of Sinc-Approximating Kernels for Medical Image Interpolation

Quantitative Comparison of Sinc-Approximating Kernels for Medical Image Interpolation Quantitative Coparison of Sinc-Approxiating Kernels for Medical Iage Interpolation Erik H. W. Meijering, Wiro J. Niessen, Josien P. W. Plui, Max A. Viergever Iage Sciences Institute, Utrecht University

More information

Spatial Special Preprocessing

Spatial Special Preprocessing Spatial Special Preprocessing Methods & Models for fmri Data Analysis Septeber 26, 2014 Lars Kasper, PhD TNU & MR-Technology Group Institute for Bioedical Engineering, UZH & ETHZ Generous slide support:

More information

Evaluation of a multi-frame blind deconvolution algorithm using Cramér-Rao bounds

Evaluation of a multi-frame blind deconvolution algorithm using Cramér-Rao bounds Evaluation of a ulti-frae blind deconvolution algorith using Craér-Rao bounds Charles C. Beckner, Jr. Air Force Research Laboratory, 3550 Aberdeen Ave SE, Kirtland AFB, New Mexico, USA 87117-5776 Charles

More information

TensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3

TensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3 2017 2nd International Conference on Coputational Modeling, Siulation and Applied Matheatics (CMSAM 2017) ISBN: 978-1-60595-499-8 TensorFlow and Keras-based Convolutional Neural Network in CAT Iage Recognition

More information

Preprocessing of fmri data (basic)

Preprocessing of fmri data (basic) Preprocessing of fmri data (basic) Practical session SPM Course 2016, Zurich Andreea Diaconescu, Maya Schneebeli, Jakob Heinzle, Lars Kasper, and Jakob Sieerkus Translational Neuroodeling Unit (TNU) Institute

More information

Image Filter Using with Gaussian Curvature and Total Variation Model

Image Filter Using with Gaussian Curvature and Total Variation Model IJECT Vo l. 7, Is s u e 3, Ju l y - Se p t 016 ISSN : 30-7109 (Online) ISSN : 30-9543 (Print) Iage Using with Gaussian Curvature and Total Variation Model 1 Deepak Kuar Gour, Sanjay Kuar Shara 1, Dept.

More information

FIL SPM Course Spatial Preprocessing

FIL SPM Course Spatial Preprocessing Registration, noralisation, segentation, VBM Matthan Caan, BIC/CSCA suer school 2012 Neuroiage, 2012 slides copied/adjusted fro: FIL SPM Course Spatial Preprocessing 1. smri 2. DTI 3. fmri By John Ashburner

More information

Signal, Noise and Preprocessing*

Signal, Noise and Preprocessing* Translational Neuroodeling Unit Signal, Noise and Preprocessing* Methods and Models for fmri Analysis Septeber 27 th, 2016 Lars Kasper, PhD TNU & MR-Technology Group Institute for Bioedical Engineering,

More information

Clustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering

Clustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering Clustering Cluster Analysis of Microarray Data 4/3/009 Copyright 009 Dan Nettleton Group obects that are siilar to one another together in a cluster. Separate obects that are dissiilar fro each other into

More information

COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL

COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL 1 Te-Wei Chiang ( 蔣德威 ), 2 Tienwei Tsai ( 蔡殿偉 ), 3 Jeng-Ping Lin ( 林正平 ) 1 Dept. of Accounting Inforation Systes, Chilee Institute

More information

Shortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm

Shortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm International Journal of Engineering and Technical Research (IJETR) ISSN: 31-869 (O) 454-4698 (P), Volue-5, Issue-1, May 16 Shortest Path Deterination in a Wireless Packet Switch Network Syste in University

More information

Ming-Wei Lee 1, Wei-Tso Lin 1, Yu-Ching Ni 2, Meei-Ling Jan 2, Yi-Chun Chen 1 * National Central University

Ming-Wei Lee 1, Wei-Tso Lin 1, Yu-Ching Ni 2, Meei-Ling Jan 2, Yi-Chun Chen 1 * National Central University Rapid Constructions of Circular-Orbit Pinhole SPECT Iaging Syste Matrices by Gaussian Interpolation Method Cobined with Geoetric Paraeter Estiations (GIMGPE Ming-Wei Lee, Wei-Tso Lin, Yu-Ching Ni, Meei-Ling

More information

Computer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13

Computer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13 Coputer Aided Drafting, Design and Manufacturing Volue 26, uber 2, June 2016, Page 13 CADDM 3D reconstruction of coplex curved objects fro line drawings Sun Yanling, Dong Lijun Institute of Mechanical

More information

Abstract. 2. Segmentation Techniques. Keywords. 1. Introduction. 3. Threshold based Image Segmentation

Abstract. 2. Segmentation Techniques. Keywords. 1. Introduction. 3. Threshold based Image Segmentation International Journal of Advanced Coputer Research (ISSN (print): 49-777 ISSN (online): 77-7970) Volue-3 Nuber- Issue-8 March-03 MRI Brain Iage Segentation based on hresholding G. Evelin Sujji, Y.V.S.

More information

Galois Homomorphic Fractal Approach for the Recognition of Emotion

Galois Homomorphic Fractal Approach for the Recognition of Emotion Galois Hooorphic Fractal Approach for the Recognition of Eotion T. G. Grace Elizabeth Rani 1, G. Jayalalitha 1 Research Scholar, Bharathiar University, India, Associate Professor, Departent of Matheatics,

More information

Gromov-Hausdorff Distance Between Metric Graphs

Gromov-Hausdorff Distance Between Metric Graphs Groov-Hausdorff Distance Between Metric Graphs Jiwon Choi St Mark s School January, 019 Abstract In this paper we study the Groov-Hausdorff distance between two etric graphs We copute the precise value

More information

EE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011

EE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011 EE 364B Convex Optiization An ADMM Solution to the Sparse Coding Proble Sonia Bhaskar, Will Zou Final Project Spring 20 I. INTRODUCTION For our project, we apply the ethod of the alternating direction

More information

A Novel Fast Constructive Algorithm for Neural Classifier

A Novel Fast Constructive Algorithm for Neural Classifier A Novel Fast Constructive Algorith for Neural Classifier Xudong Jiang Centre for Signal Processing, School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue, Singapore

More information

Medical Biophysics 302E/335G/ st1-07 page 1

Medical Biophysics 302E/335G/ st1-07 page 1 Medical Biophysics 302E/335G/500 20070109 st1-07 page 1 STEREOLOGICAL METHODS - CONCEPTS Upon copletion of this lesson, the student should be able to: -define the ter stereology -distinguish between quantitative

More information

2nd Workshop on Advanced Research and Technology in Industry Applications (WARTIA 2016)

2nd Workshop on Advanced Research and Technology in Industry Applications (WARTIA 2016) 2nd Workshop on Advanced Research and Technology in Industry Applications (WARTIA 2016) Method for Marking and Positioning Corrosions in the Autoobile Engine Cylinder Cavity fro the Ultrasonic Phased Array

More information

The Internal Conflict of a Belief Function

The Internal Conflict of a Belief Function The Internal Conflict of a Belief Function Johan Schubert Abstract In this paper we define and derive an internal conflict of a belief function We decopose the belief function in question into a set of

More information

A NEW METHOD FOR COLOURIZING OF MULTICHANNEL MR IMAGES BASED ON REAL COLOUR OF HUMAN BRAIN

A NEW METHOD FOR COLOURIZING OF MULTICHANNEL MR IMAGES BASED ON REAL COLOUR OF HUMAN BRAIN A NEW METHOD FOR OLOURIZING OF MULTIHANNEL MR IMAGES BASED ON REAL OLOUR OF HUMAN BRAIN Mohaad Hossein Kadbi; Eadoddin Fateizaheh; Abouzar Eslai; and arya khosroshahi Electrical Engineering Dept., Sharif

More information

A Novel 2D Texture Classifier For Gray Level Images

A Novel 2D Texture Classifier For Gray Level Images 2012, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.co A Novel 2D Texture Classifier For Gray Level Iages B.S. Mousavi 1 Young Researchers Club, Zahedan

More information

A simplified approach to merging partial plane images

A simplified approach to merging partial plane images A siplified approach to erging partial plane iages Mária Kruláková 1 This paper introduces a ethod of iage recognition based on the gradual generating and analysis of data structure consisting of the 2D

More information

An Optimization Clustering Algorithm Based on Texture Feature Fusion for Color Image Segmentation

An Optimization Clustering Algorithm Based on Texture Feature Fusion for Color Image Segmentation Algoriths 2015, 8, 234-247; doi:10.3390/a8020234 Article OPEN ACCESS algoriths ISSN 1999-4893 www.dpi.co/journal/algoriths An Optiization Clustering Algorith Based on Texture Feature Fusion for Color Iage

More information

Oblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands

Oblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands Oblivious Routing for Fat-Tree Based Syste Area Networks with Uncertain Traffic Deands Xin Yuan Wickus Nienaber Zhenhai Duan Departent of Coputer Science Florida State University Tallahassee, FL 3306 {xyuan,nienaber,duan}@cs.fsu.edu

More information

Detection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm

Detection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm Detection of Outliers and Reduction of their Undesirable Effects for Iproving the Accuracy of K-eans Clustering Algorith Bahan Askari Departent of Coputer Science and Research Branch, Islaic Azad University,

More information

ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH

ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH Kulapraote Prathuchai Geoinforatics Center, Asian Institute of Technology, 58 Moo9, Klong Luang, Pathuthani, Thailand.

More information

Novel Image Representation and Description Technique using Density Histogram of Feature Points

Novel Image Representation and Description Technique using Density Histogram of Feature Points Novel Iage Representation and Description Technique using Density Histogra of Feature Points Keneilwe ZUVA Departent of Coputer Science, University of Botswana, P/Bag 00704 UB, Gaborone, Botswana and Tranos

More information

On the Computation and Application of Prototype Point Patterns

On the Computation and Application of Prototype Point Patterns On the Coputation and Application of Prototype Point Patterns Katherine E. Tranbarger Freier 1 and Frederic Paik Schoenberg 2 Abstract This work addresses coputational probles related to the ipleentation

More information

Smarter Balanced Assessment Consortium Claims, Targets, and Standard Alignment for Math

Smarter Balanced Assessment Consortium Claims, Targets, and Standard Alignment for Math Sarter Balanced Assessent Consortiu s, s, Stard Alignent for Math The Sarter Balanced Assessent Consortiu (SBAC) has created a hierarchy coprised of clais targets that together can be used to ake stateents

More information

COMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, August 23, 2004, 12:38 PM) PART III: CHAPTER ONE DIFFUSERS FOR CGH S

COMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, August 23, 2004, 12:38 PM) PART III: CHAPTER ONE DIFFUSERS FOR CGH S COPUTER GEERATED HOLOGRAS Optical Sciences 67 W.J. Dallas (onday, August 3, 004, 1:38 P) PART III: CHAPTER OE DIFFUSERS FOR CGH S Part III: Chapter One Page 1 of 8 Introduction Hologras for display purposes

More information

Relief shape inheritance and graphical editor for the landscape design

Relief shape inheritance and graphical editor for the landscape design Relief shape inheritance and graphical editor for the landscape design Egor A. Yusov Vadi E. Turlapov Nizhny Novgorod State University after N. I. Lobachevsky Nizhny Novgorod Russia yusov_egor@ail.ru vadi.turlapov@cs.vk.unn.ru

More information

Feature Selection to Relate Words and Images

Feature Selection to Relate Words and Images The Open Inforation Systes Journal, 2009, 3, 9-13 9 Feature Selection to Relate Words and Iages Wei-Chao Lin 1 and Chih-Fong Tsai*,2 Open Access 1 Departent of Coputing, Engineering and Technology, University

More information

An Automatic Detection Method for Liver Lesions Using Abdominal Computed Tomography

An Automatic Detection Method for Liver Lesions Using Abdominal Computed Tomography n utoatic Detection Method for Liver Lesions Using bdoinal Coputed Toography Sheng-Fang Huang Departent of Medical Inforatics Tzu Chi University Hualien, Taiwan SFhuang@ail.tcu.edu.tw Kuo-Hsien Chiang

More information

1 Extended Boolean Model

1 Extended Boolean Model 1 EXTENDED BOOLEAN MODEL It has been well-known that the Boolean odel is too inflexible, requiring skilful use of Boolean operators to obtain good results. On the other hand, the vector space odel is flexible

More information

Using Imperialist Competitive Algorithm in Optimization of Nonlinear Multiple Responses

Using Imperialist Competitive Algorithm in Optimization of Nonlinear Multiple Responses International Journal of Industrial Engineering & Production Research Septeber 03, Volue 4, Nuber 3 pp. 9-35 ISSN: 008-4889 http://ijiepr.iust.ac.ir/ Using Iperialist Copetitive Algorith in Optiization

More information

OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS

OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS Key words SOA, optial, coplex service, coposition, Quality of Service Piotr RYGIELSKI*, Paweł ŚWIĄTEK* OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS One of the ost iportant tasks in service oriented

More information

An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured from Different Viewpoints

An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured from Different Viewpoints 519 An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured fro Different Viewpoints Yousuke Kawauchi 1, Shin Usuki, Kenjiro T. Miura 3, Hiroshi Masuda 4 and Ichiro Tanaka 5 1 Shizuoka

More information

NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH

NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH V. Atienza; J.M. Valiente and G. Andreu Departaento de Ingeniería de Sisteas, Coputadores y Autoática Universidad Politécnica de Valencia.

More information

Comparison of Navigator Echo and Centroid Corrections of Image Displacement Induced by Static Magnetic Field Drift on Echo Planar Functional MRI

Comparison of Navigator Echo and Centroid Corrections of Image Displacement Induced by Static Magnetic Field Drift on Echo Planar Functional MRI JOURNAL OF MAGNETIC RESONANCE IMAGING 13:308 312 (2001) Technical Note Coparison of Navigator Echo and Centroid Corrections of Iage Displaceent Induced by Static Magnetic Field Drift on Echo Planar Functional

More information

Structural Balance in Networks. An Optimizational Approach. Andrej Mrvar. Faculty of Social Sciences. University of Ljubljana. Kardeljeva pl.

Structural Balance in Networks. An Optimizational Approach. Andrej Mrvar. Faculty of Social Sciences. University of Ljubljana. Kardeljeva pl. Structural Balance in Networks An Optiizational Approach Andrej Mrvar Faculty of Social Sciences University of Ljubljana Kardeljeva pl. 5 61109 Ljubljana March 23 1994 Contents 1 Balanced and clusterable

More information

Optimized stereo reconstruction of free-form space curves based on a nonuniform rational B-spline model

Optimized stereo reconstruction of free-form space curves based on a nonuniform rational B-spline model 1746 J. Opt. Soc. A. A/ Vol. 22, No. 9/ Septeber 2005 Y. J. Xiao and Y. F. Li Optiized stereo reconstruction of free-for space curves based on a nonunifor rational B-spline odel Yi Jun Xiao Departent of

More information

A Discrete Spring Model to Generate Fair Curves and Surfaces

A Discrete Spring Model to Generate Fair Curves and Surfaces A Discrete Spring Model to Generate Fair Curves and Surfaces Atsushi Yaada Kenji Shiada 2 Tootake Furuhata and Ko-Hsiu Hou 2 Tokyo Research Laboratory IBM Japan Ltd. LAB-S73 623-4 Shiotsurua Yaato Kanagawa

More information

International Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN

International Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN International Journal of Scientific & Engineering Research, Volue 4, Issue 0, October-203 483 Design an Encoding Technique Using Forbidden Transition free Algorith to Reduce Cross-Talk for On-Chip VLSI

More information

TALLINN UNIVERSITY OF TECHNOLOGY, INSTITUTE OF PHYSICS 17. FRESNEL DIFFRACTION ON A ROUND APERTURE

TALLINN UNIVERSITY OF TECHNOLOGY, INSTITUTE OF PHYSICS 17. FRESNEL DIFFRACTION ON A ROUND APERTURE 7. FRESNEL DIFFRACTION ON A ROUND APERTURE. Objective Exaining diffraction pattern on a round aperture, deterining wavelength of light source.. Equipent needed Optical workbench, light source, color filters,

More information

Fast Positron Range Calculation in Heterogeneous Media for 3D PET Reconstruction

Fast Positron Range Calculation in Heterogeneous Media for 3D PET Reconstruction Fast Positron Range Calculation in Heterogeneous Media for 3D PET Reconstruction László Sziray-Kalos, Milán Magdics, Balázs Tóth, Balázs Csébfalvi, Taás Uenhoffer, Judit Lantos, and Gergely Patay Abstract

More information

Investigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks

Investigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Investigation of The Tie-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Pingyi Fan, Chongxi Feng,Yichao Wang, Ning Ge State Key Laboratory on Microwave and Digital Counications,

More information

AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM

AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM International Journal of Software Engineering & Applications (IJSEA), Vol.6, No.5, Septeber 205 AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM Xie Yang and Cheng Wushan College of Mechanical Engineering,

More information

Boosted Detection of Objects and Attributes

Boosted Detection of Objects and Attributes L M M Boosted Detection of Objects and Attributes Abstract We present a new fraework for detection of object and attributes in iages based on boosted cobination of priitive classifiers. The fraework directly

More information

Identifying Converging Pairs of Nodes on a Budget

Identifying Converging Pairs of Nodes on a Budget Identifying Converging Pairs of Nodes on a Budget Konstantina Lazaridou Departent of Inforatics Aristotle University, Thessaloniki, Greece konlaznik@csd.auth.gr Evaggelia Pitoura Coputer Science and Engineering

More information

Effects of Desingularization and Collocation-Point Shift on Steady Waves with Forward Speed

Effects of Desingularization and Collocation-Point Shift on Steady Waves with Forward Speed Effects of Desingularization and Collocation-Point Shift on Steady Waves with Forward Speed Yonghwan Ki* & Dick K.P. Yue** Massachusetts Institute of Technology, Departent of Ocean Engineering, Cabridge,

More information

The Art and Pitfalls of fmri Preprocessing

The Art and Pitfalls of fmri Preprocessing Translational Neuroodeling Unit The Art and Pitfalls of fmri Preprocessing Lars Kasper June 14 th, 2015 - An SPM Perspective MR-Technology Group & Translational Neuroodeling Unit Institute for Bioedical

More information

Different criteria of dynamic routing

Different criteria of dynamic routing Procedia Coputer Science Volue 66, 2015, Pages 166 173 YSC 2015. 4th International Young Scientists Conference on Coputational Science Different criteria of dynaic routing Kurochkin 1*, Grinberg 1 1 Kharkevich

More information

Performance Analysis of RAID in Different Workload

Performance Analysis of RAID in Different Workload Send Orders for Reprints to reprints@benthascience.ae 324 The Open Cybernetics & Systeics Journal, 2015, 9, 324-328 Perforance Analysis of RAID in Different Workload Open Access Zhang Dule *, Ji Xiaoyun,

More information

Fast Robust Fuzzy Clustering Algorithm for Grayscale Image Segmentation

Fast Robust Fuzzy Clustering Algorithm for Grayscale Image Segmentation Fast Robust Fuzzy Clustering Algorith for Grayscale Iage Segentation Abdelabbar Cherkaoui, Hanane Barrah To cite this version: Abdelabbar Cherkaoui, Hanane Barrah. Fast Robust Fuzzy Clustering Algorith

More information

Reconstruction of Time Series using Optimal Ordering of ICA Components

Reconstruction of Time Series using Optimal Ordering of ICA Components Reconstruction of Tie Series using Optial Ordering of ICA Coponents Ar Goneid and Abear Kael Departent of Coputer Science & Engineering, The Aerican University in Cairo, Cairo, Egypt e-ail: goneid@aucegypt.edu

More information

Classification of Benign and Malignant DCE-MRI Breast Tumors by Analyzing the Most Suspect Region

Classification of Benign and Malignant DCE-MRI Breast Tumors by Analyzing the Most Suspect Region Classification of Benign and Malignant DCE-MRI Breast Tuors by Analyzing the Most Suspect Region Sylvia Glaßer 1, Uli Nieann 1, Uta Prei 2, Bernhard Prei 1, Myra Spiliopoulou 3 1 Departent for Siulation

More information

Cassia County School District #151. Expected Performance Assessment Students will: Instructional Strategies. Performance Standards

Cassia County School District #151. Expected Performance Assessment Students will: Instructional Strategies. Performance Standards Unit 1 Congruence, Proof, and Constructions Doain: Congruence (CO) Essential Question: How do properties of congruence help define and prove geoetric relationships? Matheatical Practices: 1. Make sense

More information

Image Reconstruction. R.D. Badawi. Department of Radiology Department of Biomedical Engineering. Page 1

Image Reconstruction. R.D. Badawi. Department of Radiology Department of Biomedical Engineering. Page 1 First ever X-ray iage - 895 Iage Reconstruction R.D. Badawi Departent of Radiology Departent of Bioedical Engineering X-ray Projection Iaging Requires straight line trajectory of unattenuated x-rays Nuclear

More information

λ-harmonious Graph Colouring Lauren DeDieu

λ-harmonious Graph Colouring Lauren DeDieu λ-haronious Graph Colouring Lauren DeDieu June 12, 2012 ABSTRACT In 198, Hopcroft and Krishnaoorthy defined a new type of graph colouring called haronious colouring. Haronious colouring is a proper vertex

More information

THE rounding operation is performed in almost all arithmetic

THE rounding operation is performed in almost all arithmetic This is the author's version of an article that has been published in this journal. Changes were ade to this version by the publisher prior to publication. The final version of record is available at http://dx.doi.org/.9/tvlsi.5.538

More information

Feature Based Registration for Panoramic Image Generation

Feature Based Registration for Panoramic Image Generation IJCSI International Journal of Coputer Science Issues, Vol. 10, Issue 6, No, Noveber 013 www.ijcsi.org 13 Feature Based Registration for Panoraic Iage Generation Kawther Abbas Sallal 1, Abdul-Mone Saleh

More information

CAMERA-GUIDED MRI-MEG COREGISTRATION

CAMERA-GUIDED MRI-MEG COREGISTRATION CAMERA-GUIDED MRI-MEG COREGISTRATION Chou-Ming Cheng 1,2 ( 鄭州閔 ), Li-Fen Chen 3,1 ( 陳麗芬 ), Yu-Te Wu 2,1 ( 吳育德 ), Jen-Chuen Hsieh 1,4,5,6 ( 謝仁俊 ), and Yong-Sheng Chen 7,* ( 陳永昇 ) 1 Laboratory of Integrated

More information

A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing

A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing A Trajectory Splitting Model for Efficient Spatio-Teporal Indexing Slobodan Rasetic Jörg Sander Jaes Elding Mario A. Nasciento Departent of Coputing Science University of Alberta Edonton, Alberta, Canada

More information

Predicting x86 Program Runtime for Intel Processor

Predicting x86 Program Runtime for Intel Processor Predicting x86 Progra Runtie for Intel Processor Behra Mistree, Haidreza Haki Javadi, Oid Mashayekhi Stanford University bistree,hrhaki,oid@stanford.edu 1 Introduction Progras can be equivalent: given

More information

Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem

Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem Theoretical Analysis of Local Search and Siple Evolutionary Algoriths for the Generalized Travelling Salesperson Proble Mojgan Pourhassan ojgan.pourhassan@adelaide.edu.au Optiisation and Logistics, The

More information

Geo-activity Recommendations by using Improved Feature Combination

Geo-activity Recommendations by using Improved Feature Combination Geo-activity Recoendations by using Iproved Feature Cobination Masoud Sattari Middle East Technical University Ankara, Turkey e76326@ceng.etu.edu.tr Murat Manguoglu Middle East Technical University Ankara,

More information

Data & Knowledge Engineering

Data & Knowledge Engineering Data & Knowledge Engineering 7 (211) 17 187 Contents lists available at ScienceDirect Data & Knowledge Engineering journal hoepage: www.elsevier.co/locate/datak An approxiate duplicate eliination in RFID

More information

Utility-Based Resource Allocation for Mixed Traffic in Wireless Networks

Utility-Based Resource Allocation for Mixed Traffic in Wireless Networks IEEE IFOCO 2 International Workshop on Future edia etworks and IP-based TV Utility-Based Resource Allocation for ixed Traffic in Wireless etworks Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, and Dacheng

More information

A Learning Framework for Nearest Neighbor Search

A Learning Framework for Nearest Neighbor Search A Learning Fraework for Nearest Neighbor Search Lawrence Cayton Departent of Coputer Science University of California, San Diego lcayton@cs.ucsd.edu Sanjoy Dasgupta Departent of Coputer Science University

More information

Approximate String Matching with Reduced Alphabet

Approximate String Matching with Reduced Alphabet Approxiate String Matching with Reduced Alphabet Leena Salela 1 and Jora Tarhio 2 1 University of Helsinki, Departent of Coputer Science leena.salela@cs.helsinki.fi 2 Aalto University Deptartent of Coputer

More information

Derivation of an Analytical Model for Evaluating the Performance of a Multi- Queue Nodes Network Router

Derivation of an Analytical Model for Evaluating the Performance of a Multi- Queue Nodes Network Router Derivation of an Analytical Model for Evaluating the Perforance of a Multi- Queue Nodes Network Router 1 Hussein Al-Bahadili, 1 Jafar Ababneh, and 2 Fadi Thabtah 1 Coputer Inforation Systes Faculty of

More information

Affine Invariant Texture Analysis Based on Structural Properties 1

Affine Invariant Texture Analysis Based on Structural Properties 1 ACCV: The 5th Asian Conference on Coputer Vision, --5 January, Melbourne, Australia Affine Invariant Texture Analysis Based on tructural Properties Jianguo Zhang, Tieniu Tan National Laboratory of Pattern

More information

3D Building Detection and Reconstruction from Aerial Images Using Perceptual Organization and Fast Graph Search

3D Building Detection and Reconstruction from Aerial Images Using Perceptual Organization and Fast Graph Search 436 Journal of Electrical Engineering & Technology, Vol. 3, No. 3, pp. 436~443, 008 3D Building Detection and Reconstruction fro Aerial Iages Using Perceptual Organization and Fast Graph Search Dong-Min

More information

Shape Optimization of Quad Mesh Elements

Shape Optimization of Quad Mesh Elements Shape Optiization of Quad Mesh Eleents Yufei Li 1, Wenping Wang 1, Ruotian Ling 1, and Changhe Tu 2 1 The University of Hong Kong 2 Shandong University Abstract We study the proble of optiizing the face

More information

3 Conference on Inforation Sciences and Systes, The Johns Hopkins University, March, 3 Sensitivity Characteristics of Cross-Correlation Distance Metric and Model Function F. Porikli Mitsubishi Electric

More information

POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang

POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang IEEE International Conference on ultiedia and Expo POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION Junjun Jiang, Ruiin Hu, Zhen Han, Tao Lu, and Kebin Huang National Engineering

More information

CLUSTERING OF AE SIGNAL AMPLITUDES BY MEANS OF FUZZY C-MEANS ALGORITHM

CLUSTERING OF AE SIGNAL AMPLITUDES BY MEANS OF FUZZY C-MEANS ALGORITHM The 12 th International Conference of the Slovenian Society for Non-Destructive Testing»Application of Conteporary Non-Destructive Testing in Engineering«Septeber 4-6, 213, Portorož, Slovenia More info

More information

Supplementary methods

Supplementary methods Supplementary methods This section provides additional technical details on the sample, the applied imaging and analysis steps and methods. Structural imaging Trained radiographers placed all participants

More information

Resolution. Super-Resolution Imaging. Problem

Resolution. Super-Resolution Imaging. Problem Resolution Super-Resolution Iaging Resolution: Sallest easurable detail in a visual presentation Subhasis Chaudhuri Departent of Electrical Engineering Indian institute of Technology Bobay Powai, Mubai-400

More information

Knowledge-Based Segmentation of Brain MRI Scans Using the Insight Toolkit

Knowledge-Based Segmentation of Brain MRI Scans Using the Insight Toolkit Knowledge-Based Segmentation of Brain MRI Scans Using the Insight Toolkit John Melonakos 1, Ramsey Al-Hakim 1, James Fallon 2 and Allen Tannenbaum 1 1 Georgia Institute of Technology, Atlanta GA 30332,

More information

A Hybrid Network Architecture for File Transfers

A Hybrid Network Architecture for File Transfers JOURNAL OF IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 6, NO., JANUARY 9 A Hybrid Network Architecture for File Transfers Xiuduan Fang, Meber, IEEE, Malathi Veeraraghavan, Senior Meber,

More information

Homework 1. An Introduction to Neural Networks

Homework 1. An Introduction to Neural Networks Hoework An Introduction to Neural Networks -785: Introduction to Deep Learning Spring 09 OUT: January 4, 09 DUE: February 6, 09, :59 PM Start Here Collaboration policy: You are expected to coply with the

More information

Colorado School of Mines. Computer Vision. Professor William Hoff Dept of Electrical Engineering &Computer Science.

Colorado School of Mines. Computer Vision. Professor William Hoff Dept of Electrical Engineering &Computer Science. Professor Willia Hoff Dept of Electrical Engineering &Coputer Science http://inside.ines.edu/~whoff/ 1 Caera Calibration 2 Caera Calibration Needed for ost achine vision and photograetry tasks (object

More information

Automatic Generation of Training Data for Brain Tissue Classification from MRI

Automatic Generation of Training Data for Brain Tissue Classification from MRI MICCAI-2002 1 Automatic Generation of Training Data for Brain Tissue Classification from MRI Chris A. Cocosco, Alex P. Zijdenbos, and Alan C. Evans McConnell Brain Imaging Centre, Montreal Neurological

More information

Solving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification

Solving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification Solving the Daage Localization Proble in Structural Health Monitoring Using Techniques in Pattern Classification CS 9 Final Project Due Dec. 4, 007 Hae Young Noh, Allen Cheung, Daxia Ge Introduction Structural

More information

(Geometric) Camera Calibration

(Geometric) Camera Calibration (Geoetric) Caera Calibration CS635 Spring 217 Daniel G. Aliaga Departent of Coputer Science Purdue University Caera Calibration Caeras and CCDs Aberrations Perspective Projection Calibration Caeras First

More information

CROSSOVER ANALYSIS OF CHANG E-1 LASER ALTIMETER DATA

CROSSOVER ANALYSIS OF CHANG E-1 LASER ALTIMETER DATA ISPRS Workshop on Geospatial Data Infrastructure: fro data acquisition and updating to sarter services CROSSOVER ANALYSIS OF CHANG E- LASER ALTIMETER DATA Wenin Hu, Zongyu Yue, Kaichang Di* Institute of

More information

Biomedical Research 2016; Special Issue: S324-S331 ISSN X

Biomedical Research 2016; Special Issue: S324-S331 ISSN X Bioedical Research 2016; Special Issue: S324-S331 ISSN 0970-938X www.bioedres.info A novel region based segentation of hepatic tuors and hepatic vein in low contrast CTA iages using Bernstein polynoials.

More information

( ) ( ) ( ) ( ), Main Menu

( ) ( ) ( ) ( ), Main Menu Anti-alias optial interpolation with priors Ali Özbek*, Schluberger; Massiiliano Vassallo, WesternGeco; A. Keal Özdeir, WesternGeco; Daniele Molteni 1, WesternGeco; Yaşar Keal Alp 2, Schluberger. Suary

More information

Real Time Displacement Measurement of an image in a 2D Plane

Real Time Displacement Measurement of an image in a 2D Plane International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882 Volue 5, Issue 3, March 2016 176 Real Tie Displaceent Measureent of an iage in a 2D Plane Abstract Prashant

More information

Region Segmentation Region Segmentation

Region Segmentation Region Segmentation /7/ egion Segentation Lecture-7 Chapter 3, Fundaentals of Coputer Vision Alper Yilaz,, Mubarak Shah, Fall UCF egion Segentation Alper Yilaz,, Mubarak Shah, Fall UCF /7/ Laer epresentation Applications

More information

IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE. Rafael García, Xevi Cufí and Lluís Pacheco

IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE. Rafael García, Xevi Cufí and Lluís Pacheco IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE Rafael García, Xevi Cufí and Lluís Pacheco Coputer Vision and Robotics Group Institute of Inforatics and Applications, University of

More information