Hybrid MPI-OpenMP Parallelization Of Image Reconstruction

Transcription

1 JOURNAL OF SOFTWARE, VOL. 8, NO. 3, MARCH Hybrid MPI-OpenMP Parallelization Of Iage Recontruction Jinliang Wan College of Coputer and Inforation Engineering, Henan Univerity of Econoic and Law Zhengzhou, China Eail: Yanhui Liu State Key Laboratory for Seiic Reduction/Control & Structural Safety (Cultivation), Guangzhou Univerity Guangzhou, China Eail: Abtract Perceptual coding hould take full advantage of the reult fro huan viual yte (HVS) tudie. In thi paper, we exploit an iage recontruction algorith, which can iply and reliably repreent iage uing regional hape and texture inforation and effectually eliinate perceptual redundancy. But real-tie application of the algorith i liited due to it inherent coplex and intenive coputation. Therefore, we ipleent iage recontruction with a hybrid eage paing interface (MPI) and OpenMP approach on the bai of a tandard MPI ipleentation. Experiental reult confir our iage recontruction algorith can get optial retoration reult. Copared with JPEG and JPEG000 copreion, thi algorith can not only get ore coding gain but reain ot inforation people care. Our hybrid MPI-OpenMP approach can ignificantly iprove tie perforance of iage recontruction algorith. Index Ter huan viual yte, iage recontruction, parallel proceing I. INTRODUCTION The aintrea of iage coding chee i baed on hybrid coding fraework integrated with three clae of traditional technologie. Tranfor coding, prediction coding and entropy coding are ued to reduce and reove patial redundancy, teporal redundancy and tatitic redundancy. But huan eye are the terinal receptor for iage, and thu there till i a lot of perceptual redundant inforation according to the characteritic of huan viual yte (HVS). However, it i difficult to achieve additional ignificant progre for copreion efficiency becaue of the liitation of pixel-baed iage repreentation [6]. Therefore, how to find a ore efficient iage repreentation ethod ha alway been coding cientit ardent puruit. The econd-generation iage coding technique were propoed by Kunt [], which can take advantage of the huan viual perceptual characteritic. In recent year, with the etablihent and developent of the wavelet tranfor theory [], fractal theory [3, 4] and viual iulation theory [5], Iage proceing ha been coniderable developent. And, actually any till iage contain aive texture like gra, brick, cloud, and, etc., which copoe the till background. Ndjiki- Nya [7] aued that the texture in an iage could be claified into two categorie: texture with uniportant ubjective detail and the reainder. Sun [8] utilized thi idea and conidered texture a uniportant part in ter of the inherent iperfection of the HVS. Change of texture detail will not affect the ubjective coprehenion toward the original texture. It indicate that thee viual feature can be utilized to eliinate perceptual redundancy. In recent year, there have eerged large quantitie of efficient and effective algorith of iage texture analyi and ynthei [9-3]. A non-paraetric ethod for texture ynthei wa propoed in []. The ethod can produce good yntheized reult for a wide range of texture by titching together all texture patche. In addition, the detection and extraction of linear tructure which uually refer to the contour ued to define the target hape or the boundarie ued to dearcate the region alo have been reearched far and wide [7-0]. Mot of the early hape decription technique ued binary iage. At preent, thee reearche have a wide range of application in the field of iage proceing and coputer viion. In thi tudy, we propoe an iage recontruction algorith and it hybrid MPI-OpenMP approach. Thi algorith can elect the allet region texture aple and obtain optial retoration iage. But with the iage ize increaing, iage recontruction will cot a large executing tie. To iprove it tie efficiency, we dicu the hybrid MPI-OpenMP approach in thi paper. The parallel prograing approach i ipleented on a dedicated cluter. The reainder of thi paper i organized a follow. In the next ection, the detail of the propoed iage recontruction algorith are preented. And Sect.3 give the detail of the hybrid MPI- OpenMP approach. The propoed iage recontruction doi:0.4304/jw

