CLASSIFICATION of hyperspectral images (HSIs) has. Extinction Profiles Fusion for Hyperspectral Images Classification

Size: px
Start display at page:

Download "CLASSIFICATION of hyperspectral images (HSIs) has. Extinction Profiles Fusion for Hyperspectral Images Classification"

Transcription

1 1 Extncton Profles Fuson for Hyperspectral Images Classfcaton Leyuan Fang, Senor Member, IEEE, Nanjun He, Student Member, IEEE, Shutao L, Senor Member, IEEE, Pedram Ghams, Member, IEEE, and Jón Atl Benedktsson, Fellow, IEEE Abstract Extncton profle (EP) s an effectve spatal-spectral feature extracton method for hyperspectral mages (HSIs), whch has recently drawn much attenton. However, the exstng methods utlze the EPs n a stackng way, whch s hard to fully explore the nformaton n EPs for HSI classfcaton. In ths paper, a novel fuson framework termed EPs-fuson (EPs-F) s proposed to explot the nformaton wthn and among EPs for HSI classfcaton. In general, EPs-F ncludes the followng two stages: In the frst stage, by extractng the EPs from three ndependent components (ICs) of a HSI, three complementary groups of EPs can be constructed. For each EP, an adaptve superpxel-based composte kernel strategy s proposed to explore the spatal nformaton wthn EP. The weghts to create the composte kernel and the number of superpxels are automatcally determned based on the spatal nformaton of each EP. In the second stage, snce the dfferent EPs contan hghly complementary nformaton, a smple yet effectve decson fuson method s further appled to obtan the fnal classfcaton result. Experments on three real HSI data sets verfy the qualtatve and quanttatve superorty of the proposed EPs-F method over several state-of-the-art HSI classfers. Index Terms Classfcaton, hyperspectral mage (HSI), extncton profle (EP), composte kernel, decson fuson. I. INTRODUCTION CLASSIFICATION of hyperspectral mages (HSIs) has many applcatons, ncludng the precson agrculture [1], urban mappng [2], and natonal defense [3]. In HSIs, each pxel s a hgh-dmensonal vector, and ts entres represent the spectral responses of dfferent spectral bands, whch ncorporate abundant spectral nformaton to acheve hgh classfcaton accuracy. In recent years, a number of classfers have been ntroduced for HSI classfcaton, ncludng the neural networks [4], multple kernel methods [5] [7], collaborate representaton [8], [9], and sparse representaton [10] [13], snce they are wdely used n many applcatons [14], [15]. Among these methods, Ths paper was supported by the Natonal Natural Scence Fund of Chna for Dstngushed Young Scholars under Grant , the Natonal Natural Scence Fund of Chna for Internatonal Cooperaton and Exchanges under Grant , the Natonal Natural Scence Foundaton under Grant No , and the Fund of Hunan Provnce for Scence and Technology Plan Project under Grant 2017RS3024. L. Fang, N. He and S. L are wth the College of Electrcal and Informaton Engneerng, Hunan Unversty, Changsha, , Chna (e-mal: fangleyuan@gmal.com; henanjun@hnu.edu.cn; shutao l@hnu.edu.cn). P. Ghams s wth the German Aerospace Center (DLR), Remote Sensng Technology Insttute (IMF), and Technsche Unverstät München, Sgnal Processng n Earth Observaton, Munch, Germany (e-mal: pedram.ghams@dlr.de). J. A. Benedktsson s wth the Faculty of Electrcal and Computer Engneerng, Unversty of Iceland, 101 Reykjavk, Iceland (e-mal: benedkt@h.s). support vector machnes (SVMs) [16], [17] have shown good performance especally when a lmted number of tranng samples are avalable [18]. In general, the tradtonal SVM method classfes the mage wthout consderng the contextual nformaton,.e., nterpxel dependency. Therefore, the classfcaton map obtaned by the SVM method may contan much salt and pepper nose. To enhance the classfcaton performance, the composte kernel-based SVMs were utlzed to combne both the spectral and spatal nformaton [19] [21]. In [19], Camps-Valls et al. constructed a famly of composte kernels by utlzng the Mercer s kernels, whch can explore the spatal nformaton n an effcent way. Moreover, n [20], a generalzed composte kernel framework was proposed to combne the spectral and spatal nformaton by a kernel stackng manner. On the other hand, varous feature extracton-based classfcaton methods have been proposed [22] [25]. In [23], the prncpal component analyss (PCA) was utlzed for feature extracton. In [24], [25], the ndependent component analyss (ICA) and the lnear dscrmnatve analyss (LDA) have been nvestgated for dscrmnatve feature extracton. In general, these methods are only desgned for spectral feature extracton, wthout consderng the spatal dependences of adjacent pxels. To enhance the classfcaton performance, spatal nformaton should also be taken nto account. A consderable number of spatal-spectral feature extracton-based classfcaton methods have been developed n the lteratures, ncludng the classcal Markov random feld (MRF) modelngbased methods [26], [27] morphologcal profles (MPs)-based methods [28], ts extended versons [29], [30], morphologcal attrbute profle (AP) [31], and extncton profle (EP) [32], [33]. Among these feature extracton methods, the EP has recently drawn much attenton snce t has followng advantages. Frstly, t can smultaneously preserve the geometrcal characterstcs of the nput mage, whle removeng unmportant detals. Secondly, t can delver a better recognton performance than the tradtonal spatal-spectral AP [32] feature extracton method. To apply the EP method to the HSI, the ndependent component analyss (ICA) s used to extract a few nformatve features from the HSI and the three man ICs of the HSI are preserved as the base mages to produce EPs. Snce the ICA method ams at mnmzng the dependence between ts components [34], the obtaned three EPs (denoted by EP 1, EP 2 and EP 3 ) are relatvely ndependent to each other, whch can reflect the characterstcs of HSI from dfferent aspects and offer hghly complementary nformaton among

2 2 Fg. 1. The flowchart of the proposed EPs-F algorthm. them. The procedure of constructon of three complementary EPs are llustrated n the second lne of Fg. 1. As can be observed, snce the mportant geometrcal characterstcs of ICs from a HSI are well preserved, there exsts abundant spatal nformaton wthn each EP. In addton, as the EPs are produced from relatvely ndependent ICs respectvely, each EP has ts own dstnctve characterstcs whch can offer complementary nformaton among EPs. Both the spatalspectral nformaton wthn and among EPs can be utlzed to enhance the classfcaton performance. However, the exstng method smply stack all EPs together [33], whch can not fully explot these nformaton n EPs for HSI classfcaton. In ths paper, we propose fuson framework termed EPsF to explot the nformaton wthn and among the EPs for HSI classfcaton. Generally, the proposed EPs-F method has two stages. In the frst stage, to utlze the abundant spatal nformaton wthn EP, an adaptve superpxel-based composte kernel strategy s proposed to fuse two types of shape-adaptve spatal features of EP and the spectral feature of orgnal HSI. Compared to other smlar methods whch need to set weghts of dfferent kernels manually, an adaptve strategy s proposed to produce the composte kernel based on the spatal nformaton. Moreover, an automatc approach s proposed to determne the number of superpxels base on the contextual nformaton of the EP. In the second stage, snce dfferent EPs reflect HSI n dfferent aspects whch can provde complementary nformaton n correspondng classfcaton maps, a smple yet effectve decson fuson method s consdered to fuse the classfcaton maps to get the fnal classfcaton result. The man contrbutons of ths paper are lsted as bellows. 1) Dfferent from the prevous stackng strategy n [33], we propose an effectve fuson framework to explot the rch spatal nformaton wthn EP and hghly complementary nformaton among EPs for HSI classfcaton. 2) To explore the spatal nformaton wthn EP, an adaptve superpxel-based composte kernel method s proposed, whch can not only adaptvely fuse the kernels of dfferent features, but also automatcally select the number of superpxels. The rest of ths paper s organzed as follows. In Secton II, we brefly revew the SVM method wth composte kernel for HSI classfcaton, extncton flters and EP-based feature extracton method. The proposed EPs-F method s detaled n Secton III. In Secton IV, the expermental results compared wth several state-of-the-art classfcaton methods are gven. Fnally, n Secton V, the paper s summarzed and the future works are suggested. II. R EVIEWS OF R ELATED M ETHODS In ths secton, we brefly revew the SVM method wth composte kernel for HSI classfcaton, the extncton flters (EFs), and the extncton profle (EP) feature extracton method. A. The SVM Method wth Composte Kernel Gven a labeled tranng data sets {(x1, y1 ) (xn, yn )}, where x RN and y { 1, +1}, and a nonlnear mappng

