Comprehensive Quantification of Signal-to-Noise Ratio and g-factor for Image-Based and k-space-based Parallel Imaging Reconstructions
|
|
- Caroline Barnett
- 6 years ago
- Views:
Transcription
1 Magneti Resonane in Mediine 60: (2008) Comprehensive Quantifiation of Signal-to-Noise Ratio and g-fator for Image-Based and k-spae-based Parallel Imaging Reonstrutions Philip M. Robson, 1 * Aaron K. Grant, 1 Ananth J. Madhuranthakam, 2 Riardo Lattanzi, 1,3 Daniel K. Sodikson, 4 and Charles A. MKenzie 5 Parallel imaging reonstrutions result in spatially varying noise amplifiation haraterized by the g-fator, preluding onventional measurements of noise from the final image. A simple Monte Carlo based method is proposed for all linear image reonstrution algorithms, whih allows measurement of signal-to-noise ratio and g-fator and is demonstrated for SENSE and GRAPPA reonstrutions for aelerated aquisitions that have not previously been amenable to suh assessment. Only a simple presan measurement of noise amplitude and orrelation in the phased-array reeiver, and a single aelerated image aquisition are required, allowing robust assessment of signal-to-noise ratio and g-fator. The pseudo multiple replia method has been rigorously validated in phantoms and in vivo, showing exellent agreement with true multiple replia and analytial methods. This method is universally appliable to the parallel imaging reonstrution tehniques used in linial appliations and will allow pixel-by-pixel image noise measurements for all parallel imaging strategies, allowing quantitative omparison between arbitrary k-spae trajetories, image reonstrution, or noise onditioning tehniques. Magn Reson Med 60: , Wiley-Liss, In. Key words: signal-to-noise ratio; image noise; g-fator; parallel imaging; image reonstrution Parallel imaging approahes are widely used for aelerating MR image aquisitions (Simultaneous Aquisition of Spatial Harmonis (SMASH) (1), Sensitivity Enoding (SENSE) (2), Generalized Auto-Calibrating Partially Parallel Aquisition (GRAPPA) (3). Reeiving signals simultaneously in the independent elements of a radiofrequeny oil array allows aquisition of some of the phase-enoded signals to be omitted. The distint spatial sensitivity profiles of the elements ontain spatial information that may be used for the purpose of spatial enoding in the image that is normally provided by appliation of magneti field gradients. The penalty for aquiring fewer signals is a loss of Signal-to-Noise Ratio (SNR) in the final image by a fator 1 Department of Radiology, Beth Israel Deaoness Medial Center, Boston, Massahusetts. 2 Global Applied Siene Lab., GE Healthare, Boston, Massahusetts. 3 Harvard-MIT Division of Health Sienes and Tehnology, Boston, Massahusetts. 4 Department of Radiology, New York University Shool of Mediine, New York, New York. 5 Department of Medial Biophysis, The University of Western Ontario, London, Ontario, Canada. *Correspondene to: Philip M. Robson, Beth Israel Deaoness Medial Center, Department of Radiology, Room, Ansin 242, 330 Brookline Avenue, Boston, MA probson@bidm.harvard.edu Reeived 30 Otober 2007; revised 7 April 2008; aepted 15 May DOI /mrm Published online in Wiley InterSiene ( Wiley-Liss, In. 895 of the square root of the aeleration fator R due to redued signal averaging. In parallel imaging image-noise is further amplified by the ill-onditioning of the image reonstrution proess. In general, the noise amplifiation is spatially variant and depends on the speifi geometry of the radiofrequeny oil array used and is therefore haraterized by the (geometry) g-fator (2). An aurate and quantitative method of analyzing noise amplifiation is essential for objetive omparison between parallel imaging tehniques and between image reonstrution methods when developing new methods and designing linial imaging protools. Spatial variation of the image noise preludes the onventional (and simple) Region-of-Interest (ROI) approah for SNR estimation whih uses a region of signal within the objet and a region of noise outside of the objet (4,5), making SNR diffiult to deal with pratially in parallel imaging. Quantifiation of noise amplifiation in parallel imaging has been studied previously (2,6), produing methods for diret alulation of image noise, g- fator (2) and SNR (7) for some lasses of parallel imaging strategies. However, all existing tehniques are subjet to ertain regimes in whih it is impossible to alulate SNR analytially. Diret image noise matrix approahes (2) require memory for matries of size O(n 2 ), where n may be as large as N 2 for arbitrary k-spae trajetories and generalized SENSE image reonstrution (8), where N is the image matrix dimension. Typially N may be 256, whih, for omplex floating-point data, leads to a reonstrution matrix of approximately 30 Gb. For diret GRAPPA approahes n may be as large as N 3 (9) leading to a reonstrution matrix of approximately 2000 Tb. Furthermore, matrix inversion approahes require O(n 3 ) operations (8). Thus, diret omputation rapidly may beome intratable suh that urrently there is no universal approah for measuring SNR or g-fator. Statistial methods, for example Monte Carlo and bootstrapping methods (10), are often used in funtional parameter estimation from MRI (e.g., Jones and Steger et al.) (11,12). This work develops a simple Monte Carlo method for rigorously alulating image noise propagating through the image reonstrution itself (similarly to methods explored previously) (13,14). This method allows alulation of SNR and g-fator for all parallel imaging tehniques whih use a linear image reonstrution algorithm, irrespetive of whether diret alulation is available or omputationally tratable. In this work we demonstrate noise analysis for two lasses of parallel imaging methods (SENSE and GRAPPA) routinely used in linial imaging appliations.
2 896 Robson et al. IMAGE NOISE ANALYSIS FOR LINEAR RECONSTRUCTION ALGORITHMS As desribed by Pruessmann et al. (2), for a linear image reonstrution the propagation of noise from the sampled values in k-spae into the image noise is desribed by noise matries. The image reonstrution is desribed by the operation of the reonstrution matrix F on the vetor of k-spae data s, to generate image pixel values in the vetor (Eq. [1]). Fs [1] The variane of the pixel values in the p th element of is given by the p th diagonal entry in the image noise matrix X. X F F [2] The sample noise matrix (2) is the Kroneker produt of the noise ovariane matrix and an identity matrix of dimension N aq equal to the number of aquired k-spae points (the length of vetor s divided by the number of oil elements) (Eq. [3]). RI Naq [3] The noise ovariane matrix desribes the level and orrelation of noise in the signals reeived in eah element of the oil array. The noise ovariane matrix may be expressed in terms of the individual noise reords n ik (noise samples 1 k N k for oil i) reeived in eah oil element in the absene of NMR signal (Eq. [4], where * represents omplex onjugation) (7). ij 1 N k n 2N ikn jk* [4] k Trivially, a onventional Fourier Transform image reonstrution is a linear operation that may be expressed in the matrix form of Equation [1]. Noise amplifiation may also be haraterized analytially using this formalism. The g-fator is simply the ratio of the SNR for an optimal unaelerated image and the SNR of the aelerated image with an additional fator of the aeleration fator R whih aounts for the SNR loss due to averaging fewer aquired signals (Eq. [5]). k 1 g SNR optimal,unaelerated SNR aelerated R SD aelerated SD optimal,unaelerated R Equivalently, assuming the image signal is the same in the aelerated and unaelerated optimal reonstrutions (whih is expliitly required by the formalism of the SENSE reonstrution in Pruessmann et al.) (2) the g-fator may be expressed in terms of the image noise standard deviations (SD) leading to the familiar expression of g- fator in terms of image noise matrix terms (Eq. [6]). g p R X pp [5] aelerated X pp [6] optimal,unaelerated The optimal SNR image is ahieved by onsidering the noise orrelations between elements of the oil array as desribed by Roemer et al. (15). Therefore, it follows that an unaelerated image reonstrution may be suboptimal and may by our urrent definition have a g-fator greater than unity. This analytial approah allows image reonstrutions to inlude division by the image noise to generate pixel values in units of SNR, whereby the normal image pixel is divided by the alulated image noise for that pixel (hereafter referred to as the diret SNR method ). Kellman and MVeigh (7) desribe image reonstrutions in SNR-units by the diret SNR method for fully gradient-enoded (unaelerated) aquisitions and aelerated aquisitions using a SENSE tehnique. The diret method provides an image with pixel-by-pixel SNR values whih faithfully represent the spatial variation in image noise resulting from parallel imaging aquisition to omplement the information in the onventional magnitude image. Most linial appliations of parallel imaging follow either the SENSE or the GRAPPA approahes. SENSE image reonstrutions may be generalized (2,8,16) as a pseudo-inverse of the enoding matrix E whih expresses the k-spae signals reeived by eah element of a oil array reeiver s as the Fourier transform of the objet multiplied by the omplex spatial sensitivity of the oil element (Eqs. [7] and [8]). s E [7] E 1 E 1 E 1 s [8] It an be seen in Equation [8] that all generalized SENSE image reonstrutions obey the linear formulation required in Equation [1] for the analytial image noise matrix formalism of Equation [2] to hold. GRAPPA tehniques reonstrut missing phase-enoded lines in k-spae by linearly ombining neighboring lines. The weighting fators for the ombination are determined from fitting lines to a small additional number of autoalibration signal (ACS) lines aquired around the enter of k-spae. This is a generalization of similar k-spae fitting approahes (1,17). In other tehniques, for example, AUTO-SMASH (17), the linear ombination of k-spae lines produes a single omposite k-spae from whih a final image is reonstruted by Fourier transform. As desribed by Griswold et al. (3), the GRAPPA approah reonstruts fully sampled k-spae data for eah element of the oil array before reonstruting an image for eah oil by Fourier transform and enjoys the SNR advantage of a root-sum-of-squares (RSS) ombination of the separate oil images. The RSS step, speifially intended to improve SNR (and avoid phase anellation problems), is nonlinear and preludes use of the image noise matrix formalism to alulate image noise and g-fator diretly. This has proven an obstale to detailed analysis of the harateristis of noise propagation in the GRAPPA method beyond appreiating the exellent appearane of various images reonstruted by the GRAPPA method. However, the RSS oilombination is a simplifiation of the full omplex oil
3 Comprehensive Quantifiation of SNR and g-fator 897 ombination desribed by Roemer et al. (15) for the unaelerated ase. Use of omplex ombinations allows the GRAPPA reonstrution to be written as a linear matrix operation (9). In this alternative formulation, eah of the steps of the GRAPPA reonstrution may be expressed as a matrix operation. First, missing phase-enoded lines in the undersampled k-spae are reonstruted by the operation of a transfer matrix T, whih performs linear ombinations of neighboring lines. Seond, a Fourier transform matrix H is applied to the now repleted k-spae data matrix from eah oil. Finally, a omplex oil-ombination matrix Ĉ (9) is applied to form the vetor of final image pixels (Eq. [9]). ĈHTs [9] Complex oil ombination allows the GRAPPA reonstrution to be expressed as a linear operation and, therefore, noise propagation may be analyzed using the image noise formalism of Eq. [2]. The oil sensitivities used in the matrix Ĉ may be alulated from a separate image or from the entral lines of the aquired k-spae data in a self-alibrating approah. The linear matrix representation omplex-grappa approah is disussed in Robson et al. (9). Limitations of Conventional Noise Analysis The formality of writing the reonstrution in a matrix operation form for the purpose of noise analysis arries the high omputational burden of handling many data at one. The size of the reonstrution matrix for SENSE and GRAPPA methods with 1-D aeleration is O(N y by N ky ), where N y and N ky are the number of data in the imageand k-spae y-dimension, and is the number of oil elements. The omputation for the generalized SENSE method is more demanding as this involves inversion of a matrix of this order of magnitude (8). In volumetri image aquisitions where aeleration is applied in two dimensions, whih is ommonly the ase in linial appliations, the matries beome larger, O(N y N z by N ky N kz ), where N z and N kz are equivalent quantities in the z-dimension; furthermore, in GRAPPA methods where the reonstrution kernel may span three dimensions (18), the matrix expands into a further dimension leading to a reonstrution matrix size O(N x N y N z by N kx N ky N kz ). Thus diret alulation of SNR and g-fator by means of image noise matries soon beomes omputationally intratable. It should be noted that 2D-Cartesian- SENSE (19) is omputationally tratable beause the regularly undersampled data permit ontration of the generalized matrix expression into small sub-bloks. For variable density k-spae sampling shemes oupled with 2D aeleration, the full matrix must be used. Non-Cartesian k-spae sampling trajetories, inluding radial and spiral tehniques, where it is not possible to form disrete sets of aliased pixels are another important lass of image aquisitions for whih an analytial and omputationally tratable matrix reonstrution may not be available due to the size of the reonstrution matrix. In all suh ases where the matrix approah of image reonstrution is not feasible an alternative approah is used. For SENSE tehniques, an iterative onjugate-gradient (CG) tehnique may be applied to reonstrut the image as desribed in Pruessmann et al. (8). For GRAPPA tehniques, many small onvolution operations are applied to the undersampled k- spae followed by a standard Fourier Transform algorithm (indeed this is the onventional implementation of the GRAPPA reonstrution for Cartesian sampling, and with additional regridding of the data for non-cartesian GRAPPA) (20). However, diret alulation of the image noise and g-fator is not possible without forming the reonstrution matrix; indeed iterative approahes for generalized SENSE do not yield expliitly the reonstrution weights whih form the reonstrution matrix. Diret alulation of image noise beomes intratable whenever the reonstrution matrix beomes too large to be omputationally feasible, inluding the following: (i) Cartesian SENSE with variable density k-spae traversal and 2D aeleration; (ii) Generalized SENSE with arbitrary k-spae trajetories (e.g., spirals); (iii) GRAPPA with 2D aeleration (inluding regular undersampling shemes); (iv) GRAPPA with 2D or 3D reonstrution kernels. A PSEUDO MULTIPLE REPLICA APPROACH As an alternative to the analytial matrix-based approah, image noise amplifiations may be determined from the variations in image pixel values aused by random noise flutuations in the input k-spae signals where the image reonstrution is onsidered to be a blak-box signal proessing blok. The gold-standard image noise measurement is the soalled atual multiple replia method where k-spae signals are aquired multiple times and reonstruted using the same blak-box into a stak of equivalent image replias whih differ only in their noise ontent. Image noise may then be found on a pixel-by-pixel basis by finding the standard deviation of pixel values through the stak of image replias. Aquisition of multiple image replias allows assessment of image noise and thus SNR on a pixel-by-pixel basis and is therefore useful for measuring the spatially-variant amplified noise in parallel imaging (4,5). The use of this gold standard is not feasible in pratie for real-world in vivo imaging due to exessive patient motion or physiologi noise between image aquisitions, suseptibility to instrument drift (21), and prolonged examination times. For a linear blak-box signal proessing blok the image noise is solely dependent on the noise in the signal and the reonstrution an be seen to operate on the image and the noise separately. We propose a simple Monte Carlo tehnique hereafter termed the pseudo multiple replia method for obtaining a robust measurement of image noise for all linear image reonstrutions whih may be used when a diret alulation is not possible. Corretly saled and orrelated syntheti random noise is added to the aquired k-spae before blak-box image reonstrution. This proess is repeated multiple times, eah time with different syntheti noise, to produe a stak of independent image replias from whih image noise may be alulated emulating the gold-standard atual multiple replia method. A previous study (13) has used this approah with syntheti Gaussian noise without onsider-
4 898 Robson et al. ing noise orrelations. Another study (14) applied a bootstrap method, reordering aquired noise, to estimate the noise propagation through the image reonstrution that inluded noise orrelations and saling without needing to generate fresh noise for eah replia. The pseudo multiple replia method is based on prior knowledge of the signal noise in k-spae. It does not require expliit knowledge of the reonstrution matrix and requires aquisition of k-spae only one to alulate SNR of the aelerated image. The iterative onjugate gradient method for SENSE methods is linear and thus may be used with the pseudo multiple replia method. For GRAPPA methods, the onventional image reonstrution whih applies many small onvolutions before RSS oil-ombination is nonlinear only in the final RSS step. Therefore, a linear omplex- GRAPPA may be implemented in both a full matrix form (transfer matrix used to reonstrut k-spae) and the onventional form of reonstrution. Thus a linear onventional GRAPPA tehnique may be used with the pseudo multiple replia method. ( RSS-GRAPPA will be speified expliitly hereafter, with onventional referring to k-spae reonstrution and omplex referring to omplex oil ombination.). THEORY Pseudo Multiple Replia Method On the assumption that repeatedly aquired k-spae data differs only in its noise ontent, the signal omponent being unhanged, syntheti omplex noise, orretly saled and orrelated between elements of the oil array, may be added to k-spae to emulate atual multiple replia aquisition before image reonstrution (see Fig. 1). Noise may be added uniformly to k-spae; the harateristi spatial variane of noise ours only in image spae after image reonstrution. The pseudo multiple replia method takes advantage of the linearity of the image reonstrution. Eah pseudo replia image has the orret representation of the image noise despite being noisier than the original aquired image by a fator of 2 after FIG. 1. a: The pseudo multiple replia method. Image k-spae and the noise presan data are aquired one (steps 1 3). The noise ovariane matrix is used to sale and orrelate unity SD Gaussian noise for every replia loop (steps 4 7). The reonstruted image is added to a stak of replias before repeating the noise-addition loop (step 8). For self-alibrated tehniques, the reonstrution matrix is alulated from the original data and is used for all replias. The stak of replias is then used to alulate SNR (step 9 10). In step 11, the multiple replia loop is repeated using an artifiial fully-sized zero k-spae to analyze noise from an un-aelerated aquisition and with an image reonstrution that is simply an FFT and an optimal omplex oil ombination. Finally, g-fator is alulated (step 12). b: The steps involved in forming the SNR and g-fator for both SENSE and GRAPPA image reonstrutions. Noise SD is found from the standard deviation of the real or imaginary parts of the omplex pixel values for eah pixel loation through the stak of replias (STEP 2). In STEP 5, the g-fator is found from the two noise SD maps divided by the square root of the aeleration fator R.
5 Comprehensive Quantifiation of SNR and g-fator 899 addition of the seond independent set of pseudo noise data. The atual image noise, whih annot be removed from the aquired k-spae, remains in every image replia and appears as part of the true image when the image noise is alulated from the stak of pseudo image replias. The noise is found from the standard deviation of either the real or imaginary omponents of the omplex image pixel values through the stak of replias beause the linear reonstrution transforms noise in an equivalent manner in either omponent of the omplex signal. As many replias as desired for alulating standard deviation may be formed. Linearity of an image reonstrution also ensures that Gaussian distributed white noise in the reeived NMR signal is transformed into Gaussian noise in the image domain. Thus, the standard deviation of image pixel values takes an intuitive interpretation defining the range in whih the true pixel value may be found, or, equivalently, the amount by whih the pixel value may vary due to random noise flutuations alone. Furthermore, linear reonstrutions do not suffer from noise biasing whih results from magnitude operations (7,22). Saling and orrelation of the noise is determined from the signal aquired during a noise presan when the reeiver is opened with no RF pulses and no normal MR signal present, as desribed by Kellman and MVeigh (7) (see Fig. 1a). The oils must be loaded as for imaging so that the noise reeived is that originating from the objet; and the oil must be in plae as for imaging so that the noise orrelations due to oupling of omponent oils are orretly measured. The bandwidth of the reeiver and the reeiver gains are set as for imaging to ensure the noise is saled orretly. Further details of the noise presan may be found in Kellman and MVeigh (7). The noise ovariane matrix ij measuring the noise level (diagonal elements) and orrelation (off-diagonal elements) between oils i and j (where i and j run from 1 to the number of oils, ) in the oil array may be formed (7,23) from the measured noise presan data aording to Equation [10] with the noise reords n ik of N omplex points sampled at time intervals indexed by k from the i th omponent oil. ij 1 N 2N n ik n* jk [10] k 1 Saled and orrelated noise reords for eah hannel i of orr the phased-array n ik are formulated from unorrelated Gaussian-distributed white noise n G ik with unity standard deviation by matrix multipliation with the prinipal matrix square root of the measured noise ovariane matrix (Eq. [11]) suh that the noise ovariane matrix is reovered upon multipliation of orrelated noise reords (Eq. [12]), given that the prinipal square root of the noise ovariane matrix is equal to its Hermitian onjugate. n ik orr j 1 1/2 G ij n jk [11] N 1 2N k 1 1 n orr ik n orr jk * 1 2N p 1 1 2N p 1 N 2N k 1 1/2 ip jp q 1 1/2 G ip n pk p 1 1/2 ip jq q 1 N 1/2 * k 1 1/2 *2N pq p 1 * 1/2 jq *n G qk q 1 n G pk n G qk * 1/2 ip 1/2 pj ij [12] 1/ The matrix square root 2 ij is given by the matrix of eigenvetors V ij and the diagonal matrix of square roots of eigenvalues S pq ij 1/2 1 V ip S pq V qj p 1 q 1 [13] from the eigen-deomposition of the noise ovariane matrix ij 1 ij V ip D pq V qj p 1 q 1 [14] where D pq is the diagonal matrix of eigenvalues. The prinipal matrix square root is given by taking all positive square roots of the eigenvalues. For the Hermitian-positive definite noise ovariane matrix, all eigenvalues are real and positive, and the eigenvetors form a unitary basis, so 1/ that it an be seen that 2 ij is equal to its Hermitian onjugate as required in Equation [12]. The prinipal matrix square root of the noise ovariane matrix was hosen arbitrarily as the orrelating matrix. The Cholesky deomposition of the noise ovariane matrix into a lower triangular matrix L ij and its Hermitian onjugate is an equivalent hoie for the orrelating matrix as previously used by Pruessmann et al. (8). To onfirm the freedom of hoie Gaussian noise was orrelated with the prinipal matrix square root, another of the matrix square roots from the eigen-deomposition, and the lower triangular matrix from the Cholesky deomposition. The noise SD of eah of the orrelated hannels was found to be the same for eah method used. Thus, any appropriate hoie of the orrelating matrix produes equivalent results when used with the pseudo multiple replia method. SNR Maps From the Pseudo Multiple Replia Method Maps of SNR are formed from the pseudo multiple replia method by first forming an image noise map. For eah pixel the standard deviation in either the real or imaginary omponent of the omplex image is found from the stak of image replias. The SNR is then given by the magnitude of the image in the original reonstruted image, that is, that without additional noise added, divided by the value of the noise standard deviation for that pixel. We use the real omponent of the image beause the image is ompletely real after reonstrution so as to avoid magnituderelated noise bias in low-snr regions. Note that the image
6 900 Robson et al. noise is always orretly measured, without noise bias, from the omplex data. The SNR map will always have itself the SNR of the aquired image from whih the signal omponent of SNR is taken whereas the SNR of the image noise map may be made as high as desired by inreasing the number of pseudo replias reonstruted and is limited only by total available omputation time. g-fator Maps From the Pseudo Multiple Replia Method g-fator maps are generally reated diretly from the reonstrution matrix as speified in Pruessmann et al. (2). To ensure the general appliability of the pseudo multiple replia method, a proedure is required for determining the g-fator that does not require aquisition of a fully sampled referene image to provide the image noise standard deviation for an unaelerated aquisition in the expression for the g-fator in Equation [5] (where R is the aeleration fator). Again taking advantage of the linearity of the reonstrution, the pseudo multiple replia method is applied to noise-only data. The unaelerated image noise may be found by reonstruting a syntheti noise-only fully sampled k-spae (i.e., the data has the full matrix size of the final image) instead of an aquired unaelerated image k-spae. Repeated reonstrution of multiple replias of noise-only k-spae data produes a stak of noise-only image replias whose pixel noise standard deviation gives the proper value for an unaelerated aquisition. Alternatively, a diret image-noise alulation for R 1 may be used (7). Care must be taken to find the optimal-snr image for the unaelerated ase to orretly define the g-fator. For both SENSE and GRAPPA tehniques, this is given by an FFT, orretly saled for unity gain of noise, followed by an optimal omplex oil-ombination desribed by Roemer et al. (15). The Roemer-optimum image is formed by the inlusion of the noise ovariane matrix into the optimal oil-ombination Ĉ whih appears in the GRAPPA matrixreonstrution (Eq. [9]) as desribed in Robson et al. (9). g-fator maps are then found from the ratio of the noise standard deviation maps for an aelerated and an unaelerated aquisition (Eq. [5]). The proedure for measuring the noise ovariane matrix and for performing the pseudo multiple replia measurement of the SNR and g-fator is desribed in Figure 1. Pseudo Multiple Replia Method With Self-alibrated Approahes FIG. 2. Plot of the standard deviation (losed irles) of repeated (five) estimates of the noise-sd (open irles) of separate unityvariane Gaussian-distributed noise data of varying number of samples. For a single estimate of the noise-sd to have a standard deviation less than 1% of the true value (here 0.01), the noise data must omprise greater than approximately 10 4 samples. The pseudo multiple replia tehnique relies on the image reonstrution being idential for eah replia in order that flutuations in the NMR signal are orretly translated into variane in the image domain. For externally-alibrated tehniques, this ondition is met. Conventionally, SENSE tehniques use oil sensitivities obtained from a separate alibration image and are therefore externally alibrated. However, GRAPPA tehniques are most often selfalibrating, finding the reonstrution weights from the aquired k-spae itself (i.e. from the Auto-Calibrating-Signal lines). It is possible to implement an externally alibrated GRAPPA-reonstrution by using weights alulated from a separate equivalent k-spae aquisition. In the ase of self-alibrated tehniques, it is important to use the same reonstrution for eah replia in the pseudo multiple replia method. For SENSE tehniques this requires the use of the same oil sensitivities for eah replia. For GRAPPA tehniques the same transfer matrix (or set of reonstrution weights) must be used as alulated for reonstruting the original aelerated image without pseudo-noise added (rather than using new weights alulated from syntheti noise-enhaned ACS in eah replia). METHODS Pre-San Noise Measurement and Saling The required number of noise samples whih must be taken to orretly measure the noise ovariane matrix has been determined by alulating the SD of Gaussian distributed random noise reords of various lengths N, whih eah have unit variane. This was repeated five times eah for different values of N between 64 and The SD of the five estimates for eah N is plotted in Figure 2 showing that for a measurement of noise SD to be aurate to within 2% N must be greater than approximately 2000 and within 1% greater than approximately 8000 (following a 1/ N pattern). These values an be ahieved by using image matries of and , respetively. It was onfirmed that digitization error was not important by observing a Gaussian harater in a histogram plot of both the real and imaginary omponents of the noise reeived in eah of the elements of the oil array with no NMR signal present. Twenty-one bins were used over the observed range of the noise. It was assumed throughout that the noise is white in harater, having equal power at all frequenies. Kellman and MVeigh desribe the presan noise measurement in greater detail (7). Experiments The pseudo multiple replia SNR measurement was validated with images of the manufaturer s standard spheri-
7 Comprehensive Quantifiation of SNR and g-fator 901 al phantom. Pseudo multiple replia SNR and g-fator measurements were ompared with gold-standard atual multiple replia SNR and g-fator measurements from 128 separately aquired 2D slie images and also ompared with the diret SNR method (7,9). Both SENSE and GRAPPA methods were investigated for various aeleration fators with undersampling in one dimension. 2D aeleration with variable density k-spae traversal was then investigated in phantoms where it is possible to validate the pseudo multiple replia method against the gold standard atual multiple replia method but not against a diret alulation. The pseudo multiple replia method was then applied in vivo after obtaining written informed onsent with approval of our institutional review board. First, in the brain, 1-D aeleration was used allowing the pseudo multiple replia method to be verified by a diret image-noise alulation, noting that no atual replia method is feasible in vivo. Finally, a 3D volumetri image of the abdomen was obtained using 2D aeleration, a variable density k-spae trajetory and self-alibration. A linial presription was hosen whih requires parallel imaging aeleration to aquire data in a single 22-s breath-hold demonstrating the pseudo multiple replia tehnique in a ase for whih no other method exists for alulating SNR and g-fator. Pseudo multiple replia alulations used 128 image replias throughout. The estimate of SNR and g-fator beomes inreasingly aurate as the number of replias is inreased, thus the optimal hoie of the number of replias is somewhat arbitrary and depends on the desired auray and total omputation time available. Using approximately 100 replias gives an adequate auray of 10% aording to a 1/ N saling relationship. All data were aquired on a 1.5 Tesla (T) Exite-HDx whole-body sanner, (GE Healthare, Waukesha, WI) using an 8-hannel head oil array exept the abdomen image whih used an 8-hannel body array. In the phantom and the brain images k-spae data were aquired fully sampled and later deimated by removing some aquired phaseenoded lines from the data set to mimi aelerated aquisitions of various net redution fators and k-spae sampling patterns. Noise data were aquired from an equivalent separate single image with the amplitude of RF pulses set to zero and without hanging transeiver settings, giving greater than 4096 data points, whih was suffiient to alulate the noise ovariane matrix. An axial 2D slie of the phantom was aquired using a fast gradient realled eho pulse sequene; imaging parameters inluded: matrix size of 64 64, field of view of 20 m, slie thikness of 1 mm, aquisition bandwidth of khz, flip angle of replias of the same slie were aquired onseutively in a single experiment. k-spae data from the first replia aquisition were used with the diret SNR method and the pseudo multiple replia method. The hosen imaging parameters for the phantom experiment resulted in an image SNR of approximately 40 for a fully sampled image, whih is suffiiently low that noise dominates shot-to-shot variation in the sanner in the determination of SNR from the atual multiple replias (6). For a seletion of pixels, pixel intensity in eah replia was plotted against replia number (not shown) to onfirm that no temporal drift was present in the atual multiple replia data. An axial 2D slie of the brain was aquired using a T 1 -weighted spin-eho pulse sequene; imaging parameters inluded: matrix size of , field of view of 22 m, slie thikness of 5 mm, aquisition bandwidth of khz, TR/TE of 500/20 ms. A oronal 3D volume of the abdomen was aquired with at 1 -weighted fast gradient realled eho pulse sequene; imaging parameters inluded: in-plane matrix size of , with 80 3-mm slies, field of view of 36 m, frequeny-enode diretion superior-inferior, aquisition bandwidth of 62.5 khz, TR/TE of 3.9/1.7 ms, and flip angle 15. In-house implementations of an iterative onjugate-gradient generalized SENSE image reonstrution and a omplex-ombined GRAPPA method with onventional onvolution-like k-spae reonstrution (9) were used for the multiple replia images. In-house implementations were also used for the diret matrix-inverse generalized SENSE reonstrution and the diret omplex-grappa matrixreonstrution (9). All image reonstrution and image replia analysis was performed using Matlab (The Math- Works, Natik, MA) and run on a standard PC with a Pentium IV 2.8 GHz CPU and 512 MB of RAM. The omputation time required to generate SNR and g-fator maps is dominated by the reonstrution of the aelerated image replias (the generation of pseudo noise, the formation of unaelerated image replias, and finding the final image noise standard deviation are all relatively rapid). Computation times varied aording to the size of the image matries being handled and reonstrution type; they were generally rather long, ranging from a few minutes for 128 onventional GRAPPA replias with a matrix size of to approximately 24 hr for 128 replias of a CG-generalized SENSE reonstrution with a matrix size of However, the Matlab ode used in this work had not been optimized for speed, and signifiant redutions in omputation time are likely to be possible. g-fator maps for the gold-standard atual multiple replia method (in the phantom) were formed by dividing the image-noise SD-maps alulated from the stak of atual aelerated image replias by the image-noise SD-map alulated from the stak of atual optimal-snr unaelerated image replias. It was onfirmed that the image-noise SD-map alulated from the unaelerated atual multiple replias and the SD-map alulated using pseudo fully sampled noise and the pseudo multiple replia method were equivalent (not shown). Unaelerated image-noise maps for the pseudo replia method used pseudo fully sampled noise throughout. In all ases, for both SENSE and GRAPPA methods oil sensitivities were alulated from the fully sampled enter of k-spae whih is filtered by a Kaiser-Bessel window with 2. In all ases exept in the phantom for an outer redution fator of 3 the undersampled k-spae had a variable density sampling pattern. RESULTS Figure 3 shows the SNR-saled images (intensity units of SNR) and g-fator maps for the 2D slie through the
8 902 Robson et al. FIG. 3. SNR-saled images and g- fator maps (three leftmost olumns, SNR top, g-fator bottom) for various aeleration fators (ORF shown at left) using generalized SENSE reonstrution. There is exellent agreement between all methods: (i) atual multiple replia, (ii) pseudo multiple replia, and (iii) diret alulation. Iterative CG reonstrution is used for the multiple replia methods and matrix-inversion for the diret SNR method. Differene maps (two rightmost olumns) for eah aeleration between methods show negligible residual struture between all methods. (Phase-enoding/aeleration diretion is left right.) phantom reonstruted using a SENSE image reonstrution. Measurements have been made using three methods: (i) atual multiple replia method, (ii) pseudo multiple replia method, and (iii) diret SNR method. SNR maps are shown for: (a) fully sampled image, (b) threefold regularly undersampled, and () variable-density undersampling with an outer redution fator (ORF) of 4 and dense fully sampled enter of 16 lines giving total aeleration fator R 2.3. Differene maps between the pseudo multiple replia measurement and gold standard methods are shown for both SNR and g-fator maps. Differene maps are normalized to the gold-standard measurement. Figure 4 shows equivalent images using a GRAPPA image reonstrution. Interestingly, in the g-fator maps for the GRAPPA image reonstrution shown in Figure 4 there are loalized regions in whih the g-fator is less than one. This is a surprising feature whih is disussed further below. There is exellent agreement between the SNR and g- fator maps alulated with all methods and for all aelerations both in spatial distribution and in the overall saling of SNR and g-fator values. The differene maps show there is no residual differential struture in the SNR or g-fator maps between methods. Computations of the mean value in the differene maps inside a mask of the phantom show that systemati error in the SNR and g- fator maps from the pseudo multiple replia method are always within 2% of the gold standard measurement. These small global errors are likely due to small inauray in the measurement of the noise ovariane matrix
9 Comprehensive Quantifiation of SNR and g-fator 903 FIG. 4. SNR-saled images and g- fator maps (three leftmost olumns, SNR top, g-fator bottom) for various aeleration fators (ORF shown at left) using GRAPPA reonstrution. There is exellent agreement between all methods: (i) atual multiple replia (ii) pseudo multiple replia, and (iii) diret alulation. Conventional onvolution-like reonstrution is used for the multiple replia methods and matrix-inversion for the diret SNR method; both use SNR-optimal omplex oil-ombination. Differene maps (two rightmost olumns) for eah aeleration between methods show negligible residual struture between all methods. (Phase-enoding/aeleration diretion is left right.) when omparing to atual multiple replia noise, or due to some small saling differene that exists between the diret image reonstrutions and the reonstrution methods used for the multiple replia measurements. As disussed by Kellman and MVeigh (7) the noise in the diret SNR method is determined from more samples (64 64) of the noise in the noise ovariane matrix than the number of replia images (128); therefore, the SNR and g-fator maps for the multiple replia methods appear noisier than those from the diret SNR method. The light bands at the edges of the FOV evident in the gold-standard multiple replia differene maps in Figures 3 and 4 are a onsequene of a sharp roll-off to the top-hat frequeny response of the digital reeiver whih is not repliated in the pseudo noise; this does not affet the noise in the bandwidth inluding the image. Figure 5 shows SNR and g-fator maps for both a SENSE and a GRAPPA image reonstrution method. Data were undersampled with an ORF of 2 in twodimensions and inluded a dense enter of k-spae of 8 lines in both dimensions giving a total redution fator R 3.1. Exellent agreement is observed between the pseudo multiple replia method and the gold standard atual multiple replia method. Mean values of the differene maps within the mask of the phantom show systemati differenes in the SNR and g-fator maps between the pseudo and atual multiple replia methods of less than 2%. It is interesting to note that despite being applied to exatly the same data, the SENSE and GRAPPA reonstrutions give very different patterns of SNR and g-fator, as also observed by Thunberg and Zetterberg (13).
10 904 Robson et al. FIG. 5. SNR-saled images and g-fator maps (SNR middle-top, g-fator middle-bottom) for 2D aelerated generalized SENSE and GRAPPA image reonstrutions. A fully sampled and aelerated image is shown (top-left/ top-right for eah reonstrution method); an ORF of 2 in both dimensions was used with a dense enter of 8 lines in eah dimension giving R 3.1 for the full matrix size of CG-Generalized SENSE and onvolution-like GRAPPA with omplex-ombination reonstrutions were used. There is exellent agreement between pseudo multiple replia and atual multiple replia methods. Differene maps (bottom) between methods show negligible residual struture. Figure 6 shows SNR and g-fator maps for the axial 2D brain image reonstruted using a SENSE and a GRAPPA tehnique undersampled with an ORF of 4 and inluding a dense fully sampled enter of 32 lines giving a total aeleration R 2.9. The SNR-saled images and g-fator maps alulated using the pseudo multiple replia method are ompared with those alulated using the diret SNR method and show exellent agreement (note that atual multiple replia measurement is not feasible due to subjet motion limitations). Mean values of the differene maps within the mask of the brain show systemati differenes in the SNR and g-fator maps between the pseudo multiple replia and diret SNR methods of less than 1%. The g-fator maps in the brain are familiar from those in the phantom where the overall geometry and the oil sensitivity distributions are similar. Figure 7 shows SNR and g-fator maps for a oronal and axial-reformatted slie from the 3D volumetri image of the abdomen. Aquired data was undersampled with an ORF of 2 in both phase-enoded diretions with a densely sampled enter of 20 lines in eah diretion and a total aeleration fator R Image reonstrution used a generalized SENSE approah. No diret alulation of SNR and g-fator is omputationally feasible with this k-spae trajetory, beause the reonstrution matrix was approximately 6 Gb (for a matrix size of being undersampled by R 2.63 and with 8 oils, see Limitations of Conventional Noise Analysis in the Introdution setion); nor is an atual multiple replia method feasible in vivo. DISCUSSION g-fator Less Than Unity for GRAPPA It was noted in the Results setion that a g-fator less than 1 is found when using a GRAPPA reonstrution. It is well established that a g-fator less than one is not possible for SENSE reonstrutions that use a matrix inverse of the entire under-sampled k-spae data (2). Any image reon-
11 Comprehensive Quantifiation of SNR and g-fator 905 FIG. 6. SNR-saled images and g- fator maps (SNR middle-top, g- fator middle-bottom) in vivo for generalized SENSE and GRAPPA image reonstrutions. A fully sampled and aelerated image is shown (top-left/top-right for eah reonstrution method); an ORF of 4 was used with a dense enter of 32 lines giving R 2.9 for the full matrix size of CG-Generalized SENSE and onvolutionlike GRAPPA with omplex-ombination reonstrutions were used with the pseudo multiple replia method; matrix-inverse generalized SENSE and full matrix GRAPPA image reonstrution was used for the diret method. There is exellent agreement between pseudo multiple replia and diret alulation methods. Differene maps (bottom) between methods show negligible residual struture. strution (inluding modifiations to SENSE tehniques) may inlude expliitly some degree of numerial regularization to improve the apparent SNR and in suh ases a g-fator less than unity may be found (24). We infer from the observation of g 1 that our implementation of the GRAPPA tehnique inludes some impliit onditioning of the noise. This has been observed and disussed in Robson et al. (9). The agreement of a diret alulation of g-fator and an atual multiple replia method indiates that this observation of g 1 is a genuine finding. Suh inherent onditioning is likely to stem from alulation of the weighting fators for fitting missing lines in k-spae on a least-squares basis. Indeed, in the related SMASH reonstrution tehnique (1), the fitting proess is expliitly approximate. Pseudo Multiple Replia The pseudo multiple replia method has been shown to be an aurate method of quantifying the image noise for both SENSE and GRAPPA tehniques when ompared with diret alulation of image noise and g-fator from the image noise matries and to the gold-standard atual multiple replia values. Validation of the pseudo multiple replia method has been further demonstrated against the gold-standard atual replia method for a variable-density 2D-aelerated parallel imaging aquisition for whih it is not feasible to alulate image noise diretly due to the extremely large reonstrution matrix required for the diret alulation of image noise. While omputation time for the pseudo multiple replia method is also long it requires repetitions of smaller omputations and is therefore a preferred approah when diret approahes beome unfeasible. The method has been used to produe maps of g-fator without requiring aquisition of an unaelerated image permitting the method to be used in vivo when the need to aquire a lengthy unaelerated image would be prohibitive (e.g., for volumetri image aquisition). Generation of g-fator maps in addition to SNR maps is benefi-
12 906 Robson et al. FIG. 7. SNR and g-fator maps alulated using the pseudo multiple replia method for slies from a 3D volumetri image aquired in vivo in a 22-s breathhold. A CG-generalized SENSE image reonstrution of data undersampled in two dimensions with ORF 2 2, a dense enter of lines and total aeleration R 2.63 was used. The graysale maximum of 30/40 for SNR maps orresponds to oronal/axial orientations, respetively. ial for assessing noise amplifiation beause SNR maps inlude spatial variations due to the magnetization density as well as noise amplifiation. Furthermore, SNR maps inlude artifats from the image reonstrution whih should not be onfused with loalized regions of noise amplifiation. Additionally, the pseudo multiple replia tehnique is immune to the influene of instrumental drift and is, therefore, likely to out-perform aquisition of atual multiple replias (4,5,21). The noise presan is both rapid and simple. For a typial reeiver bandwidth of 60 khz, the noise pre-san ould take as little as one sixth of a seond given 10 4 samples required to measure the noise standard deviation to within 1%. Data aquisition simply requires opening the reeiver without RF exitation, whih easily may be inorporated into any imaging pulse sequene program. In this work, we have made possible the omparison between the noise harateristis of different image reonstrution methods. In our implementations, it is apparent that GRAPPA tehniques intrinsially ontrol noise to a greater extent than SENSE tehniques and demonstrate a more diffuse spatial variation of image noise as seen in their g-fator maps (13). In future studies, the pseudo multiple replia method will allow omprehensive, quantitative omparison between reonstrution tehniques for whih diret image noise alulations may not be available or may be omputationally intratable. For example, in Figure 3, it is interesting to note that a lower total aeleration of R 2.3 displays higher g-fator values and lower SNR due to the variable density of its k-spae trajetory with ORF of 4 when ompared with equivalent values for the regularly undersampled threefold aeleration; similar investigation of variable density trajetories where diret alulation of image noise is not omputationally feasible will be possible. Furthermore, beause the pseudo replia method brakets the entire image aquisition and reonstrution proess inserting random noise at the beginning and omputing image noise in the final step, it is possible with this method to analyze the effet of image proessing steps, for example, an expliit noise onditioning step, or the stopping ondition hosen in iterative approahes. Computation time is the prinipal drawbak to the pseudo multiple replia method whih may prelude routine implementation of SNR analysis. The lengthy image postproessing time may be drastially redued by implementing the analysis with optimized C-programs run on a faster dediated omputer. Furthermore, reonstrution of separate image replias may be trivially parallelized on luster or multi-ore arhitetures. However, an important appliation of the SNR and g-fator analysis proposed here will be in developing new parallel imaging tehniques and designing linial imaging protools ases in whih omputation time may not be a primary onstraint. CONCLUSION The pseudo multiple replia image noise measurement outlined here is a simple, robust and aurate method for the quantifiation of SNR and g-fator for all parallel imaging tehniques whih use a linear image reonstrution algorithm, enompassing the majority of linial parallel imaging appliations. This allows noise analysis for reonstrutions that do not permit diret alulation of image noise. This approah will provide a useful tool for objetive omparison between the in vivo-performane of parallel imaging methods being universally appliable with any signal aquisition shemes, k-spae sampling shemes or trajetories, image reonstrution methods, image proessing, or regularization tehniques, hopefully guiding
NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman
NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of
More informationLearning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract
CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and
More informationA {k, n}-secret Sharing Scheme for Color Images
A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University
More informationA Novel Validity Index for Determination of the Optimal Number of Clusters
IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers
More informationthe data. Structured Principal Component Analysis (SPCA)
Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving
More informationAbstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.
Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,
More informationExtracting Partition Statistics from Semistructured Data
Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk
More informationDetecting Moving Targets in Clutter in Airborne SAR via Keystoning and Multiple Phase Center Interferometry
Deteting Moving Targets in Clutter in Airborne SAR via Keystoning and Multiple Phase Center Interferometry D. M. Zasada, P. K. Sanyal The MITRE Corp., 6 Eletroni Parkway, Rome, NY 134 (dmzasada, psanyal)@mitre.org
More informationPipelined Multipliers for Reconfigurable Hardware
Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,
More informationOn - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2
On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,
More informationAcoustic Links. Maximizing Channel Utilization for Underwater
Maximizing Channel Utilization for Underwater Aousti Links Albert F Hairris III Davide G. B. Meneghetti Adihele Zorzi Department of Information Engineering University of Padova, Italy Email: {harris,davide.meneghetti,zorzi}@dei.unipd.it
More informationThe Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines
The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer
More informationDr.Hazeem Al-Khafaji Dept. of Computer Science, Thi-Qar University, College of Science, Iraq
Volume 4 Issue 6 June 014 ISSN: 77 18X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om Medial Image Compression using
More informationPlot-to-track correlation in A-SMGCS using the target images from a Surface Movement Radar
Plot-to-trak orrelation in A-SMGCS using the target images from a Surfae Movement Radar G. Golino Radar & ehnology Division AMS, Italy ggolino@amsjv.it Abstrat he main topi of this paper is the formulation
More informationAn Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index
IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive
More informationGraph-Based vs Depth-Based Data Representation for Multiview Images
Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:
More informationWhat are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study
What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The
More informationAnd, the (low-pass) Butterworth filter of order m is given in the frequency domain by
Problem Set no.3.a) The ideal low-pass filter is given in the frequeny domain by B ideal ( f ), f f; =, f > f. () And, the (low-pass) Butterworth filter of order m is given in the frequeny domain by B
More information3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT?
3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? Bernd Girod, Peter Eisert, Marus Magnor, Ekehard Steinbah, Thomas Wiegand Te {girod eommuniations Laboratory, University of Erlangen-Nuremberg
More informationOutline: Software Design
Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling
More informationFitting conics to paracatadioptric projections of lines
Computer Vision and Image Understanding 11 (6) 11 16 www.elsevier.om/loate/viu Fitting onis to paraatadioptri projetions of lines João P. Barreto *, Helder Araujo Institute for Systems and Robotis, Department
More informationDrawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;
Naïve line drawing algorithm // Connet to grid points(x0,y0) and // (x1,y1) by a line. void drawline(int x0, int y0, int x1, int y1) { int x; double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx;
More informationAccommodations of QoS DiffServ Over IP and MPLS Networks
Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering
More informationAlgorithms, Mechanisms and Procedures for the Computer-aided Project Generation System
Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department
More informationWe don t need no generation - a practical approach to sliding window RLNC
We don t need no generation - a pratial approah to sliding window RLNC Simon Wunderlih, Frank Gabriel, Sreekrishna Pandi, Frank H.P. Fitzek Deutshe Telekom Chair of Communiation Networks, TU Dresden, Dresden,
More informationAnalysis of input and output configurations for use in four-valued CCD programmable logic arrays
nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,
More informationCapturing Large Intra-class Variations of Biometric Data by Template Co-updating
Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University
More informationDetection of RF interference to GPS using day-to-day C/No differences
1 International Symposium on GPS/GSS Otober 6-8, 1. Detetion of RF interferene to GPS using day-to-day /o differenes Ryan J. R. Thompson 1#, Jinghui Wu #, Asghar Tabatabaei Balaei 3^, and Andrew G. Dempster
More informationUsing Augmented Measurements to Improve the Convergence of ICP
Using Augmented Measurements to Improve the onvergene of IP Jaopo Serafin, Giorgio Grisetti Dept. of omputer, ontrol and Management Engineering, Sapienza University of Rome, Via Ariosto 25, I-0085, Rome,
More informationPerformance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application
World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah
More informationAlgorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking
Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient
More informationASSESSMENT OF TWO CHEAP CLOSE-RANGE FEATURE EXTRACTION SYSTEMS
ASSESSMENT OF TWO CHEAP CLOSE-RANGE FEATURE EXTRACTION SYSTEMS Ahmed Elaksher a, Mohammed Elghazali b, Ashraf Sayed b, and Yasser Elmanadilli b a Shool of Civil Engineering, Purdue University, West Lafayette,
More informationIntroduction to Seismology Spring 2008
MIT OpenCourseWare http://ow.mit.edu 1.510 Introdution to Seismology Spring 008 For information about iting these materials or our Terms of Use, visit: http://ow.mit.edu/terms. 1.510 Leture Notes 3.3.007
More informationICCGLU. A Fortran IV subroutine to solve large sparse general systems of linear equations. J.J. Dongarra, G.K. Leaf and M. Minkoff.
http://www.netlib.org/linalg/ig-do 1 of 8 12/7/2009 11:14 AM ICCGLU A Fortran IV subroutine to solve large sparse general systems of linear equations. J.J. Dongarra, G.K. Leaf and M. Minkoff July, 1982
More informationarxiv: v1 [cs.db] 13 Sep 2017
An effiient lustering algorithm from the measure of loal Gaussian distribution Yuan-Yen Tai (Dated: May 27, 2018) In this paper, I will introdue a fast and novel lustering algorithm based on Gaussian distribution
More informationKERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION
KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION Cuiui Kang 1, Shengai Liao, Shiming Xiang 1, Chunhong Pan 1 1 National Laboratory of Pattern Reognition, Institute of Automation, Chinese
More informationAutomatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)
Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University
More informationVideo Data and Sonar Data: Real World Data Fusion Example
14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu
More informationWe P9 16 Eigenray Tracing in 3D Heterogeneous Media
We P9 Eigenray Traing in 3D Heterogeneous Media Z. Koren* (Emerson), I. Ravve (Emerson) Summary Conventional two-point ray traing in a general 3D heterogeneous medium is normally performed by a shooting
More informationParticle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating
Original Artile Partile Swarm Optimization for the Design of High Diffration Effiient Holographi Grating A.K. Tripathy 1, S.K. Das, M. Sundaray 3 and S.K. Tripathy* 4 1, Department of Computer Siene, Berhampur
More informationA Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering
A Novel Bit Level Time Series Representation with Impliation of Similarity Searh and lustering hotirat Ratanamahatana, Eamonn Keogh, Anthony J. Bagnall 2, and Stefano Lonardi Dept. of omputer Siene & Engineering,
More information1. Introduction. 2. The Probable Stope Algorithm
1. Introdution Optimization in underground mine design has reeived less attention than that in open pit mines. This is mostly due to the diversity o underground mining methods and omplexity o underground
More informationUnsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks
Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens
More informationSystem-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications
System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis
More informationAn Approach to Physics Based Surrogate Model Development for Application with IDPSA
An Approah to Physis Based Surrogate Model Development for Appliation with IDPSA Ignas Mikus a*, Kaspar Kööp a, Marti Jeltsov a, Yuri Vorobyev b, Walter Villanueva a, and Pavel Kudinov a a Royal Institute
More informationA New RBFNDDA-KNN Network and Its Application to Medical Pattern Classification
A New RBFNDDA-KNN Network and Its Appliation to Medial Pattern Classifiation Shing Chiang Tan 1*, Chee Peng Lim 2, Robert F. Harrison 3, R. Lee Kennedy 4 1 Faulty of Information Siene and Tehnology, Multimedia
More informationQuery Evaluation Overview. Query Optimization: Chap. 15. Evaluation Example. Cost Estimation. Query Blocks. Query Blocks
Query Evaluation Overview Query Optimization: Chap. 15 CS634 Leture 12 SQL query first translated to relational algebra (RA) Atually, some additional operators needed for SQL Tree of RA operators, with
More informationSmooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints
Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of
More informationSegmentation of brain MR image using fuzzy local Gaussian mixture model with bias field correction
IOSR Journal of VLSI and Signal Proessing (IOSR-JVSP) Volume 2, Issue 2 (Mar. Apr. 2013), PP 35-41 e-issn: 2319 4200, p-issn No. : 2319 4197 Segmentation of brain MR image using fuzzy loal Gaussian mixture
More informationCalculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem
Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion
More informationPerformance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification
erformane Improvement of TC on Wireless Cellular Networks by Adaptive Combined with Expliit Loss tifiation Masahiro Miyoshi, Masashi Sugano, Masayuki Murata Department of Infomatis and Mathematial Siene,
More informationRapid, accurate particle tracking by calculation of radial symmetry centers
Rapid, aurate partile traing by alulation of radial symmetry enters Raghuveer Parthasarathy Supplementary Text and Figures Supplementary Figures Supplementary Figure 1 Supplementary Figure Supplementary
More informationrepresent = as a finite deimal" either in base 0 or in base. We an imagine that the omputer first omputes the mathematial = then rounds the result to
Sientifi Computing Chapter I Computer Arithmeti Jonathan Goodman Courant Institute of Mathemaial Sienes Last revised January, 00 Introdution One of the many soures of error in sientifi omputing is inexat
More informationMeasurement of the stereoscopic rangefinder beam angular velocity using the digital image processing method
Measurement of the stereosopi rangefinder beam angular veloity using the digital image proessing method ROMAN VÍTEK Department of weapons and ammunition University of defense Kouniova 65, 62 Brno CZECH
More informationDetection and Recognition of Non-Occluded Objects using Signature Map
6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,
More informationSemi-Supervised Affinity Propagation with Instance-Level Constraints
Semi-Supervised Affinity Propagation with Instane-Level Constraints Inmar E. Givoni, Brendan J. Frey Probabilisti and Statistial Inferene Group University of Toronto 10 King s College Road, Toronto, Ontario,
More informationHEXA: Compact Data Structures for Faster Packet Processing
Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for
More informationFOREGROUND OBJECT EXTRACTION USING FUZZY C MEANS WITH BIT-PLANE SLICING AND OPTICAL FLOW
FOREGROUND OBJECT EXTRACTION USING FUZZY C EANS WITH BIT-PLANE SLICING AND OPTICAL FLOW SIVAGAI., REVATHI.T, JEGANATHAN.L 3 APSG, SCSE, VIT University, Chennai, India JRF, DST, Dehi, India. 3 Professor,
More informationApproximate logic synthesis for error tolerant applications
Approximate logi synthesis for error tolerant appliations Doohul Shin and Sandeep K. Gupta Eletrial Engineering Department, University of Southern California, Los Angeles, CA 989 {doohuls, sandeep}@us.edu
More informationColor Image Fusion for Concealed Weapon Detection
In: E.M. Carapezza (Ed.), Sensors, and ommand, ontrol, ommuniations, and intelligene (C3I) tehnologies for homeland defense and law enforement II, SPIE-571 (pp. 372-379). Bellingham, WA., USA: The International
More informationGray Codes for Reflectable Languages
Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings
More informationINTERPOLATED AND WARPED 2-D DIGITAL WAVEGUIDE MESH ALGORITHMS
Proeedings of the COST G-6 Conferene on Digital Audio Effets (DAFX-), Verona, Italy, Deember 7-9, INTERPOLATED AND WARPED -D DIGITAL WAVEGUIDE MESH ALGORITHMS Vesa Välimäki Lab. of Aoustis and Audio Signal
More informationRotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors
Eurographis Symposium on Geometry Proessing (003) L. Kobbelt, P. Shröder, H. Hoppe (Editors) Rotation Invariant Spherial Harmoni Representation of 3D Shape Desriptors Mihael Kazhdan, Thomas Funkhouser,
More informationNew Fuzzy Object Segmentation Algorithm for Video Sequences *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 521-537 (2008) New Fuzzy Obet Segmentation Algorithm for Video Sequenes * KUO-LIANG CHUNG, SHIH-WEI YU, HSUEH-JU YEH, YONG-HUAI HUANG AND TA-JEN YAO Department
More informationCross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer
Communiations and Networ, 2013, 5, 69-73 http://dx.doi.org/10.4236/n.2013.53b2014 Published Online September 2013 (http://www.sirp.org/journal/n) Cross-layer Resoure Alloation on Broadband Power Line Based
More informationPartial Character Decoding for Improved Regular Expression Matching in FPGAs
Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia
More informationThe Mathematics of Simple Ultrasonic 2-Dimensional Sensing
The Mathematis of Simple Ultrasoni -Dimensional Sensing President, Bitstream Tehnology The Mathematis of Simple Ultrasoni -Dimensional Sensing Introdution Our ompany, Bitstream Tehnology, has been developing
More informationA DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR
Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and
More information特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing
デンソーテクニカルレビュー Vol. 15 2010 特集 Road Border Reognition Using FIR Images and LIDAR Signal Proessing 高木聖和 バーゼル ファルディ Kiyokazu TAKAGI Basel Fardi ヘンドリック ヴァイゲル Hendrik Weigel ゲルド ヴァニーリック Gerd Wanielik This paper
More informationCOST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY
COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY Dileep P, Bhondarkor Texas Instruments Inorporated Dallas, Texas ABSTRACT Charge oupled devies (CCD's) hove been mentioned as potential fast auxiliary
More informationGradient based progressive probabilistic Hough transform
Gradient based progressive probabilisti Hough transform C.Galambos, J.Kittler and J.Matas Abstrat: The authors look at the benefits of exploiting gradient information to enhane the progressive probabilisti
More informationHIGHER ORDER full-wave three-dimensional (3-D) large-domain techniques in
FACTA UNIVERSITATIS (NIŠ) SER.: ELEC. ENERG. vol. 21, no. 2, August 2008, 209-220 Comparison of Higher Order FEM and MoM/SIE Approahes in Analyses of Closed- and Open-Region Eletromagneti Problems Milan
More informationSelf-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization
Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in
More informationFast Rigid Motion Segmentation via Incrementally-Complex Local Models
Fast Rigid Motion Segmentation via Inrementally-Complex Loal Models Fernando Flores-Mangas Allan D. Jepson Department of Computer Siene, University of Toronto {mangas,jepson}@s.toronto.edu Abstrat The
More informationCluster-Based Cumulative Ensembles
Cluster-Based Cumulative Ensembles Hanan G. Ayad and Mohamed S. Kamel Pattern Analysis and Mahine Intelligene Lab, Eletrial and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1,
More informationA radiometric analysis of projected sinusoidal illumination for opaque surfaces
University of Virginia tehnial report CS-21-7 aompanying A Coaxial Optial Sanner for Synhronous Aquisition of 3D Geometry and Surfae Refletane A radiometri analysis of projeted sinusoidal illumination
More informationMulti-Channel Wireless Networks: Capacity and Protocols
Multi-Channel Wireless Networks: Capaity and Protools Tehnial Report April 2005 Pradeep Kyasanur Dept. of Computer Siene, and Coordinated Siene Laboratory, University of Illinois at Urbana-Champaign Email:
More informationCleanUp: Improving Quadrilateral Finite Element Meshes
CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)
More informationChemical, Biological and Radiological Hazard Assessment: A New Model of a Plume in a Complex Urban Environment
hemial, Biologial and Radiologial Haard Assessment: A New Model of a Plume in a omplex Urban Environment Skvortsov, A.T., P.D. Dawson, M.D. Roberts and R.M. Gailis HPP Division, Defene Siene and Tehnology
More informationOptimization of Two-Stage Cylindrical Gear Reducer with Adaptive Boundary Constraints
5 JOURNAL OF SOFTWARE VOL. 8 NO. 8 AUGUST Optimization of Two-Stage Cylindrial Gear Reduer with Adaptive Boundary Constraints Xueyi Li College of Mehanial and Eletroni Engineering Shandong University of
More informationCompressed Sensing mm-wave SAR for Non-Destructive Testing Applications using Side Information
Compressed Sensing mm-wave SAR for Non-Destrutive Testing Appliations using Side Information Mathias Bequaert 1,2, Edison Cristofani 1,2, Gokarna Pandey 2, Marijke Vandewal 1, Johan Stiens 2,3 and Nikos
More informationUCSB Math TI-85 Tutorials: Basics
3 UCSB Math TI-85 Tutorials: Basis If your alulator sreen doesn t show anything, try adjusting the ontrast aording to the instrutions on page 3, or page I-3, of the alulator manual You should read the
More informationThe Implementation of RRTs for a Remote-Controlled Mobile Robot
ICCAS5 June -5, KINEX, Gyeonggi-Do, Korea he Implementation of RRs for a Remote-Controlled Mobile Robot Chi-Won Roh*, Woo-Sub Lee **, Sung-Chul Kang *** and Kwang-Won Lee **** * Intelligent Robotis Researh
More informationTime delay estimation of reverberant meeting speech: on the use of multichannel linear prediction
University of Wollongong Researh Online Faulty of Informatis - apers (Arhive) Faulty of Engineering and Information Sienes 7 Time delay estimation of reverberant meeting speeh: on the use of multihannel
More informationCluster-based Cooperative Communication with Network Coding in Wireless Networks
Cluster-based Cooperative Communiation with Network Coding in Wireless Networks Zygmunt J. Haas Shool of Eletrial and Computer Engineering Cornell University Ithaa, NY 4850, U.S.A. Email: haas@ee.ornell.edu
More informationSURVEY ON MEDICAL IMAGE SEGMENTATION USING ENHANCED K-MEANS AND KERNELIZED FUZZY C- MEANS
SURVEY ON MEDICAL IMAGE SEGMENTATION USING ENHANCED K-MEANS AND KERNELIZED FUZZY C- MEANS Gunwanti S. Mahajan & Kanhan S. Bhagat. Dept of E &TC, J. T. Mahajan C.o.E Faizpur, India ABSTRACT Diagnosti imaging
More informationImproved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules
Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu
More informationDefect Detection and Classification in Ceramic Plates Using Machine Vision and Naïve Bayes Classifier for Computer Aided Manufacturing
Defet Detetion and Classifiation in Cerami Plates Using Mahine Vision and Naïve Bayes Classifier for Computer Aided Manufaturing 1 Harpreet Singh, 2 Kulwinderpal Singh, 1 Researh Student, 2 Assistant Professor,
More informationDiffusion Kernels on Graphs and Other Discrete Structures
Diffusion Kernels on Graphs and Other Disrete Strutures Risi Imre Kondor ohn Lafferty Shool of Computer Siene Carnegie Mellon University Pittsburgh P 523 US KONDOR@CMUEDU LFFERTY@CSCMUEDU bstrat The appliation
More informationDynamic Programming. Lecture #8 of Algorithms, Data structures and Complexity. Joost-Pieter Katoen Formal Methods and Tools Group
Dynami Programming Leture #8 of Algorithms, Data strutures and Complexity Joost-Pieter Katoen Formal Methods and Tools Group E-mail: katoen@s.utwente.nl Otober 29, 2002 JPK #8: Dynami Programming ADC (214020)
More informationTUMOR DETECTION IN MRI BRAIN IMAGE SEGMENTATION USING PHASE CONGRUENCY MODIFIED FUZZY C MEAN ALGORITHM
TUMOR DETECTION IN MRI BRAIN IMAGE SEGMENTATION USING PHASE CONGRUENCY MODIFIED FUZZY C MEAN ALGORITHM M. Murugeswari 1, M.Gayathri 2 1 Assoiate Professor, 2 PG Sholar 1,2 K.L.N College of Information
More informationPerformance Benchmarks for an Interactive Video-on-Demand System
Performane Benhmarks for an Interative Video-on-Demand System. Guo,P.G.Taylor,E.W.M.Wong,S.Chan,M.Zukerman andk.s.tang ARC Speial Researh Centre for Ultra-Broadband Information Networks (CUBIN) Department
More informationCluster Centric Fuzzy Modeling
10.1109/TFUZZ.014.300134, IEEE Transations on Fuzzy Systems TFS-013-0379.R1 1 Cluster Centri Fuzzy Modeling Witold Pedryz, Fellow, IEEE, and Hesam Izakian, Student Member, IEEE Abstrat In this study, we
More informationPARAMETRIC SAR IMAGE FORMATION - A PROMISING APPROACH TO RESOLUTION-UNLIMITED IMAGING. Yesheng Gao, Kaizhi Wang, Xingzhao Liu
20th European Signal Proessing Conferene EUSIPCO 2012) Buharest, Romania, August 27-31, 2012 PARAMETRIC SAR IMAGE FORMATION - A PROMISING APPROACH TO RESOLUTION-UNLIMITED IMAGING Yesheng Gao, Kaizhi Wang,
More informationMulti-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality
INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of
More informationChannel Splitting Network for Single MR Image Super-Resolution. Xiaole Zhao, Yulun Zhang, Tao Zhang, and Xueming Zou. PSNR(dB)
1 Channel Splitting Network for Single R Image Super-Resolution Xiaole Zhao, Yulun Zhang, Tao Zhang, and Xueming Zou arxiv:1810.06453v [s.cv] 13 De 018 Abstrat High resolution magneti resonane (R) imaging
More informationA scheme for racquet sports video analysis with the combination of audio-visual information
A sheme for raquet sports video analysis with the ombination of audio-visual information Liyuan Xing a*, Qixiang Ye b, Weigang Zhang, Qingming Huang a and Hua Yu a a Graduate Shool of the Chinese Aadamy
More informationChapter 2: Introduction to Maple V
Chapter 2: Introdution to Maple V 2-1 Working with Maple Worksheets Try It! (p. 15) Start a Maple session with an empty worksheet. The name of the worksheet should be Untitled (1). Use one of the standard
More informationParametric Abstract Domains for Shape Analysis
Parametri Abstrat Domains for Shape Analysis Xavier RIVAL (INRIA & Éole Normale Supérieure) Joint work with Bor-Yuh Evan CHANG (University of Maryland U University of Colorado) and George NECULA (University
More informationChromaticity-matched Superimposition of Foreground Objects in Different Environments
FCV216, the 22nd Korea-Japan Joint Workshop on Frontiers of Computer Vision Chromatiity-mathed Superimposition of Foreground Objets in Different Environments Yohei Ogura Graduate Shool of Siene and Tehnology
More information