Video Copy Detection Based on Fusion of Spatio-temporal Features

Size: px
Start display at page:

Download "Video Copy Detection Based on Fusion of Spatio-temporal Features"

Transcription

1 Vdeo Copy Detecton Based on Fuson of Spato-temporal Features BAO We, JI Lxn, GAO Shln, LI Xng, Lu Lxong Natonal Dgtal swtchng System Engneerng & Technologcal R&D Center Zhengzhou, Chna Abstract A vdeo copy detecton method based on fuson of spato-temporal features s proposed n ths paper. Frstly, trajectores are bult and lens boundares are detected by SURF features analyzng, then normalzed hstogram s used to descrbe spato-temporal behavor of trajectores, the bag of vsual words s constructed by trajectores behavor clusterng, word frequency vectors and SURF features wth behavor labels are extracted to express spato-temporal content of lens, fnally, duplcates are detected effcently based on gradematch. The expermental results show the performance of ths method s mproved greatly compared wth other smlar methods. Keywords-Vdeo copy detecton; Speeded-up robust feature; Spato-temporal behavor of trajectores; Bag of vsual words; Grade-match. I. INTRODUCTION Wth the development of multmeda technology and the popularty of broadband servces, many webstes allow users to upload and share vdeo. Users can create vdeo through moble phone and dgtal camera, or drectly download webste vdeo to edt and then upload t to share. There are a large number of copy vdeos on the webstes, whch nfrnge the copyrght of author serously. In order to protect ntellectual property rghts, scholars propose content-based vdeo copy detecton technology, abbrevated as vdeo copy detecton. Vdeo copy detecton has been wdely used n areas such as copyrght protecton, busness ntellgence, ad trackng and content regulaton [1]. The valdty of vdeo copy detecton algorthm s manly dependent on the robustness and dstngushablty of the feature. Most vdeo copy detecton algorthms based on global feature extract low-level feature from the vdeo mage to represent the vdeo, but these algorthms are senstve to varous copy technques, so the detecton result s not satsfactory. Local feature descrbes the structure and texture nformaton of neghborhood of the nterest pont, havng a good robustness generally to brghtness, vewng angle, geometry and affne transformatons. Local feature s wdely used n vdeo copy detecton n recent years, and has a good detecton performance. However, wth the mprovement of vdeo resoluton and the explosve growth of the amount of vdeo, the number of local features extracted from large vdeo database s ncreasngly large. And a mass of nterframe redundances, a huge amount of computaton for smlarty measure and memory overhead become the man problems that lmt ts applcaton. In addton, the majorty of vdeo copy detecton algorthms based on local feature always use the frame-match. These algorthms do not utlze the tme doman nformaton of vdeo. Two rrelevant local features may match, whch results n false detecton. For the above ssues, Law-To [2] proposes a vdeo copy detecton algorthm on the trajectory of feature ponts. Frst, t extracts feature ponts from each frame of vdeo and bulds the trajectory by matchng feature ponts. Second, cluster spato-temporal behavor of trajectores and assgn labels havng semantc nformaton. Fnally, create an ndex for feature ponts, whch not only reduces the probablty of msmatch, but also mproves the effcency of match. By the experment, they proved ts superor detecton performance [3]. Basng on ths, many scholars propose the mproved algorthm. These mproved algorthms can be summed up nto two categores: one s that Sh Chen [4] etc. use U- SURF algorthm to extract feature ponts, match feature ponts to buld trajectores, and descrbe spato-temporal behavor of trajectores by space coordnates and tme coordnates of the feature ponts. Trajectores are dvded nto four categores, ncludng statonary, horzontal movement, vertcal movement and complex movement. Fnally they use local senstve hash (LSH) to create ndex to accelerate the match process. The other s that Guo Junbo [5], Wu Xao [6] use Harrs combned wth KLT algorthm to rapdly extract trajectores. The vdeo s dvded nto sublenses. They quantfy relatve dsplacement of adjacent feature ponts on one trajectory, descrbe the spato-temporal behavor of trajectores by normalzed hstogram or Markov model, and cluster trajectores to buld a bag of vsual words. A word frequency vector represents a sub-lens for fast vdeo copy detecton. These two mproved methods both have some flaws, the former drawback s the huge amount of calculaton of feature extracton and matchng, whch cause tme-consumng serously; the shortcomngs of the latter s the feature contans only tme-doman nformaton but lacks dstngushablty and robustness, and detecton result s not satsfactory. Amng at the drawbacks of the above algorthms, fusng the advantages of the above algorthms, we propose a new vdeo copy detecton method. Frst of all, the SURF features are extracted from each frame, then we buld the trajectores and splt lens by analyzng SURF features, then use statstcal normalzed hstograms to descrbe the spatotemporal behavor of trajectores. Second, cluster trajectores behavor to buld a bag of vsual words, calculate word frequency vector descrbng lens, and fnally use gradematch strategy of word frequency vector and SURF features wth dynamc behavor label for quck match. The expermental result on MUSCLE-VCD-2007 database [7] 0255