3 3 Fg. 2. The procedure for creatng shape adaptve regons = 1, 2, 3. φ( ), the SVM ams to solve the followng classfcaton problem: { 1 mn w,ξ,b 2 w 2 + C } ξ, subject to (1) y ( φ(x ), w + b) 1 ξ, = 1,, n ξ > 0, = 1,, n, where w and b defne a lnear classfer n the feature space. C s the regularzaton parameter to control the generalzaton capabltes of the classfer, and ξ are postve slack varables to cope wth the outlers n tranng samples. The kernel trck s often adopted n the SVM wth kernel functon defned as follows. K(x, x j ) = φ(x ), φ(x j ). (2) By ncorporatng equaton (2) nto (1), the fnal decson functon for the test x can be obtaned by solvng ts dual Lagrangan problem, whch shows as bellows: f(x) = sgn( n y α K(x, x) + b), (3) =1 where α are the Lagrange multplers. For HSI classfcaton, the one-aganst-one multclassfcaton scheme s adopted n the SVM method [19]. To further explot the spatal nformaton n HSI, the composte kernel strategy s adopted. Assume the orgnal tranng spectral pxels and spatal features are (x spe 1,, x spe n ) and (x spa 1,, x spa n ), respectvely, then two types of kernels can be constructed (.e., spectral kernel and spatal kernel denoted by K spe (x spe, x spe j ) and K spa (x spa, x spa j ) [19], respectvely). The composte kernel s computed by a weghed average operaton: K CW (x, x j ) = µ spe K spe (x spe, x spe j )+ µ spa K spa (x spa, x spa j ), where µ spe and µ spa are the weghts for the spectral kernel K spe (x spe, x spe j ) and the spatal kernel K spa (x spa, x spa j ), respectvely, and µ spe + µ spa = 1. The composte kernel s ntroduced nto equaton (3) to create a new decson rule for classfcaton. Compared wth a sngle kernel, snce the spatal and spectral nformaton of HSI are jontly consdered, the composte kernel can provde a better classfcaton performance. Among varous kernel functons, the radal bass functon (RBF) kernel s wdely used, whch s computed as: (4) K (x, x j ) = exp( x x j 2 /2σ 2 ). (5) B. Extncton Flters (EFs) The EFs are connected flters, whch preserve the relevant mage extrema. Relevance s measured by the concept of extncton values defned n [36]. The EFs are defned as follows: Let max(f) = {M 1, M 2,, M N } denote the regonal maxma of mage F. Each regonal maxma M has an extncton value ε correspondng to the ncreasng attrbute beng analyzed. The EF of F preserves the n maxma wth the hghest extncton values,.e., EF n (F), whch s gven as follows: EF n (F) = R δ F(G), (6) where RF δ (G) s the reconstructon by dlaton [37] of the mask mage G, whch s gven by G = max n =1 (M ). The max s the pxel-wse maxmum operaton. M 1 s the maxmum wth the hghest extncton value, and M 2 has the second hghest extncton value. C. The Extncton Profle The EP s composed of a sequence of thnnng and thckenng transformatons obtaned by a set of EFs wth a sequence of progressvely strcter crtera. For nstance, an EP for the nput gray-scale mage F can be defned as follows: EP(F) = φp λ,l (F), φ P λ,l 1 (F),, φ P λ,1 (F), F, }{{} thckenng profle γ P λ,l (F), γ P λ,l 1 (F),, γ P λ,1 (F) }{{}, thnnng profle wth P λl : {P λ } ( = 1,, L), a set of L ordered predcates (.e., P λ P λk, k) [32]. In order to extract the EP from a HSI, the ICA, as mentoned above, s frst utlzed to obtan the most nformatve components and the three ICs are used as base mages to produce EPs. Then, the EP method s appled on each IC as follows: EP 1 = EP(IC 1 ), EP 2 = EP(IC 2 ), EP 3 = EP(IC 3 ). Snce the ICs are relatvely ndependent to each other [34], the obtaned ICs can characterze the orgnal HSI n dfferent aspects whch can offer dstnctve and complementary nformaton n correspondng EP. The whole procedure of EPs extracton from ICs are shown n the frst two lnes of Fg. 1. In ths way, three complementary EPs can be constructed. III. PROPOSED EPS-F METHOD The framework of the proposed EPs-F method s summarzed by the flowchart n Fg. 1 whch ncludes the followng (7)

4 4 two stages: 1) Wthn EP, an adaptve composte kernel strategy s proposed to fuse the spatal nformaton of EP and the spectral nformaton of HSI, and then the composte kernel s fed nto an SVM to obtan the frst stage classfcaton maps; and 2) Among EPs, snce the classfcaton maps from dfferent EPs contan complementary nformaton, the decson fuson s further adopted to fuse the classfcaton maps for obtanng the fnal classfcaton result. A. Stage I: Fuson Wthn EP The stage I conssts of the followng steps: 1) The constructon of shape adaptve regons; 2) Intra and nter shape adaptve spatal features extracton; and 3) An adaptve strategy for composte kernel computaton. Note that, to explore the abundant spatal nformaton wthn each EP, one possble way s to use the fxed wndow based manner. However, there are some demerts assocated wth the fxed wndow. For example, on the edge structural area, the fxed sze wndow mght nclude the pxels from dfferent classes, and thus, the spatal nformaton of EP cannot be suffcently utlzed. Recent work [35] has demonstrated that the superpxel can adjust the shape of the wndow based on the contextual nformaton whch can more effectvely explore the spatal nformaton. Moreover, snce the HSIs have more than one hundred spectral bands and some bands may have heavy nose or artfacts, drectly segmentng the whole HSIs wth the superpxel method [38] [40] wll create very hgh computatonal cost and also be nterfered by the nose exsted n the spectral bands. To address ths ssue, our method apples the prncpal component analyss (PCA) [44] on the HSI, and exact the frst three PCs as the based mages for superpxel segmentaton, whch can greatly reduce the computatonal cost and s robust to nose. Accordng to the aforementoned analyss, for each EP, an over segmentaton based superpxel method [35] s appled on the frst three PCs to create shape adaptve regons for spatal nformaton extracton. 1) Constructon of Shape Adaptve Regons The PCA [44] s frst used to reduce the feature bands of the EP and the frst three prncpal components are used as the base mages (.e., I base ), snce they contan the most mportant nformaton of the EP. Then an over segmentaton method [35] s utlzed to construct a 2D superpxel map on the base mage. Subsequently, the 2D superpxel map whch contans the poston ndexes of pxels wthn each superpxel s appled on the correspondng EP to extract the nonoverlappng 3D shape, t = 1,, S num, S num s the number of superpxels). The procedure for creatng of shape adaptve regons s llustrated n Fg. 2. As a result, we can construct many 3D shape adaptve regons for spatal feature extracton. More detals about the over segmentaton algorthm can be found n [35]. Note that, n the superpxel segmentaton part, how to choose the number of superpxels s a key problem. Most of the exstng methods [41] [43] use a manual way to determne the number of superpxels for dfferent mages whch are very tme consumng and are hard to be adaptable to other complex scenaros. To address ths problem, we propose an adaptve adaptve regons (denoted by Y shape t Fg. 3. The example of shape adaptve regon Y shape t adaptve regonsy shape t,1, Y shape t,2,..., Y shape t,8 and ts neghbor shape strategy to determne ths parameter by utlzng the contextual nformaton. Specfcally, the Canny flter [45] s utlzed to detect the structural texture of the base mage I base and the number of nonzero elements N f n fltered mages (denoted by I flter ) s compared wth the total number of pxels N b n I base to create the texture rato R by: R = N f N b. (8) The number of superpxels S num s computed by the predefned number of base superpxel S base and the texture rato R as follows: S num = S base R. (9) For dfferent EPs, the number of base superpxel s set to be fxed, whle the texture rato s automatcally calculated based on the textural structures of the EPs by equaton (8). Therefore, the superpxel number S num can also be adaptvely adjusted wth the texture rato R. In ths way, not only the number of parameter s reduced, but also the spatal characterstcs of dfferent features are taken nto consderaton. 2) Intra And Inter Shape Adaptve Spatal Features Extracton As can be seen from Fg. 2, each shape adaptve regon ncludes a group of neghbor pxels whch are represented by yt k, k = 1,, K. K s the number of EP pxels wthn one shape adaptve regon. For each shape adaptve regon, we can extract two types of spatal features n the followng two ways: a) Intra-shape adaptve spatal feature. To explore the spatal feature wthn a shape adaptve regon, we frst rcompute the average of EP pxels (yt k, k = 1,, K), whch s denoted by ȳ t. The average pxel ȳ t s assgned to each EP pxel n Y shape t. We perform the same operaton for all the shape adaptve regons. Therefore, a mean EP feature EP mean can be constructed by consttutng all the fltered shape adaptve regons. b) Inter-shape adaptve spatal feature. By consderng the neghborng shape-adaptve regons shares the same spatal nformaton, a weghted average strategy s appled on the neghborng shape adaptve regons (.e., Y shape t,v, v = 1,, J) of the Y shape t, where J s the number of ts neghborng Inter-shape adaptve regons. The example of shape adaptve regon Y shape t and ts neghborng shape adaptve regons are

5 5 Fg. 4. The comparson between classfcaton maps obtaned from fuson stage I and the reference map. (a), (b) and (c) are the classfcaton maps (.e., map 1, map 2 and map 3 ) obtaned from EP 1, EP 2 and EP 3 n fuson stage I, respectvely, and (d) s the reference map. represented n Fg. 3. The Inter-shape adaptve spatal feature s defned by equaton (10). Specfcally, the weghted average operaton s appled on the average pxels ȳ t,v, v = 1,, J, whch are the average of Y shape y weght t = t,v, J w t,v ȳ t,v, (10) v=1 where w t,v = exp( ȳt ȳt,v 2 2 /h) Sum. Sum s defned as J v=1 exp( ȳ t ȳ t,v 2 2 /h), and h s a predefned scalar. Moreover, the y weght t s assgned to all EP pxels n Y shape t and all shape adaptve regons are conducted the same operaton. In ths way, a weghted average EP feature EP weght can be created. 3) Adaptve Strategy for Composte Kernel Computaton Assumng a set of spectral pxels (denoted by x spe 1,, x spe N, N s the number of the tranng samples) are randomly (or manually) selected from the orgnal HSI (denoted by X spe ) as tranng samples. The poston ndexes of selected spectral pxels are then utlzed to extract the correspondng spatal pxels from EP mean (wth mean EP pxels denoted by y1 mean,, yn mean ) and EP weght (wth weght average EP pxels denoted by y weght 1,, y weght N ), respectvely. Thus, we can construct three types of feature tranng samples (denoted by x spec 1,, x spec N, y1 mean,, yn mean and y weght 1,, y weght, respectvely). After that, the obtaned three knds of tranng samples are used to create three dfferent kernels by the RBF kernel functon n (5),.e., K tran spec ( x spe exp( x spe K tran ntraep ( y mean exp( y mean ( KnterEP tran exp( y weght y weght N, x spe ) j = x spe 2 /2σ 2 ), j, yj mean ) = y mean 2 /2σ 2 ), j ), y weght j = y weght 2 /2σ 2 ). j (11) (12) (13) Instead of manually selectng the weghts of the above three kernels, an adaptve composte kernel strategy s proposed to adjust the weght automatcally based on the contextual nformaton of X spe, EP mean and EP weght. Specfcally, accordng to the complexness of structural texture of I base s, and I base w (.e., the base mage of X spec, EP mean and I base m EP weght, respectvely), three texture ratos (.e., R s, R m and R w ) can also be computed by equaton (8). The fltered mage s obtaned by the Canny flter on the correspondng base mage. Note that, the base mages are obtaned by applyng the PCA transform on the EP and only adoptng the frst three prncpal components. The obtaned texture ratos are set as the weght of the correspondng kernels,.e., K CW = R s norm Ktran spe R m ( x spe norm Ktran ntraep R w norm Ktran nterep, x spe j ( y mean ( y weght ) +, yj mean ) + ), y weght, j (14) where norm = R s + R m + R w. In ths way, the structural nformaton of X spe, EP mean and EP weght are well utlzed n the composte kernel weghts. Fnally, the obtaned composte kernel s ncorporated nto the SVM classfer to create the classfcaton map of the test samples. The aforementoned operatons are appled on each EP. Therefore, three complementary classfcaton maps can be obtaned whch are denoted by map 1, map 2 and map 3 (see the examples n Fg. 4). B. Stage II: Fuson among EPs Snce each EP has ts own dstnctve characterstcs whch can reflect the orgnal HSI n dfferent aspects, the classfcaton maps (.e., map 1, map 2 and map 3 ) obtaned from dfferent EPs have complementary nformaton. For example, from Fg. 4, we can observe that the classfcaton map 1 delvers the best classfcaton performance n the red crcle area, whereas map 2 and map 3 show some wrong classfcatons n dfferent parts of the red crcle area. The same stuaton can also be observed at other regons (e.g., the green crcle and the yellow crcle area). Thus, n ths stage, the decson fuson s further utlzed to fuse the three obtaned classfcaton maps for creatng the fnal classfcaton result. Specfcally, the majorty votng (MV) s adopted n the three obtaned classfcaton maps (map 1, map 2 and map 3 ) pxel by pxel. We count the number of each class occurrence and denote them as Count 1, Count 2,, Count M, where M s the class number. The class label of the test pxel can be obtaned by: L = max m (Count 1, Count 2,, Count M ). (15) In very small number of cases,.e., for few test samples, the three classfcaton map s labels are dfferent whch s hard to choose the rght map s label as the fnal result. To address ths ssue, we defne a confdence level wth ntaton value be zero for each map (.e., map 1, map 2 and map 3 ). When one makes majorty vote (.e., ts vote belongs to the majorty vote), the confdence level of the correspondng map wll ncrease by one. We fnally choose the labels of classfcaton map that has the hghest confdence level as the labels for those undetermned test samples. IV. EXPERIMENTAL RESULTS AND DISCUSSION The proposed EPs-F method s tested on three HSI mages,.e., the Arborne Vsble/Infrared Imagng Spectrometer