2 688 JOURNAL OF SOFTWARE, VOL. 8, NO. 3, MARCH 03 algorith and hybrid MPI-OpenMP approach are teted in Sect.4. Finally, thi paper i concluded in Sect.5. II. IMAGE RECONSTRUCTION ALGORITHM Diagra of iage recontruction algorith i hown in Fig.. The ipleenting procedure of the iage texture ubtitution algorith conit of three phae: ultiregion extraction, iage feature repreentation and ulti-region iage recontruction. purpoe, a contour tracing algorith [7] i applied to the input binary iage. The hape of thi coding region i drawn by the white cloed curve, a i hown in Fig. (b). Figure. Diagra of the iage recontruction algorith A. Multi-Region Extraction An iage i firt egented into any all region in ter of hoogeneou color and texture. The egentation ethod i the o-called JSEG algorith [4, 5]. Conidering that texture aple election i enitive to egentation reult, we erge connected all region if they are nearby in pace o that each iage can obtain bigger region [6]. And, nuber of region which each iage get ay be variable in order to obtain optial retoration reult. Through ulti-region extraction, hoogeneou pixel belong to the ae region. Each region ha a unique index and every pixel belonged to one region i aigned the ae region index. Region indexe of all pixel copoe of region index lit. The region index lit i a the ae ize a the original iage if the input one i graycale, and it i one third ize a the original color iage naturally. Each eleent of index lit correpond to the pixel of original iage. Specifically, the region index lit play an iportant role in the iage feature repreentation and the hybrid MPI-OpenMP parallel prograing approach. B. Iage Feature Repreentation Shape and texture are alient feature of the appearance of object in natural cene. The id-level region i iage repreenting and recontructing unit which contain hape and texture characteritic. Decribing approache of hape and texture feature will be dicued repectively. The ipleenting procedure of regional hape feature repreentation i decribed a the following tep: binarization proceing, contour tracking, down apling and piecewie iterative curve fitting. Fig. indicate the cheatic drawing of four tage above. In order to elaborate conveniently, we jut take into account one region. Firtly, the iage hould be binarized according to region index lit. Thi coding region correpond to the white area and other region correpond to the black area, a i depicted in Fig. (a). Secondly, an ordered equence of contour point approxiating the regional hape i extracted. For thi Figure. Scheatic drawing of regional hape feature repreentation Thirdly, a vector copoed of equally ditributed point along the regional contour i extracted fro the ordered equence of contour pixel. Contour point are extracted in uch a way that they will be approxiately equally ditributed along the regional contour curve, howed a Fig. (c). The regional contour i repreented by the ordered equence ( x, y ) of contour point, where denote the poition along the regional contour curve. Finally, the piecewie iterative curve fitting [8] cobined with top-down plit algorith and curve-fitting principle i ipleented to repreent region tructure feature. It ipleentation procedure i decribed a the following tep: Connecting the two farthet edge point A and B into a line egent L, and thu plit the cloed contour into two curve and BA, a i hown in Fig. (d). Calculate the ditance d of each edge point on curve to thi line egent L uing (), and deterine the edge point farthet fro the line egent L. Here, uppoe the coordinate of A and B are ( xa, ya) and ( xb, y B), o the forula for line egent L paing fro the two end point i hown a (): xy ( y) + yx ( x) + xy xy = 0 () A B A B A B B A The ditance d of edge point ( x, y ) to the line egent L i: r d = () Δ