2 shows the method not only mantan good detecton effect but also greatly mprove the detecton speed, more sutable for large and complex databases vdeo copy detecton. II. OVERVIEW OF THE PROPOSED ALGORITHM PROCESSES The whole algorthm s dvded nto offlne and onlne part, as s shown n Fg. 1. The processng steps of Offlne part are as follows: We frstly extract the SURF features of each frame of vdeo, buld trajectory and splt lens by analyzng the SURF features; Then, quantfy and encode the relatve dsplacement of adjacent ponts along the trajectory, statstcally generate normalzed hstogram to descrbe spatotemporal behavor of trajectores; Cluster the normalzed hstograms of spatotemporal behavor of trajectores for all vdeo, then we regard cluster center as word to buld a bag of vsual words; The spato-temporal behavor of trajectores along the lens are takng as a word, and the bag of vsual words s used for expressng tme doman nformaton of each lens as a word frequency vector; Word frequency vector and SURF features sets wth the label of dynamc behavor are extracted from each lens of the vdeos n the vdeo lbrary. All these are regarded as the reference vdeo template. Fgure 1. Algorthm flowchart. Onlne process conssts of feature extracton and gradematch two phases. In the feature extracton phase, the bag of vsual words generated n offlne module are used to extracted word frequency vector for each lens, and characterze each SURF feature to form a feature set wth the label of dynamc behavors. In the grade-match phase, matchng s conducted between lens word frequency vectors of the query vdeo and vectors of each reference vdeo to dentfy the most smlar lens; then SURF features wth the label of dynamc behavor are used for exact-match to determne detecton results. III. FEATURE EXTRACTION Feature extracton ncludes buldng trajectory and lens segmentaton, spato-temporal behavor of trajectores descrpton, spato-temporal feature extracton three steps. The purpose of feature extracton s to extract lens word frequency vector and SURF feature set wth label of dynamc behavor to descrbe each lens spato-temporal content. A. buldng trajectory and lens segmentaton Standard SURF algorthm has been selected to extract local features n ths paper. SURF algorthm was put forward by Bay etc. [8] n 2006, wth a hgher detecton speed, characterzng flexbly, more robust. In 2007, Bauer[9], Luo[10], respectvely made an expermental comparson between SURF algorthm and other manstream algorthm. The results show SURF features good robustness to the common vdeo copy transformaton, and the speed s sgnfcantly better than other algorthms. Vdeo s a sequence of frames. Per second vdeo generally contans 25 to 30 frames. Each frame wthn one lens contans smlar content. If we smply rollup SURF features of each frame n a vdeo, there are a lot of redundancy and huge amount of data n the feature set. It s dffcult to measure ther smlarty. After extracted SURF features from each frame of vdeo, ths paper use feature matchng method to buld trajectory and splt lens. Thus the nter-frame redundancy of SURF features wll be elmnated and t wll also remove sngular pont. The smple and stable SURF feature set wll be ganed to represent each lens. Sngular pont s an solated feature ponts that do not match 0256

3 other SURF features nsde the lens. The trajectory buldng and the lens segmentaton processes are as follows: 1) In ths step, SURF features of each vdeo frame are extracted and then perform the followng steps to the end. 2) Sequentally match the current frame SURF feature sets (number of features as m) wth a set of the trajectores and the features do not nclude trajectores of precedng 15 frames : When matchng wth one trajectory n the trajectory sets, the feature s added to the trajectory. The trajectory parameters are updated, and the features are removed from the feature sets of current frame. Record the updated number of trajectores as n 1 ; When a feature matches wth a feature n the precedng adjacent 15 frame sets, a new trajectory s bult. Then record the number of the new trajectores as n 3, the total number of the trajectores s n ; 3) If ( n + n ) n< ϕ&&( n + n ) m< φ, the lens converson occurs, then perform step 4), otherwse go to step 2). ϕ and φ should be set accordng to the expermental result, n ths paper we choose 0.2; 4) Calculate the mean of each trajectory SURF feature as a descrpton of man spatal content of the lens. Record the spatal coordnate of each pont on the trajectory as the descrpton of the temporal domans dynamc behavor. Then splt lens and repeat step 2) and step 3) n the new lens. Through the above processes, the vdeo s dvded nto a group of lenses. Each lens s descrbed wth a SURF feature set and a trajectory set. The SURF feature set s the descrpton of the steady content of the vdeo. The spatal coordnate of each pont along the trajectory s the descrpton of the target pont s dynamc behavor n subsequent frames. Two together can complete show the vdeo content. B. The spato-temporal behavor of trajectores descrpton Usng space coordnates to descrbe the spato-temporal behavor of trajectores exsts two problems: one s that t s senstve to some copy transformatons, such as pcture-npcture, geometry transformaton, local varatons, droppng frames and other transformatons n the tme doman; the other s that the trajectory length s not unform, t s dffcult to measure the smlarty. In ths paper, we quantfy and encode the relatve dsplacement of adjacent ponts along the trajectory and then, statstcally generate a normalzed hstogram to descrbe the spato-temporal behavor of trajectores. The prncple s shown n Fg. 2. The spatotemporal behavor of trajectores are dvded nto two states, statonary and movement. Statonary means relatve dsplacement s less than a certan threshold. Movement means relatve dsplacement s greater than the threshold. To ncrease the dstngushablty, the relatve dsplacement s dvded nto three lengths and eght drectons. Coupled wth statonary, there are a total of 25 states, correspondng wth 25 code. The quantfcaton of the relatve dsplacement should be set accordng to the vdeo resoluton and frame rate. P 0 P 1 P 2 P P 5 6 P P 3 4 P 0 P 1 P 1 P 2 Fgure 2. Spato-temporal behavor of trajectores descrpton dagram. In order to enhance the robustness of spato-temporal behavor feature and the stablty of the trajectory, we remove the trajectory whose length s less than a certan threshold and normalze the codng hstogram. The ultmate spato-temporal behavor of trajectores are represented as 25-dmensonal feature vector: T = { t,, t,, t }. (1) 0 24 Where t = m M ndcates the frequency of code, M s the length of the trajectory, and m s the codng s occurrences along the trajectory. Descrpton of the Normalzed hstogram has good robustness, and can effectvely reduce the mpact of the above transformatons and mprove detecton accuracy. E.g. due to the effect of tme doman transform, f the trajectory whose length s M drops x frames and adds y frames, then the effect of dynamc behavor s x + y. But the effect on the normalzed hstogram s ( x + y+ z)/ M. When z << M, It means the effect to be reduced Mx n general case. C. The vdeo spato-temporal features extracton Copy vdeo and source vdeo may vary consderably on vsual content, but the semantc s the same. To extract rcher semantc nformaton, we frst cluster the spato-temporal behavor of trajectores and buld a bag of vsual words based on clusterng results. Then each lens s regarded as an artcle takng the spato-temporal behavor of trajectores as words. Calculate Frequency vector usng (3) to represent lens. In order to elmnate the msmatch, accordng to the clusterng results, we gve each SURF feature dynamc behavor label, and then store the sorted SURF features wth the dynamc behavor label for quckly matchng. T1 = { t1,, t } 25 T = { t,, t } ( T1; SURF mean 1) ( T2; SURF mean 2) V = {, t, t } 1 K + SURF mean1 SURFmean2 + Label + Label Fgure 3. Schematc dagram for lens word frequency vector and SURF feature ndex buldng. 0257