6 6 TABLE I NUMBERS OF SAMPLES IN DIFFERENT CLASSES IN THE THREE TEST IMAGES. Indan Pnes Unversty of Pava Houston Unversty Image Class Name Number Class Name Number Class Name Number Class Name Number 1 Corn-notll Asphalt Healthy grass Parkng Lot Corn-mntll Meadows Stressed grass Parkng Lot Grass-pasture Gravel Synthetc grass Tenns court Grass-trees Trees Tress Runnng track Hay-wndrowed Metal sheet Sol 1242 Total Sybean-notll Bare Sol Water Sybean-mntll Btumen Resdental Sybean-clean Brcks Commercal Woods Shadows Road Bldg-grass-trees 386 Total Hghway 382 Total Ralway 114 weghts n the SVM-CK were manually selected. The SC- MK method adopted a superpxel method to extract both the spatal and spectral nformaton. In the GCK-MLR method, a generalzed composte kernel whch fused the spectral-spatal nformaton was constructed for HSI classfcaton. For the MFNL method, varous features extracted from HSI were combned together for classfcaton. For the EPs-stackng method, the dfferent EPs are used n a stackng way whch s hard to fully explore the nformaton n EPs. To objectvely evaluate the classfcaton results, three metrcs of overall accuracy (OA), average accuracy (AA), and Kappa coeffcent (K) are adopted. Besdes, the average and standard devaton of the classfcaton accuraces over ten runs are reported. The code of the proposed EPs-F method wll be released on the webste 1. Fg. 5. The reference map and classfcaton results (%) for the Indan Pnes mage. (a) False-color composte mages, (b) Reference, (c) SVM [16], (d) EMP [29], (e) SVM-CK [19], (f) EPF [46], (g) GCK-MLR [20], (h) SC-MK [21], () MNFL [47], (j) EPs-stackng [33] and (k) the proposed EPs-F. (AVIRIS) Indan Pnes mage, the Reflectve Optcs System Imagng Spectrometer (ROSIS-03) Unversty of Pava mage, and the Houston Unversty mage. In addton, the classfcaton results of the EPs-F method on the three test mages are vsually and quanttatvely compared wth several wellknown HSI classfcaton methods (.e., the SVM [16], EMP [29], edge preservng flter (EPF) [46], SVM-composte kernel (SVM-CK) [19], generalzed composte kernel-based multvarate logstc regresson (GCK-MLR) [20], superpxel-based classfcaton va multple kernels (SC-MK) [21], multple nonlnear feature learnng wth multvarate logstc regresson (MFNL) [47], extncton profles wth a stackng manner (EPs-stackng) [33]). The SVM s a pxel-wse classfcaton method, whch does not consder spatal nformaton. For the EMP and EPF method, the spatal context of the HSI was exploted by the morphologcal method and edge-flterng, respectvely. In the SVM-CK method, the mean of the neghborhood pxels n a fxed wndow was utlzed to extract the spatal features, and then the spatal features were combned wth spectral features usng a weghted composte kernel. The A. Expermental Data Sets 1) AVIRIS Indan Pnes: The Indan Pnes mage was acqured by the AVIRIS sensor over the agrcultural Indan Pnes ste n northwestern Indana. The sze of ths mage s , where 20 water absorpton bands are removed. The spatal resoluton of the mage s 20m per pxel and the spectral coverage ranges from 200nm to 240nm. The reference map of ths mage contans sxteen classes, most of whch are dfferent knds of crops. In our experment, the major ten classes are used and the reference classes are reported n Table I. Fg. 5 (a) and (b) demonstrate the false-color composte of the Indan Pnes mage and the correspondng reference data. 2) Unversty of Pava: The Unversty of Pava mage was captured by the ROSIS-03 sensor over an urban area surroundng the Unversty of Pava, Italy. The ROSIS-03 sensor generated an mage wth a geometrc resoluton of 1.3m per pxel wth the spectral coverage rangng from 430nm to 860nm. Ths mage s of sze , where 12 spectral bands are removed due to the exstence of hgh nose. The reference of ths mage contans nne ground-truth classes and reference classes are represented n Table I. Fg. 6 (a) and (b) show the false-color composte of the Unversty of Pava mage and the correspondng reference data. 3) Houston Unversty: The Houston Unversty mage was acqured over the Houston Unversty campus and ts negh- 1

7 7 For the SVM-CK method, the summaton composte kernel s used to make a decson rule, n whch the weght of the spectral content and textural content are set as the optmal value n [21]. The parameters of the SVM classfer used n the SVM-CK method are also selected by the fve-fold cross-valdaton technque. The parameters of the EMP, EPF, GCK-MLR, MFNL, EPs-stackng and SC-MK are set as the defaulted values reported n [29], [46], [19], [47], [33] and [21], respectvely. C. Results Comparson Fg. 6. The reference map and classfcaton results (%) for the Unversty of Pava mage. (a) False-color composte mages, (b) Reference, (c) SVM [16], (d) EMP [29], (e) SVM-CK [19], (f) EPF [46], (g) GCK-MLR [20], (h) SC-MK [21], () MNFL [47], (j) EPs-stackng [33] and (k) the proposed EPs-F. borng area, whch was used n the 2013 GRSS Data Fuson Contest. The hyperspectral data contans 144 spectral bands n the 380nm-1050nm regon, and pxels wth a spatal resoluton of 2.5m. Ths mage s an urban data sets whose most of the land covers are man-made objects whch contans ffteen classes. The reference classes are also shown n Table I. Fg. 7 (a) and (b) show the false-color composte of the Houston Unversty mage and the correspondng reference data. B. Parameter Settng For the tested Indan Pnes, Unversty of Pava, and Houston Unversty mages, the number of base superpxels are set to 1750, 5000, and 45000, respectvely. The parameter h n (10) s set to 500. The effects of number of base superpxels and h are dscussed n the followng subsecton. The σ n (11)(13) s set to 1 and the parameters of the SVM classfer n our method are selected by a fve-fold cross-valdaton technque. The parameters of the other test methods are set as follows: The parameters of the SVM method are determned by the fve-fold cross-valdaton technque. Fg. 5 shows dfferent classfcaton maps obtaned by dfferent nvestgated methods on the Indan Pnes mage wth 50 tranng samples are randomly selected for each class (Tr=50). As can be observed, by only consderng the spectral nformaton, the SVM method shows a very nosy estmaton n ts classfcaton map. By ncorporatng the local spatal context of the HSI, the EMP, SVM-CK, EPF, and GCK-MLR delver a smoother vsual result. However, those approaches stll fal to dentfy the pxels n the detaled and edge regons (e.g., the 7th class, Soynbeans-mntll). In addton, by combnng varous spatal features (e.g., nonlnear and lnear features of HSI) or extractng the spatal nformaton of HSI wth a more sophstcated strategy, the MNFL and SC-MK methods have better vsual performance, but stll exstng some wrong classfcaton labels (e.g., the 4th class, area of grass tree). Snce the rch spatal nformaton n EPs can not be fully explored by a smple stackng manner, the EPs-stackng method also fals to classfy the pxels n some area (e.g., the 7th class, Sybeanmntll). By contrast, the proposed EPs-F method has the best vsual classfcaton performance, whch not only reduces the nose greatly, but also preserves the meanngful structural nformaton. The correspondng classfcaton accuraces are reported n Table II wth the best results n bold. As can be seen, the proposed method acheves the hghest classfcaton accuracy n terms of OA, AA and K. Fg. 6. llustrates dfferent classfcaton maps obtaned by dfferent test methods on the Unversty of Pava mage wth 50 tranng samples are randomly selected per class (Tr=50). As can be observed from Fg. 6, the SVM classfcaton map s stll very nosy. The EMP, SVM-CK and MNFL can delver a comparatvely smooth result, but stll fal to detect some meanngful regons (e.g., the detaled or near-edge areas). Although, the EPF, GCK-MLR and SC-MK algorthms show mprovements on the detecton of the detals, there s stll notceable salt and pepper nose n the large-scale green area (e.g., 2nd class, meadows, at the bottom of the classfcaton map). The same stuaton can also be observed on the area of the 6th class (Bare sol) of the classfcaton map obtaned by the EPs-stackng method. By contrast, the proposed EPsF method can provde the best vsual performance at these areas, wth great suppresson on nose. The correspondng quanttatve results are shown n Table III wth the best results n bold. As can be seen, compared wth the SVMCK, GCK-MLR, SC-MK, and MFNL methods, the average

8 8 Fg. 7. The reference map and classfcaton results (%) for the Houston Unversty mage. (a) False-color composte mages, (b) Reference, (c) SVM [16], (d) EMP [29], (e) SVM-CK [19], (f) EPF [46], (g) GCK-MLR [20], (h) SC-MK [21], () MNFL [47], (j) EPs-stackng [33] and (k) the proposed EPs-F. mprovements of the proposed method are over 2.1%, 1.7%, and 2.7%, n terms of OA, AA and K, respectvely. In addton, another experment s conducted on the Houston Unversty mage, wth dfferent numbers of randomly selected tranng samples (.e., 10, 30 and 50 tranng samples for each class, respectvely) to evaluate the performance of the nvestgated methods. The quanttatve results are represented n Table IV wth the best results n bold. As can be observed, the proposed EPs-F method outperforms all the compared methods n terms of OA, AA and K even f only a small number of tranng samples are avalable. The man reasons are two folds. On the one hand, the EP can well preserve the geometrcal characterstcs of HSI whch can offer a dscrmnatve nformaton for classfcaton. On the other hand, by fusng the abundant spatal nformaton wthn each EP (.e., Fuson Stage I) and ncorporatng the complementary nformaton among EPs (.e., Fuson Stage II), the dscrmnatve nformaton s suffcently utlzed. The vsual performance comparson of dfferent methods wth Tr = 50 are represented n Fg. 7. As can be seen, the proposed EPs-F method provdes the best vsual classfcaton result compared wth other test methods (see the zoom regons of Fg. 7). D. Effects of Fuson Stage I And Fuson Stage II Ths secton analyzes the effects of the Fuson Stages I and II n the proposed EPs-F algorthm. 1) Effect of Fuson Stage I: The step of spatal nformaton extracton wthn EP s removed and the three complementary EPs are drectly combned together to create a composte kernel for classfcaton whle other parameters and operatons reman unchanged. The correspondng classfcaton performance s compared wth the proposed EPs-F on varous Fg. 8. The classfcaton result (n OA, AA, and K) comparson between EPs-F and EPs-F wthout Fuson Stage I usng a varous number of tranng samples. (a) Indan Pnes, (b) Unversty of Pava, and (c) Houston Unversty mages. Fg. 9. Correlaton coeffcent matrces across dfferent EPs for the three test HSI mages. mages, whch s llustrated n Fg. 8. As can be observed, the proposed method delvers a better classfcaton performance on dfferent mages consderng varous numbers of tranng samples. Specfcally, for the Indan Pnes data sets, the classfcaton accuracy decreases when the Fuson Stage I s removed. When only 10 tranng samples are selected for each class (.e., Tr =10), the OA of the proposed EPs-F method s 83.35%, whle the OA of the EPs-F wthout stage I s 73.58% whch are shown n Table V wth the best results n bold. It can be seen that the OA decreases by almost 10%. The