3 JOURNAL OF SOFTWARE, VOL. 8, NO. 3, MARCH Where, denote the poition of any point along the curve, and r = x ( y y ) y ( x x ) + x y x y (3) A B A B A B B A Δ = A B (4) Thu, the axiu abolute error i: MAE d = ax (5) [ A, B] Clearly, point C with MAE i the farthet edge point fro the line egent L..If the axiu error of that point fro the line egent L i above a threhold, plit the curve into two curve egent at that point (i.e. new vertex point C ), one between A and C, the other between C and B. Repeat econd tep and third tep eparately for the above two ub-curve egent AC and CB to deterine ore and ore vertice until the error i aller than the plit threhold et in advance. Ipleent polynoial curve fitting on each ubcurve egent and the polynoial coefficient are deeed a region hape feature. Siply, we only take ub-curve egent AC a an exaple. The curve AC i repreented by the order equence ( x, y),( x, y),...,( xn, y n) of edge point, where n denote the nuber of eleent in thi order equence. A polynoial alway ay be expreed by the u of oe orthogonal polynoial. Suppoe the fitted polynoial can be expreed by (6): F ( x) = C P( x) i i i= = CP( x) + CP( x) + + CP( x) = P + Px+ P x + + P x (6) Our purpoe i to calculate P 0, P, L, P, where denote order of the fitted polynoial. The orthogonal function faily can be contructed by (7): P0 ( x) = P( x) = ( x A) P0( x) P( x) = ( x A) P( x) BP 0( x) (7)... P ( x) = ( x A ) P ( x) B P ( x) Where, j+ j+ j j j n n n xipj xi xp i j xi yipj xi i= i= i= j+ =, j =, n n j = n Pj ( xi) Pj ( xi) Pj ( xi) i= i= i= ( ) ( ) ( ) A B C (8) And j = 0,, L,. Finally, we ay calculate the polynoial coefficient P0, P, L, P in ter of j Pj ( x ) above. In C and { } thi way, the contour curve of one region i figured by thee coefficient and neceary endpoint. Regional texture feature i repreented by regional texture aple elected. A regional texture aple hould contain a ajority of local and global characteritic of the inner texture. The inner texture i analyzed by a Dautocorrelation tatitic analyi ethod []. The autocorrelation function of an iage can be ued to ae the aount of regularity a well a the finene/coarene of the texture preent in the iage. The autocorrelation function of an iage i defined a follow: MN ριι( xy, ) = ( M x)( N y) M x N y u= v= M IuvIu (, ) ( + xv, + y) N u= v= I ( u, v) For regular tructural texture, the function will exhibit peak and valley. We can eaily deterine the cale of the texture priitive fro the given texture. The texture aple hould contain ~5 texture priitive. For tochatic texture, 90% above value of the function are bigger than 0.9 generally. Correpondingly, the ize of texture aple not only ay be et aller but alo can be controlled by the reearcher. C. Multi-Region Iage Recontruction The ipleenting procedure of ulti-region iage recontruction i decribed a the following tage: region contour recontruction, region texture ynthei and region retoration. In the firt tage, the contour curve of one region can be decribed a a polynoial function a follow: y = P0 + Px + Px + + P x (9) L (0) P P L Where, the polynoial coefficient 0,,, have been attained through region tructure feature repreentation. According to the x-coordinate of two endpoint, uch a x and x n, it i eay to attain an r abcia vector x = { x, x+, L, xn}, where each eleent i the x-coordinate of one point on the curve. Subtitute eleent of x r in (0) one by one, then the y- coordinate of each point will be gained. In thi way, the region contour i recontructed. In order to ake the connection between two neighboring curve perfect and guarantee the contour cloed, a generic algorith of dilation i applied. P