4 Good clusterng results can buld a more approprate bag of vsual words, and get lens frequency vector and dynamc behavor label easer to dstngush. Compared wth K-Means clusterng algorthm, AP [11] cluster algorthm s more sutable for processng the large-scale database cluster problem, and can get better clusterng results n shorter tme [12]. Ths paper uses AP cluster algorthm mproved by Wang kajun etc. [12] to cluster spato-temporal behavor of trajectores. The cluster algorthm can specfy the number of clusters. We regard cluster center as vsual keyword, each SURF feature n one cluster s marked by t and then buld a bag of vsual words based on codes from vsual keywords. As s shown n Fg. 3, take spato-temporal behavor of each trajectory along the lens as the words, each lens s represented by a 25dmensonal word frequency vector usng the bag of vsual words: V = { t,, t,, t }. (2) 1 d K n N d t = log. (3) n n Where n d s the occurrence of spato-temporal behavor feature of trajectores along the lens d, and n d s the number of the trajectores along the lens d, n represents the number of the lens whch contans spato-temporal behavor feature of trajectores, whle N represents the total number of the lens. IV. GRADE-MATCH In the former secton, the vdeo s dvded nto a set of lenses. The SURF feature set wth dynamc behavor labels and word frequency vector are used to represent each lens. The SURF feature set s a descrpton of the lens spatal nformaton and huge; word frequency vector s an overvew representaton of the lens tme doman nformaton. The lens s one of the contnuous shootng of the camera frame sequence and the vdeo s smallest structural unt. When the query vdeo contans a reference vdeo lens, t s confrmed that the query vdeo s a copy of the reference vdeo. To smplfy the match process and mprove the match effcency, ths paper uses a grade-match strategy shown n Fg. 4. Frst, the lens word frequency vector match: If t can determne that a query vdeo lens s a copy of one reference vdeo, then output the result; If unsure, dentfy the most smlar lens, then perform the SURF feature matchng, two weghted smlarty determne the fnal nspecton results. S S2 S1< α S S S S < β 2 1 Fgure 4. Grade-match flowchart. The query vdeo takes lens as unt, matches sequentally. In ths paper, the cosne dstance measures the smlarty of the word frequency vector along the lens. Thus obtan the N lenses gettng the hghest smlarty score, the score n descendng order are ( D ; S ),( D ; S ),,( D ; S ). Where n N D represents a lens of the reference vdeo lbrary, and S represents the smlarty. If S 2 S 1 s less than a certan threshold, t s consdered that the query vdeo s a copy of the vdeo whch contans lens D. Otherwse, n ths N lens 1 range, use the followng method to measure the smlarty of the SURF feature sets: Assume that the two SURF features sets are respectvely A and B, and the number of ther features s respectvely KeyNum and KeyNum. We use A B the Eucldean dstance as the measure, the number of matchng features s KeyMatch. Accordng to Equaton (4), AB calculate the smlarty of SURF features sets, the results are respectvely ( D ; S ),( D ; S ),,( D ; S ). We calculate the n N fnal smlarty wth the weghted (5), and the results n descendng order are S, S,..., S. If N s less than a 1 2 N certan threshold value, t s consdered that the query vdeo s a copy of the vdeo whch contans the most smlar lens. Otherwse, the query vdeo s not a reference to a copy of the vdeos n the vdeo lbrary. Accordng to the expermental results, the N s 30. KeyMatchAB S = 100%. (4) mn( KeyNum, KeyNum ) A S γ S η S B = +. (5) Assumng that the reference vdeo lbrary contans x lenses, and each lens contans y trajectores n average. Query vdeo contans x lens and y trajectores per lens. Thus the calculaton amount of grade-match strategy s: ( σ σ K) K 64 x x + y y N. (6) 0258