9 9 man reason s that wthout the Fuson Stage I, the abundant spatal nformaton wthn each EP cannot be well exploted. The same stuaton can also be observed for the Unversty of Pava data sets and Houston Unversty data sets. Overall, the proposed fuson frameworks can consstently acheve the best results n terms of classfcaton accuraces when the spatal nformaton wthn EP are effectvely exploted. 2) Effect of Fuson Stage II: Frst, the complementary propertes between dfferent EPs are nvestgated. Fg.9 shows the correlaton coeffcent matrx across the dfferent EPs on the three test mages and the bar n the last column represents the correlaton value n coeffcent matrx. As can be observed, the correlatons wthn each EP s very strong, whle dfferent EPs have much smaller correlatons. These low correlatons among EPs just show the dfferences whle stll be complementary. Note that, gven a matrx X = [x 1, x 2,, x n ], ts correlaton coeffcent matrx R R n n s calculated by equaton (16). R(, j) = cov(x, x j ) cov(x, x ) cov(x j, x j ). (16) where cov denotes the covarance operaton. Then, each EP s regarded as an ndependent feature and only spatal nformaton wthn each EP s consdered to create the classfcaton result. The parameters and operaton are smlar to the EPs-F. Fg. 10 shows the classfcaton results comparson between EPs-F and EPs-F wthout Fuson Stage II on dfferent mages and number of tranng samples. As can be seen, by utlzng the complementary nformaton among dfferent EPs wth the MV, the classfcaton performance of the proposed EPs-F method outperforms other sngle features (.e., EP 1, EP 2 and EP 3 ) and the advantage of the proposed method becomes more obvous when the avalable tranng samples are lmted (e.g., Tr =10). For example, as shown n Table V, for the Unversty of Pava data sets, the proposed method has the hghest classfcaton accuracy wth OA = 92.56%, whereas the OA of other sngle features (.e., EP 1, EP 2 and EP 3 ) are 88.82%, 89.59% and 86.11% wth the decrease of 3.74%, 2.97% and 6.45%, respectvely. The same results can also be observed on the other two data sets (e.g., Indan Pnes and Houston Unversty), whch demonstrates the MV can utlze the complementary nformaton among dfferent EPs n our proposed fuson framework for classfcaton. Note that, the best results n Table V are shown n bold. E. Parameter Dscusson 1) Effects of Number of Base Superpxel: In ths part, the effect of number of base superpxel s nvestgated. The numbers of tranng and test samples are selected to be the same as n the aforementoned experments on the Indan Pnes, Unversty of Pava mages and Houston unversty mage. Accordng to the sze of the mage, the number of base superpxel for the Indan Pnes mage s selected from 500 to 5000 wth the step sze of 250. The number of base superpxel for the Unversty of Pava mage s selected from 1000 to wth the step sze of 1000, whle the number of base superpxel on the Houston Unversty mage s selected from Fg. 10. The classfcaton results (n OA, AA, and K) comparson between EPs-F and EPs-F wthout Fuson Stage II at varous number of tranng samples. (a) Indan Pnes, (b) Unversty of Pava, and (c) Houston Unversty mages. Fg. 11. The effects of number of base superpxel on three dfferent mages. (a) Indan Pnes (Tr = 50), (b) Unversty of Pava (Tr = 50), and (c) Houston Unversty mages (Tr = 10, Tr = 30 and Tr = 50) to wth the step sze of Fg. 11 llustrates the OA values of the proposed EPs-F method under dfferent base superpxel numbers on all three test mages. Specfcally, for Indan Pnes, as can be observed, the classfcaton accuracy on OA reaches the best when the superpxel number equals to 1750 (marked by a red crcle) and the OA decreases when the number of base superpxel s selected to be other values. Ths s manly due to the fact that when the number of base superpxel s less than 1750, the spatal nformaton wth dfferent classes mght be ncluded nto one superpxel, and thus, t leads to the decrease n the classfcaton accuracy. On the other hand, when the number of base superpxel s larger than 1750, the sze of each superpxel wll become small, and thus, the spatal nformaton (e.g., n large homogeneous regons of the Indan Pnes mage) wll not be suffcently exploted for classfcaton. In addton, the same stuaton can also be seen on other test two mages (.e., the Unversty of Pava and Houston Unversty) wth the optmal number of base superpxel are 5000 and 45000, respectvely. Note that, wth dfferent number of tranng samples, the best number of base superpxel for Houston unversty are same (see the (c) n Fg. 11) whch demonstrates the robustness of the proposed method. 2) Effect of Parameter h: The proposed method s tested on three test mages wth the h vared from 100 to 1000 (wth Tr = 50), whch s shown n Fg. 12. As can be observed, the classfcaton results on the three test mages reman comparatvely stable. For example, on the Indan Pnes mage, the dfference between the maxmal OA and mnmum OA s less than 0.5%. Moreover, snce the Unversty of Pava and Houston Unversty mage are acqured from the urban area wth more detaled structures, the optmal h for the Unversty of Pava and Houston Unversty mage are smaller than the h for Indan Pnes. The optmal h for the Indan Pnes, Unversty

10 10 TABLE II THE AVERAGE ACCURACY(STANDARD DEVIATION)(%) OF TEN REPEATED EXPERIMENTS ON INDIAN PINES IMAGE OBTAINED BY DIFFERENT METHODS WITH 50 TRAINING SAMPLES PER CLASS. Class SVM [16] EMP [29] EPF [46] SVM-CK [19] GCK-MLR [20] SC-MK [21] MNFL [47] EPs-stackng [33] EPs-F (3.69) 83.17(4.40) 84.47(6.02) 78.24(6.91) 78.70(3.97) 93.80(3.63) 91.13(2.80) 82.02(1.15) 90.71(3.29) (4.70) 84.47(5.48) 87.23(9.66) 84.15(3.58) 91.56(2.13) 95.41(1.83) 91.01(3.01) 83.85(7.07) 95.45(3.16) (3.76) 89.85(3.71) 97.09(2.04) 93.95(3.22) 92.21(2.04) 97.16(2.16) 92.20(1.98) 94.78(1.80) 98.45(0.76) (1.69) 97.18(0.86) 96.85(1.66) 98.47(1.80) 98.79(0.67) 99.85(0.01) 91.25(0.54) 98.06(0.94) 99.96(0.01) (1.71) 99.98(0.06) 98.70(1.84) 99.86(0.04) 99.98(0.06) 100(0) 92.81(0.25) 99.72(0.03) 100(0) (3.91) 84.03(5.08) 75.50(5.27) 77.53(2.36) 85.07(2.23) 94.99(3.74) 92.03(2.91) 85.03(3.44) 96.17(1.71) (2.41) 92.66(2.26) 95.93(2.86) 75.07(2.87) 85.38(2.10) 90.61(2.73) 93.49(1.71) 81.23(5.31) 93.67(3.78) (2.28) 73.51(1.94) 72.50(4.98) 79.89(2.79) 90.33(2.70) 96.28(1.75) 90.98(1.51) 83.61(6.03) 96.94(1.88) (0.91) 99.86(0.14) 99.43(0.38) 92.35(1.71) 98.35(0.95) 98.47(0.05) 91.74(1.60) 97.66(1.04) 99.79(0.01) (4.70) 95.32(2.15) 73.99(9.57) 94.40(3.10) 95.60(2.81) 98.42(0.60) 91.85(3.66) 97.62(1.97) 99.70(0.02) OA 72.73(0.85) 89.43(1.67) 88.31(1.80) 83.68(2.35) 89.36(0.70) 95.06(0.67) 90.86(0.80) 87.66(1.93) 95.85(0.46) AA 68.72(0.93) 87.76(1.90) 86.51(2.01) 87.39(1.81) 91.71(0.40) 96.50(0.40) 91.85(0.78) 90.43(1.47) 97.09(0.24) K 73.52(0.61) 90.01(1.62) 88.22(1.53) 81.14(2.64) 87.73(0.82) 94.32(0.81) 89.44(0.91) 85.89(2.21) 95.22(0.52) TABLE III THE AVERAGE ACCURACY (STANDARD DEVIATION)(%) OF TEN REPEATED EXPERIMENTS ON UNIVERSITY OF PAVIA IMAGE OBTAINED BY DIFFERENT METHODS WITH 50 TRAINING SAMPLES PER CLASS. Class SVM [16] EMP [29] EPF [46] SVM-CK [19] GCK-MLR [20] SC-MK [21] MNFL [47] EPs-stackng [33] EPs-F (3.69) 98.61(0.96) 98.00(0.60) 88.23(3.32) 95.68(0.68) 95.37(1.50) 95.92(1.11) 94.48(1.53) 98.03(0.72) (4.70) 98.62(1.05) 98.43(1.03) 92.60(3.83) 97.38(1.56) 95.62(1.35) 95.90(1.53) 95.79(1.89) 98.27(1.10) (3.76) 73.73(0.83) 92.18(7.45) 85.75(2.76) 91.91(2.81) 97.76(1.61) 84.76(3.50) 97.40(0.78) 99.39(0.07) (1.69) 96.09(1.01) 91.87(8.31) 94.15(1.78) 95.09(1.11) 96.34(1.21) 95.32(1.49) 98.79(0.89) 98.01(0.83) (1.71) 98.89(0.18) 97.55(3.11) 99.52(0.09) 99.21(0.21) 99.96(0.06) 99.49(0.24) 99.52(0.19) 99.94(0.04) (3.91) 85.79(4.22) 80.13(8.67) 91.46(2.16) 97.03(0.89) 97.78(1.66) 96.41(0.84) 96.65(0.66) 99.90(0.07) (2.41) 94.62(0.62) 86.99(7.29) 92.47(2.80) 97.86(0.97) 99.95(0.02) 98.99(0.68) 97.62(0.75) 99.96(0.05) (5.98) 92.31(1.45) 91.47(7.86) 83.39(4.21) 93.14(2.95) 94.84(2.74) 87.57(3.01) 97.16(1.76) 99.14(0.36) (0.02) 99.79(0.03) 98.91(0.71) 99.96(0.01) 99.77(0.14) 99.99(0.01) 99.83(0.11) 98.13(1.11) 99.99(0.06) OA 84.06(1.09) 94.57(0.77) 93.57(2.39) 91.14(1.06) 96.40(0.36) 96.28(1.48) 94.95(0.72) 96.76(0.59) 98.67(0.67) AA 79.35(1.26) 92.85(1.01) 91.60(3.03) 91.95(0.61) 96.34(0.31) 97.51(0.70) 94.91(0.36) 97.53(0.28) 99.18(0.18) K 82.02(0.91) 93.21(1.02) 92.82(2.55) 88.34(1.37) 95.24(0.51) 95.11(1.91) 93.43(0.91) 95.68(0.76) 98.23(0.93) TABLE IV THE AVERAGE ACCURACY (STANDARD DEVIATION)(%) OF TEN REPEATED EXPERIMENTS ON HOUSTON UNIVERSITY IMAGE WITH VARIOUS TRAINING SAMPLES OBTAINED BY DIFFERENT METHODS. Tr=10 Tr=30 Tr=50 Method OA AA K OA AA K OA AA K SVM [16] 74.05(2.07) 71.97(2.20) 75.21(0.16) 86.35(1.14) 85.24(1.22) 86.23(1.01) 89.93(0.63) 89.10(0.68) 89.83(0.72) EMP [29] 78.50(2.22) 76.79(2.38) 80.44(2.02) 88.03(0.58) 87.07(0.62) 88.62(0.73) 92.25(0.60) 91.62(0.65) 92.41(0.52) EPF [46] 78.73(2.42) 77.02(2.59) 78.22(2.02) 91.35(0.97) 90.65(1.04) 91.02(1.31) 94.55(0.80) 94.10(0.86) 94.41(1.02) SVM-CK [19] 77.04(2.03) 78.46(1.68) 75.19(2.17) 88.95(1.49) 89.62(1.56) 88.05(1.56) 92.27(0.42) 92.63(0.43) 91.04(0.46) GCK-MLR [20] 80.45(1.54) 81.72(1.20) 78.91(1.71) 91.66(1.07) 91.90(0.89) 91.01(1.12) 94.41(0.49) 94.45(0.50) 94.01(0.53) SC-MK [21] 74.84(3.19) 77.80(2.91) 72.32(3.44) 89.57(0.10) 90.58(0.85) 88.71(1.12) 92.44(0.73) 93.17(0.60) 91.82(0.08) MNFL [47] 69.79(2.91) 72.66(2.02) 67.28(2.01) 89.41(0.84) 89.87(0.63) 88.52(0.94) 93.38(0.36) 93.46(0.34) 92.81(0.39) EPs-stackng [33] 73.05(1.95) 75.77(1.44) 70.80(2.10) 83.62(1.54) 84.99(0.98) 82.30(1.65) 88.17(0.41) 89.01(0.43) 87.20(0.45) EPs-F 82.72(2.22) 84.00(1.90) 81.31(2.41) 93.81(0.94) 94.09(0.79) 93.32(0.14) 96.26(0.53) 96.46(0.49) 95.96(0.58) of Pava, and Houston Unversty s 700, 500, 500 respectvely and h s set to be 500 for these three mages. F. Effect of Dfferent Number of EP groups In ths part, the nfluence of number of EP groups to proposed EPs-F method s nvestgated. Specfcally, for Indan Pnes and Pava Unversty mages, the frst fve EPs are generated wth the frst fve ICs, and each of them as well as ther combnatons are analyzed. Also, for the Houston unversty mage, the frst four EPs are generated wth the frst four ICs, and each of them as well as ther combnatons are analyzed. Fg. 13 (as shown n the below) llustrates the classfcaton results of the proposed method wth dfferent EP groups on three test mages of dfferent tranng samples. As can be observed, utlzng the EP 1 + EP 2 + EP 3 (proposed EPs-F) almost delvers the best classfcaton results. Further utlzng more EPs does not show any mprovements and even deterorate the performance. Therefore, n ths paper, the frst three ICs s utlzed. Overall, by consderng three dfferent mages wth dverse characterstcs (.e., spatal and spectral resoluton) and tranng samples, the frst three ICs can always delver the best performance. Therefore, only three ICs are expected to lead to very good results and t s not necessary to adjust ths parameter f other mages are used. V. CONCLUSIONS In ths paper, a new two step-based fuson framework s proposed to explot the spatal nformaton of the extncton profle (EP) for hyperspectral mage (HSI) classfcaton, whch s