4 690 JOURNAL OF SOFTWARE, VOL. 8, NO. 3, MARCH 03 In the econd tage, a texture ynthei algorith i perfored in the anner of Efro and Freean iage quilting in []. And any ipleentation detail are introduced in []. For intance, a bigger patch ean better capturing of texture characteritic in the texture patche and thu ore iilarity between the original texture and the yntheized one. It i uually aued that the patch contain one texture eleent at leat. Finally, region retoration i achieved through uch a way that yntheized region texture i filled to the recontructed region contour. Multi-region iage recontruction i achieved when all region are uccefully retored. III. HYBRID MPI-OPENMP APPROACH To iprove the efficiency of iage recontruction algorith, during the ipleenting procedure, parallel technique are utilized to achieve iage feature extraction and ulti-region iage recontruction. The ipleenting procedure of thi parallel prograing approach conit of two phae: MPI paralleli and OpenMP paralleli. In order to illutrate the ipleenting proce of the propoed hybrid MPI- OpenMP approach, we give it parallel ipleenting flowchart, a hown in Fig.3. The proceor whoe ID nuber i i take charge of region which ha ae index. For exaple, the ater take charge of region whoe index i 0. In the MPI parallel ipleenting proce, Firtly, according to region index lit, The ater and all lave obtain regional tructure feature through perforing contour tracking, down apling and piecewie iterative curve fitting and regional texture aple through perforing aple election. After that, the ater and all lave accoplih regional texture ynthei according to regional texture aple. Secondly, becaue contour curve of each region i different and polynoial coefficient are generated randoly, nuber of polynoial coefficient of region contour curve i different. Therefore, the ater and all lave gather nuber of thee polynoial coefficient of contour curve of all region fro all proceor, which could be ipleented by uing the MPI_Allgather() function. After that, the ater gather thee polynoial coefficient of contour curve of other region fro all laver, which could be ipleented by uing the MPI_Gatherv() function. Then, the ater gather yntheized texture of other region fro all laver, which could be ipleented by uing the MPI_Gather() function. Finally, the ater achieve contour recontruction of all region. Then, the ater accoplihe ulti-region iage recontruction through copleting retoration of all region ucceively. B. OpenMP Paralleli Figure 4. The OpenMP parallel code Figure 3. The hybrid MPI-OpenMP parallel ipleenting flowchart A. MPI Paralleli The MPI paralleli i deigned baed on the Mater- Slave deign pattern [3] and it ethodology i baed on the Tak-Channel odel. In order to elaborate conveniently, we aue that nuber of region i N. And then indexe of thee region are 0,,, L, N, repectively. Each region i apped a a tak and each tak correpond to a proce. ID nuber of ater i 0; ID nuber of all laver are,, 3, L, N, repectively. The piecewie iterative curve fitting play a key role in the proce of region tructure feature repreentation and it execution tie can not be ignored. In addition, with the iage ize increaing, the execution tie conued by piecewie iterative curve fitting will alo increae. That will affect the efficiency of iage recontruction. In order to olve thi proble, we take full advantage of potential parallel feature of iage recontruction algorith and propoe a ulti-threaded piecewie iterative curve fitting which i baed on the OpenMP technique [3]. At the ae tie, ulti-threaded paralleli baed on OpenMP doe not produce counication overhead. Fig.4 illutrate the OpenMP