5 If usng the feature pont matchng frstly, and then match trajectory to confrm, the calculaton amount s: x y ( x y σ K + σ N). (7) Where N s the number of the canddate trajectores. K s the number of clusters of the spato-temporal behavor of trajectores. σ s the unt computaton amount calculatng 64 smlarty of 64-dmensonal SURF features. σ 25 s the unt calculaton amount of smlarty of 25-dmensonal spatotemporal behavor of trajectores. σ K s the unt calculaton amount of the smlarty of K -dmensonal word frequency vector. We can fnd the grade-match can effectvely reduce the amount of calculaton. V. EXPERIMENTAL RESULTS AND ANALYSIS A. Expermental set Our experment was conducted on the Intel dual-core 2.9GHz CPU, 2GB RAM computer, Matlab and C language mxed programmng. Reference vdeo set s MUSCLE-VCD database [7].The vdeo set contans 101 reference vdeos, about 100 hours. Nonreference vdeos are downloaded from open-vdeo webste. The query vdeo s made wth TRECVID [1] offcal program. There are total 300 query vdeos, about 12 hours. The query vdeos consst of copy vdeos of the 10 transformaton types. Vdeo format s MPEG-1. B. Evaluaton standard Two evaluaton crtera of TRECVID 2011[1] vdeo copy detecton competton are used to measure the performance of the algorthm: 1) Normalzed detecton cost rate(ndcr): NDCR = P + β R. (8) mss FA mss targ et FA β = C ( C R ). (9) Where P s the undetected rate, R mss FA s the false detecton rate, β s a weghtng coeffcent, C = C = 1 are the cost of false and mssed detectons, FA mss R = / h. The smaller NDCR s, the smaller the targ et cost of vdeo copy detecton algorthm, the better the performance. 2) The average detecton tme T mean : T = T N. (10) mean full quers Where T s the tme of the whole process for all vdeo full from decodng to outputtng a detecton result, N quers represents the number of the query vdeos. The smaller T, the faster the algorthm detecton s. the mean C. Performance Analyss We extracted 31,473,425 trajectores from 58 hours reference vdeos, whch contan 33,804 lenses. In order to mprove the stablty of the trajectores, the short trajectores whose lengths are less than 3 have been removed. The remanng 29,461,003 trajectores are used for AP cluster to buld a bag of vsual words. 50 query vdeos have been selected randomly. Compare the detecton results of dfferent number of clusters, and determne the optmal number of clusters. Fg. 5 shows when K s 82, the detecton results are best. In order to verfy the effectveness of our algorthm, under the above expermental envronment, we made an expermental comparson between algorthm [2], [4], [6] and our algorthm n ths paper. The evaluaton crtera are NDCR and T. The results are shown n Fg. 6 and Table I. mean We can see that the detecton of our algorthm s better than the algorthm proposed n [6] and [2]. The result s near wth the algorthm of [4]. However, the average detecton tme s much shorter than [2] and [4]. As s shown n Fg. 6, our algorthm s optmal to the followng transformatons: affne transformaton (T1), re-encodng (T4) and a slght drop qualty (T6). The reason s we used the standard SURF algorthm to extract the local features whch have good robustness to affne transformaton. Descrbng the spatotemporal behavor of trajectores by normalzed hstogram can effectvely reduce the nfluence of tme-doman varaton. Fg. 6 also shows our algorthm s not as good as the algorthm of [4] for some complex transformatons (T9), (T10). The reason s that word frequency vector cannot completely elmnate the mpact of complex transformatons, whch cause mss detecton. The results can be mproved by ncreasng the number N of canddate lens, but t wll reduce the effcency of detecton. To set the value of N, t should be based on the complexty of copy transformatons and the sze of vdeo lbrares. TABLE I. DETECTION RESULT OF THE ALGORITHMS Algorthm Average NDCR The average Average tme for Average tme for detecton tme (s) feature extracton (s) feature matchng (s) Algorthm of Ref [2] Algorthm of Ref [4] Algorthm of Ref [6] Our algorthm

