An Effective Hardware Architecture for Bump Mapping Using Angular Operation
|
|
- Hugo Stevenson
- 5 years ago
- Views:
Transcription
1 Graphis Hardware (2003) M. Doggett W. Heidrih W. Mark. Shilling (Editors) n Effetive Hardware rhiteture for Bump Mapping Using ngular peration S. G. Lee W. C. Park W. J. Lee T. D. Han and S. B. Yang Department of Computer Siene Yonsei Universit Seoul Republi of Korea bstrat In this paper we propose an effetive bump mapping algorithm that utilies the referene spae with the polar oordinate sstem and also propose a new hardware arhiteture assoiated with the proposed bump mapping algorithm. The proposed arhiteture redues the omputations to transform the vetors from the objet spae into the referene spae b using a new vetor rotation method. It also redues the omputations for the illumination alulation b using the law of osine. Compared with the previous approahes the proposed arhiteture redues multipliation operations up to 78%. Categories and Subjet Desriptors (aording to CM CCS): I.3.7 [Computer Graphis]: ThreeDimensional Graphis and Realism. Introdution Bump mapping developed b Blinn an represent effetivel the bump parts of the objet surfae suh as a protuberane of the skin of a peanut in detail using geometr mapping without omple modeling The following three steps are required for eah piel to perform the onventional bump mapping In the first step the displaement values or height values are fethed from a 2D bump map. In the seond step both the partial differentiations and the rossproduts are alulated to perturb the normal vetor. In the last step the illumination is alulated with the perturbed normal vetor the light vetor L and the halfwa vetor H after the normaliation of these three vetors. To aomplish the above steps a large amount of perpiel omputations is required. The normal vetor perturbation an be preproessed b defining the surfaeindependent spae alled the referene spae Instead the transformations of the light and the halfwa vetors from the objet spae into the referene spae should be provided for eah piel (or for eah small polgon). For these transformations the definition of a 3 3 matri and a 3 3 matri multipliation are required for eah piel. The rest of this paper is organied as follows. The related work to bump mapping hardware arhiteture is desribed in Setion 2. In Setion 3 we eplain the proposed algorithm for the vetor rotation and the illumination alulation in de In Kim et al. 9 and Kugler the polar oordinate sstem The Eurographis ssoiation is used to represent vetors L and H for bump mapping. Compared with the Cartesian oordinate sstem the polar oordinate sstem is an effetive approah from the viewpoint of hardware requirements. Contrar to three omponents in the Cartesian oordinate sstem onl two angles are suffiient to represent a vetor. The normaliation of the vetors for the illumination alulation an also be eliminated. However the matri multipliation for the transformation or a large map for the normal vetor perturbation are still required. In this paper we propose a new transformation method for both the light vetor L and the halfwa vetor H represented b the polar oordinate sstem and present its hardware arhiteture. The proposed method transforms diretl the vetors L and H in the objet spae into the vetors L and H in the referene spae onl b vetor rotations respetivel. Thus the proposed method does not need an hardware foatri transformation but requires onl a few hardware logis for the vetor rotations. It also redues the illumination alulation hardware b appling the law of osine to the previous illumination alulation equations.
2 Lee et al. n Effetive Hardware rhiteture for Bump Mapping Using ngular peration tail. In Setion 4 we illustrate the proposed bump mapping hardware arhiteture and ompare its hardware ompleit with those of other approahes. Eperimental environments and results are disussed in Setion 5. Conlusions are given in Setion Bakground and related work In the normal vetor perturbation step of the onventional bump mapping as shown in () a perturbed normal vetor is alulated b deviating a normal vetor b the displaement value B stored in the bump map. B u P v B v P u () where B u and B v are the partial derivatives of the bump displaement value B with respet to the bumpmap parameters u and v respetivel. P u and P v are the partial derivatives of the surfae at point P ling in the tangent plane. Then the illumination of the perturbed normal vetor is alulated with L and H using the Phong illumination model as shown in (2). I I ak a I i k d L k s H n (2) where I a is the intensit of ambient light I i is the intensit of inident light and k a k d and k s are ambient diffuse and speular refletion oeffiients respetivel. Peer et al. 8 propose an effiient method to support bump mapping b adding minimal hardware into the Phong shading hardware. B introduing the loal tangent spae (the referene spae) defined b a normal vetor a tangent vetor T and a binormal vetor B the omputation of the perturbed normal is pushed into a preproessor. Ernst et al. 0 simplif the onstrution of the bump map b fiing the value k into where k is a onstant of the equation in Peer et al. 8 for the normal vetor perturbation. In Peer et al. 8 and Ernst et al. 0 a 3 3 matri transformation and a normaliation for the light and the halfwa vetors should be ompleted before the illumination alulation. The polar oordinates of a vetor P are written into ϕ P θ P where ϕ P is an angle between the ais and a vetor generated b projeting P onto the plane and θ P is an angle between P and the ais. The bump mapping methods using the polar oordinate sstem are disussed in Kim et al. 9 Kugler and Ikedo et al Kim et al. 9 gives onl a small redution to the hardware requirements for the illumination alulation b using (3) and (4) whih ompute the inner produts in (2) with the perturbed angles ϕ n θ n obtained from the bump map. n L l L osθ l os θ n sinθ l sinθ n os ϕ l ϕ n (3) n L h L osθ h os θ n sinθ h sinθ n os ϕ h ϕ n (4) Ikedo et al present a high performane Phong shading hardware supporting bump refletion refration and teture mapping in a single LSI hip. s mentioned in 69 Kugler it requires a large amount of logi foatri operations beause it has been implemented with the lassial straightforward method. Moreover it ma not produe the orret refletion angle to alulate the intensit of speular light espeiall in largesied polgons. Kugler integrates the arithmeti units and the referene tables into one dediated memor hip alled the intelligent memor (IMEM) to support teture bump and refletionmapping. In this arhiteture eah normal vetor is transformed from the Cartesian oordinates into the spherial oordinates. Then the transformed normal vetor is perturbed b using three rotations whih are eeuted b two additions and one lookup table (LUT) aess. fter the normal vetor perturbation the illumination is alulated b referring to the diffuse and speular light maps. IMEM redues the amount of omputations b using the preomputed LUTs and maps. However it requires a map of large sie over 3 MBtes. 3. The proposed bump mapping algorithm The proessing flow of the proposed bump mapping algorithm onsists of the Vetor Rotation Stage the Bump Vetor Feth Stage and the Illumination Calulation Stage. In the Vetor Rotation Stage vetors in the 3D objet spae are transformed into the 3D referene spae b the angular rotation operation. This operation generates the light and the halfwa vetors L and H in the referene spae b transforming the vetors L and H in the objet spae. The two angles of the transformed vetors an be alulated b utiliing the projetion onto the plane and the proportion onto the sphere. The detailed eplanation of this method and its hardware arhiteture will be given in Setion 3. and 4. respetivel. In the Bump Vetor Feth Stage the perturbed normal vetors s are fethed from the bump vetoap whih is onstruted in the referene (the tangent) spae and is omputed in the preproess stage b the alulation method in Peer 8 or b the filtering of the bump height map. vetor in the bump vetoap is represented as ϕ θ using the polar oordinate sstem. In the Illumination Calulation Stage after the inner produts L and H are omputed the illumination is alulated b referring to the diffuse and speular tables with the values of the inner produts. The algorithm for the illumination alulation and its hardware arhiteture are disussed in detail in Setion 3.2 and 4.2 respetivel. 3.. The vetor rotation 3... The proposed vetor rotation method In the proposed method the vetors L and H are transformed diretl into the tangent spae b the rotation operations where the polar oordinate (ϕ θ ) of the normal vetor The Eurographis ssoiation 2003.
3 Lee et al. n Effetive Hardware rhiteture for Bump Mapping Using ngular peration ( =' ) Figure : The first rotation: It rotates ϕ around the ais. ref Figure 3: The geometri information of vetors that are required to find the omponents of the transformed vetor re f. vetor with the ais diretion in the world spae and is in parallel with the normal vetor re f in the referene spae. Similarl is also moved into re f ϕ re f θ re f whih is idential to in the referene spae The information for finding the angles of the vetor after the rotation operation Figure 2: The seond rotation: It rotates θ around the ais. at a point on the objet s surfae are used as the rotation fators (angles) of the vetor. Figures and 2 show these rotation operations; a vetor is transformed into a vetor re f. The polar oordinate (ϕ re f θ re f ) an be found b the projetion onto the plane and the proportion of the angular variation on a sphere respetivel. ϕ θ is an arbitrar vetor on the world spae whih orresponds to a light vetor L ϕ L θ L and a halfwa vetor H ϕ H θ H in ase of performing bump mapping. Figure shows the first rotation that rotates and b ϕ around the ais. Through this rotation and are onverted into and respetivel. This makes it possible to rotate auratel around the ais b moving into on the plane. et as shown in Figure 2 the seond rotation is performed b rotating the transferred vetors and b θ around the ais. s a result is idential to the unit The Eurographis ssoiation Figure 3 shows the geometri information of the vetors that are required to find the polar oordinate (ϕ θ ) of the transformed vetor. More detailed desriptions to the newl defined vetors in Figure 3 are given below. : It is a unit vetor that begins with the origin and ends with a point interseting both the plane and a irle whih passes the end point of and whih is in parallel with the plane. Let an angle between and the ais be θ whih is required to find an angle θ of. : It is a vetor that is generated b projeting onto the plane. The and oordinates of the end point of are sinθ os ϕ ϕ and sinθ sin ϕ ϕ respetivel. re f : It is a unit vetor that begins with the origin and ends with a point interseting both the plane and a irle whih passes the end point of and whih is in parallel with the plane. n angle between re f and the ais is (θ θ ) and the and oordinates of the end point of re f are sin θ θ and os θ θ respetivel. re f : It is a vetor that is generated b projeting onto the plane. The and oordinates of the end point of re f are sin θ θ and sinθ sin ϕ ϕ respetivel.
4 !!!! Lee et al. n Effetive Hardware rhiteture for Bump Mapping Using ngular peration sin sin( ) mn C m C n C 0 C m 0 mn ( = ) ' mn 0 sin( ) Figure 4: The alulation of ϕ : This method alulates an angle ϕ between a projeted vetor and the ais b projeting onto the plane. Figure 5: The geometri relationship of the vetors on a sphere. B appling the law of osine to the oordinate of we an find θ whih is epressed as (5). θ Sin sin" 2 Let and Y be θ #%$ ϕ & ϕ ' 2 ( θ #$ ϕ & ϕ ' Y 2 Then θ an be rewritten as θ Sin The alulation of ϕ # sin" θ &%$ ϕ & ϕ ' 2 (*) θ &$ ϕ & ϕ ' 2. sin # siny 2 ). To find an angle ϕ of the projetion of onto the plane is required as shown in Figure 4. In the figure ϕ an be alulated with ϕ Tan sinθ sin$ ϕ & ϕ ' sin$ θ & θ ' ). Let Z θ & θ. Then ϕ an be rewritten as in (9) b appling the law of osine to sinθ sin$ ϕ & ϕ '. ϕ Tan osy & os 2sinZ ) The derivation of an angular equation using the geometri relationship of the vetors on a sphere Compared with the method for finding ϕ it is relativel omple to find the angle θ between and the ais. We will eplain how to alulate the angle θ from this setion through Setion First speifing the geometri relationship of the vetors on a sphere is required to find θ. In this setion the relationship of the vetors on a sphere is (5) (6) (7) (8) (9) 7 speified and the alulation method for finding θ mn of an arbitrar vetor mn is desribed. Figure 5 shows the geometri relationship among a vetor mn the plane and the plane. Detailed desriptions for the irles and the vetors defined in Figure 5 are given below. C m: It is a irle that is in parallel with the plane and passes a point (ϕ mn θ mn ). Let the radius of this irle be. C m : It is a irle that is generated b projeting the irle C m onto the plane. C n: It is a irle that is in parallel with the plane and passes a point (ϕ mn θ mn ). mn : It is a vetor that begins with the origin and ends with a point (0 θ mn ) at whih the irle C m intersets the plane. 0 : It is a vetor that begins with the origin and ends with a point (ϕ 0 θ 0 ) at whih the irle C n intersets the plane. Let the oordinate of the point (ϕ 0 θ 0 ) be 0. mn : It is a vetor that is generated b projeting mn onto the plane. The end point (ϕ mn θ mn ) of mn is on the irle C m. In Figure 5 we assume two arbitrar vetors that begin with the origin and end with points at whih the plane in parallel with the plane intersets the irles C m and C m. Then for C m the variation range of an angle between mn and the ais is from 0 to 90 θ mn. Similarl for C m the variation range is from 0 to 90. When these vetors move on C m and C m under the above assumption the ratio of the angular variation to the variation range of eah vetor for C m is equal to that of C m. Therefore the following epression holds. θ mn & θ mn θ mn (0) 90 & θ mn 90 0 The Eurographis ssoiation 2003.
5 Lee et al. n Effetive Hardware rhiteture for Bump Mapping Using ngular peration C0 C m 0 θ (= θ re f ) of is (θ (8). θ θ ) thus (7) is rewritten into θ θ θ θ 76 θ prop (8) mn θ an be rewritten as follows. θ Z 90 Z θ prop (9) 0 mn 0 0 θ prop that an be alulated b the method presented in Setion 3..4 is represented as (20). θ prop 90 Cos3 sinθ sin ϕ ϕ (20) os θ θ Figure 6: The projetion of mn and its related omponents onto the plane. Hene θ mn an be written as θ mn θ mn θ mn θ mn () We will define the etent to the angular variation θ prop as in (2) whose alulation method will be desribed in detail in Setion Finall θ mn an be rewritten as (3). θ mn θ prop (2) 90 θ mn θ mn θ prop 90 θ mn (3) The alulation of θ prop depending on the loation of vetors θ prop an be alulated b using an angle θ mn of mn as shown in Figure 5. Figure 6 shows the projetion of mn and its related omponents onto the plane. s shown in Figure 6 the oordinate of a point at whih the etension line of mn intersets a unit irle C 0 in the plane is 02. The osine of an angle between mn and the ais is alulated as in (4). 0 os 90 θ mn (4) θ mn 90 Cos3 0 (5) s a result θ prop is alulated b (6) where both 0 and are alread alulated and θ prop ranges from 0 to. θ prop 90 Cos3 0 (6) The alulation of θ The angle θ of the transformed vetor is alulated b using the methods derived from Setions 3..4 and From (3) θ an be alulated as follows. θ The Eurographis ssoiation θ 90 θ θprop (7) 72 Through the use of the law of osine along with Y and Z (20) an be rewritten into (2). Finall θ an be determined b using (9) and (2). θ prop 90 Cos3 osy os (2) 2osZ 3.2. The illumination alulation In the Illumination Calulation Stage the intensit of a piel is omputed with the light and the halfwa vetors L = (ϕ L θ L ) and H = (ϕ H θ H ) and the perturbed normal vetor = (ϕ θ ). In order to alulate the inner produts of the vetors in (2) the appropriate vetors represented b the polar oordinates should be transformed into the vetors in the Cartesian oordinates. The inner produts of the transformed vetors L and H are alulated as follows. L osθ L osθ sinθ L sinθ os ϕ L ϕ (22) H osθ H osθ sinθ H sinθ os ϕ H ϕ (23) (22) and (23) are idential to (3) and (4) in Kim et al. 9 respetivel. However appling the law of osine to these equations makes it possible to redue the amount of omputations for the inner produts. (24) and (25) are the final equations of the inner produts in whih the numbers of multipliations and osines required in the inner produts of the vetors represented b the polar oordinates are redued from 6 and 0 to 2 and 6 respetivel. L 2 4 os θ L θ os θ L θ 6 2 4os θ L θ 8 os θ L θ 6 os ϕ L ϕ (24) H 2 4 os θ H θ os θ H θ 6 2 4os θ H θ os θ H θ 6 os ϕ H ϕ (25) The intensities of the diffuse and the speular lights are omputed b multipling these inner produts b the light parameters. Then the final olor of a bumpmapped piel is determined b adding these intensities together.
6 Lee et al. n Effetive Hardware rhiteture for Bump Mapping Using ngular peration Right Y Right sin & os sin & os sin sin os os Right Right SI 90 Z sin & os os sin T Tprop ' ' Figure 7: The hardware arhiteture for the proposed vetor rotation method. 4. The hardware arhiteture for the proposed bump mapping algorithm L L H H 4.. The vetor rotation unit The hardware arhiteture for the proposed vetor rotation method is shown in Figure 7. It requires si tables three multipliers and eight adderssubtrators to implement (9) and (9). For the sine and osine alulations we use the sin & os LUTs to redue the omputations for perpiel operations. The reiproals of the sine and osine are alulated b ombining the sine and osine alulation step and the reiproal alulation step not b two separate steps. For arbitrar values of k s θ prop s are preomputed b (26) and are stored in the proportion table T prop. Cos3 θ prop k (26) 90 ote that k s in the above equation are alulated b (27) whih is obtained from (2). Therefore θ prop s are fethed from T prop with the indies of k s. osy os k (27) 2osZ 4.2. The illumination alulation unit Figure 8 shows the whole bump mapping hardware arhiteture inluding both the vetor rotation unit and the illumination alulation unit. The illumination alulation unit onsists of two parts that alulate the intensities of the diffuse and the speular light. The intensities of lights are obtained from the light tables referred to b the values of the inner produts. The proposed illumination alulation unit an be implemented with si osine tables one diffuse table one speular table two multipliers and thirteen adderssubtrators. Compared with Kim s arhiteture 9 requiring twelve tables si multipliers and five adderssubtrators the proposed arhiteture is more effiient in terms of hardware ompleit. More detailed omparisons of the proposed arhiteture with other arhitetures are made in Setion 4.3. The light table method for the illumination alulation 73 u B v B The Bump Vetor Map ' ' The Illumination Calulation Unit The Vetor Rotation Unit Diffuse Table The Vetor Rotation Unit os os os os os os Right L' L' H H ' ' Right Right I Bumpmapped Figure 8: The proposed bump mapping hardware. used in Kim et al. 9 finds the intensities of a piel b referring to the diffuse and the speular light tables whih are preomputed. In this method the table entries are indeed b salar values i.e. inner produt values. Therefore the sie of the table is : bits whih is quite small. However in the light map method the map s entries are indeed b vetor values with two or three oordinates. Thus the sie of the map is at least bits whih is muh larger sie than that of the light table method The omparison of other eisting approahes Table shows the omparison of the proposed arhiteture with other arhitetures based on the hardware ompleit. For the omparison we split the proess of bump mapping into two parts the illumination environment setup and the illumination alulation. The frontend is the part that prepares the environment for the illumination alulation and inludes the transformation into the referene spae the normal vetor perturbation and the normaliation. First we will observe the hardware ompleit of the il ; Right Diffuse Table The Eurographis ssoiation 2003.
7 Lee et al. n Effetive Hardware rhiteture for Bump Mapping Using ngular peration rhiteture Peer 8 Kugler Kim 9 Ernst 0 urs Coordinate Sstem Cartesian Polar Polar Cartesian Polar 27 Multipliers Map 3 Multipliers 27 Multipliers 6 Multipliers Illumination 9 Division Units 5 Multipliers 6 LUTs 9 Division Units 2 LUTs Environment 3 SQRTs 3 LUTs 8 dders 3 SQRTs 6 dders Setup 8 dders 2 dders 8 dders Proessing Steps Illumination Calulation ot vailable 8 Multipliers 6 Multipliers 7 Multipliers 2 Multipliers 2 Maps 2 LUTs LUT 8 LUTs 5 LUTs 5 dders 5 dders dders 4 dders Table : The omparison of the arhitetures based on the hardware ompleit. lumination environment setup. Twent multipliations and eight additions are required to perform the normal vetor perturbation b the Blinn s method. To simplif this omputation Kugler uses LUTs and a map. His arhiteture is implemented b five multipliers two adders three LUTs and one map; but the sie of the map reahes 32 Kbtes. For Peer 8 and Ernst 0 that use the referene spae the transformation of L and H into the referene spae whih requires two 3 3 matri operations is implemented b eighteen multipliers and twelve adders and the normaliation of the transformed vetors is organied into nine multipliers three SQRTs nine division units and si adders. In Kim et al. 9 the transformation omputations in the polar oordinate sstem is performed b thirt one multipliers si LUTs and eighteen adders. However the abovementioned methods have to reonstrut a matri for the transformation of eah piel or polgon hene these methods require larger amount of omputations than those shown in Table. The proposed arhiteture redues the hardware requirements for the transformation into the referene spae to si multipliers twelve LUTs and siteen adders b using onl rotations and table referenes without an matri operations. In the Illumination Calulation Stage Kugler s approah alulates the illumination through the address generation of the light map the aess to the light map and the olor blending without the inner produt operation. His method uses eight multipliers four adders and five LUTs to generate the address of the light map and eploits two MB light maps to alulate the intensit of the light. Ernst uses a straightforward method for the Phong illumination model whih requires seven multipliers five adders and one power table. Kim s arhiteture performs the illumination alulation b omputing the inner produt of the vetors with angles and b referring to the diffusespeular light table with the omputed innerprodut value. Their illumination alulation unit is omposed of si multipliers twelve LUTs and five adders. We use the same method as the one used in Kim et al. but two multipliers eight LUTs and eleven adders are onl needed for our arhiteture. The Eurographis ssoiation In omparisons with other approahes using the Cartesian oordinate sstem the amount of hardware for the illumination alulation is inreased a little but the amount of hardware for the illumination environment setup is dereased relativel a lot. bserve that our hardware arhiteture redues the hardware requirement onsiderabl ompared with other polaroordinate approahes. 5. Eperimental results The algorithm and hardware arhiteture proposed in this paper have been simulated in C. For the simulation we modified Mesa to implement the onventional bump mapping method and the proposed bump mapping method. To investigate the qualit differenes between ours and the onventional approah we performed teture and bumpmapping using various objets with various teture and bumpmaps. Figure 9 shows the results generated b mapping a wooden wall teture and bumpmap onto a plane. Figures 9(a) and 9(b) are made b the onventional method using the objet spae with the Cartesian oordinate sstem and b the proposed method using the referene spae with the polar oordinate sstem respetivel. When Comparing these images there is little differene in the qualit between these two images to the etent of not being differentiated b the naked ees. Figures 0(a) and 0(b) show the results of mapping a brik wall teture and bumpmap onto a ube b the onventional method and b the proposed method respetivel. There is also little differene in the image qualit as in the ase of a plane in Figure 9. Figure has been generated b mapping a map of the world onto a sphere. The images of this figure are obtained b mapping a teture and bumpmap with resolution onto a sphere objet with resolution. In Figure the overall images don t look vivid beause these mapping methods wear the maps onverted from resolution into resolution on the surfae of the objet. However we an hardl differentiate the image qualit between these two images generated b both methods.
8 Lee et al. n Effetive Hardware rhiteture for Bump Mapping Using ngular peration Figure 9: Images generated b mapping a wooden wall onto a plane. (a) the onventional method (b) the proposed method Figure 0: Images generated b mapping a brik wall onto a ube. (a) the onventional method (b) the proposed method Figure : Images generated b mapping a map of the world onto a sphere. (a) the onventional method (b) the proposed method 6. Conlusions In this paper we have proposed a bump mapping method with the effetive vetor rotation and illumination alulation algorithm. The proposed arhiteture redues a large amount of omputations and hardwares required for the transformation and the illumination alulation in bump mapping. Furthermore it ould also generate nearl the same qualit of images as the onventional method. knowledgements This work is supported b the RL Fund from the Ministr of Siene & Tehnolog of Korea. 75 Referenes. J. F. Blinn Simulation of Wrinkled Surfaes CM Computer Graphis (Pro. of SIGGRPH 78) pp Watt 3D Computer Graphis 3rd Ed. ddison Wesle T. Moller and E. Haines RealTime Rendering K Peters Ltd VIDI Corp. =produts. 5. T. MRenolds D. Blthe B. Grantham and S. elson dvaned Graphis Programming Tehniques Using pengl In Course otes of SIGGRPH M. Kilgard Pratial and Robust Bumpmapping Tehnique for Toda s GPUs VIDI Corporation G. Miller M. Halstead and M. Clifton nthefl Teture Computation for RealTime Surfae Shading IEEE Computer Graphis and ppliations 8(2) pp M. Peer J. ire and B. Cabral Effiient Bump Mapping Hardware Computer Graphis 3(4) pp J. S. Kim J. H. Lee and K. H. Park fast and effiient bump mapping algorithm b angular perturbation Computers and Graphis 25(5) pp I. Ernst H. Russeler H. Shul and. Wittig Gouraud Bump Mapping In Pro. of EurographisSIGGRPH Workshop on Graphis Hardware pp Kugler IMEM: an intelligent memor for bumpand refletionmapping In Pro. of EurographisSIGGRPH Workshop on Graphis Hardware pp T. Ikedo and J. Ma n dvaned Graphis Chip with Bumpmapped Phong Shading In Pro. of IEEE Computer Graphis International 97 pp T. Ikedo and J. Ma The Truga 00: Salable Rendering Proessor IEEE Computer Graphis and ppliations 8(2) pp T. Ikedo and E. buhi Realtime Rough Surfae Renderer In Pro. of IEEE Computer Graphis International 200 pp The Mesa 3D Graphis Librar org. The Eurographis ssoiation 2003.
An Effective Hardware Architecture for Bump Mapping Using Angular Operation
An Effective Hardware Architecture for Bump Mapping Using Angular Operation Seung-Gi Lee, Woo-Chan Park, Won-Jong Lee, Tack-Don Han, and Sung-Bong Yang Media System Lab. (National Research Lab.) Dept.
More informationFUZZY WATERSHED FOR IMAGE SEGMENTATION
FUZZY WATERSHED FOR IMAGE SEGMENTATION Ramón Moreno, Manuel Graña Computational Intelligene Group, Universidad del País Vaso, Spain http://www.ehu.es/winto; {ramon.moreno,manuel.grana}@ehu.es Abstrat The
More informationA Novel Validity Index for Determination of the Optimal Number of Clusters
IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers
More informationIntroduction to Seismology Spring 2008
MIT OpenCourseWare http://ow.mit.edu 1.510 Introdution to Seismology Spring 008 For information about iting these materials or our Terms of Use, visit: http://ow.mit.edu/terms. 1.510 Leture Notes 3.3.007
More informationGraph-Based vs Depth-Based Data Representation for Multiview Images
Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:
More informationDesign of tree-type support structure of free-form shell generated using fractal geometry
6 30 September, 06, Too, Japan K. Kawaguhi, M. Ohsai, T. Taeuhi (eds.) Design of tree-tpe support struture of free-form shell generated using fratal geometr Jinglan CUI*, Guanghun ZHOU a, Maoto OHSAKI
More informationPerformance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application
World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah
More informationCSCI-4972/6963 Advanced Computer Graphics
Luo Jr. CSCI-497/696 Advaned Computer Graphis http://www.s.rpi.edu/~utler/lasses/advanedgraphis/s8/ Professor Barb Cutler utler@s.rpi.edu MRC 9A Piar Animation Studios, 986 Topis for the Semester Mesh
More informationSmooth Trajectory Planning Along Bezier Curve for Mobile Robots with Velocity Constraints
Smooth Trajetory Planning Along Bezier Curve for Mobile Robots with Veloity Constraints Gil Jin Yang and Byoung Wook Choi Department of Eletrial and Information Engineering Seoul National University of
More informationPipelined Multipliers for Reconfigurable Hardware
Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,
More informationRotation Invariant Spherical Harmonic Representation of 3D Shape Descriptors
Eurographis Symposium on Geometry Proessing (003) L. Kobbelt, P. Shröder, H. Hoppe (Editors) Rotation Invariant Spherial Harmoni Representation of 3D Shape Desriptors Mihael Kazhdan, Thomas Funkhouser,
More informationOn - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2
On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,
More informationA DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR
Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and
More informationSimultaneous image orientation in GRASS
Simultaneous image orientation in GRASS Alessandro BERGAMINI, Alfonso VITTI, Paolo ATELLI Dipartimento di Ingegneria Civile e Ambientale, Università degli Studi di Trento, via Mesiano 77, 38 Trento, tel.
More informationAUTOMATIC TRACKING OF MOVING OBJECT WITH EYE-IN- HAND ROBOT MANIPULATOR
AUTOATIC TRACKING OF OVING OBJECT WITH EYE-IN- HAND ROBOT ANIPULATOR 1 JIN-SIANG SHAW, WEN-LIN CHI Institute of ehatroni Engineering, Taipei Teh, Taipei, Taiwan Email: 1 jshaw@ntut.edu.tw, ton455448@gmail.om
More informationA radiometric analysis of projected sinusoidal illumination for opaque surfaces
University of Virginia tehnial report CS-21-7 aompanying A Coaxial Optial Sanner for Synhronous Aquisition of 3D Geometry and Surfae Refletane A radiometri analysis of projeted sinusoidal illumination
More informationWIRELESS CAPSULE ENDOSCOPY IMAGES ENHANCEMENT BASED ON ADAPTIVE ANISOTROPIC DIFFUSION
WIRELESS CAPSULE ENDOSCOPY IMAGES ENHANCEMENT BASED ON ADAPTIVE ANISOTROPIC DIFFUSION Lei Li 1, Y. X. ZOU 1* and Yi Li 1 ADSPLAB/ELIP, Shool of ECE, Peking Universit, Shenzhen 518055, China Shenzhen JiFu
More informationSystem-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications
System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis
More informationtimestamp, if silhouette(x, y) 0 0 if silhouette(x, y) = 0, mhi(x, y) = and mhi(x, y) < timestamp - duration mhi(x, y), else
3rd International Conferene on Multimedia Tehnolog(ICMT 013) An Effiient Moving Target Traking Strateg Based on OpenCV and CAMShift Theor Dongu Li 1 Abstrat Image movement involved bakground movement and
More informationMATH STUDENT BOOK. 12th Grade Unit 6
MATH STUDENT BOOK 12th Grade Unit 6 Unit 6 TRIGONOMETRIC APPLICATIONS MATH 1206 TRIGONOMETRIC APPLICATIONS INTRODUCTION 3 1. TRIGONOMETRY OF OBLIQUE TRIANGLES 5 LAW OF SINES 5 AMBIGUITY AND AREA OF A TRIANGLE
More informationOrientation of the coordinate system
Orientation of the oordinate system Right-handed oordinate system: -axis by a positive, around the -axis. The -axis is mapped to the i.e., antilokwise, rotation of The -axis is mapped to the -axis by a
More informationAnalysis of input and output configurations for use in four-valued CCD programmable logic arrays
nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,
More informationChromaticity-matched Superimposition of Foreground Objects in Different Environments
FCV216, the 22nd Korea-Japan Joint Workshop on Frontiers of Computer Vision Chromatiity-mathed Superimposition of Foreground Objets in Different Environments Yohei Ogura Graduate Shool of Siene and Tehnology
More information3D-TV Rendering from Multiple Cameras
Master s Thesis 3D-TV Rendering from Multiple Cameras Thesis ommittee: Prof. dr. ir. Jan Biemond Dr. C.P. Botha Dr. Emile A. Hendriks Dr. ir. Andre Redert Author Anastasia Manta Email amantamio@hotmail.om
More informationA {k, n}-secret Sharing Scheme for Color Images
A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University
More informationBoundary Correct Real-Time Soft Shadows
Boundary Corret Real-Time Soft Shadows Bjarke Jakobsen Niels J. Christensen Bent D. Larsen Kim S. Petersen Informatis and Mathematial Modelling Tehnial University of Denmark {bj, nj, bdl}@imm.dtu.dk, kim@deadline.dk
More informationDetection and Recognition of Non-Occluded Objects using Signature Map
6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,
More informationParticle Swarm Optimization for the Design of High Diffraction Efficient Holographic Grating
Original Artile Partile Swarm Optimization for the Design of High Diffration Effiient Holographi Grating A.K. Tripathy 1, S.K. Das, M. Sundaray 3 and S.K. Tripathy* 4 1, Department of Computer Siene, Berhampur
More informationVideo Data and Sonar Data: Real World Data Fusion Example
14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu
More informationMulti-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality
INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of
More informationThe Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines
The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer
More information1. Inversions. A geometric construction relating points O, A and B looks as follows.
1. Inversions. 1.1. Definitions of inversion. Inversion is a kind of symmetry about a irle. It is defined as follows. he inversion of degree R 2 entered at a point maps a point to the point on the ray
More informationNONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION. Ken Sauer and Charles A. Bouman
NONLINEAR BACK PROJECTION FOR TOMOGRAPHIC IMAGE RECONSTRUCTION Ken Sauer and Charles A. Bouman Department of Eletrial Engineering, University of Notre Dame Notre Dame, IN 46556, (219) 631-6999 Shool of
More information特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing
デンソーテクニカルレビュー Vol. 15 2010 特集 Road Border Reognition Using FIR Images and LIDAR Signal Proessing 高木聖和 バーゼル ファルディ Kiyokazu TAKAGI Basel Fardi ヘンドリック ヴァイゲル Hendrik Weigel ゲルド ヴァニーリック Gerd Wanielik This paper
More informationDrawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;
Naïve line drawing algorithm // Connet to grid points(x0,y0) and // (x1,y1) by a line. void drawline(int x0, int y0, int x1, int y1) { int x; double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx;
More informationTrajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller
Trajetory Traking Control for A Wheeled Mobile Robot Using Fuzzy Logi Controller K N FARESS 1 M T EL HAGRY 1 A A EL KOSY 2 1 Eletronis researh institute, Cairo, Egypt 2 Faulty of Engineering, Cairo University,
More informationExtracting Partition Statistics from Semistructured Data
Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk
More informationReview (Law of sines and cosine) cosines)
Date:03/7,8/01 Review 6.1-6. Objetive: Apply the onept to use the law of the sines and osines to solve oblique triangles Apply the onept to find areas using the law of sines and osines Agenda: Bell ringer
More information3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT?
3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? Bernd Girod, Peter Eisert, Marus Magnor, Ekehard Steinbah, Thomas Wiegand Te {girod eommuniations Laboratory, University of Erlangen-Nuremberg
More informationApproximate logic synthesis for error tolerant applications
Approximate logi synthesis for error tolerant appliations Doohul Shin and Sandeep K. Gupta Eletrial Engineering Department, University of Southern California, Los Angeles, CA 989 {doohuls, sandeep}@us.edu
More informationProjections. Let us start with projections in 2D, because there are easier to visualize.
Projetions Let us start ith projetions in D, beause there are easier to visualie. Projetion parallel to the -ais: Ever point in the -plane ith oordinates (, ) ill be transformed into the point ith oordinates
More informationPARAMETRIC SAR IMAGE FORMATION - A PROMISING APPROACH TO RESOLUTION-UNLIMITED IMAGING. Yesheng Gao, Kaizhi Wang, Xingzhao Liu
20th European Signal Proessing Conferene EUSIPCO 2012) Buharest, Romania, August 27-31, 2012 PARAMETRIC SAR IMAGE FORMATION - A PROMISING APPROACH TO RESOLUTION-UNLIMITED IMAGING Yesheng Gao, Kaizhi Wang,
More informationA RAY TRACING SIMULATION OF SOUND DIFFRACTION BASED ON ANALYTIC SECONDARY SOURCE MODEL
19th European Signal Proessing Conferene (EUSIPCO 211) Barelona, Spain, August 29 - September 2, 211 A RAY TRACING SIMULATION OF SOUND DIFFRACTION BASED ON ANALYTIC SECONDARY SOURCE MODEL Masashi Okada,
More informationWe P9 16 Eigenray Tracing in 3D Heterogeneous Media
We P9 Eigenray Traing in 3D Heterogeneous Media Z. Koren* (Emerson), I. Ravve (Emerson) Summary Conventional two-point ray traing in a general 3D heterogeneous medium is normally performed by a shooting
More informationwith respect to the normal in each medium, respectively. The question is: How are θ
Prof. Raghuveer Parthasarathy University of Oregon Physis 35 Winter 8 3 R EFRACTION When light travels from one medium to another, it may hange diretion. This phenomenon familiar whenever we see the bent
More informationHEXA: Compact Data Structures for Faster Packet Processing
Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for
More informationASSESSMENT OF TWO CHEAP CLOSE-RANGE FEATURE EXTRACTION SYSTEMS
ASSESSMENT OF TWO CHEAP CLOSE-RANGE FEATURE EXTRACTION SYSTEMS Ahmed Elaksher a, Mohammed Elghazali b, Ashraf Sayed b, and Yasser Elmanadilli b a Shool of Civil Engineering, Purdue University, West Lafayette,
More informationSpecial Relativistic (Flight-)Simulator
Speial Relativisti (Flight-)Simulator Anton Tsoulos and Wolfgang Knopki Abstrat With speial relativisti visualisation it is possible to experiene and simulate relativisti effets whih our when traveling
More informationContents Contents...I List of Tables...VIII List of Figures...IX 1. Introduction Information Retrieval... 8
Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introdution... 1 1.1. Internet Information...2 1.2. Internet Information Retrieval...3 1.2.1. Doument Indexing...4 1.2.2. Doument Retrieval...4
More informationCell Projection of Convex Polyhedra
Volume Graphis (2003) I. Fujishiro, K. Mueller, A. Kaufman (Editors) Cell Projetion of Convex Polyhedra Stefan Roettger and Thomas Ertl Visualization and Interative Systems Group University of Stuttgart
More informationAccurate Image Based Relighting through Optimization
Thirteenth Eurographis Workshop on Rendering (2002) P. Debeve and S. Gibson (Editors) Aurate Image Based Relighting through Optimization Pieter Peers Philip Dutré Department of Computer Siene, K.U.Leuven,
More informationCracked Hole Finite Element Modeling
Craked Hole Finite Element Modeling (E-20-F72) Researh Report Submitted to: Lokheed Martin, Program Manager: Dr. Stephen P. Engelstad Prinipal Investigator: Dr. Rami M. Haj-Ali Shool of Civil and Environmental
More informationDetecting Moving Targets in Clutter in Airborne SAR via Keystoning and Multiple Phase Center Interferometry
Deteting Moving Targets in Clutter in Airborne SAR via Keystoning and Multiple Phase Center Interferometry D. M. Zasada, P. K. Sanyal The MITRE Corp., 6 Eletroni Parkway, Rome, NY 134 (dmzasada, psanyal)@mitre.org
More informationHIGHER ORDER full-wave three-dimensional (3-D) large-domain techniques in
FACTA UNIVERSITATIS (NIŠ) SER.: ELEC. ENERG. vol. 21, no. 2, August 2008, 209-220 Comparison of Higher Order FEM and MoM/SIE Approahes in Analyses of Closed- and Open-Region Eletromagneti Problems Milan
More informationCluster-Based Cumulative Ensembles
Cluster-Based Cumulative Ensembles Hanan G. Ayad and Mohamed S. Kamel Pattern Analysis and Mahine Intelligene Lab, Eletrial and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1,
More informationGray Codes for Reflectable Languages
Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings
More informationThe Mathematics of Simple Ultrasonic 2-Dimensional Sensing
The Mathematis of Simple Ultrasoni -Dimensional Sensing President, Bitstream Tehnology The Mathematis of Simple Ultrasoni -Dimensional Sensing Introdution Our ompany, Bitstream Tehnology, has been developing
More informationHigh Speed Area Efficient VLSI Architecture for DCT using Proposed CORDIC Algorithm
International Journal of Innovative Researh in Siene, Engineering and Tehnology Website: www.ijirset.om High Speed Area Effiient VLSI Arhiteture for DCT using Proposed CORDIC Algorithm Deepnarayan Sinha
More informationTUMOR DETECTION IN MRI BRAIN IMAGE SEGMENTATION USING PHASE CONGRUENCY MODIFIED FUZZY C MEAN ALGORITHM
TUMOR DETECTION IN MRI BRAIN IMAGE SEGMENTATION USING PHASE CONGRUENCY MODIFIED FUZZY C MEAN ALGORITHM M. Murugeswari 1, M.Gayathri 2 1 Assoiate Professor, 2 PG Sholar 1,2 K.L.N College of Information
More informationSelf-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization
Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in
More informationFitting conics to paracatadioptric projections of lines
Computer Vision and Image Understanding 11 (6) 11 16 www.elsevier.om/loate/viu Fitting onis to paraatadioptri projetions of lines João P. Barreto *, Helder Araujo Institute for Systems and Robotis, Department
More informationElectrical Engineering Department, University of Texas at Dallas, Richardson, TX, USA 3
Effiient Performane odeling via Dual-Prior Baesian odel Fusion for Analog and ixed-signal Ciruits Qiheng Huang Chenlei Fang Fan Yang * Xuan Zeng * Dian Zhou and Xin i 3 State Ke ab of ASIC & Sstem iroeletronis
More informationOFF-LINE ROBOT VISION SYSTEM PROGRAMMING USING A COMPUTER AIDED DESIGN SYSTEM S. SRIDARAN. Thesis submitted to the Faculty of the
OFF-LINE ROBOT VISION SYSTEM PROGRAMMING USING A COMPUTER AIDED DESIGN SYSTEM by S. SRIDARAN Thesis submitted to the Faulty of the Virginia Polytehni Institute and State University in partial fulfillment
More informationReduced-Complexity Column-Layered Decoding and. Implementation for LDPC Codes
Redued-Complexity Column-Layered Deoding and Implementation for LDPC Codes Zhiqiang Cui 1, Zhongfeng Wang 2, Senior Member, IEEE, and Xinmiao Zhang 3 1 Qualomm In., San Diego, CA 92121, USA 2 Broadom Corp.,
More informationUsing Augmented Measurements to Improve the Convergence of ICP
Using Augmented Measurements to Improve the onvergene of IP Jaopo Serafin, Giorgio Grisetti Dept. of omputer, ontrol and Management Engineering, Sapienza University of Rome, Via Ariosto 25, I-0085, Rome,
More informationOn-the-Fly Adaptive Subdivision Terrain
On-the-Fly Adaptive Subdivision Terrain Dir Rose, Martin Kada, Thomas Ertl University of Stuttgart, Institute of Computer Siene Visualization and Interative Systems Group Breitwiesenstraße 20-22, 70565
More informationAccommodations of QoS DiffServ Over IP and MPLS Networks
Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering
More informationAlgorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking
Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient
More informationKERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION
KERNEL SPARSE REPRESENTATION WITH LOCAL PATTERNS FOR FACE RECOGNITION Cuiui Kang 1, Shengai Liao, Shiming Xiang 1, Chunhong Pan 1 1 National Laboratory of Pattern Reognition, Institute of Automation, Chinese
More informationINTERPOLATED AND WARPED 2-D DIGITAL WAVEGUIDE MESH ALGORITHMS
Proeedings of the COST G-6 Conferene on Digital Audio Effets (DAFX-), Verona, Italy, Deember 7-9, INTERPOLATED AND WARPED -D DIGITAL WAVEGUIDE MESH ALGORITHMS Vesa Välimäki Lab. of Aoustis and Audio Signal
More informationthe data. Structured Principal Component Analysis (SPCA)
Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving
More informationAn Efficient and Scalable Approach to CNN Queries in a Road Network
An Effiient and Salable Approah to CNN Queries in a Road Network Hyung-Ju Cho Chin-Wan Chung Dept. of Eletrial Engineering & Computer Siene Korea Advaned Institute of Siene and Tehnology 373- Kusong-dong,
More informationCluster Centric Fuzzy Modeling
10.1109/TFUZZ.014.300134, IEEE Transations on Fuzzy Systems TFS-013-0379.R1 1 Cluster Centri Fuzzy Modeling Witold Pedryz, Fellow, IEEE, and Hesam Izakian, Student Member, IEEE Abstrat In this study, we
More information1. Introduction. 2. The Probable Stope Algorithm
1. Introdution Optimization in underground mine design has reeived less attention than that in open pit mines. This is mostly due to the diversity o underground mining methods and omplexity o underground
More informationA Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering
A Novel Bit Level Time Series Representation with Impliation of Similarity Searh and lustering hotirat Ratanamahatana, Eamonn Keogh, Anthony J. Bagnall 2, and Stefano Lonardi Dept. of omputer Siene & Engineering,
More informationBENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS
Proeedings of ASME 0 International Mehanial Engineering Congress & Exposition IMECE0 November 5-, 0, San Diego, CA IMECE0-6657 BENDING STIFFNESS AND DYNAMIC CHARACTERISTICS OF A ROTOR WITH SPLINE JOINTS
More informationAbstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.
Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,
More informationarxiv: v1 [cs.gr] 10 Apr 2015
REAL-TIME TOOL FOR AFFINE TRANSFORMATIONS OF TWO DIMENSIONAL IFS FRACTALS ELENA HADZIEVA AND MARIJA SHUMINOSKA arxiv:1504.02744v1 s.gr 10 Apr 2015 Abstrat. This work introdues a novel tool for interative,
More informationChapter 2: Introduction to Maple V
Chapter 2: Introdution to Maple V 2-1 Working with Maple Worksheets Try It! (p. 15) Start a Maple session with an empty worksheet. The name of the worksheet should be Untitled (1). Use one of the standard
More informationA Unified Subdivision Scheme for Polygonal Modeling
EUROGRAPHICS 2 / A. Chalmers and T.-M. Rhyne (Guest Editors) Volume 2 (2), Number 3 A Unified Subdivision Sheme for Polygonal Modeling Jérôme Maillot Jos Stam Alias Wavefront Alias Wavefront 2 King St.
More informationExploring the Commonality in Feature Modeling Notations
Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om
More informationDirection-Driven Shape-Based Interpolation of Volume Data
Diretion-Driven Shape-Based Interpolation of Volume Data Jiří Hladůvka and Eduard Gröller Vienna University of Tehnology, Institute of Computer Graphis and Algorithms Favoritenstraße 9 11, E186, A-1040
More informationReading Object Code. A Visible/Z Lesson
Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly
More informationLight Scattering by Individual and Groups of Spheroidal Particles
Light Sattering by Individual and Groups of Spheroidal Partiles Diploma paper by Peter Alsholm Lund Reports on Atomi Physis, LRAP-200 Lund, August 1996 Abstrat In order to simulate the light propagation
More informationTime delay estimation of reverberant meeting speech: on the use of multichannel linear prediction
University of Wollongong Researh Online Faulty of Informatis - apers (Arhive) Faulty of Engineering and Information Sienes 7 Time delay estimation of reverberant meeting speeh: on the use of multihannel
More informationImproving the Perceptual Uniformity of a Gloss Space
Improving the Pereptual Uniformity of a Gloss Spae Adria Fores, 1 Mark D. Fairhild, 1 Ingeborg Tastl 2 1 Munsell Color Siene Laboratory, Rohester Institute of Tehnology 2 Hewlett-Pakard Laboratories Abstrat
More informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. Improvement of low illumination image enhancement algorithm based on physical mode
[Type text] [Type text] [Type text] ISSN : 0974-7435 Volume 10 Issue 22 BioTehnology 2014 An Indian Journal FULL PAPER BTAIJ, 10(22), 2014 [13995-14001] Improvement of low illumination image enhanement
More informationAdaptive Implicit Surface Polygonization using Marching Triangles
Volume 20 (2001), Number 2 pp. 67 80 Adaptive Impliit Surfae Polygonization using Marhing Triangles Samir Akkouhe Eri Galin L.I.G.I.M L.I.G.I.M Eole Centrale de Lyon Université Claude Bernard Lyon 1 B.P.
More informationFlow Demands Oriented Node Placement in Multi-Hop Wireless Networks
Flow Demands Oriented Node Plaement in Multi-Hop Wireless Networks Zimu Yuan Institute of Computing Tehnology, CAS, China {zimu.yuan}@gmail.om arxiv:153.8396v1 [s.ni] 29 Mar 215 Abstrat In multi-hop wireless
More information1 The Knuth-Morris-Pratt Algorithm
5-45/65: Design & Analysis of Algorithms September 26, 26 Leture #9: String Mathing last hanged: September 26, 27 There s an entire field dediated to solving problems on strings. The book Algorithms on
More informationImproved Circuit-to-CNF Transformation for SAT-based ATPG
Improved Ciruit-to-CNF Transformation for SAT-based ATPG Daniel Tille 1 René Krenz-Bååth 2 Juergen Shloeffel 2 Rolf Drehsler 1 1 Institute of Computer Siene, University of Bremen, 28359 Bremen, Germany
More informationPartial Character Decoding for Improved Regular Expression Matching in FPGAs
Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia
More informationImproved Real-Time Shadow Mapping for CAD Models
Improved Real-Time Shado Mapping for CAD Models Vitor Barata R. B. Barroso TeGraf, Computer Siene Dept., PUC-Rio vbarata@tegraf.pu-rio.br Waldemar Celes TeGraf, Computer Siene Dept., PUC-Rio eles@tegraf.pu-rio.br
More informationMethods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems
Methods for Multi-Dimensional Robustness Optimization in Complex Embedded Systems Arne Hamann, Razvan Rau, Rolf Ernst Institute of Computer and Communiation Network Engineering Tehnial University of Braunshweig,
More informationSpace- and Time-Efficient BDD Construction via Working Set Control
Spae- and Time-Effiient BDD Constrution via Working Set Control Bwolen Yang Yirng-An Chen Randal E. Bryant David R. O Hallaron Computer Siene Department Carnegie Mellon University Pittsburgh, PA 15213.
More informationReading Object Code. A Visible/Z Lesson
Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly
More informationA Numerical optimization technique for the design of airfoils in viscous flows
Rohester Institute of Tehnology RIT Sholar Works Theses Thesis/Dissertation Colletions 7-1-1995 A Numerial optimization tehnique for the design of airfoils in visous flows Robert MaNeill Follow this and
More informationAn Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index
IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive
More informationBSPLND, A B-Spline N-Dimensional Package for Scattered Data Interpolation
BSPLND, A B-Spline N-Dimensional Pakage for Sattered Data Interpolation Mihael P. Weis Traker Business Systems 85 Terminal Drive, Suite Rihland, WA 995-59-946-544 mike@vidian.net Robert R. Lewis Washington
More informationThe Implementation of RRTs for a Remote-Controlled Mobile Robot
ICCAS5 June -5, KINEX, Gyeonggi-Do, Korea he Implementation of RRs for a Remote-Controlled Mobile Robot Chi-Won Roh*, Woo-Sub Lee **, Sung-Chul Kang *** and Kwang-Won Lee **** * Intelligent Robotis Researh
More information