Wavelet Based Segmentation of Hyperspectral Colon Tissue Imagery
[毕业论文]流体覆盖薄层对无限大弹性板中声表面波波速的影响
![[毕业论文]流体覆盖薄层对无限大弹性板中声表面波波速的影响](https://img.taocdn.com/s3/m/8fc0de1278563c1ec5da50e2524de518964bd3c2.png)
流体覆盖薄层对无限大弹性板中声表面波波速的影响摘要压电声表面波器件有频率高、体积小、功能多、稳定性好、易于批量生产等特点,以其独特的性能在移动通信、航空航天、电子对抗等军用和民用领域得到了成功的应用。
新兴的声表面波流体传感器,更是以其灵敏度高和功耗低的特点,广泛应用于生物和化学试样的检测,是传感领域拥有巨大发展潜力的新方向。
本文首先从覆盖理想流体层的各向同性半无限大弹性体中的声表面波分析开始,求得了表面波速度与理想流体层厚度的关系,得到的结果与早期的研究和实验结果一致。
当基体是各向同性无限大弹性板的情况时,发现随着流体层厚度的不断减小,弹性板的振动开始表现为显著的对称和反对称模态,这一结果与没有覆盖流体层的弹性板振动研究结果相吻合。
由于实际的声表面波器件都是由各向异性材料制造的,为了能更精确地分析流体试样对声表面波的影响,我们分析了基体是半无限大ST切石英晶体和无限大ST切石英晶体板的情形。
由于弹性板与流体层的相互作用,实际振动会出现多个声表面波模态和相应的波速。
接着本文对覆盖粘性流体层的各向同性以及各向异性无限大弹性板中的声表面波传播特性进行了分析,求得了覆盖粘性流体层的无限大弹性板中的声表面波波速方程。
数值计算表明,由于弹性板和粘性流体层的驻波共振,板中声表面波的对称和反对称模态随着波速不同而进行着转换。
并且发现当粘性流体层厚度为零时,我们所求得的波速与没有覆盖粘性流体层相对应的无限大弹性板中的声表面波波速相同;当粘性流体层的厚度不断增加时,求得的声表面波波速接近于粘性流体层中的波速。
最后,本文把覆盖层材料扩展到粘弹性材料。
在考虑粘弹性材料的复材料常数的情况下,求得了覆盖粘弹性层的无限大弹性体和弹性板中的声表面波波速方程。
由于我们现行的研究模型更接近实际的声表面波流体传感器,并且充分考虑了覆盖流体层的厚度、密度以及粘性影响,因此本文的研究方法以及得到的结果对于声表面波流体传感器的分析和设计具有重要的实用价值。
基于Curvelet变换的图像压缩感知重构

基于Curvelet变换的图像压缩感知重构叶慧;孔繁锵【摘要】Discrete Cosine Transform(DCT) and wavelet transform are used for sparse representation, but DCT can’t analyse well in domain of time and frequency. The directional selectivity of wavelet transform is poor and can’t reconstruct edge information well enough. Against the optimization of sparse representation, Curvelet transform has characters of multi-scale, singularity and more sparsity. This paper proposes a compressed sensing reconstruction algorithm based on Curvelet transform, which uses Curvelet transform for sparse representation and thresholding method in wavelet domain to solve the noise problem of signal reconstruction. Results demonstrate that the algorithm gets 1.86 dB higher Peak Signal to Noise Ratio(PSNR) and 1.15 dB higher PSNR compared with traditional wavelet transform and Contourlet transform. As Curvelet transform is applied to compressed sensing, optimal result of edge and smooth part of image are got, also the reconstructed quality of details is increased.%压缩感知主要采用离散余弦变换(DCT)和正交小波进行图像的稀疏表示,但是 DCT 时频分析性能不佳,小波方向选择性差,不能很好地表示图像边缘的信息。
INTERNATIONAL JOURNAL OF CIRCUIT THEORY AND APPLICATIONS

INTERNATIONAL JOURNAL OF CIRCUIT THEORY AND APPLICATIONSInt.J.Circ.Theor.Appl.2006;34:559–582Published online in Wiley InterScience().DOI:10.1002/cta.375A wavelet-based piecewise approach for steady-state analysisof power electronics circuitsK.C.Tam,S.C.Wong∗,†and C.K.TseDepartment of Electronic and Information Engineering,Hong Kong Polytechnic University,Hong KongSUMMARYSimulation of steady-state waveforms is important to the design of power electronics circuits,as it reveals the maximum voltage and current stresses being imposed upon specific devices and components.This paper proposes an improved approach tofinding steady-state waveforms of power electronics circuits based on wavelet approximation.The proposed method exploits the time-domain piecewise property of power electronics circuits in order to improve the accuracy and computational efficiency.Instead of applying one wavelet approximation to the whole period,several wavelet approximations are applied in a piecewise manner tofit the entire waveform.This wavelet-based piecewise approximation approach can provide very accurate and efficient solution,with much less number of wavelet terms,for approximating steady-state waveforms of power electronics circuits.Copyright2006John Wiley&Sons,Ltd.Received26July2005;Revised26February2006KEY WORDS:power electronics;switching circuits;wavelet approximation;steady-state waveform1.INTRODUCTIONIn the design of power electronics systems,knowledge of the detailed steady-state waveforms is often indispensable as it provides important information about the likely maximum voltage and current stresses that are imposed upon certain semiconductor devices and passive compo-nents[1–3],even though such high stresses may occur for only a brief portion of the switching period.Conventional methods,such as brute-force transient simulation,for obtaining the steady-state waveforms are usually time consuming and may suffer from numerical instabilities, especially for power electronics circuits consisting of slow and fast variations in different parts of the same waveform.Recently,wavelets have been shown to be highly suitable for describingCorrespondence to:S.C.Wong,Department of Electronic and Information Engineering,Hong Kong Polytechnic University,Hunghom,Hong Kong.†E-mail:enscwong@.hkContract/sponsor:Hong Kong Research Grants Council;contract/grant number:PolyU5237/04ECopyright2006John Wiley&Sons,Ltd.560K.C.TAM,S.C.WONG AND C.K.TSEwaveforms with fast changing edges embedded in slowly varying backgrounds[4,5].Liu et al.[6] demonstrated a systematic algorithm for approximating steady-state waveforms arising from power electronics circuits using Chebyshev-polynomial wavelets.Moreover,power electronics circuits are piecewise varying in the time domain.Thus,approx-imating a waveform with one wavelet approximation(ing one set of wavelet functions and hence one set of wavelet coefficients)is rather inefficient as it may require an unnecessarily large wavelet set.In this paper,we propose a piecewise approach to solving the problem,using as many wavelet approximations as the number of switch states.The method yields an accurate steady-state waveform descriptions with much less number of wavelet terms.The paper is organized as follows.Section2reviews the systematic(standard)algorithm for approximating steady-state waveforms using polynomial wavelets,which was proposed by Liu et al.[6].Section3describes the procedure and formulation for approximating steady-state waveforms of piecewise switched systems.In Section4,application examples are presented to evaluate and compare the effectiveness of the proposed piecewise wavelet approximation with that of the standard wavelet approximation.Finally,we give the conclusion in Section5.2.REVIEW OF WA VELET APPROXIMATIONIt has been shown that wavelet approximation is effective for approximating steady-state waveforms of power electronics circuits as it takes advantage of the inherent nature of wavelets in describing fast edges which have been embedded in slowly moving backgrounds[6].Typically,power electronics circuits can be represented by a time-varying state-space equation˙x=A(t)x+U(t)(1) where x is the m-dim state vector,A(t)is an m×m time-varying matrix,and U is the inputfunction.Specifically,we writeA(t)=⎡⎢⎢⎢⎣a11(t)a12(t)···a1m(t)............a m1(t)a m2(t)···a mm(t)⎤⎥⎥⎥⎦(2)andU(t)=⎡⎢⎢⎢⎣u1(t)...u m(t)⎤⎥⎥⎥⎦(3)In the steady state,the solution satisfiesx(t)=x(t+T)for0 t T(4) where T is the period.For an appropriate translation and scaling,the boundary condition can be mapped to the closed interval[−1,1]x(+1)=x(−1)(5) Copyright2006John Wiley&Sons,Ltd.Int.J.Circ.Theor.Appl.2006;34:559–582A WA VELET-BASED PIECEWISE APPROACH FOR STEADY-STATE ANALYSIS561 Assume that the basic time-invariant approximation equation isx i(t)=K T i W(t)for−1 t 1and i=1,2,...,m(6) where W(t)is any wavelet basis of size2n+1+1(n being the wavelet level),K T i=[k i,0,...,k i,2n+1] is a coefficient vector of dimension2n+1+1,which is to be found.‡The wavelet transformedequation of(1)isKD W=A(t)K W+U(t)(7)whereK=⎡⎢⎢⎢⎢⎢⎢⎢⎣k1,0k1,1···k1,2n+1k2,0k2,1···k2,2n+1............k m,0k m,1···k m,2n+1⎤⎥⎥⎥⎥⎥⎥⎥⎦(8)Thus,(7)can be written generally asF(t)K=−U(t)(9) where F(t)is a m×(2n+1+1)m matrix and K is a(2n+1+1)m-dim vector,given byF(t)=⎡⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎣a11(t)W T(t)−W T(t)D T···a1i(t)W T(t)···a1m W T(t)...............a i1(t)W T(t)···a ii(t)W T(t)−W T(t)D T···a im W T(t)...............a m1(t)W T(t)···a mi(t)W T(t)···a mm W T(t)−W T(t)D T⎤⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎦(10)K=[K T1···K T m]T(11)Note that since the unknown K is of dimension(2n+1+1)m,we need(2n+1+1)m equations. Now,the boundary condition(5)provides m equations,i.e.[W(+1)−W(−1)]T K i=0for i=1,...,m(12) This equation can be easily solved by applying an appropriate interpolation technique or via direct numerical convolution[11].Liu et al.[6]suggested that the remaining2n+1m equations‡The construction of wavelet basis has been discussed in detail in Reference[6]and more formally in Reference[7].For more details on polynomial wavelets,see References[8–10].Copyright2006John Wiley&Sons,Ltd.Int.J.Circ.Theor.Appl.2006;34:559–582562K.C.TAM,S.C.WONG AND C.K.TSEare obtained by interpolating at2n+1distinct points, i,in the closed interval[−1,1],and the interpolation points can be chosen arbitrarily.Then,the approximation equation can be written as˜FK=˜U(13)where˜F= ˜F1˜F2and˜U=˜U1˜U2(14)with˜F1,˜F2,˜U1and˜U2given by˜F1=⎡⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎣[W(+1)−W(−1)]T(00···0)···(00···0)(00···0)[W(+1)−W(−1)]T···(00···0)............(00···0)2n+1+1columns(00···0)···[W(+1)−W(−1)]T(2n+1+1)m columns⎤⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎦⎫⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎬⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎭m rows(15)˜F2=⎡⎢⎢⎢⎢⎢⎢⎢⎢⎣F( 1)F( 2)...F( 2n+1)(2n+1+1)m columns⎤⎥⎥⎥⎥⎥⎥⎥⎥⎦⎫⎪⎪⎪⎪⎪⎪⎪⎪⎬⎪⎪⎪⎪⎪⎪⎪⎪⎭2n+1m rows(16)˜U1=⎡⎢⎢⎢⎣...⎤⎥⎥⎥⎦⎫⎪⎪⎪⎬⎪⎪⎪⎭m elements(17)˜U2=⎡⎢⎢⎢⎢⎢⎣−U( 1)−U( 2)...−U( 2n+1)⎤⎥⎥⎥⎥⎥⎦⎫⎪⎪⎪⎪⎪⎬⎪⎪⎪⎪⎪⎭2n+1m elements(18)Finally,by solving(13),we obtain all the coefficients necessary for generating an approximate solution for the steady-state system.Copyright2006John Wiley&Sons,Ltd.Int.J.Circ.Theor.Appl.2006;34:559–582A WA VELET-BASED PIECEWISE APPROACH FOR STEADY-STATE ANALYSIS5633.WA VELET-BASED PIECEWISE APPROXIMATION METHODAlthough the above standard algorithm,given in Reference[6],provides a well approximated steady-state solution,it does not exploit the piecewise switched nature of power electronics circuits to ease computation and to improve accuracy.Power electronics circuits are defined by a set of linear differential equations governing the dynamics for different intervals of time corresponding to different switch states.In the following,we propose a wavelet approximation algorithm specifically for treating power electronics circuits.For each interval(switch state),we canfind a wavelet representation.Then,a set of wavelet representations for all switch states can be‘glued’together to give a complete steady-state waveform.Formally,consider a p-switch-state converter.We can write the describing differential equation, for switch state j,as˙x j=A j x+U j for j=1,2,...,p(19) where A j is a time invariant matrix at state j.Equation(19)is the piecewise state equation of the system.In the steady state,the solution satisfies the following boundary conditions:x j−1(T j−1)=x j(0)for j=2,3,...,p(20) andx1(0)=x p(T p)(21)where T j is the time duration of state j and pj=1T j=T.Thus,mapping all switch states to the close interval[−1,1]in the wavelet space,the basic approximate equation becomesx j,i(t)=K T j,i W(t)for−1 t 1(22) with j=1,2,...,p and i=1,2,...,m,where K T j,i=[k1,i,0···k1,i,2n+1,k2,i,0···k2,i,2n+1,k j,i,0···k j,i,2n+1]is a coefficient vector of dimension(2n+1+1)×p,which is to be found.Asmentioned previously,the state equation is transformed to the wavelet space and then solved by using interpolation.The approximation equation is˜F(t)K=−˜U(t)(23) where˜F=⎡⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎣˜F˜F1˜F2...˜Fp⎤⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎦and˜U=⎡⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎣˜U˜U1˜U2...˜Up⎤⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎦(24)Copyright2006John Wiley&Sons,Ltd.Int.J.Circ.Theor.Appl.2006;34:559–582564K.C.TAM,S.C.WONG AND C.K.TSEwith ˜F0,˜F 1,˜F 2,˜F p ,˜U 0,˜U 1,˜U 2and ˜U p given by ˜F 0=⎡⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎣F a 00···F b F b F a 0···00F b F a ···0...............00···F b F a (2n +1+1)×m ×p columns⎤⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎦⎫⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎬⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎭m ×p rows (F a and F b are given in (33)and (34))(25)˜F 1=⎡⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎣F ( 1)0 0F ( 2)0 0............F ( 2n +1) (2n +1+1)m columns 0(2n +1+1)m columns···0 (2n +1+1)m columns(2n +1+1)×m ×p columns⎤⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎦⎫⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎬⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎭2n +1m rows(26)˜F 2=⎡⎢⎢⎢⎢⎢⎢⎢⎢⎣0F ( 1)···00F ( 2)···0............0(2n +1+1)m columnsF ( 2n +1)(2n +1+1)m columns···(2n +1+1)m columns⎤⎥⎥⎥⎥⎥⎥⎥⎥⎦(27)˜F p =⎡⎢⎢⎢⎢⎢⎢⎢⎢⎣0···0F ( 1)0···0F ( 2)...... 0(2n +1+1)m columns···(2n +1+1)m columnsF ( 2n +1)(2n +1+1)m columns⎤⎥⎥⎥⎥⎥⎥⎥⎥⎦(28)˜U0=⎡⎢⎢⎢⎣0 0⎤⎥⎥⎥⎦⎫⎪⎪⎪⎬⎪⎪⎪⎭m ×p elements(29)Copyright 2006John Wiley &Sons,Ltd.Int.J.Circ.Theor.Appl.2006;34:559–582A WA VELET-BASED PIECEWISE APPROACH FOR STEADY-STATE ANALYSIS565˜U1=⎡⎢⎢⎢⎢⎢⎣−U( 1)−U( 2)...−U( 2n+1)⎤⎥⎥⎥⎥⎥⎦⎫⎪⎪⎪⎪⎪⎬⎪⎪⎪⎪⎪⎭2n+1m elements(30)˜U2=⎡⎢⎢⎢⎢⎣−U( 1)−U( 2)...−U( 2n+1)⎤⎥⎥⎥⎥⎦(31)˜Up=⎡⎢⎢⎢⎢⎢⎣−U( 1)−U( 2)...−U( 2n+1)⎤⎥⎥⎥⎥⎥⎦(32)F a=⎡⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎣[W(−1)]T0 00[W(−1)]T 0............00···[W(−1)]T(2n+1+1)m columns⎤⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎦⎫⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎬⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎭m rows(33)F b=⎡⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎣[−W(+1)]T0 00[−W(+1)]T 0............00···[−W(+1)]T(2n+1+1)m columns⎤⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎦⎫⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎬⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎪⎭m rows(34)Similar to the standard approach outlined in Section2,all the coefficients necessary for gener-ating approximate solutions for each switch state for the steady-state system can be obtained by solving(23).It should be noted that the wavelet-based piecewise method can be further enhanced for approx-imating steady-state solution using different wavelet levels for different switch states.Essentially, Copyright2006John Wiley&Sons,Ltd.Int.J.Circ.Theor.Appl.2006;34:559–582566K.C.TAM,S.C.WONG AND C.K.TSEwavelets of high levels should only be needed to represent waveforms in switch states where high-frequency details are present.By using different choices of wavelet levels for different switch states,solutions can be obtained more quickly.Such an application of varying wavelet levels for different switch intervals can be easily incorporated in the afore-described algorithm.4.APPLICATION EXAMPLESIn this section,we present four examples to demonstrate the effectiveness of our proposed wavelet-based piecewise method for steady-state analysis of switching circuits.The results will be evaluated using the mean relative error (MRE)and mean absolute error (MAE),which are defined byMRE =12 1−1ˆx (t )−x (t )x (t )d t (35)MAE =12 1−1|ˆx (t )−x (t )|d t (36)where ˆx (t )is the wavelet-approximated value and x (t )is the SPICE simulated result.The SPICE result,being generated from exact time-domain simulation of the actual circuit at device level,can be used for comparison and evaluation.In discrete forms,MAE and MRE are simply given byMRE =1N Ni =1ˆx i −x i x i(37)MAE =1N Ni =1|ˆx i −x i |(38)where N is the total number of points sampled along the interval [−1,1]for error calculation.In the following,we use uniform sampling (i.e.equal spacing)with N =1001,including boundary points.4.1.Example 1:a single pulse waveformConsider the single pulse waveform shown in Figure 1.This is an example of a waveform that cannot be efficiently approximated by the standard wavelet algorithm.The waveform consists of five segments corresponding to five switch states (S1–S5),and the corresponding state equations are given by (19),where A j and U j are given specifically asA j =⎧⎪⎪⎪⎪⎪⎪⎪⎪⎪⎨⎪⎪⎪⎪⎪⎪⎪⎪⎪⎩0if 0 t <t 10if t 1 t <t 21if t 2 t <t 30if t 3 t <t 40if t 4 t T(39)Copyright 2006John Wiley &Sons,Ltd.Int.J.Circ.Theor.Appl.2006;34:559–582A WA VELET-BASED PIECEWISE APPROACH FOR STEADY-STATE ANALYSIS567S1S2S3S4S50t1t2t3t4THFigure 1.A single pulse waveform consisting of 5switch states.andU j =⎧⎪⎪⎪⎪⎪⎪⎪⎨⎪⎪⎪⎪⎪⎪⎪⎩0if 0 t <t 1H /(t 2−t 1)if t 1 t <t 2−Hif t 2 t <t 3−H /(t 4−t 3)if t 3 t <t 40if t 4 t T(40)where H is the amplitude (see Figure 1).Switch states 2(S2)and 4(S4)correspond to the rising edge and falling edge,respectively.Obviously,when the widths of rising and falling edges are small (relative to the whole switching period),the standard wavelet method cannot provide a satisfactory approximation for this waveform unless very high wavelet levels are used.Theoretically,the entire pulse-like waveform can be very accurately approximated by a very large number of wavelet terms,but the computational efforts required are excessive.As mentioned before,since the piecewise approach describes each switch interval separately,it yields an accurate steady-state waveform description for each switch interval with much less number of wavelet terms.Figures 2(a)and (b)compare the approximated pulse waveforms using the proposed wavelet-based piecewise method and the standard wavelet method for two different choices of wavelet levels with different widths of rising and falling edges.This example clearly shows the benefits of the wavelet-based piecewise approximation using separate sets of wavelet coefficients for the different switch states.Copyright 2006John Wiley &Sons,Ltd.Int.J.Circ.Theor.Appl.2006;34:559–582568K.C.TAM,S.C.WONG AND C.K.TSE0−0.2−0.4−0.6−0.8−1−20−15−10−50.20.40.60.81−0.2−0.4−0.6−0.8−10.20.40.60.81(a)051015(b)Figure 2.Approximated pulse waveforms with amplitude 10.Dotted line is the standard wavelet approx-imated waveforms using wavelets of levels from −1to 5.Solid lines are the actual waveforms and the wavelet-based piecewise approximated waveforms using wavelets of levels from −1to 1:(a)switch states 2and 4with rising and falling times both equal to 5per cent of the period;and (b)switch states 2and 4with rising and falling times both equal to 1per cent of the period.4.2.Example 2:simple buck converterThe second example is the simple buck converter shown in Figure 3.Suppose the switch has a resistance of R s when it is turned on,and is practically open-circuit when it is turned off.The diode has a forward voltage drop of V f and an on-resistance of R d .The on-time and off-time equivalent circuits are shown in Figure 4.The basic system equation can be readily found as˙x=A (t )x +U (t )(41)where x =[i L v o ]T ,and A (t )and U (t )are given byA (t )=⎡⎢⎣−R d s (t )L −1L 1C −1RC⎤⎥⎦(42)U (t )=⎡⎣E (1−s (t ))+V f s (t )L⎤⎦(43)Copyright 2006John Wiley &Sons,Ltd.Int.J.Circ.Theor.Appl.2006;34:559–582Figure3.Simple buck convertercircuit.Figure4.Equivalent linear circuits of the buck converter:(a)during on time;and(b)during off time.Table ponent and parameter values for simulationof the simple buck converter.Component/parameter ValueMain inductance,L0.5mHCapacitance,C0.1mFLoad resistance,R10Input voltage,E100VDiode forward drop,V f0.8VSwitching period,T100 sOn-time,T D40 sSwitch on-resistance,R s0.001Diode on-resistance,R d0.001with s(t)defined bys(t)=⎧⎪⎨⎪⎩0for0 t T D1for T D t Ts(t−T)for all t>T(44)We have performed waveform approximations using the standard wavelet method and the proposed wavelet-based piecewise method.The circuit parameters are shown in Table I.We also generate waveforms from SPICE simulations which are used as references for comparison. The approximated inductor current is shown in Figure5.Simple visual inspection reveals that the wavelet-based piecewise approach always gives more accurate waveforms than the standard method.Copyright2006John Wiley&Sons,Ltd.Int.J.Circ.Theor.Appl.2006;34:559–582−0.5−10.51−0.5−10.51012345670123456712345671234567(a)(b)(c)(d)Figure 5.Inductor current waveforms of the buck converter.Solid line is waveform from piecewise wavelet approximation,dotted line is waveform from SPICE simulation and dot-dashed line is waveform using standard wavelet approximation.Note that the solid lines are nearly overlapping with the dotted lines:(a)using wavelets of levels from −1to 0;(b)using wavelets of levels from −1to 1;(c)using wavelets oflevels from −1to 4;and (d)using wavelets of levels from −1to 5.Table parison of MREs for approximating waveforms for the simple buck converter.Wavelet Number of MRE for i L MRE for v C CPU time (s)MRE for i L MRE for v C CPU time (s)levels wavelets (standard)(standard)(standard)(piecewise)(piecewise)(piecewise)−1to 030.9773300.9802850.0150.0041640.0033580.016−1to 150.2501360.1651870.0160.0030220.0024000.016−1to 290.0266670.0208900.0320.0030220.0024000.046−1to 3170.1281940.1180920.1090.0030220.0024000.110−1to 4330.0593070.0538670.3750.0030220.0024000.407−1to 5650.0280970.025478 1.4380.0030220.002400 1.735−1to 61290.0122120.011025 6.1880.0030220.0024009.344−1to 72570.0043420.00373328.6410.0030220.00240050.453In order to compare the results quantitatively,MREs are computed,as reported in Table II and plotted in Figure 6.Finally we note that the inductor current waveform has been very well approximated by using only 5wavelets of levels up to 1in the piecewise method with extremelyCopyright 2006John Wiley &Sons,Ltd.Int.J.Circ.Theor.Appl.2006;34:559–582123456700.10.20.30.40.50.60.70.80.91M R E (m e a n r e l a t i v e e r r o r )Wavelet Levelsinductor current : standard method inductor current : piecewise methodFigure parison of MREs for approximating inductor current for the simple buck converter.small MREs.Furthermore,as shown in Table II,the CPU time required by the standard method to achieve an MRE of about 0.0043for i L is 28.64s,while it is less than 0.016s with the proposed piecewise approach.Thus,we see that the piecewise method is significantly faster than the standard method.4.3.Example 3:boost converter with parasitic ringingsNext,we consider the boost converter shown in Figure 7.The equivalent on-time and off-time circuits are shown in Figure 8.Note that the parasitic capacitance across the switch and the leakage inductance are deliberately included to reveal waveform ringings which are realistic phenomena requiring rather long simulation time if a brute-force time-domain simulation method is used.The state equation of this converter is given by˙x=A (t )x +U (t )(45)where x =[i m i l v s v o ]T ,and A (t )and U (t )are given byA (t )=A 1(1−s (t ))+A 2s (t )(46)U (t )=U 1(1−s (t ))+U 2s (t )(47)Copyright 2006John Wiley &Sons,Ltd.Int.J.Circ.Theor.Appl.2006;34:559–582Figure7.Simple boost convertercircuit.Figure8.Equivalent linear circuits of the boost converter including parasitic components:(a)for on time;and(b)for off time.with s(t)defined earlier in(44)andA1=⎡⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎣−R mL mR mL m00R mL l−R l+R mL l−1L l1C s−1R s C s000−1RC⎤⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎦(48)A2=⎡⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎣−R mR dL mR m R dL m0−R mL m d mR m R dL l−R mR d+R lL l−1L lR mL l d m1C s00R mC(R d+R m)−R mC(R d+R m)0−R+R m+R dC R(R d+R m)⎤⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎦(49)Copyright2006John Wiley&Sons,Ltd.Int.J.Circ.Theor.Appl.2006;34:559–582U1=⎡⎢⎢⎢⎢⎢⎢⎢⎢⎢⎣EL m⎤⎥⎥⎥⎥⎥⎥⎥⎥⎥⎦(50)U2=⎡⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎢⎣EL m−R m V fL m d mR m V fL l(R d+R m)−V f R mC(R d m⎤⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎥⎦(51)Again we compare the approximated waveforms of the leakage inductor current using the proposed piecewise method and the standard wavelet method.The circuit parameters are listed in Table III.Figures9(a)and(b)show the approximated waveforms using the piecewise and standard wavelet methods for two different choices of wavelet levels.As expected,the piecewise method gives more accurate results with wavelets of relatively low levels.Since the waveform contains a substantial portion where the value is near zero,we use the mean absolute error(MAE)forTable ponent and parameter values for simulation ofthe boost converter.Component/parameter ValueMain inductance,L m200 HLeakage inductance,L l1 HParasitic resistance,R m1MOutput capacitance,C200 FLoad resistance,R10Input voltage,E10VDiode forward drop,V f0.8VSwitching period,T100 sOn-time,T D40 sParasitic lead resistance,R l0.5Switch on-resistance,R s0.001Switch capacitance,C s200nFDiode on-resistance,R d0.001Copyright2006John Wiley&Sons,Ltd.Int.J.Circ.Theor.Appl.2006;34:559–5820−0.2−0.4−0.6−0.8−1−50.20.40.60.815100(a)(b)−50.20.40.60.81510Figure 9.Leakage inductor waveforms of the boost converter.Solid line is waveform from wavelet-based piecewise approximation,dotted line is waveform from SPICE simulation and dot-dashed line is waveform using standard wavelet approximation:(a)using wavelets oflevels from −1to 4;and (b)using wavelets of levels from −1to 5.Table IV .Comparison of MAEs for approximating the leakage inductor currentfor the boost converter.Wavelet Number MAE for i l CPU time (s)MAE for i l CPU time (s)levels of wavelets(standard)(standard)(piecewise)(piecewise)−1to 3170.4501710.1250.2401820.156−1to 4330.3263290.4060.1448180.625−1to 5650.269990 1.6410.067127 3.500−1to 61290.2118157.7970.06399521.656−1to 72570.13254340.6250.063175171.563evaluation.From Table IV and Figure 10,the result clearly verifies the advantage of using the proposed wavelet-based piecewise method.Furthermore,inspecting the two switch states of the boost converter,it is obvious that switch state 2(off-time)is richer in high-frequency details,and therefore should be approximated with wavelets of higher levels.A more educated choice of wavelet levels can shorten the simulationCopyright 2006John Wiley &Sons,Ltd.Int.J.Circ.Theor.Appl.2006;34:559–582345670.050.10.150.20.250.30.350.40.450.5M A E (m e a n a b s o l u t e e r r o r )Wavelet Levelsleakage inductor current : standard method leakage inductor current : piecewise methodFigure parison of MAEs for approximating the leakage inductor current for the boost converter.time.Figure 11shows the approximated waveforms with different (more appropriate)choices of wavelet levels for switch states 1(on-time)and 2(off-time).Here,we note that smaller MAEs can generally be achieved with a less total number of wavelets,compared to the case where the same wavelet levels are employed for both switch states.Also,from Table IV,we see that the CPU time required for the standard method to achieve an MAE of about 0.13for i l is 40.625s,while it takes only slightly more than 0.6s with the piecewise method.Thus,the gain in computational speed is significant with the piecewise approach.4.4.Example 4:flyback converter with parasitic ringingsThe final example is a flyback converter,which is shown in Figure 12.The equivalent on-time and off-time circuits are shown in Figure 13.The parasitic capacitance across the switch and the transformer leakage inductance are included to reveal realistic waveform ringings.The state equation of this converter is given by˙x=A (t )x +U (t )(52)where x =[i m i l v s v o ]T ,and A (t )and U (t )are given byA (t )=A 1(1−s (t ))+A 2s (t )(53)U (t )=U 1(1−s (t ))+U 2s (t )(54)Copyright 2006John Wiley &Sons,Ltd.Int.J.Circ.Theor.Appl.2006;34:559–5820−0.2−0.4−0.6−0.8−1−6−4−20.20.40.60.81024680−0.2−0.4−0.6−0.8−1−6−4−20.20.40.60.81024680−0.2−0.4−0.6−0.8−1−6−4−20.20.40.60.81024680−0.2−0.4−0.6−0.8−1−6−4−20.20.40.60.8102468il(A)il(A)il(A)il(A)(a)(b)(c)(d)Figure 11.Leakage inductor waveforms of the boost converter with different choice of wavelet levels for the two switch states.Dotted line is waveform from SPICE simulation.Solid line is waveform using wavelet-based piecewise approximation.Two different wavelet levels,shown in brackets,are used for approximating switch states 1and 2,respectively:(a)(3,4)with MAE =0.154674;(b)(3,5)withMAE =0.082159;(c)(4,5)with MAE =0.071915;and (d)(5,6)with MAE =0.066218.Copyright 2006John Wiley &Sons,Ltd.Int.J.Circ.Theor.Appl.2006;34:559–582。
基于几何光学近似迭代的多重散射波面分析

2021 年 3 月第 44 卷 第 2 期湖南师范大学自然科学学报Journal of Natural Science of Hunan Normal University Vel.54 No.2Mar., 2021DOI : 10.7612/j5ssn.2096W2'l .2021.02.012基于几何光学近似迭代的多重散射波面分析彭梓齐",杨江河(湖南文理学院数理学院,中国常德415000)摘要为了解析环状光在散射媒质中的传播特性,本文提出了以几何光学近似为基础的波面分析法来进行分析。
该方法主要以几何光学近似法为工具计算散射粒子的前方散射光,并运用迭代计算的方式实现多重散射模 型的波面分析。
本文运用该方法计算了散射媒质中的透射率以及环状光在散射媒质中的散射强度波形。
计算结 果与实验结果一致,散射媒质在特定的距离以及浓度下,环状光的散射波面中心会出现干涉波峰。
关键词几何光学近似;多重散射;前方散射;干涉中图分类号 O436.1 文献标识码 A 文章编号 2096-5281( 2021) 02-0087-08Wavefrant Analysis of Multiglo Scattering Based onGeometric Optics AppraximationPL#$ Zi-/i ** , B4NG 8a'g-0&收稿日期:2020-07-08基金项目:国家自然科学基金资助项目(U14311⑵;湖南省自然科学基金资助项目(2020JJ5396);湖南省2018年普通高校教育教学改革研究项目(湘教通[2018]436号);湖南文理学院博士启动项目(E07018021)* 通信作者,E-mail : pengzq@ (Colleac of Mathematics and Physics , Hunan University of Arts and Science , Changde 415000, China )Abstracr Tv analyzv thv charycte/stics of annular beam propagation in random media , wv proposed a new wavefront analysis method based on geometWc optics approximation. In this algorithm , wv adopted a simplified gev- metic optics approximation and iterative calculation based on forsard scatte/ng and simulated thv attenuation and thv scatw/ng waveform of thv annular beam in random media. An inWr^ered peak was obtained at thv optical axis with a coiain propagation distance and media concentrations , which is consistent with thv expe/mentat results.Key wordt geometWc optics approximation ; multiplv scytte/ng ; forsard scytte/ng ; inte/erenco光学遥感作为成熟的测量技术在工业、医疗、环保等领域得到了广泛应用W 在光学遥感应用中,光 在媒质中的传播效率是影响光学测量结果与精度的一项重要参数。
纹理物体缺陷的视觉检测算法研究--优秀毕业论文

摘 要
在竞争激烈的工业自动化生产过程中,机器视觉对产品质量的把关起着举足 轻重的作用,机器视觉在缺陷检测技术方面的应用也逐渐普遍起来。与常规的检 测技术相比,自动化的视觉检测系统更加经济、快捷、高效与 安全。纹理物体在 工业生产中广泛存在,像用于半导体装配和封装底板和发光二极管,现代 化电子 系统中的印制电路板,以及纺织行业中的布匹和织物等都可认为是含有纹理特征 的物体。本论文主要致力于纹理物体的缺陷检测技术研究,为纹理物体的自动化 检测提供高效而可靠的检测算法。 纹理是描述图像内容的重要特征,纹理分析也已经被成功的应用与纹理分割 和纹理分类当中。本研究提出了一种基于纹理分析技术和参考比较方式的缺陷检 测算法。这种算法能容忍物体变形引起的图像配准误差,对纹理的影响也具有鲁 棒性。本算法旨在为检测出的缺陷区域提供丰富而重要的物理意义,如缺陷区域 的大小、形状、亮度对比度及空间分布等。同时,在参考图像可行的情况下,本 算法可用于同质纹理物体和非同质纹理物体的检测,对非纹理物体 的检测也可取 得不错的效果。 在整个检测过程中,我们采用了可调控金字塔的纹理分析和重构技术。与传 统的小波纹理分析技术不同,我们在小波域中加入处理物体变形和纹理影响的容 忍度控制算法,来实现容忍物体变形和对纹理影响鲁棒的目的。最后可调控金字 塔的重构保证了缺陷区域物理意义恢复的准确性。实验阶段,我们检测了一系列 具有实际应用价值的图像。实验结果表明 本文提出的纹理物体缺陷检测算法具有 高效性和易于实现性。 关键字: 缺陷检测;纹理;物体变形;可调控金字塔;重构
Keywords: defect detection, texture, object distortion, steerable pyramid, reconstruction
II
基于深度卷积-长短期记忆神经网络的整车道路载荷预测

拟路谱技术和基于机器学习的路谱识别技术。前者首 先通过激光扫描技术获取试验场路面不平度信号,然 后对包括轮胎、衬套悬置等弹性元件的整车模型进行 动力学仿真分析 ;后 [1-4] 者首先利用合适的机器学习模 型直接根据方便测量的整车参数预测道路载荷,然后 利用整车动力学仿真分析获取底盘结构件的动态响 应载荷 。 [5-8] 通过对比这 2 种方法,发现与虚拟路谱技术 相比,基于机器学习的路谱识别技术省去了操作复杂且 代价高昂的路面不平度测量工作,且不需要在整车动力 学模型中建立轮胎模型。
经 网 络(DCNN-LSTM)模 型 ,提 出 了 基 于 数 据 驱 动 的 整 车 轮 心 载 荷 预 测 方 法 。 对 比 试 验 结 果 表 明 ,该 方 法 预 测 的 整 车 轮 心
载荷与试验场采集数据非常接近,有利于逐步取消路谱采集试验并极大地提高整车耐久性分析的效率。
主题词:道路载荷 深度学习 数据库 疲劳耐久分析 深度卷积神经网络 长短期记忆
每小块求取统计值(如均值或最大值)即可得到池化层 的输出信息。在整车道路载荷预测中,需要处理的汽车
算和求和运算,然后通过非线性转换获得卷积层的输出 信息。在池化层,输入的数据被分为很多小块,通过对
运行参数属于一维时序数据,因此 DCNN 层选用如图 2 所示的一维卷积神经网络层。
x(1) x(2)
x(S - 1) x(S)
1 前言
在现有的汽车底盘结构疲劳耐久分析流程中,为了 获得整车的道路载荷谱,通常需要在项目开发早期开展 整车道路耐久试验,该试验需要特制的试制样车、测量 设备、试验场所以及数周的试验时间。随着控制成本和 缩减开发周期的要求日益严格,道路试验成本高、周期 长的问题更加突出,亟待解决。
基于 Curvelet 变换的压缩传感超分辨率重建

基于 Curvelet 变换的压缩传感超分辨率重建叶坤涛;郭振龙;贺文熙【期刊名称】《计算机应用与软件》【年(卷),期】2016(033)010【摘要】In order to improve the resolution of single-frame degraded images under the condition of no any training set,we implemented a compressed sensing super-resolution reconstruction algorithm,called Curvelet-FIST,which is based on Curvelet transform and fast iterative threshold-shrinkage (FIST)algorithm.First,the algorithm sets up a sampling mode of pseudo-star-shape sampling on low-resolution images. Then by making use of the theory of compressed sensing,and in Curvelet transform domain,it restores the high-resolution image from sampling values through FIST algorithm.Simulation experiment showed that this super-resolution reconstruction algorithm,compared with traditional interpolation algorithm and the compressed sensing reconstruction algorithm based on Wavelet transform and FIST (Wavelet-FIST), has higher peak signal-to-noise ratio (PSNR).%为了在无训练集的情况下,改善单帧退化图像的分辨率,实现了一种基于 Curvelet 变换和快速迭代收缩阈值法(FIST)的压缩传感超分辨率重建算法(Curvelet-FIST)。
超高速撞击波阻抗梯度材料形成的碎片云相变特性

第42卷第4期兵工学报Vol.42No.4 2021年4月ACTA ARMAMENTARII Apr.2021超高速撞击波阻抗梯度材料形成的碎片云相变特性郑克勤1,张庆明1,龙仁荣1,薛一江1,龚自正2,武强2,张品亮2,宋光明2(1.北京理工大学爆炸科学与技术国家重点实验室,北京100081; 2.北京卫星环境工程研究所,北京100094)摘要:在超高速碰撞下,波阻抗梯度材料能使弾丸的动能更多地转变为靶板材料内能,使其发生熔化、气化等相变,分散和消耗弹丸的动能,进而实现航天器对空间碎片的防护。
以钛、铝、镁3种材料组成的波阻抗梯度材料为研究对象,借助于光滑粒子流体动力学数值模拟方法,采用Til-loston状态方程和Steinberg-Guinan本构模型,给出各材料的冲击相变判据,结合速度为7.9km/s 的超高速碰撞实验结果,验证数值模拟结果的有效性。
计算结果表明:钛、铝、镁波阻抗梯度材料在受到大于4km/s速度撞击时,形成的碎片云会发生不同程度的熔化和气化;钛、铝、镁3种组分分别在受到6km/s、5km/s、4km/s速度撞击时碎片云会发生熔化,在受到8km/s、9km/s、6km/s速度撞击时碎片云会发生气化。
关键词:超高速撞击;波阻抗梯度材料;碎片云;相变中图分类号:O313.4文献标志码:A文章编号:1000-1093(2021)04-0773-08DOI:10.3969/j.issn.1000-1093.2021.04.011Phase Transition Characteristics of Debris Cloud of Ti/Al/Mg WaveImpedance Gradient Material Subjected to Hypervelocity ImpactZHENG Keqin1,ZHANG Qingming1,LONG Renrong1,XUE Yijiang1,GONG Zizheng2,WU Qiang2,ZHANG Pinliang2,SONG Guangming2(1.State Key Laboratory of Explosion Science and Technology,Beijing Institute of Technology,Beijing100081,China;2.Beijing Institute of Spacecraft Environmental Engineering,Beijing100094,China)Abstract:In hypervelocity impact,the wave impedance gradient material helps to transfer the kinetic energy into more internal energy,which causes the melting and vapor phase transition of debris cloud,and disperses and dissipates the kinetic energy of projectile,thus protecting the spacecraft from debris cloud.The wave impedance gradient material studied in this paper is made of titanium,aluminium and magnesium alloy(TAM).The smoothed particle hydrodynamics(SPH)method is used to simulate hypervelocity impact.Impact-induced phase transition criteria of various materials are given by using Tilloston equation of state and Steinberg-Guinan constitutive model.The simulated results were compared with the experimental results with impact velocity of7.9km/s.The results show that the impactgenerated debris cloud is melted and vaporized to some extent when TAM wave impedance gradient material is impacted by the velocity more than4km/s.For Ti,Al and Mg,the debris cloud is melted at the impact velocities of6km/s,5km/s and4km/s,respectively,and it is vaporized at the impact velocities of8km/s,9km/s and6km/s.收稿日期:2021-02-03基金项目:国家重点研发计划项目(2016YFC0801204);民用航天预先研究项目(D020304)作者简介:郑克勤(1992—),女,硕士研究生。
- 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。
Wavelet Based Segmentation of Hyperspectral ColonTissue ImageryKashif M. Rajpoot*, Nasir M. Rajpoot†*Faculty of Computing Sciences & Engineering, De Montfort UniversityLeicester, UK†Department of Computer Science, University of WarwickCoventry, UKEmails: iamkashi@,nasir@Abstract Segmentation is an early stage for the automated classification of tissue cells between normal and malignant types. We present an algorithm for unsupervised segmentation of hyperspectral human colon tissue cell images into its constituent parts by exploiting the spatial relationship between these constituent parts. This is done by employing a modification of the conventional wavelet based texture analysis, on the projection of hyperspectral image data in the first principal component direction. Results show that our algorithm is comparable to other more computationally intensive methods which exploit spectral characteristics of the hyperspectral imagery data.Keywords:Hyperspectral imaging, colon tissue cell classification,, dimensionality reduction, image segmentation, wavelet transform1. INTRODUCTIONIt has been shown through experiments that hyperspectral imaging can be successfully utilized to distinguish normal vs. malignant cells of the same cellular lineage [1]. Diagnostically important spectral features can be subtle and not easily assessed by the naked eye. Also, the high spectral resolution characteristics of hyperspectral sensors preserve important aspects of the spectrum [2]. This eventually makes segmentation of different materials possible.According to a recent publication [3], 34,000 new cases of colorectal cancer are diagnosed each year. During the year 2000, there were 16,250 deaths from colorectal cancer in the UK alone. Colorectal cancer is the third most commonly diagnosed cancer in the UK after lung and breast cancer. The UK had one of the worst detection rates for colorectal cancer in Europe. Yet 80% of colorectal cancer cases can be treated if caught at an early stage. The limited availability of specialist pathological staff and the huge amount of data provided by the hyperspectral sensors means that the user fatigue is a significant obstruction in the examination of these images and the identification of colon cancer in early stages. New improved screening and diagnosis methods could potentially save thousands more lives each year.The reliable detection of malignant cells in stained tissue samples is still one of the most demanding and time-consuming tasks in pathology and is a typical example of a pattern recognition problem [1]. Generally, the task of pattern recognition in images consists of three independent steps, which can be applied to the tissue classification problem as follows:(i)Image segmentation: The objects contained in theimage scene are separated from the background.This is the separation of constituent parts oftissue cells.(ii)Feature extraction:The characteristics of each object are quantified. These features, of course,should contain enough discriminant informationsufficient to distinguish a normal tissue from amalignant tissue.(iii)Classification:Each object is assigned to a generic target class. The extracted features fromthe segmentation labels are utilized todiscriminate between normal and malignanttissue cells.This paper reports on work related to the above first stage of segmentation. The whole process of classification is described in the MSc thesis of the primary author [4]. The input hyperspectral image cubes were taken from micro-array archival colon tissue sections between 450-650nm wavelength and of dimensions 1024x1024x20.This paper starts with a presentation of the essential background knowledge for the work, followed by a brief description of the dimensionality reduction phase, an important step during hyperspectral image segmentation process. The wavelet multiresolution analysis procedure to perform the segmentation by exploiting the spatial relationship is presented. We also illustrate, in brief, another experimented method of segmentation which utilizes the spectral characteristics. Finally, we conclude that the results using the former algorithm are visually comparable to those using latter one but with certain limitations.1.1BackgroundHyperspectral imaging sensors capture image scenes in contiguous but narrow spectral bands over visible and near infrared wavelength range of electromagnetic spectrum. In this way, they can potentially capture tens to hundreds of spectral bands covering the narrow spectralfeatures of the captured material as closely as possible. The image data provided by hyperspectral sensors can be visualized as a 3D cube or a stack of multiple 2D images (Figure 1) because of its intrinsic structure, where the cube face is a function of the spatial coordinates ),(y x f and depth is a function of wavelength )(λd .(a) 3D cube(b) Stack of multiple 2D imagesFigure 1: Hyperspectral image data representationIn this case, each spatial point on the face is characterized by its own spectrum (often called spectral signature ). This spectrum is in direct correspondence with the amount of energy in the material represented, as hyperspectral sensors commonly utilize the simple fact that a body with temperature over absolute zero emits light in certain frequency bands. Consequently, the separation of constituent regions in the image scene becomes possible.Anatomically, human body is made up of thousands of millions of different kind of cells. Our cell reproduction system constantly controls the growth of these cells, and a growth is made only if required by the body organs. When an organ of the body is affected by cancer, tumour cells are created and this reproduction control system becomes ineffective due to the continuous growth of these tumour cells.The colon is the upper part of the large intestine tube while the rectum is the lower part of this tube (Figure 2, Source: /). Practically, colon or rectum cancer is characterized as separate cancer instances. Colorectal or bowel cancer is a composite name for colon and rectum cancer. It is the uncontrolled growth of tissue cells in either colon or rectum which causes the colorectal cancer.Figure 2: Human colon shown in digestive systemAt a microscopic level, human colon tissue cells can be characterised as having 4 constituent parts: nuclei, cytoplasm, lamina propria, and lumen. According to a dictionary of cancer related medical terms [11], these constituent parts are defined as:(i) Nuclei : the core central part of a cell,containing DNA, which controls its growth(ii) Cytoplasm : the fluid inside a cell but outsidethe cell's nucleus. Most chemical reactions in a cell take place in the cytoplasm.(iii) Lamina propria : a type of connective tissuefound under the thin layer of tissues covering a mucous membrane(iv) Lumen : the cavity or channel within a tube ortubular organ such as a blood vessel or the intestineThe aim of this work is to separate a given hyperspectral image data cube into these constituent parts.2. DIMENSIONALITY REDUCTIONBefore the formal process of hyperspectral image segmentation, an intermediate step of dimensionality reduction is often involved. Hyperspectral imagery data provides a wealth of information about an image scene which is potentially very helpful in the segmentation of objects. At the same time, the huge size of hyperspectral image data (with tens to hundreds of spectral bands) normally means high computational complexity. High dimensional vector spaces have been found by mathematicians to have some rather unusual and unintuitive characteristics [5].This is often recognized as the curse of dimensionality in the literature. In this situation, it is usually required to reduce the dimensionality of the data before proceeding to the next essential tasks. The hyperspectral sensors commonly oversample the spectral signal to ensure that narrow band features are adequately represented [2]. The important job here is to eliminate this redundancy while, at the same time, preserving the high-quality features for the segmentation algorithm.Principal component analysis (PCA) is a statistical multivariate data analysis tool which attempts to find the natural coordinate axes for the multidimensional dataset. It is the representation of the higher-dimensional data into lower-dimensional orthogonal axes such that it is highly decorrelated. This representation can be considered as the transformation of the original data into a new vector space where the basis vectors are actually a linear combination of the original data vectors. We utilized PCA for dimensionality reduction because of its intrinsic simplicity and well-established mathematical groundings.In a single sentence, PCA can be formulated as the projection of the multivariate data on the orthogonal axes which are in fact the eigenvectors of the covariance matrix of the original data . Thus the new basis set for data is derived from the original data vectors. These orthogonal eigenvectors of the covariance matrix are actually called the principal components. SupposeA representsthemultivariate data, then a mathematical formulation can be given as [6]:T AA n 1=Σ(1)where Σ is the covariance matrix of A . The PCA problem reduces to the computation of the eigenvectors of this matrix where an eigen-analysis problem for Σ is devised as:v v λ=Σ(2)such thatv and λ represent the eigenvectors and thecorresponding eigenvalues of Σ with values in λ sortedin descending order. The eigenvector corresponding to the highest eigenvalue is the principal component with maximum variation in that direction. If we assume that V is a matrix whose columns are the eigenvectors of Σ, then the projected data in the direction of principal components is given by:V B Z *=(3)whereBis obtained by subtracting mean vector fromeach vector of A .Later in the paper, we will come across the concept of the amount / percentage of variance preserved by the projected data in a certain principal component direction. Here, we explain this for the variance preserved in one or more directions. This is directly related to the corresponding eigenvalues and is computed, for k eigenvectors, as follows:===nj jki ivp 11λλ(4)where k < n , while assuming that the eigenvalues of the covariance matrix are in a sorted order.3. SEGMENTATIONTwo ways of segmenting the hyperspectral image data into its constituent parts are: (1) spatial analysis : by exploiting the spatial relationships between these parts, and (2) spectral analysis : the exploitation of spectral characteristics. Wavelet multiresolutional analysis technique evaluates the spatial relationship between the objects in an image at multiple scales and thus falls in the former category.Wavelets are orthogonal basis functions, having compact support in time (space), which can be used to represent a signal (image). Unlike conventional Fourier transform, which utilizes sines and cosines of varying amplitude and frequency as its basis functions, wavelet transform makes use of these wavelet functions which are scalable. A variety of such functions exists and a well suitable wavelet can be selected particular to an application depending on the signal / image characteristics to represent.Wavelet theory is based on strong mathematical foundations and it employs established tools including pyramidal image processing, subband coding, and quadrature mirror filtering. One of the most striking and powerful applications of wavelet theory is the possibility of multiresolution analysis, shown by Mallat in 1987 [12]. Multiresolution analysis allows us to exploit the signal or image characteristics, matched to a particular scale, which might go undetected in other analysis techniques [7]. This capability of multiresolution processing paved the way to successful analysis of various kinds of texture.In the following section, we present briefly the conventional wavelet based texture analysis procedure and describe how it was modified to our wavelet based hyperspectral image segmentation.3.1 Wavelet based texture analysisTexture can be defined as an attribute representing the spatial arrangement of the gray levels of the pixels in a region [8]. The sole aim of a texture analysis method is to describe different textures present in an image. One of the most important aspects of texture description has been identified as scale [9]. If we can collect these descriptive features corresponding to a texture at various scales, we can distinguish different textures in an image. Wavelet transform, on the other hand, provides a unified way of multiresolution analysis.A usual sequence of operations performed for wavelet based texture analysis [10] is:Figure 3: Sequence of operations for wavelet based textureanalysisTexture segmentation results for two image scenes with quite dissimilar textures produced with the above sequence of operations are shown in the following figures.Original image with two different kinds of textureTextures segmented using wavelet based approach at wavelet decomposition level 2 Textures segmented using wavelet based approach at wavelet decomposition level 3Figure 4: Texture segmentation with wavelet basedapproach - IOriginal image with two different kinds of textureTextures segmented using wavelet based approach at wavelet decomposition level 2Textures segmented using wavelet based approach at wavelet decomposition level 3Figure 5: Texture segmentation with wavelet basedapproach - IIThese results basically highlight the important role of the wavelet decomposition level which sets the detail of scale viewed by processing / analysis method. The hidden fact behind multiresolution processing for texture analysis is to generate a number of homogeneous features that represent the response of a bank of filters at different scales.3.2 Spatial analysis based hyperspectral imagesegmentationThe sole purpose of this practice is to exploit the spatial characteristics in the image rather than the spectral features. Before describing the method, we would like to state what the input to this method is. It is not very uncommon in hyperspectral colon tissue imagery to have 80% or even more variance concentrated in the data projected in the first principal component direction (this fact is based on experimental results with image data cubes). Our experiments show that the projected data in the first principal component direction has sufficient spatial information to segment the cell image into constituent parts.Assuming that each of the constituent parts of the colon tissue cells is a distinct type of texture which may be described by multiresolutional analysis procedure, we experimented with wavelet texture analysis technique onthis projected data. Results showed (Figure 7 (b) ) that this is perhaps not a suitable segmentation method for our problem. This was the stimulation behind experimenting new methods to exploit the multiresolutional characteristics.The simple trick we used in our segmentation algorithm was the skipping of steps II and IV of Figure 3. Thus, the sequence of operations for hyperspectral colon tissue image segmentation becomes:Figure 6: Sequence of operations for wavelet basedhyperspectral image segmentationHyperspectral colon tissue image segmented into cell-constituent parts with this method is shown in the Figure below:(a) Projected data in the first principal component direction(b) Segmentation with conventional wavelet texture analysis approach(c) Segmentation with our proposed approachFigure 7: Wavelet based hyperspectral colon tissue imagesegmentationThe rationale behind this process is that the preprocessing stage (smoothing, etc.) in conventional wavelet texture analysis method loses the necessary discriminant information. Also, the discarded DC subband contains important grey value intensity approximation to the original input image. Therefore, inclusion of the DC subband feature image and avoiding the preprocessing stage actually permits the clustering algorithm to observe the intensity variation in the features and assign the labels based on these differences. Although the experimentation with wavelet decomposition level and selection of wavelet filters is not exhaustive, early attempts show that adecomposition level 2 and daubechies-8 filters perform well for hyperspectral colon tissue segmentation.3.3Spectral analysis based hyperspectral imagesegmentationApart from the spatial analysis, another possibility for the segmentation of hyperspectral data is by doing a spectral analysis. This approach is in correspondence with the spectral signature (or spectrum) of each point on the face of the data cube. In practice, we rarely perform a spectral analysis on the original image cube. Rather, we transform it into lower dimensions (by PCA, ICA, etc.), to remove the spectral redundancy which may hamper the segmentation procedure, and then perform the analysis to differentiate between the objects by labeling each face point. In the case of PCA used for dimensionality reduction, the data is projected in first few principal component directions such that this projection contains possibly over 98% of the variance, calculated according to equation (4). Usually, the projected data in first three to four principal component directions can preserve over 99% variance of the whole data. This is also the case with our data where we fed the projected data into a nearest-centroid K-means clustering algorithm for the segmentation, Figure 8 (b). Shown also, in Figure 8 (c), is the segmentation result based on spectral analysis but with a relatively sophisticated approach of ICA (Independent Component Analysis) preprocessed by high-emphasis filtering. This method is described in detail in [4].(a) Wavelet based segmentation(b) Spectral analysisbased segmentationwith PCA(c) Spectral analysisbased segmentationwith ICAFigure 8: Comparison of segmentation performance4. CONCLUSIONSA method for segmentation of hyperspectral cell imagery data is presented with the objective of exploiting the spatial relationships between constituent parts of the tissue cells. This is quite a simple but elegant approach with established mathematical groundings. Experimental results show that although projection of data in only one principal direction was used to segment the image data, consequently saving storage and computational time, our algorithm is comparable to spectral analysis method for segmentation.However, our wavelet based technique is limited as it will produce fine results only when the projected data in the first principal component direction covers more than 80% of the data variance. Although its performance on the data projected in the first principal component direction with less than 80% of the variance is not tested, we predict that the resulting segmentation may not be a true representation of the regions in the colon imagery. On the other hand, spectral analysis based technique is not merely dependent on first principal component direction and, therefore, it should be relatively more consistent and reliable than wavelet based technique.The segmentation labels (or the segmented image, in other words) are further utilized for feature extraction and classification tasks. The details of this can be found in [4].ACKNOWLEDGMENTWe gratefully acknowledge obtaining hyperspectral imagery data used in this work from and having fruitful discussions with Ronald Coifman and Mauro Maggioni of the Applied Mathematics Department of Yale University (USA).REFERENCES[1] R. Levenson, C. Hoyt, “Spectral Imaging &Microscopy,” American Laboratory 2000[2] G. Shaw, D. Manolakis, “Signal Processingfor Hyperspectral Image Exploitation,” IEEE Signal Processing Magazine, vol. 19, no. 1, pp. 12-16, January 2002[3] Cancer Research UK, Bowel Cancer Factsheet,May 2002[4] K. M. Rajpoot, Hyperspectral Colon Tissue CellClassification, MSc DSIP Dissertation, Faculty of Computing Sciences & Engineering, De Montfort University, UK, September 2003[5] L. Jimenez, D. Landgrebe, “Supervisedclassification in high dimensional space: geometrical, statistical and asymptotical properties of multivariate data,” IEEE Trans. Syst., Man, Cybernet., C, vol. 28, pp. 39-54, February 1998[6] T. Marks, Principal Component Analysis (PCA),Lecture Notes, Cognitive Science Department, University of California at San Diego (UCSD) USA [7] R. Gonzalez, R. Woods, Digital ImageProcessing, Second Edition, Prentice Hall, 2001[8] IEEE Gl., IEEE Standard Glossary of ImageProcessing & Pattern Recognition terminology, IEEE Std 610.4-1990, March 1990[9] P. Scheunders, S. Livens, G. Van deWouwer, P. Vautrot, P. Van Dyck, “Wavelet-based Texture Analysis ,” IEEE Conference on Image Processing and its Applications, July 1997[10] N. M. Rajpoot, “Texture Classification UsingDiscriminant Wavelet Packet Subbands,” Proceedings of 45th IEEE Midwest Symposium on Circuits and Systems (MWSCAS'2002), Tulsa, Oklahoma (USA), Aug. 2002[11] National Cancer Institute,/[12] S. Mallat, “A Compact MultiresolutionRepresentation: The Wavelet Model,” ProceedingsIEEE Computer Society Workshop on ComputerVision, IEEE Computer Society Press, Washington,D.C., pp. 2-7, 1987。