6 NDCR K Fgure 5. Detecton performance under dfferent number of clusters. NDCR Algorthm of Ref [2] Algorthm of Ref [4] Algorthm of Ref [6] Our algorthm 0 T1 T2 T3 T4 T5 T6 T7 T8 T9 T10 Transformaton types Fgure 6. Comparson of NDCR Among the 10 knds of the varous algorthms for copes transformaton. As s shown n Table I, n the case of detecton results are smlar, our method s most effcent, especally on the matchng tme. Pont trajectory asynchronous match strategy s adopted by [2]. It only need extract local feature from keyframes(every 29 frames to extract one). The feature extracton speed of [2] s very fast, but t requre to match a large number of feature ponts wth large-scale (tens of mllons) vdeo database s trajectores. Although the ndex structure can speed up the match process, tme-consumng s stll serous. Reference [4] uses the current frame feature sets to match adjacent 15 frames feature sets to buld trajectores. It frstly matches the feature ponts, then confrm the result by trajectory coordnates. Thus feature extracton and matchng both consume a lot of tme. Reference [6] uses Harrs and KLT algorthm to quckly buld the trajectory. It dvded lens nto sub-lens basng on the dfference between current frame and the frst frame of the lens. But the number of sub-lens s large, and t needs ntegrate the matchng result of sub-lens to determne the fnal detecton results, and the matchng s tme-consumng. But [6] mproves the match effcency by ndex, and the detecton speed can satsfy realtme requrement. In ths paper, the SURF feature set and the trajectory set of current frame have been used to match wth adjacent 15 frames feature set that unjon n trajectores to quckly buld the trajectory. Dvde lens basng on the dfference of the current frame and the contents of the entre lens. When matchng, herarchcal polcy has been used to avod massve SURF features matchng, and ths effectvely reduces the match complexty, and mproves the detecton effcency. Whether the query vdeo s reference vdeo copy or not can be determned accordng to the test results of a sngle lens. Ths s why our algorthm s less tme-consumng when matchng. VI. USING THE TEMPLATE In ths paper, we propose the vdeo copy detecton method ntegrated spato-temporal features on prevous work. The method utlzes the fuson of spato-temporal features for analyss, and extracts word frequency vector and SURF feature set wth the label of dynamc behavor to descrbe each lens. It also smplfes the complexty of matchng by classfyng match strategy and mproves the detecton effcency. The expermental results show that the method dramatcally mproves the detecton whle ensurng detecton effect. The next step of the research focuses on how to mprove the speed of buldng trajectores and copy vdeo locatng accuracy. ACKNOWLEDGMENT Ths paper s orgnated from a project numbered as 2011AA010603, whch s supported by natonal 863 foundatons. REFERENCES [1] Gudelnes for the TRECVID 2011CD task Evaluaton[OL]. [2] Law-To J, Busson O, Gouet-Brunet V, et al. Robust Votng Algorthm based on Labels of Behavor for Vdeo Copy Detecton[C]. In ACM Multmeda, [3] Law-To J, L Chen, Alexs Joly, et al. Vdeo Copy Detecton: A Comparatve Study[C]. In Proc of ACM Internatonal Conference on Image and Vdeo Retreval, [4] Sh Chen, Jnqao Wang, Y Ouyang, et al. Mult-Level Trajectory Modelng for Vdeo Copy Detecton[C]. In Proc of IEEE Internatonal Conference on Acoustcs Speech and Sgnal Processng, 2010, [5] Guo Junbo, L Jntao, Zhang Yongdong, et al. Vdeo Copy Detecton Based on Trajectory Behavor Pattern [J]. Journal of computer-aded desgn & computer graphcs, 2010,22, [6] Wu Xao, L Jntao, Tang Sheng, Guo Junbo. Vdeo Copy Detecton Based on Spato-Temporal Trajectory Behavor Feature [J]. Journal of computer research and development, 2010, 47, [7] The orgn of the vdeo database s MUSCLE-VCD-2007[EB/OL]. [8] Bay H, Ess A, Gool L.,etc. SURF: Speeded Up Robust Features[J]. Computer Vson and Image Understandng, 110, [9] Bauer.J, Sünderhauf.N, Protzel.P. Comparng Several Implementatons of Two Recently Publshed Feature Detectors[C]. In Proc. of the Internatonal Conference on Intellgent and Autonomous Systems, Toulouse, France, [10] Luo Juan, Oubong Gwun. A Comparson of SIFT, PCA-SIFT and SURF[J]. Internatonal Journal of Image Processng,3, [11] Frey.J, Dueck.D. Clusterng by Passng Messages between Data Ponts[J]. Scence, 2007, 315, [12] Wang Kajun, Zheng Je. Fast Algorthm of Affnty Propagaton Clusterng under Gven Number of Clusters [J]. applcatons of the computer systems, 2010, 19,

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

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

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

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

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

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

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

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

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

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

A Clustering Algorithm for Key Frame Extraction Based on Density Peak

A Clustering Algorithm for Key Frame Extraction Based on Density Peak Journal of Computer and Communcatons, 2018, 6, 118-128 http://www.scrp.org/ournal/cc ISSN Onlne: 2327-5227 ISSN Prnt: 2327-5219 A Clusterng Algorthm for Key Frame Extracton Based on Densty Peak Hong Zhao

More information

Object-Based Techniques for Image Retrieval

Object-Based Techniques for Image Retrieval 54 Zhang, Gao, & Luo Chapter VII Object-Based Technques for Image Retreval Y. J. Zhang, Tsnghua Unversty, Chna Y. Y. Gao, Tsnghua Unversty, Chna Y. Luo, Tsnghua Unversty, Chna ABSTRACT To overcome the

More information

An Improved Image Segmentation Algorithm Based on the Otsu Method

An Improved Image Segmentation Algorithm Based on the Otsu Method 3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

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

Querying by sketch geographical databases. Yu Han 1, a *

Querying by sketch geographical databases. Yu Han 1, a * 4th Internatonal Conference on Sensors, Measurement and Intellgent Materals (ICSMIM 2015) Queryng by sketch geographcal databases Yu Han 1, a * 1 Department of Basc Courses, Shenyang Insttute of Artllery,

More information

An efficient method to build panoramic image mosaics

An efficient method to build panoramic image mosaics An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract

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

An Image Compression Algorithm based on Wavelet Transform and LZW

An Image Compression Algorithm based on Wavelet Transform and LZW An Image Compresson Algorthm based on Wavelet Transform and LZW Png Luo a, Janyong Yu b School of Chongqng Unversty of Posts and Telecommuncatons, Chongqng, 400065, Chna Abstract a cylpng@63.com, b y27769864@sna.cn

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

Research and Application of Fingerprint Recognition Based on MATLAB

Research and Application of Fingerprint Recognition Based on MATLAB Send Orders for Reprnts to reprnts@benthamscence.ae The Open Automaton and Control Systems Journal, 205, 7, 07-07 Open Access Research and Applcaton of Fngerprnt Recognton Based on MATLAB Nng Lu* Department

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

Robust Shot Boundary Detection from Video Using Dynamic Texture

Robust Shot Boundary Detection from Video Using Dynamic Texture Sensors & Transducers 204 by IFSA Publshng, S. L. http://www.sensorsportal.com Robust Shot Boundary Detecton from Vdeo Usng Dynamc Teture, 3 Peng Tale, 2 Zhang Wenjun School of Communcaton & Informaton

More information

A CALCULATION METHOD OF DEEP WEB ENTITIES RECOGNITION