11 11 TABLE V THE AVERAGE ACCURACY (STANDARD DEVIATION)(%) OF TEN REPEATED EXPERIMENTS ON THREE TEST IMAGES OBTAINED BY EPS-F AND ITS TWO VARIANT METHODS. Method OA AA K Method OA AA K Method OA AA K Indn Pnes EPs-F wthout EPs-F wthout Fuson Stage II Fuson Stage I EP 1 EP 2 EP 3 EPs-F (3.42) (2.93) (3.24) (5.52) (3.34) (3.98) (4.20) (2.80) (3.43) (3.98) (4.41) (5.24) (3.69) (4.67) (4.31) Unversty of Pava EPs-F wthout EPs-F wthout Fuson Stage II Fuson Stage I EP 1 EP 2 EP 3 EPs-F ) (2.72) (2.34) (2.60) (4.84) (2.56) (1.44) (1.52) (1.64) (2.32) (1.50) (3.42) (2.93) (3.24) (5.52) (3.34) Houston Unversty EPs-F wthout EPs-F wthout Fuson Stage II Fuson Stage I EP 1 EP 2 EP 3 EPs-F (2.32) (3.35) (2.66) (2.11) (2.22) (2.00) (3.03) (2.16) (1.66) (1.90) (2.52) (3.24) (2.92) (2.32) (2.42) termed as the EPs-F method. Frst, by extractng the EP from frst three ndependent components (ICs) of HSI, three dscrmnatve and complementary EPs can be constructed. Then, a superpxel-based adaptve composte kernel strategy s proposed to ncorporate the spatal nformaton wthn each EP and spectral features of the orgnal HSI mage. Furthermore, a decson fuson strategy s utlzed to fuse complementary nformaton among EPs. In ths way, the abundant spatal nformaton wthn each EP, the spectral feature of orgnal HSI and the complementary nformaton among EPs are well utlzed. The classfcaton results obtaned by the proposed EPs-F on three real HSIs outperforms several state-of-theart classfcaton methods n term of quanttve and vsual performance whch proves the effectveness of the proposed method. In the proposed framework, the superpxel-based method s used to explore the abundant nformaton wthn EP. However, snce the EP s also a 3D mage, the tensor analyss-based method deserves to be studed to extract more dscrmnatve features for classfcaton. Moreover, our future work wll utlze other knds of features and combne them wth EPs to mprove classfcaton accuraces. ACKNOWLEDGEMENT The authors would lke to thank Prof. D. Landgrebe from Purdue Unversty and the NASA Jet Propulson Laboratory for provdng the free downloads of the hyperspectral data sets. In addton, we would apprecate Dr. Jun L for provdng the Fg. 12. The effects of the parameter h n equaton (10) to the classfcaton accuracy on three test mages wth Tr = 50. Fg. 13. The effects of the weght s dstrbuton n equaton (10) to the classfcaton accuracy on three test mages wth dfferent Tr. softwares of GCK-MLR and MNFL. We would lke also to thank the edtors and anonymous revewers for ther nsghtful comments and suggestons, whch have sgnfcantly mproved ths paper. REFERENCES [1] M. Dalponte, H. O. Orka, T. Gobakken, D. Ganelle, and E. Nasset, Tree speces classfcaton n boreal forests wth hyperspectral data, IEEE Trans. Geosc. Remote Sens., vol. 51, no. 5, pp , May [2] K. Karalas, G. Tsagkataks, M. Zervaks, and P. Tsakaldes, Land classfcaton usng remotely sensed data: Gong multlabel, IEEE Trans. Geosc. Remote Sens, vol. 54, no. 6, pp , Jun [3] J. M. Boucas-Das, A. Plaza, G. Camps-Valls, P. Scheunders, N. M. Nasrabad, and J. Chanussot, Hyperspectral remote sensng data analyss and future challenges, IEEE Geosc. Remote Sens. Mag., vol. 1, no. 2, pp. 6-36, Jun [4] F. Ratle, G. Camps-Valls, and J. Weston, Semsupervsed neural networks for effcent hyperspectral mage classfcaton, IEEE Trans. Geosc. Remote Sens., vol. 48, no. 5, pp , May [5] Q. Wang, Y. Gu, and D. Tua, Dscrmnatve multple kernel learnng for hyperspectral mage classfcaton, IEEE Trans. Geosc. Remote Sens., vol. 54, no. 7, pp , Jul [6] Y. Gu, J. Chanussot, X. Ja, and J. A. Benedktsson, Multple kernel learnng for hyperspectral mage classfcaton: A revew, IEEE Trans. Geosc. Remote Sens., n Press [7] Y. Gu, T. Lu, X. Ja, J. A. Benedktsson, and J. Chanussot, Nonlnear multple kernel learnng wth mult-structure-element extended morphologcal profles for hyperspectral mage classfcaton, IEEE Trans. Geosc. Remote Sens., vol. 54, no. 6, pp , Jun [8] S. Ja, L. Shen, and Q. L, Gabor feature-based collaboratve representaton for hyperspectral magery classfcaton, IEEE Trans. Geosc. Remote Sens., vol. 53, no. 2, pp , Feb [9] J. Lu, Z. Wu, J. L, A. Plaza, and Y. Yuan, Probablstc kernel collaboratve representaton for spatal-spectral hyperspectral mage classfcaton, IEEE Trans. Geosc. Remote Sens., vol. 54, no. 4, pp , Apr