5 JOURNAL OF SOFTWARE, VOL. 8, NO. 3, MARCH parallel piecewie iterative curve fitting in the for of code. C. Effective Load-Balancing There i effective load-balancing in our hybrid MPI- OpenMP parallel prograing approach. On the one hand, becaue all region have ae texture aple ize and texture ynthei paraeter, the tie conued by aple election and texture ynthei i alo ae. Becaue the contour of each region i different, the tie conued by contour tracing, down apling, piecewie iterative curve fitting and contour retoration i alo not ae. But in the real environent, ince the tie conued by the latter i aller than the tie conued by the forer, the difference of total execution tie aong proceor i all. On the other hand, in the ipleenting procedure of the piecewie iterative curve fitting, we execute a ultithreaded paralleli baed on OpenMP. Thi way, though the contour of each region i different, the parallel execution tie conued by piecewie iterative curve fitting i alot ae. Therefore, the difference of total execution tie aong proceor will becoe aller. Clearly, ulti-threaded paralleli baed on OpenMP i beneficial to load-balancing. IV. EXPERIMENTAL RESULTS AND PERFORMANCE ANALYSIS The propoed fraework i copoed of two part. The firt part of the propoed fraework i in Sect., which derive the iage recontruction algorith. In Sect.3, the econd part of the propoed fraework how the detail of the hybrid MPI-OpenMP approach. Experiental reult are then given according to thee two part. For the firt part, we perfor experient in Sect.4. to evaluate our iage recontruction algorith. For the econd part, we perfor experient in Sect.4. to evaluate the tie perforance of our hybrid MPI- OpenMP approach. A. Evaluation on Iage Recontruction Algorith We tet our iage recontruction algorith on oe natural iage with aive texture. For ulti-region extraction, the JSEG algorith ha three paraeter which need to be pecified artificially [5]. And we pecify the three paraeter a follow: TQUAN = -, NSCALE = -, threhcolor = 0.8, which ake the perforance of hoogeneity detection perfect. For the piecewie iterative curve fitting, the plit threhold aount to 5~0 and the degree of polynoial of curve fitting i pecified a 4 generally. Here, the JPEG verion ued i JPEG Iager...5 and the JPEG000 verion ued i Kakadu_V..3. In order to illutrate the ipleenting procedure of the propoed iage recontruction algorith, we how the reult of each tage in Fig.5. Two region of original iage are obtained through ulti-region extraction, a i hown in Fig.5 (b). Fig.5 (c) and Fig.5 (d) how the recontructed contour and the dilated contour of the upper region, repectively. Fig.5 (e) and Fig.5 (f) diplay the recontructed contour and the dilated contour of the lower region, repectively. Fig.5 (g) diplay the yntheized texture of the upper region and Fig.5 (h) diplay the yntheized texture of the lower region. Finally, the recontructed iage i how in Fig.5 (i). Figure 5. Diagra how reult of each phae Figure 6. Recontruction reult There are any recontruction reult with different nuber of region in Fig.6. Experiental reult how thee iage recontructed by our algorith have viual ipairent. But viual ipairent of JPEG iage and JPEG000 iage i alot iperceptible. The reaon why recontructed reult have viual ipairent i that lo of non-texture detailed inforation. Thi lo i the ain caue which caue the viual ipairent of

6 69 JOURNAL OF SOFTWARE, VOL. 8, NO. 3, MARCH 03 recontructed reult. Ditortion of regional contour in t obviou. TLE I. COMPARISON OF BYTES REQUIRED BY JPEG, JPEG000 AND OUR ALGORITHM Figure 7. Execution tie, Speedup and Parallel efficiency with different nuber of region In our iage recontruction algorith, byte required by iage recontruction are coputed by (): N i i () i= Ω= ( Q + T) Where, Ω denote byte required by iage recontruction; N i nuber of region; i i index of region; Q i byte of polynoial coefficient i repreenting regional contour with index i ; T i i byte of regional texture aple with index i. In Table, we how nuber of byte ued in our iage recontruction algorith and copare the to the JPEG and JPEG000 copreion for the equivalent iage. Our recontructed iage are fair approxiation and we ay do ore ueful attept for etablihing ore ophiticated iage coding algorith to recontruct very realitic iage. B. Evaluation on Hybrid MPI-OpenMP Approach We ipleent the hybrid MPI-OpenMP approach uing tandard C with Microoft MPI (MS-MPI) and OpenMP. A erie of tet have been perfored on a dedicated cluter of 8 coputing node running Window HPC Server 008, each with Quad-core Xeon X5430 (.66GHz) and 6GB eory and connected by an Infiniband witch. Now we turn to the tie perforance eaureent of the propoed hybrid MPI-OpenMP approach. We ue original iage in Fig.6 (b) and Fig.6 (d) to eaure the execution tie, peedup and parallel efficiency of our ipleentation. In addition, conidering the actual characteritic of iage hape, nuber of region of original iage in Fig.6 (b) i, 3 and 4, repectively; and nuber of region of original iage in Fig.6 (d) i, 3, 4, 5, 6 and 7, repectively. Although the nuber of thread can be arbitrarily et, the nuber of thread i pecified a two in really experientation. Thee eaureent are deontrated in Fig.7. A hown in Fig.7, we can ee clearly that the execution tie can be reduced greatly by iage feature extraction and recontruction in parallel. Moreover, the ore nuber of region i, the ore the aved tie i. In addition, high peedup are alo obtained. Moreover, the ore nuber of region i, the higher the peedup i. However, further reearch and iproveent are till required for the low parallel efficiency when the nuber of proceor i increaing. To u up, we believe that iage feature extraction and recontruction in parallel i a feaible approach for iage recontruction algorith. And it will perfor better a the further developent of parallel technique. V. CONCLUSIONS Perceptual coding hould take full advantage of the reult fro huan viual yte (HVS) tudie. Iage can be pared into ediu-level viion repreentation: regional contour curve and texture. An effective iage recontruction algorith i propoed in thi paper. Through electing the allet region texture aple, the iage recontruction algorith can effectually eliinate perceptual redundancy. Copared with JPEG and JPEG000 copreion, our algorith can get ore coding gain but reain ot iage inforation people care. Siulation reult how that our algorith can obtain optial recontructed iage. The hybrid MPI- OpenMP approach propoed i ipleented on a dedicated cluter. Thi parallel approach can ignificantly iprove efficiency of iage recontruction. Repone