A CALCULATION METHOD OF DEEP WEB ENTITIES RECOGNITION A CALCULATION METHOD OF DEEP WEB ENTITIES RECOGNITION 1 FENG YONG, DANG XIAO-WAN, 3 XU HONG-YAN School of Informaton, Laonng Unversty, Shenyang Laonng E-mal: 1 fyxuhy@163.com, dangxaowan@163.com, 3 xuhongyan_lndx@163.com

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

Query Clustering Using a Hybrid Query Similarity Measure

Query Clustering Using a Hybrid Query Similarity Measure Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan

More information

BIN XIA et al: AN IMPROVED K-MEANS ALGORITHM BASED ON CLOUD PLATFORM FOR DATA MINING

BIN XIA et al: AN IMPROVED K-MEANS ALGORITHM BASED ON CLOUD PLATFORM FOR DATA MINING An Improved K-means Algorthm based on Cloud Platform for Data Mnng Bn Xa *, Yan Lu 2. School of nformaton and management scence, Henan Agrcultural Unversty, Zhengzhou, Henan 450002, P.R. Chna 2. College

More information

A Shadow Detection Method for Remote Sensing Images Using Affinity Propagation Algorithm

A Shadow Detection Method for Remote Sensing Images Using Affinity Propagation Algorithm Proceedngs of the 009 IEEE Internatonal Conference on Systems, Man, and Cybernetcs San Antono, TX, USA - October 009 A Shadow Detecton Method for Remote Sensng Images Usng Affnty Propagaton Algorthm Huayng

More information

Hierarchical Image Retrieval by Multi-Feature Fusion

Hierarchical Image Retrieval by Multi-Feature Fusion Preprnts (www.preprnts.org) NOT PEER-REVIEWED Posted: 26 Aprl 207 do:0.20944/preprnts20704.074.v Artcle Herarchcal Image Retreval by Mult- Fuson Xaojun Lu, Jaojuan Wang,Yngq Hou, Me Yang, Q Wang* and Xangde

More information

Shape-adaptive DCT and Its Application in Region-based Image Coding

Shape-adaptive DCT and Its Application in Region-based Image Coding Internatonal Journal of Sgnal Processng, Image Processng and Pattern Recognton, pp.99-108 http://dx.do.org/10.14257/sp.2014.7.1.10 Shape-adaptve DCT and Its Applcaton n Regon-based Image Codng Yamn Zheng,

More information

Modular PCA Face Recognition Based on Weighted Average

Modular PCA Face Recognition Based on Weighted Average odern Appled Scence odular PCA Face Recognton Based on Weghted Average Chengmao Han (Correspondng author) Department of athematcs, Lny Normal Unversty Lny 76005, Chna E-mal: hanchengmao@163.com Abstract

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

Shape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram

Shape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram Shape Representaton Robust to the Sketchng Order Usng Dstance Map and Drecton Hstogram Department of Computer Scence Yonse Unversty Kwon Yun CONTENTS Revew Topc Proposed Method System Overvew Sketch Normalzaton

More information

Improved SIFT-Features Matching for Object Recognition

Improved SIFT-Features Matching for Object Recognition Improved SIFT-Features Matchng for Obect Recognton Fara Alhwarn, Chao Wang, Danela Rstć-Durrant, Axel Gräser Insttute of Automaton, Unversty of Bremen, FB / NW Otto-Hahn-Allee D-8359 Bremen Emals: {alhwarn,wang,rstc,ag}@at.un-bremen.de

More information

A Deflected Grid-based Algorithm for Clustering Analysis

A Deflected Grid-based Algorithm for Clustering Analysis A Deflected Grd-based Algorthm for Clusterng Analyss NANCY P. LIN, CHUNG-I CHANG, HAO-EN CHUEH, HUNG-JEN CHEN, WEI-HUA HAO Department of Computer Scence and Informaton Engneerng Tamkang Unversty 5 Yng-chuan

More information

CLUSTERING ALGORITHM OF VEHICLE MOTION TRAJECTORIES IN ENTRANCES AND EXITS OF FREEWAY. Zongyuan SUN1 Dongxue LI2

CLUSTERING ALGORITHM OF VEHICLE MOTION TRAJECTORIES IN ENTRANCES AND EXITS OF FREEWAY. Zongyuan SUN1 Dongxue LI2 5th Internatonal Conference on Cvl, Archtectural and Hydraulc Engneerng (ICCAHE 206) CLUSTERING ALGORITHM OF VEHICLE MOTION TRAJECTORIES IN ENTRANCES AND EXITS OF FREEWAY Zongyuan SUN Dongxue LI2 Tongj

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

Mining User Similarity Using Spatial-temporal Intersection

Mining User Similarity Using Spatial-temporal Intersection www.ijcsi.org 215 Mnng User Smlarty Usng Spatal-temporal Intersecton Ymn Wang 1, Rumn Hu 1, Wenhua Huang 1 and Jun Chen 1 1 Natonal Engneerng Research Center for Multmeda Software, School of Computer,

More information

An Effective Approach for Video Copy Detection and Identification of Misbehaving Users

An Effective Approach for Video Copy Detection and Identification of Misbehaving Users An Effectve Approach for Vdeo Copy Detecton and Identfcaton of Msbehavng Users S.Sujatha Dhanalakshm Srnvasan College of Engneerng and Technology Mamallapuram, Chenna, Tamlnadu, Inda Abstract Fast development

More information

Image Matching Algorithm based on Feature-point and DAISY Descriptor

Image Matching Algorithm based on Feature-point and DAISY Descriptor JOURNAL OF MULTIMEDIA, VOL. 9, NO. 6, JUNE 2014 829 Image Matchng Algorthm based on Feature-pont and DAISY Descrptor L L School of Busness, Schuan Agrcultural Unversty, Schuan Dujanyan 611830, Chna Abstract

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

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

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