12 12 [10] L. Fang, S. L, X. Kang, and J. A. Benedktsson, Spectral-spatal hyperspectral mage classfcaton va multscale adaptve sparse representaton, IEEE Trans. Geosc. Remote Sens., vol. 52, no. 12, pp , Dec [11] L. Fang, C. Wang, S. L, and J. A. Benedktsson, Hyperspectral mage classfcaton va multple-feature-based adaptve sparse representaton, IEEE Trans. Instrum. Meas., vol. 66, no.7, pp , Jul [12] L. Fang, S. L, X. Kang, and J. A. Benedktsson, Spectral-spatal classfcaton of hyperspectral mages wth a superpxel-based dscrmnatve sparse model, IEEE Trans. Geosc. Remote Sens., vol. 53, no. 8, pp , Aug [13] S. Ja, J. Hu, Y. Xe, L. Shen, X. Ja, and Q. L, Gabor cube selecton based multtask jont sparse representaton for hyperspectral mage classfcaton, IEEE Trans. Geosc. Remote Sens., vol. 54, no. 6, pp , Jun [14] L. Fang et al., Segmentaton based sparse reconstructon of optcal coherence tomography mages, IEEE Trans. Med. Imagng, vol. 36 no. 2, pp , Feb [15] L. Fang et al., Automatc segmentaton of nne retnal layer boundares n OCT mages of non-exudatve AMD patents usng deep learnng and graph search, Bomed. Opt. Express, vol. 8, no. 5, pp , May [16] F. Melgan and L. Bruzzone, Classfcaton of hyperspectral remote sensng mages wth support vector machnes, IEEE Trans. Geosc. Remote Sens., vol. 42, no. 8, pp , Aug [17] L. Bruzzone, M. Ch, and M. Marconcn, A novel transductve SVM for semsupervsed classfcaton of remote-sensng mages, IEEE Trans. Geosc. Remote Sens., vol. 44, no. 11, pp , Nov [18] M. Fauvel, J. Chanussot, and J. A. Benedktsson, Evaluaton of kernels for multclass classfcaton of hyperspectral remote sensng data, n Proc. IEEE Int. Conf. Acoust. Speech Sgnal Process., pp. II-II. [19] G. Camps-Valls, L. Gomez-Chova, J. Muñoz-Marł, J. Vla-Francs, and J. Calpe-Maravlla, Composte kernels for hyperspectral mage classfcaton, IEEE Geosc. Remote Sens. Lett., vol. 3, no. 1, pp , Jan [20] J. L, P. Marpu, A. Plaza, J. Boucas-Das, and J. A. Benedktsson, Generalzed composte kernel framework for hyperspectral mage classfcaton, IEEE Trans. Geosc. Remote Sens., vol. 51, no. 9, pp , Sep [21] L. Fang, S. L, W. Duan, J. Ren, and J. A. Benedktsson, Classfcaton of hyperspectral mages by explotng spectral-spatal nformaton of superpxel va multple kernels, IEEE Trans. Geosc. Remote Sens., vol. 53, no. 12, pp , Dec [22] X. Kang, S. L, and J. A. Benedktsson, Feature extracton of hyperspectral mages wth mage fuson and recursve flterng, IEEE Trans. Geosc. Remote Sens., vol. 52, no. 6, pp , Jun [23] S. Prasad and L. M. Bruce, Lmtatons of prncpal components analyss for hyperspectral target recognton, IEEE Geosc. Remote Sens. Lett., vol. 5, no. 4, pp , Oct [24] A. Vlla, J. A. Benedktsson, J. Chanussot, and C. Jutten, Hyperspectral mage classfcaton wth ndependent component dscrmnant analyss, IEEE Trans. Geosc. Remote Sens., vol. 49, no. 12, pp , Dec [25] W. L, S. Prasad, J. E. Fowler, and L. M. Bruce, Localty-preservng dmensonalty reducton and classfcaton for hyperspectral mage analyss, IEEE Trans. Geosc. Remote Sens., vol. 50, no. 4, pp , Apr [26] P. Ghams, J. A. Benedktsson, and M. O. Ulfarsson, Spectral-spatal classfcaton of hyperspectral mages based on hdden Markov random felds, IEEE Trans. Geosc. Remote Sens., vol. 52, no. 5, pp , May [27] X. Ja and J. A. Rchards, Managng the spectral-spatal mx n context classfcaton usng Markov random felds, IEEE Geosc. Remote Sens. Lett., vol. 5, no. 2, pp , Apr [28] J. A. Benedktsson, M. Pesares, and K. Amason, Classfcaton and feature extracton for remote sensng mages from urban areas based on morphologcal transformatons, IEEE Trans. Geosc. Remote Sens., vol. 41, no. 9, pp , Sep [29] J. A. Benedktsson, J. A. Palmason, and J. R. Svensson, Classfcaton of hyperspectral data from urban areas based on extended morphologcal profles, IEEE Trans. Geosc. Remote Sens., vol. 43, no. 3, pp Mar [30] A. Plaza, P. Martnez, J. Plaza, and R. Perez, Dmensonalty reducton and classfcaton of hyperspectral mage data usng sequences of extended morphologcal transformatons, IEEE Trans. Geosc. Remote Sens., vol. 43, no. 3, pp , Mar [31] M. D. Mura, J. A. Benedktsson, B. Waske, and L. Bruzzone, Morphologcal attrbute profles for the analyss of very hgh resoluton mages, IEEE Trans. Geosc. Remote Sens., vol. 48, no. 10, pp , Oct [32] P. Ghams, R. Souza, J. A. Benedktsson, X. X. Zhu, L. Rttner, and R. A. Lotufo, Extncton profles for the classfcaton of remote sensng data, IEEE Trans. Geosc. Remote Sens., vol. 54, no. 10, pp , Oct [33] P. Ghams, R. Souza, J. A. Benedktsson, L. Rttner, R. Lotufo, and X. X. Zhu, Hyperspectral data classfcaton usng extended extncton profles, IEEE Geos. Remote Sens. Lett., vol. 13, no. 11, pp , Nov [34] P. Comon, Independent component analyss, A new concept? Sgnal Process., vol. 36, no. 3, pp , Apr [35] M. Lu, O. Tuzel, S. Ramalngam, and R. Chellappa, Entropy rate superpxel segmentaton, n Proc. IEEE Conf. Comput. Vs. Pattern Recog., 2011, pp [36] C. Vacher, Extncton value: A new measurement of persstence, n Proc. IEEE Workshop Nonlnear Sgnal Image Process, 1995, pp [37] P. Solle, Morphologcal mage analyss: Prncples and applcatons, 2nd ed. Secaucus, NJ, USA: Sprnger-Verlag, [38] W. Fu, S. L, and L. Fang, Spectral-spatal hyperspectral mage classfcaton va superpxel mergng and sparse representaton, n Proc. IEEE Int. Geocs. Remote Sens. Symp. (IGARSS), 2015, pp [39] R. Roscher and B. Waske, Superpxel-based classfcaton of hyperspectral data usng sparse representaton and condtonal random felds, n Proc. IEEE Int. Geocs. Remote Sens. Symp. (IGARSS), 2014, pp [40] J. Lu, W. Yang, S. Tan, and Z. Wang, Remote sensng mage classfcaton based on random projecton super-pxel segmentaton, n Proc Int. Soc. Optc. Photon (SPIE), 2013, pp [41] T. Lu, S. L, L. Fang, L. Bruzzone, and J. A. Benedktsson, Set-toset dstance-based spectral-spatal classfcaton of hyperspectral mages, IEEE Trans. Geosc. Remote Sens., vol. 54, no. 12, pp , Dec [42] S. L, T. Lu, L. Fang, X. Ja, and J. A. Benedktsson, Probablstc fuson of pxel-level and superpxel-level hyperspectral mage classfcaton, IEEE Trans. Geosc. Remote Sens., vol. 54, no. 12, pp , Dec [43] L. Fang, H. Zhuo, and S. L Super-resoluton of hyperspectral mage va superpxel-based sparse representaton. Neuro., In press, [44] I. Jollffe, Prncpal component analyss, New York, NY, USA: Wley, [45] J. Canny, A computatonal approach to edge detecton, IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-8, no. 6, pp , Nov [46] X. Kang, S. L, and J. A. Benedktsson, Spectral-spatal hyperspectral mage classfcaton wth edge-preservng flterng, IEEE Trans. Geosc. Remote Sens., vol. 52, no. 5, pp , May [47] J. L, X. Huang, P. Gamba, J. M. Boucas-Das, L. Zhang, J. A. Benedktsson, and A. Plaza, Multple feature learnng for hyperspectral mage classfcaton, IEEE Trans. Geosc. Remote Sens., vol. 53, no. 3, pp , Mar Leyuan Fang (S 10-M 14-SM 17) receved the B.S. and Ph.D. degrees from the College of Electrcal and Informaton Engneerng, Hunan Unversty, Changsha, Chna, n 2008 and 2015, respectvely. From September 2011 to September 2012, he was a vstng Ph.D. student wth the Department of Ophthalmology, Duke Unversty, Durham, NC, USA, supported by the Chna Scholarshp Councl. Snce Jan. 2017, he has been an assocate professor wth the College of Electrcal and Informaton Engneerng, Hunan Unversty. Hs research nterests nclude sparse representaton and mult-resoluton analyss n remote sensng and medcal mage processng. He has won the Scholarshp Award for Excellent Doctoral Student granted by Chnese Mnstry of Educaton n 2011.

13 13 Nanjun He (S 17) receved the B.S. degree from Central South Unversty of Forestry and Technology, Changsha, Chna, n He s currently workng toward the Ph.D. degree n the Laboratory of Vson and Image Processng, Hunan Unversty, Changsha, Chna. From October 2017 to October 2018, he s a vstng PH.D. student wth Hyperspectral Computng Laboratory, Unversty of Extremadura, Ca ceres, Span, supported by the Chna Scholarshp Councl. Hs research nterests nclude hyperspectral magery classfcaton, hyperspectral magery restoraton, and computer vson n remote sensng mages. Shutao L (M 07-SM 15) receved the B.S., M.S., and Ph.D. degrees from Hunan Unversty, Changsha, Chna, n 1995, 1997, and 2001, respectvely. He was a Research Assocate wth the Department of Computer Scence, the Hong Kong Unversty of Scence and Technology, Hong Kong, n From 2002 to 2003, he was a Post-Doctoral Fellow wth the Royal Holloway College, Unversty of London, London, U.K., wth Prof. John ShaweTaylor. In 2005, he vsted the Department of Computer Scence, Hong Kong Unversty of Scence and Technology as a Vstng Professor. He joned the College of Electrcal and Informaton Engneerng, Hunan Unversty, n He s currently a Full Professor wth the College of Electrcal and Informaton Engneerng, Hunan Unversty. He has authored or co-authored over 160 refereed papers. Hs current research nterests nclude compressve sensng, sparse representaton, mage processng, and pattern recognton. He s now an Assocate Edtor of the IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, IEEE TRANSACTIONS ON INSTRUMENTATION AND MEASUREMENT, and a member of the Edtoral Board of the Informaton Fuson and the Sensng and Imagng. He was a recpent of two 2nd-Grade Natonal Awards at the Scence and Technology Progress of Chna n 2004 and Pedram Ghams (S 12-M 15) receved the B.Sc. degree n cvl (survey) engneerng from the Tehran South Campus of Azad Unversty, Tehran, Iran, the M.Sc. degree (Hons.) n remote sensng from the K. N. Toos Unversty of Technology, Tehran, n 2012, and the Ph.D. degree n electrcal and computer engneerng from the Unversty of Iceland, Reykjavk, Iceland, n From 2013 to 2014, he spent seven months wth the School of Geography, Plannng and Envronmental Management, The Unversty of Queensland, Brsbane, QLD, Australa. He was a Post-Doctoral Research Fellow wth the Unversty of Iceland. He has been a Post-Doctoral Research Fellow wth the Techncal Unversty of Munch, Munch, Germany, and Hedelberg Unversty, Hedelberg, Germany, snce He has also been a Researcher wth the Remote Sensng Technology Insttute (IMF), German Aerospace Center (DLR), Wesslng, Germany, snce Hs research nterests nclude remote sensng and mage analyss, wth a specal focus on spectral and spatal technques for hyperspectral mage classfcaton, multsensor data fuson, machne learnng, and deep learnng. Dr. Ghams receved the prestgous Alexander von Humboldt Fellowshp n In the 2010C2011 academc year, he receved the Best Researcher Award for M.Sc. students n the K. N. Toos Unversty of Technology. In 2013, he presented at the IEEE Internatonal Geoscence and Remote Sensng Symposum, Melbourne, VIC, Australa, and receved the IEEE Mko Takag Prze for wnnng the conference Student Paper Competton aganst almost 70 people. In 2016, he was selected as a talented nternatonal researcher by the Irans Natonal Eltes Foundaton. In 2017, he won the Data Fuson Contest 2017 organzed by the Image Analyss and Data Fuson Techncal Commttee of the IEEE Geoscence and Remote Sensng Socety. Hs model was the most accurate among over 800 submssons. Jon Atl Benedktsson (S 84-M 90-SM 99-F 04) receved the Cand.Sc. degree n electrcal engneerng from the Unversty of Iceland, Reykjavk, Iceland, n 1984 and the M.S.E.E. and Ph.D. degrees n electrcal engneerng from Purdue Unversty, West Lafayette, IN, USA, n 1987 and 1990, respectvely. From 2009 to 2015, he was the Pro Rector of Scence and Academc Affars and a Professor of electrcal and computer engneerng wth the Unversty of Iceland. On July 1, 2015, he became the Rector of the Unversty of Iceland. He has publshed extensvely n hs felds of nterest. Hs research nterests nclude remote sensng, mage analyss, pattern recognton, bomedcal analyss of sgnals, and sgnal processng. Dr. Benedktsson s a member of the Assocaton of Chartered Engneers at Iceland (VFI), the Socetas Scnetarum Islandca, and the Tau Beta P. He s a Fellow of the Internatonal Socety for Optcs and Photoncs (SPIE). He was a recpent of the Stevan J. Krstof Award from Purdue Unversty n 1991 as an Outstandng Graduate Student n Remote Sensng. He was also a recpent of the Icelandc Research Councl s Outstandng Young Researcher Award n 1997, the IEEE Thrd Mllennum Medal n 2000, the Yearly Research Award from the Engneerng Research Insttute at the Unversty of Iceland n 2006, the Outstandng Servce Award from the IEEE Geoscence and Remote Sensng Socety n 2007, and the IEEE/VFI Electrcal Engneer of the Year Award n He was a co-recpent of the Unversty of Iceland s Technology Innovaton Award n 2004, the 2012 IEEE Transactons on Geoscence and Remote Sensng Paper Award, the IEEE GRSS Hghest Impact Paper Award n 2013, and the Internatonal Journal of Image and Data Fuson Best Paper Award n He was the Presdent of the IEEE Geoscence and Remote Sensng Socety (GRSS) and has been on the GRSS Admnstratve Commttee snce He was the Edtor-n-Chef of the IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING (TGRS) from 2003 to 2008 and has been an Assocate Edtor of TGRS snce 1999, the IEEE GEOSCIENCE AND REMOTE SENSING LETTERS snce 2003, and the IEEE ACCESS snce He was the Charman of the Steerng Commttee of the IEEE JOURNAL OF SELECTED TOPICS IN APPLIED EARTH OBSERVATIONS AND REMOTE SENSING from 2007 to He serves on the Edtoral Board of the IEEE PROCEEDINGS and the Internatonal Edtoral Board of the Internatonal Journal of Image and Data Fuson. He s the Co-Founder of a bomedcal startup company Oxymap.