7 JOURNAL OF SOFTWARE, VOL. 8, NO. 3, MARCH tie of retoring iage fro original iage with any region can be reduced greatly. In our experient, everal liitation are found for the iage recontruction algorith. One cae i regional hape ditortion. Another cae i how to handle the lo of non-texture detailed inforation. Future reearch work i on how to olve thee proble and etablih ore ophiticated coding algorith to recontruct very realitic iage. ACKNOWLEDGMENT We acknowledge the funding provided by the National Natural Science Foundation of China key project (Grant No ) and youth project (Grant No ). REFERENCES [] M. Kunt, A. Ikonoopoulo, M. Kocher, Second- Generation Iage Coding Technique, Proc. IEEE, Vol. 73, No. 4, Apr. 985, pp [] R.A. DeVore, B. Jawerth, B.J. Lucier, Iage Copreion Through Wavelet Tranfor Coding, IEEE Tranaction on Inforation Theory, Vol. 38, No., Mar. 99, pp [3] L. Thoa, F. Deravi, Region-baed Fractal Iage Copreion uing Heuritic Search, IEEE Tranaction on Iage Proceing, Vol. 4, No. 6, Jun. 995, pp [4] H. Hartentein, M. Ruhl, D. Saupe, Region-baed Fractal Iage Copreion, IEEE Tranaction on Iage Proceing, Vol. 9, No. 7, Jul. 000, pp [5] J.W. Han, K.N. Ngan, Unupervied Extraction of Viual Attention Object in Color Iage, IEEE Tranaction on Circuit and Syte for Video Technology, Vol. 6, No., Jan. 006, pp [6] T. Sikora, Trend and Perpective in Iage and Video Coding, Proc. IEEE, Vol. 93, No., Jan. 005, pp [7] P. Ndjiki-Nya, B. Makai, G. Blatterann, Iproved H.64/AVC Coding uing Texture Analyi and Synthei, Proc. IEEE Int. Conf. Iage Proceing, Sept. 4-7, 003, pp. II [8] K. Sun, Y.Y. Yang, L. Ye, Q. Zhang, Iage Retoration Uing Piecewie Iterative Curve Fitting and Texture Synthei, Proc. 4th Int. Conf. Intelligent Coputing, Shanghai, China, Sept. 5-8, 008, pp [9] R.J. Chen, L.G. Liu, G.C. Dong, Local Reapling for Patch-baed Texture Synthei in Vector Field, International Journal of Coputer Application in Technology, Vol. 38, No. //3, Jul. 00, pp [0] D.S. Wickraanayake, E.A. Ediriinghe, H.E. Bez, Tranfor Doain Texture Synthei, Signal Proceing: Iage Counication, Vol. 3, No., Jan. 008, pp.-3. [] A.A. Efro, W.T. Freean, Iage Quilting for Texture Synthei and Tranfer, ACM SIGGRAPH, 00, pp [] G. Peyre, Texture Synthei with Grouplet, IEEE Tranaction on Pattern Analyi and Machine Intelligence, Vol. 3, No. 4, Apr. 00, pp [3] P.P. Bartakke, S.A. Vaidya, M.S. Sutaone, Refining Structural Texture Synthei Approach, IET Iage Proceing, Vol. 5, No., Mar. 0, pp [4] Y. Deng, B.S. Manjunath, H. Shin, Color Iage Segentation, Proc. IEEE Coputer Viion and Pattern Recognition, Fort Collin, USA, Jun. 3-5,999, pp [5] Y. Deng, B.S. Manjunath, Unupervied Segentation of Color-Texture Region in Iage and Video, IEEE Tranaction on Pattern Analyi and Machine Intelligence, Vol. 3, No. 8, Aug. 00, pp [6] F. Jing, M. Li, H.J. Zhang, B. Zhang, An Efficient and Effective Region-baed Iage Retrieval Fraework, IEEE Tranaction on Iage Proceing, Vol. 3, No. 5, May 004, pp [7] T. Adaek, N. O Connor, Efficient Contour-baed Shape Repreentation and Matching, Proc. 5th ACM SIGMM Int. Workhop on Multiedia Inforation Retrieval, Nov. 003, pp [8] P. Dollar, Z.W. Tu, S. Belongie, Supervied Learning of Edge and Object Boundarie, Proc. IEEE Coputer Viion and Pattern Recognition, 006, pp [9] D.R. Martin, C.C. Fowlke, J. Malik, Learning to Detect Natural Iage Boundarie uing Local Brightne, Color, and Texture Cue, IEEE Tranaction on Pattern Analyi and Machine Intelligence, Vol. 6, No. 5, May 004, pp [0] Q.L. Tang, N. Sang, T.X. Zhang, Contour Detection baed on Contextual Influence, Iage and Viion Coputing, Vol. 5, No. 8, Aug. 007, pp [] C.H. Chen, P.S.P. Wang, Handbook of Pattern Recognition and Coputer Viion, World Scientific Publihing Co., 999, Ch., pp 8-. [] L. Liang, C. Liu, Y. Xu, Real-Tie Texture Synthei by Patch-baed Sapling, ACM Tranaction on Graphic, Vol. 0, No. 3, Jul. 00, pp [3] M.J. Quinn, Parallel Prograing in C with MPI and OpenMP, McGraw-Hill Copanie, Inc., 004. Jinliang Wan i lecturer fro Henan Univerity of Econoic and Law. My reearch area focue on iage and video coding, real-tie digital iage proceing and high perforance coputing. I received the B.E. degree in Counication Engineering fro Zhengzhou Univerity, Zhengzhou, China, and the M.Sc. degree in Counication and Inforation Syte fro Counication Univerity of China, Beijing, China. I a currently lecturer in Henan Univerity of Econoic and Law, Zhengzhou, China, and Ph.D. candidate in Inforation Engineering School, Counication Univerity of China, Beijing, China. Now, I take part in one National Natural Science Foundation of China key project and one youth project. Yanhui Liu, Potdoctor, Certified tructural engineer, t. grade of China. State Key Laboratory for Seiic Reduction /Control & Structural Safety (Cultivation), Guangzhou Univerity. Reearch field: tructure vibration control. In 003, 007 and 009, I obtained the bachelor' degree of engineering in Hainan Univerity, ater degree of engineering in Lanzhou Univerity of Technology and doctor degree of engineering in Lanzhou Univerity of Technology repectively. In 009-0, I went in for potdoctor in Beijing Univerity of Technology. Now, I a working in State Key Laboratory for Seiic Reduction /Control & Structural Safety (Cultivation), Guangzhou Univerity. Now, I hold one National Natural Science Foundation of China and one Potdoctoral Science Foundation of China, obtain one patent of China and have publihed twenty acadeic paper of which ot have been indexed SCI or EI.