THE PATH PLANNING ALGORITHM AND SIMULATION FOR MOBILE ROBOT

THE PATH PLANNING ALGORITHM AND SIMULATION FOR MOBILE ROBOT Journal of Theoretcal and Appled Informaton Technology 30 th Aprl 013. Vol. 50 No.3 005-013 JATIT & LLS. All rghts reserved. ISSN: 199-8645 www.jatt.org E-ISSN: 1817-3195 THE PATH PLANNING ALGORITHM AND

More information

Hybrid Non-Blind Color Image Watermarking

Hybrid Non-Blind Color Image Watermarking Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,

More information

Analysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD

Analysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD Analyss on the Workspace of Sx-degrees-of-freedom Industral Robot Based on AutoCAD Jn-quan L 1, Ru Zhang 1,a, Fang Cu 1, Q Guan 1 and Yang Zhang 1 1 School of Automaton, Bejng Unversty of Posts and Telecommuncatons,

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

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

Feature-Area Optimization: A Novel SAR Image Registration Method

Feature-Area Optimization: A Novel SAR Image Registration Method Feature-Area Optmzaton: A Novel SAR Image Regstraton Method Fuqang Lu, Fukun B, Lang Chen, Hao Sh and We Lu Abstract Ths letter proposes a synthetc aperture radar (SAR) mage regstraton method named Feature-Area

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

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

A Similarity Measure Method for Symbolization Time Series

A Similarity Measure Method for Symbolization Time Series Research Journal of Appled Scences, Engneerng and Technology 5(5): 1726-1730, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scentfc Organzaton, 2013 Submtted: July 27, 2012 Accepted: September 03, 2012

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

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)

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

Target Tracking Analysis Based on Corner Registration Zhengxi Kang 1, a, Hui Zhao 1, b, Yuanzhen Dang 1, c

Target Tracking Analysis Based on Corner Registration Zhengxi Kang 1, a, Hui Zhao 1, b, Yuanzhen Dang 1, c Advanced Materals Research Onlne: 03-09-8 ISSN: 66-8985, Vols. 760-76, pp 997-00 do:0.408/www.scentfc.net/amr.760-76.997 03 Trans Tech Publcatons, Swtzerland Target Trackng Analyss Based on Corner Regstraton

More information

Combination of Color and Local Patterns as a Feature Vector for CBIR

Combination of Color and Local Patterns as a Feature Vector for CBIR Internatonal Journal of Computer Applcatons (975 8887) Volume 99 No.1, August 214 Combnaton of Color and Local Patterns as a Feature Vector for CBIR L.Koteswara Rao Asst.Professor, Dept of ECE Faculty

More information

Efficient Video Coding with R-D Constrained Quadtree Segmentation

Efficient Video Coding with R-D Constrained Quadtree Segmentation Publshed on Pcture Codng Symposum 1999, March 1999 Effcent Vdeo Codng wth R-D Constraned Quadtree Segmentaton Cha-Wen Ln Computer and Communcaton Research Labs Industral Technology Research Insttute Hsnchu,

More information

1. Introduction. Abstract

1. Introduction. Abstract Image Retreval Usng a Herarchy of Clusters Danela Stan & Ishwar K. Seth Intellgent Informaton Engneerng Laboratory, Department of Computer Scence & Engneerng, Oaland Unversty, Rochester, Mchgan 48309-4478

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

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION 1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute

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

Content-Based Bird Retrieval using Shape context, Color moments and Bag of Features

Content-Based Bird Retrieval using Shape context, Color moments and Bag of Features www.ijcsi.org 101 Content-Based Brd Retreval usng Shape context, Color moments and Features Bahr abdelkhalak 1 and hamd zouak 2 1 Faculty of Scences, Unversty Chouab Doukkal, Equpe: Modélsaton mathématque

More information

Clustering Algorithm of Similarity Segmentation based on Point Sorting

Clustering Algorithm of Similarity Segmentation based on Point Sorting Internatonal onference on Logstcs Engneerng, Management and omputer Scence (LEMS 2015) lusterng Algorthm of Smlarty Segmentaton based on Pont Sortng Hanbng L, Yan Wang*, Lan Huang, Mngda L, Yng Sun, Hanyuan

More information

Learning-Based Top-N Selection Query Evaluation over Relational Databases

Learning-Based Top-N Selection Query Evaluation over Relational Databases Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **

More information

FPGA-based implementation of circular interpolation

FPGA-based implementation of circular interpolation Avalable onlne www.jocpr.com Journal of Chemcal and Pharmaceutcal Research, 04, 6(7):585-593 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 FPGA-based mplementaton of crcular nterpolaton Mngyu Gao,

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

Pictures at an Exhibition

Pictures at an Exhibition 1 Pctures at an Exhbton Stephane Kwan and Karen Zhu Department of Electrcal Engneerng Stanford Unversty, Stanford, CA 9405 Emal: {skwan1, kyzhu}@stanford.edu Abstract An mage processng algorthm s desgned

More information

Face Recognition using 3D Directional Corner Points

Face Recognition using 3D Directional Corner Points 2014 22nd Internatonal Conference on Pattern Recognton Face Recognton usng 3D Drectonal Corner Ponts Xun Yu, Yongsheng Gao School of Engneerng Grffth Unversty Nathan, QLD, Australa xun.yu@grffthun.edu.au,

More information

A Webpage Similarity Measure for Web Sessions Clustering Using Sequence Alignment