Hyperspectral Image Classification Based on Local Binary Patterns and PCANet

Hyperspectral Image Classification Based on Local Binary Patterns and PCANet Hyperspectral Image Classfcaton Based on Local Bnary Patterns and PCANet Huzhen Yang a, Feng Gao a, Junyu Dong a, Yang Yang b a Ocean Unversty of Chna, Department of Computer Scence and Technology b Ocean

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

An Image Fusion Approach Based on Segmentation Region

An Image Fusion Approach Based on Segmentation Region Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET

BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET 1 BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET TZU-CHENG CHUANG School of Electrcal and Computer Engneerng, Purdue Unversty, West Lafayette, Indana 47907 SAUL B. GELFAND School

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

Face Recognition University at Buffalo CSE666 Lecture Slides Resources: Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural

More information

Contextual Classification of Hyperspectral Remote Sensing Images Using SVM-PLR

Contextual Classification of Hyperspectral Remote Sensing Images Using SVM-PLR Australan Journal of Basc and Appled Scences, 5(8): 374-382, 2011 ISSN 1991-8178 Contextual Classfcaton of Hyperspectral Remote Sensng Images Usng SVM-PLR 1 Mahd hodadadzadeh, 2 Hassan Ghasseman 1,2 Faculty

More information

The Research of Support Vector Machine in Agricultural Data Classification

The Research of Support Vector Machine in Agricultural Data Classification The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Outline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1

Outline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1 4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

Fuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches

Fuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of

More information

Title: A Novel Protocol for Accuracy Assessment in Classification of Very High Resolution Images

Title: A Novel Protocol for Accuracy Assessment in Classification of Very High Resolution Images 2009 IEEE. Personal use of ths materal s permtted. Permsson from IEEE must be obtaned for all other uses, n any current or future meda, ncludng reprntng/republshng ths materal for advertsng or promotonal

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

Lecture 13: High-dimensional Images

Lecture 13: High-dimensional Images Lec : Hgh-dmensonal Images Grayscale Images Lecture : Hgh-dmensonal Images Math 90 Prof. Todd Wttman The Ctadel A grayscale mage s an nteger-valued D matrx. An 8-bt mage takes on values between 0 and 55.

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

A Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines

A Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines A Modfed Medan Flter for the Removal of Impulse Nose Based on the Support Vector Machnes H. GOMEZ-MORENO, S. MALDONADO-BASCON, F. LOPEZ-FERRERAS, M. UTRILLA- MANSO AND P. GIL-JIMENEZ Departamento de Teoría

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and

More information

The Study of Remote Sensing Image Classification Based on Support Vector Machine

The Study of Remote Sensing Image Classification Based on Support Vector Machine Sensors & Transducers 03 by IFSA http://www.sensorsportal.com The Study of Remote Sensng Image Classfcaton Based on Support Vector Machne, ZHANG Jan-Hua Key Research Insttute of Yellow Rver Cvlzaton and

More information

Collaboratively Regularized Nearest Points for Set Based Recognition

Collaboratively Regularized Nearest Points for Set Based Recognition Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge Detection in Noisy Images Using the Support Vector Machines Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona

More information

A Probabilistic Approach to Detect Urban Regions from Remotely Sensed Images Based on Combination of Local Features

A Probabilistic Approach to Detect Urban Regions from Remotely Sensed Images Based on Combination of Local Features A Probablstc Approach to Detect Urban Regons from Remotely Sensed Images Based on Combnaton of Local Features Berl Sırmaçek German Aerospace Center (DLR) Remote Sensng Technology Insttute Weßlng, 82234,

More information

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Network Intrusion Detection Based on PSO-SVM

Network Intrusion Detection Based on PSO-SVM TELKOMNIKA Indonesan Journal of Electrcal Engneerng Vol.1, No., February 014, pp. 150 ~ 1508 DOI: http://dx.do.org/10.11591/telkomnka.v1.386 150 Network Intruson Detecton Based on PSO-SVM Changsheng Xang*

More information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Classifying Acoustic Transient Signals Using Artificial Intelligence

Classifying Acoustic Transient Signals Using Artificial Intelligence Classfyng Acoustc Transent Sgnals Usng Artfcal Intellgence Steve Sutton, Unversty of North Carolna At Wlmngton (suttons@charter.net) Greg Huff, Unversty of North Carolna At Wlmngton (jgh7476@uncwl.edu)

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

Local Quaternary Patterns and Feature Local Quaternary Patterns

Local Quaternary Patterns and Feature Local Quaternary Patterns Local Quaternary Patterns and Feature Local Quaternary Patterns Jayu Gu and Chengjun Lu The Department of Computer Scence, New Jersey Insttute of Technology, Newark, NJ 0102, USA Abstract - Ths paper presents

More information

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent

More information

A Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures

A Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures A Novel Adaptve Descrptor Algorthm for Ternary Pattern Textures Fahuan Hu 1,2, Guopng Lu 1 *, Zengwen Dong 1 1.School of Mechancal & Electrcal Engneerng, Nanchang Unversty, Nanchang, 330031, Chna; 2. School

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Classification / Regression Support Vector Machines

Classification / Regression Support Vector Machines Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM

More information

Detection of an Object by using Principal Component Analysis

Detection of an Object by using Principal Component Analysis Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

Vol. 5, No. 3 March 2014 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved.

Vol. 5, No. 3 March 2014 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved. Journal of Emergng Trends n Computng and Informaton Scences 009-03 CIS Journal. All rghts reserved. http://www.csjournal.org Unhealthy Detecton n Lvestock Texture Images usng Subsampled Contourlet Transform

More information

Using Fuzzy Logic to Enhance the Large Size Remote Sensing Images

Using Fuzzy Logic to Enhance the Large Size Remote Sensing Images Internatonal Journal of Informaton and Electroncs Engneerng Vol. 5 No. 6 November 015 Usng Fuzzy Logc to Enhance the Large Sze Remote Sensng Images Trung Nguyen Tu Huy Ngo Hoang and Thoa Vu Van Abstract

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-Boost Mesh Filtering for 3-D Shape Enhancement Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

IMAGE FUSION TECHNIQUES

IMAGE FUSION TECHNIQUES Int. J. Chem. Sc.: 14(S3), 2016, 812-816 ISSN 0972-768X www.sadgurupublcatons.com IMAGE FUSION TECHNIQUES A Short Note P. SUBRAMANIAN *, M. SOWNDARIYA, S. SWATHI and SAINTA MONICA ECE Department, Aarupada

More information

Machine Learning 9. week

Machine Learning 9. week Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016) Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

A Computer Vision System for Automated Container Code Recognition

A Computer Vision System for Automated Container Code Recognition A Computer Vson System for Automated Contaner Code Recognton Hsn-Chen Chen, Chh-Ka Chen, Fu-Yu Hsu, Yu-San Ln, Yu-Te Wu, Yung-Nen Sun * Abstract Contaner code examnaton s an essental step n the contaner

More information

ALEXNET FEATURE EXTRACTION AND MULTI-KERNEL LEARNING FOR OBJECT- ORIENTED CLASSIFICATION

ALEXNET FEATURE EXTRACTION AND MULTI-KERNEL LEARNING FOR OBJECT- ORIENTED CLASSIFICATION ALEXNET FEATURE EXTRACTION AND MULTI-KERNEL LEARNING FOR OBJECT- ORIENTED CLASSIFICATION Lng Dng 1, Hongy L 2, *, Changmao Hu 2, We Zhang 2, Shumn Wang 1 1 Insttute of Earthquake Forecastng, Chna Earthquake

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

Machine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)

Machine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law) Machne Learnng Support Vector Machnes (contans materal adapted from talks by Constantn F. Alfers & Ioanns Tsamardnos, and Martn Law) Bryan Pardo, Machne Learnng: EECS 349 Fall 2014 Support Vector Machnes

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

A Background Subtraction for a Vision-based User Interface *

A Background Subtraction for a Vision-based User Interface * A Background Subtracton for a Vson-based User Interface * Dongpyo Hong and Woontack Woo KJIST U-VR Lab. {dhon wwoo}@kjst.ac.kr Abstract In ths paper, we propose a robust and effcent background subtracton

More information

Learning-based License Plate Detection on Edge Features

Learning-based License Plate Detection on Edge Features Learnng-based Lcense Plate Detecton on Edge Features Wng Teng Ho, Woo Hen Yap, Yong Haur Tay Computer Vson and Intellgent Systems (CVIS) Group Unverst Tunku Abdul Rahman, Malaysa wngteng_h@yahoo.com, woohen@yahoo.com,

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

Classification of Face Images Based on Gender using Dimensionality Reduction Techniques and SVM