A Webpage Similarity Measure for Web Sessions Clustering Using Sequence Alignment A Webpage Smlarty Measure for Web Sessons Clusterng Usng Sequence Algnment Mozhgan Azmpour-Kv School of Engneerng and Scence Sharf Unversty of Technology, Internatonal Campus Ksh Island, Iran mogan_az@ksh.sharf.edu

More information

Maximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation

Maximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 5) Maxmum Varance Combned wth Adaptve Genetc Algorthm for Infrared Image Segmentaton Huxuan Fu College of Automaton Harbn

More information

Efficient Content Representation in MPEG Video Databases

Efficient Content Representation in MPEG Video Databases Effcent Content Representaton n MPEG Vdeo Databases Yanns S. Avrths, Nkolaos D. Doulams, Anastasos D. Doulams and Stefanos D. Kollas Department of Electrcal and Computer Engneerng Natonal Techncal Unversty

More information

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Positive Semi-definite Programming Localization in Wireless Sensor Networks Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer

More information

MOTION BLUR ESTIMATION AT CORNERS

MOTION BLUR ESTIMATION AT CORNERS Gacomo Boracch and Vncenzo Caglot Dpartmento d Elettronca e Informazone, Poltecnco d Mlano, Va Ponzo, 34/5-20133 MILANO boracch@elet.polm.t, caglot@elet.polm.t Keywords: Abstract: Pont Spread Functon Parameter

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

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

A NEW APPROACH FOR SUBWAY TUNNEL DEFORMATION MONITORING: HIGH-RESOLUTION TERRESTRIAL LASER SCANNING

A NEW APPROACH FOR SUBWAY TUNNEL DEFORMATION MONITORING: HIGH-RESOLUTION TERRESTRIAL LASER SCANNING A NEW APPROACH FOR SUBWAY TUNNEL DEFORMATION MONITORING: HIGH-RESOLUTION TERRESTRIAL LASER SCANNING L Jan a, Wan Youchuan a,, Gao Xanjun a a School of Remote Sensng and Informaton Engneerng, Wuhan Unversty,129

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

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010 Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.

More information

Image Alignment CSC 767

Image Alignment CSC 767 Image Algnment CSC 767 Image algnment Image from http://graphcs.cs.cmu.edu/courses/15-463/2010_fall/ Image algnment: Applcatons Panorama sttchng Image algnment: Applcatons Recognton of object nstances

More information

A new segmentation algorithm for medical volume image based on K-means clustering

A new segmentation algorithm for medical volume image based on K-means clustering Avalable onlne www.jocpr.com Journal of Chemcal and harmaceutcal Research, 2013, 5(12):113-117 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCRC5 A new segmentaton algorthm for medcal volume mage based

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

Sensor Selection with Grey Correlation Analysis for Remaining Useful Life Evaluation

Sensor Selection with Grey Correlation Analysis for Remaining Useful Life Evaluation Sensor Selecton wth Grey Correlaton Analyss for Remanng Useful Lfe valuaton Peng Yu, Xu Yong, Lu Datong, Peng Xyuan Automatc est Control Insttute, Harbn Insttute of echnology, Harbn, 5, Chna pengyu@ht.edu.cn

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Object Tracking Based on PISC Image and Template Matching

Object Tracking Based on PISC Image and Template Matching ect Trackng Based on PISC Image and Template Matchng Bud Sugand Electrcal Engneerng Department Batam State Polytechnc Batam Indonesa ud_sugand@polatam.ac.d Astract Ths paper proposed a method for oect

More information

Grading Image Retrieval Based on DCT and DWT Compressed Domains Using Low-Level Features

Grading Image Retrieval Based on DCT and DWT Compressed Domains Using Low-Level Features Journal of Communcatons Vol. 0 No. January 0 Gradng Image Retreval Based on DCT and DWT Compressed Domans Usng Low-Level Features Chengyou Wang Xnyue Zhang Rongyang Shan and Xao Zhou School of echancal

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

MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN

MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS by XUNYU PAN (Under the Drecton of Suchendra M. Bhandarkar) ABSTRACT In modern tmes, more and more

More information

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process

More information

Brushlet Features for Texture Image Retrieval

Brushlet Features for Texture Image Retrieval DICTA00: Dgtal Image Computng Technques and Applcatons, 1 January 00, Melbourne, Australa 1 Brushlet Features for Texture Image Retreval Chbao Chen and Kap Luk Chan Informaton System Research Lab, School

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to

More information

SCALABLE AND VISUALIZATION-ORIENTED CLUSTERING FOR EXPLORATORY SPATIAL ANALYSIS

SCALABLE AND VISUALIZATION-ORIENTED CLUSTERING FOR EXPLORATORY SPATIAL ANALYSIS SCALABLE AND VISUALIZATION-ORIENTED CLUSTERING FOR EXPLORATORY SPATIAL ANALYSIS J.H.Guan, F.B.Zhu, F.L.Ban a School of Computer, Spatal Informaton & Dgtal Engneerng Center, Wuhan Unversty, Wuhan, 430079,

More information

Video Content Representation using Optimal Extraction of Frames and Scenes

Video Content Representation using Optimal Extraction of Frames and Scenes Vdeo Content Representaton usng Optmal Etracton of rames and Scenes Nkolaos D. Doulam Anastasos D. Doulam Yanns S. Avrths and Stefanos D. ollas Natonal Techncal Unversty of Athens Department of Electrcal

More information

ELEC 377 Operating Systems. Week 6 Class 3

ELEC 377 Operating Systems. Week 6 Class 3 ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems

More information