Classification of Face Images Based on Gender using Dimensionality Reduction Techniques and SVM Classfcaton of Face Images Based on Gender usng Dmensonalty Reducton Technques and SVM Fahm Mannan 260 266 294 School of Computer Scence McGll Unversty Abstract Ths report presents gender classfcaton based

More information

UB at GeoCLEF Department of Geography Abstract

UB at GeoCLEF Department of Geography   Abstract UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department

More information

Performance Assessment and Fault Diagnosis for Hydraulic Pump Based on WPT and SOM

Performance Assessment and Fault Diagnosis for Hydraulic Pump Based on WPT and SOM Performance Assessment and Fault Dagnoss for Hydraulc Pump Based on WPT and SOM Be Jkun, Lu Chen and Wang Zl PERFORMANCE ASSESSMENT AND FAULT DIAGNOSIS FOR HYDRAULIC PUMP BASED ON WPT AND SOM. Be Jkun,

More information

Joint Example-based Depth Map Super-Resolution

Joint Example-based Depth Map Super-Resolution Jont Example-based Depth Map Super-Resoluton Yanje L 1, Tanfan Xue,3, Lfeng Sun 1, Janzhuang Lu,3,4 1 Informaton Scence and Technology Department, Tsnghua Unversty, Bejng, Chna Department of Informaton

More information

CLASSIFICATION OF ULTRASONIC SIGNALS

CLASSIFICATION OF ULTRASONIC SIGNALS The 8 th Internatonal Conference of the Slovenan Socety for Non-Destructve Testng»Applcaton of Contemporary Non-Destructve Testng n Engneerng«September -3, 5, Portorož, Slovena, pp. 7-33 CLASSIFICATION

More information

IMAGE FUSION BASED ON EXTENSIONS OF INDEPENDENT COMPONENT ANALYSIS

IMAGE FUSION BASED ON EXTENSIONS OF INDEPENDENT COMPONENT ANALYSIS IMAGE FUSION BASED ON EXTENSIONS OF INDEPENDENT COMPONENT ANALYSIS M Chen a, *, Yngchun Fu b, Deren L c, Qanqng Qn c a College of Educaton Technology, Captal Normal Unversty, Bejng 00037,Chna - (merc@hotmal.com)

More information

Recommended Items Rating Prediction based on RBF Neural Network Optimized by PSO Algorithm

Recommended Items Rating Prediction based on RBF Neural Network Optimized by PSO Algorithm Recommended Items Ratng Predcton based on RBF Neural Network Optmzed by PSO Algorthm Chengfang Tan, Cayn Wang, Yuln L and Xx Q Abstract In order to mtgate the data sparsty and cold-start problems of recommendaton

More information

A New Feature of Uniformity of Image Texture Directions Coinciding with the Human Eyes Perception 1

A New Feature of Uniformity of Image Texture Directions Coinciding with the Human Eyes Perception 1 A New Feature of Unformty of Image Texture Drectons Concdng wth the Human Eyes Percepton Xng-Jan He, De-Shuang Huang, Yue Zhang, Tat-Mng Lo 2, and Mchael R. Lyu 3 Intellgent Computng Lab, Insttute of Intellgent

More information

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research

More information

An Evaluation of Divide-and-Combine Strategies for Image Categorization by Multi-Class Support Vector Machines

An Evaluation of Divide-and-Combine Strategies for Image Categorization by Multi-Class Support Vector Machines An Evaluaton of Dvde-and-Combne Strateges for Image Categorzaton by Mult-Class Support Vector Machnes C. Demrkesen¹ and H. Cherf¹, ² 1: Insttue of Scence and Engneerng 2: Faculté des Scences Mrande Galatasaray

More information

Human Face Recognition Using Generalized. Kernel Fisher Discriminant

Human Face Recognition Using Generalized. Kernel Fisher Discriminant Human Face Recognton Usng Generalzed Kernel Fsher Dscrmnant ng-yu Sun,2 De-Shuang Huang Ln Guo. Insttute of Intellgent Machnes, Chnese Academy of Scences, P.O.ox 30, Hefe, Anhu, Chna. 2. Department of

More information

BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION

BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION SHI-LIANG SUN, HONG-LEI SHI Department of Computer Scence and Technology, East Chna Normal Unversty 500 Dongchuan Road, Shangha 200241, P. R. Chna E-MAIL: slsun@cs.ecnu.edu.cn,

More information

Suppression for Luminance Difference of Stereo Image-Pair Based on Improved Histogram Equalization

Suppression for Luminance Difference of Stereo Image-Pair Based on Improved Histogram Equalization Suppresson for Lumnance Dfference of Stereo Image-Par Based on Improved Hstogram Equalzaton Zhao Llng,, Zheng Yuhu 3, Sun Quansen, Xa Deshen School of Computer Scence and Technology, NJUST, Nanjng, Chna.School

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

REMOTE SENSING REQUIREMENTS DEVELOPMENT: A SIMULATION-BASED APPROACH

REMOTE SENSING REQUIREMENTS DEVELOPMENT: A SIMULATION-BASED APPROACH REMOTE SENSING REQUIREMENTS DEVEOPMENT: A SIMUATION-BASED APPROAC V. Zanon a, B. Davs a, R. Ryan b, G. Gasser c, S. Blonsk b a Earth Scence Applcatons Drectorate, Natonal Aeronautcs and Space Admnstraton,

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

Recognition of Handwritten Numerals Using a Combined Classifier with Hybrid Features

Recognition of Handwritten Numerals Using a Combined Classifier with Hybrid Features Recognton of Handwrtten Numerals Usng a Combned Classfer wth Hybrd Features Kyoung Mn Km 1,4, Joong Jo Park 2, Young G Song 3, In Cheol Km 1, and Chng Y. Suen 1 1 Centre for Pattern Recognton and Machne

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

COMPLEX WAVELET TRANSFORM-BASED COLOR INDEXING FOR CONTENT-BASED IMAGE RETRIEVAL

COMPLEX WAVELET TRANSFORM-BASED COLOR INDEXING FOR CONTENT-BASED IMAGE RETRIEVAL COMPLEX WAVELET TRANSFORM-BASED COLOR INDEXING FOR CONTENT-BASED IMAGE RETRIEVAL Nader Safavan and Shohreh Kasae Department of Computer Engneerng Sharf Unversty of Technology Tehran, Iran skasae@sharf.edu

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty

More information

Fast Feature Value Searching for Face Detection

Fast Feature Value Searching for Face Detection Vol., No. 2 Computer and Informaton Scence Fast Feature Value Searchng for Face Detecton Yunyang Yan Department of Computer Engneerng Huayn Insttute of Technology Hua an 22300, Chna E-mal: areyyyke@63.com

More information

Face Recognition Based on SVM and 2DPCA

Face Recognition Based on SVM and 2DPCA Vol. 4, o. 3, September, 2011 Face Recognton Based on SVM and 2DPCA Tha Hoang Le, Len Bu Faculty of Informaton Technology, HCMC Unversty of Scence Faculty of Informaton Scences and Engneerng, Unversty

More information

A Gradient Difference based Technique for Video Text Detection

A Gradient Difference based Technique for Video Text Detection A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng, Natonal Unversty of Sngapore {shva, phanquyt, tancl }@comp.nus.edu.sg

More information

PCA Based Gait Segmentation

PCA Based Gait Segmentation Honggu L, Cupng Sh & Xngguo L PCA Based Gat Segmentaton PCA Based Gat Segmentaton Honggu L, Cupng Sh, and Xngguo L 2 Electronc Department, Physcs College, Yangzhou Unversty, 225002 Yangzhou, Chna 2 Department

More information

SVM-based Learning for Multiple Model Estimation

SVM-based Learning for Multiple Model Estimation SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:

More information

MULTISPECTRAL REMOTE SENSING IMAGE CLASSIFICATION WITH MULTIPLE FEATURES

MULTISPECTRAL REMOTE SENSING IMAGE CLASSIFICATION WITH MULTIPLE FEATURES MULISPECRAL REMOE SESIG IMAGE CLASSIFICAIO WIH MULIPLE FEAURES QIA YI, PIG GUO, Image Processng and Pattern Recognton Laboratory, Bejng ormal Unversty, Bejng 00875, Chna School of Computer Scence and echnology,

More information

AN AUTO-ADAPTIVE INFORMATION PRESERVATION FUSION METHOD FOR SAR AND MULTISPECRAL IMAGES

AN AUTO-ADAPTIVE INFORMATION PRESERVATION FUSION METHOD FOR SAR AND MULTISPECRAL IMAGES AN AUTO-ADAPTIVE INFORMATION PRESERVATION FUSION METHOD FOR SAR AND MULTISPECRAL IMAGES H. Sun a, B. Pan b, Y. Chen a, *, J. L a, L. Deng a a College of Resources Scence & Technology, Beng Normal Unversty

More information

A Gradient Difference based Technique for Video Text Detection

A Gradient Difference based Technique for Video Text Detection 2009 10th Internatonal Conference on Document Analyss and Recognton A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng,

More information

Robust visual tracking based on Informative random fern

Robust visual tracking based on Informative random fern 5th Internatonal Conference on Computer Scences and Automaton Engneerng (ICCSAE 205) Robust vsual trackng based on Informatve random fern Hao Dong, a, Ru Wang, b School of Instrumentaton Scence and Opto-electroncs

More information

Lecture 4: Principal components

Lecture 4: Principal components /3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness

More information

Kernel Collaborative Representation Classification Based on Adaptive Dictionary Learning

Kernel Collaborative Representation Classification Based on Adaptive Dictionary Learning Internatonal Journal of Intellgent Informaton Systems 2018; 7(2): 15-22 http://www.scencepublshnggroup.com/j/js do: 10.11648/j.js.20180702.11 ISSN: 2328-7675 (Prnt); ISSN: 2328-7683 (Onlne) Kernel Collaboratve

More information

USING LINEAR REGRESSION FOR THE AUTOMATION OF SUPERVISED CLASSIFICATION IN MULTITEMPORAL IMAGES

USING LINEAR REGRESSION FOR THE AUTOMATION OF SUPERVISED CLASSIFICATION IN MULTITEMPORAL IMAGES USING LINEAR REGRESSION FOR THE AUTOMATION OF SUPERVISED CLASSIFICATION IN MULTITEMPORAL IMAGES 1 Fetosa, R.Q., 2 Merelles, M.S.P., 3 Blos, P. A. 1,3 Dept. of Electrcal Engneerng ; Catholc Unversty of

More information

Learning a Class-Specific Dictionary for Facial Expression Recognition

Learning a Class-Specific Dictionary for Facial Expression Recognition BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 4 Sofa 016 Prnt ISSN: 1311-970; Onlne ISSN: 1314-4081 DOI: 10.1515/cat-016-0067 Learnng a Class-Specfc Dctonary for

More information

Comparison Study of Textural Descriptors for Training Neural Network Classifiers

Comparison Study of Textural Descriptors for Training Neural Network Classifiers Comparson Study of Textural Descrptors for Tranng Neural Network Classfers G.D. MAGOULAS (1) S.A. KARKANIS (1) D.A. KARRAS () and M.N. VRAHATIS (3) (1) Department of Informatcs Unversty of Athens GR-157.84

More information