Optimal Multiple Sprite Generation based on Physical Camera Parameter Estimation

Size: px
Start display at page:

Download "Optimal Multiple Sprite Generation based on Physical Camera Parameter Estimation"

Transcription

1 Otimal Multile Srite Generation based on Physical Camera Parameter Estimation Matthias Kunter* a, Andreas Krutz a, Mrinal Mandal b, Thomas Sikora a a Commun. Systems Grou, Technische Universität Berlin, Einsteinufer 17, 1587 Berlin, Germany b Det. of Electrical & Comuter Engineering, University of Alberta, Edmonton, Canada T6G 2V4 ABSTRACT We resent a robust and comutational low comlex method to estimate the hysical camera arameters, intrinsic and extrinsic, for scene shots catured by cameras alying an, tilt, rotation, and zoom. These arameters are then used to slit a sequence of frames into several subsequences in an otimal way to generate multile srites. Hereby, otimal means a minimal usage of memory while keeing or even imroving the reconstruction quality of the scene background. Since wide angles between two frames of a scene shot cause geometrical distortions using a ersective maing it is necessary to art the shot into several subsequences. In our aroach it is not mandatory that all frames of a subsequence are adjacent frames in the original scene. Furthermore the angle-based classification allows frame reordering and makes our aroach very owerful. Keywords: camera calibration, image mosaicing, multile srites, srite generation 1. INTRODUCTION The growing comutational ower of today s comuting systems allows modern video analysis and coding tools to aly more comlex methods. Therefore, object based aroaches are now attracting a great deal of attention. In current hybrid video coding algorithms like MPEG-4, object based schemes are standardized for a long time but reliable all-urose algorithms roviding those objects do emerge only sarsely. A owerful tool to minimize coding costs is the srite coding tool 6. A background srite, also known as video mosaic, is the summarization of all rigid background objects of a video shot into one oversized image 2,3. Unfortunately, a universal aroach to determine the limits of srite generation is not available.. In this work, we aroach the roblem of limiting srites by roviding an efficient algorithm dividing a single video shot into a number of sub-shots based on a robust estimation of intrinsic and extrinsic camera arameters. The artition of the shots and thus a construction of multile srites is necessary due to geometrical distortions caused by the ersective image transformation, which is the aroriate maing for two image lanes in 3D sace, assuming only very small lens distortions 2. The ersective maing is given by x = H ( m) x x h a1 a2 a x y h = b1 b2 b y, (1) h c 1 c2 1 1 where (x,y) T are the coordinates of the reference image and (x,y ) T the corresonding oints in the image to register. The vector m=[a..a 2,b..b 2,c 1,c 2 ] is the arameter vector. Note that (1) is written in homogeneous coordinates, thus k H H for all k ú\{}. If the maing angle for a oint corresondence aroaches 9, i.e. c 1 x+c 2 y -1, the srite size grows towards infinity. Hence it is obvious that the srite has to be arted. The maing H(m) in equation (1), also known as homograhy, can be decomosed into a matrix F of internal camera arameters and a rotation matrix R x h x f ox x y h = F R y = f oy Rϕ R R y z ϕx ϕy. (2) h * kunter@nue.tu-berlin.de; hone ; fax ;

2 Without loss of generality we can omit the coordinates of rincile oint (o x,o y ) T while defining the image middle as the oint of origin. Thus, F can be reduced to a diagonal matrix containing focal length f n. R is a rotation matrix comosed of three rotations about y-, x-, and z-axis using Euler angles. In our work the video shot is divided in an otimal sense, which means that we obtain a minimum memory cost for the multi-srites. In order to reach this goal, we determine the hysical camera arameters esecially the focal length f i and rotation angles ϕ y,i and ϕ x,i and derive a discrete criteria for the estimation of the number of sub-srites. Estimation of camera arameters is an imortant task in image and video rocessing. The objective of the estimation techniques is to comute the intrinsic and/or extrinsic arameters of the camera, which was used to shoot a articular video. The estimated arameters can be used in many alications such as content analysis and 3D video Multile Srites Farin 1 roosed a technique for construction of multile srites with minimal coding costs based on the estimation of the size of the surrounding rectangle. In order to find the best solution, he determines the bounding box size for every air of frames i, k, being first and last frame of a sub-srite while testing every reference frame F r (i r k). Tracing back the cost values from the last frame one obtains the otimal sequence artitioning for srite construction. However, the algorithm still works sequentially, i.e. all frames that comose a sub-srite are always adjacent frames of the original shot. Additionally, the algorithm itself remains structurally comlex even if the cost comutation can be simlified. In our aroach we rely on a very comrehensible hysical camera arameter based sequence artitioning. If the camera angle between two views of a scene becomes too wide, i.e. the ersective distortion causes huge srite image sizes, the overall angle (an and/or tilt) will be arted into M angles of equal size. Thus, the artition algorithm yields in the calculation of M ot minimizing a simle cost function deending on the camera arameter set. One advantage of our aroach is the ossible reordering of the frames. Therefore, unlike other methods, frames of different temoral ositions can comose one sub-srite. 1.2 Calibration based aroach Figure 1 shows the flowchart of our roosed multile srite generation technique. In a first state we calculate the ersective transformation to register every frame F i of a sequence with resect to the reference frame F while generating a reliminary srite as roosed in our earlier work 4. If it is imossible to create one reliminary srite for the whole sequence we generate several srites with the last ossible registered frame as new reference frame F r. Second, intrinsic and extrinsic camera arameters are estimated robustly. Then, according to the calibration results we art the video sequence into M subsequences and construct the multile srites S to S M-1. The remainder of the aer is organized as follows. A quick overview of the reliminary srite generation technique is given in section 2. The estimation of hysical camera arameters and the shot artition into several sequences is described in section 3. Section 4 exlains the final construction of the multile srites. In section 5 we show our exerimental results where the quality of our calibration technique is assessed and effectiveness of the multile srite generation scheme is measured. Section 6 concludes the aer. video shot Preliminary frame-tosriteregistration H H 1,,N 1 Physical camera arameter estimation ( ϕx ϕy ϕz) Partition of video shot according to focal length and rotation angles f i Construction of srites for every sub-sequence S SM 1 Fig. 1. Flowchart of the roosed calibration based multile srite generation aroach 2. IMAGE REGISTRATION AND PRELIMINARY SPRITE GENERATION As shown in Fig. 1, reliminary srite generation is the first ste in our roosed technique. In this section, we resent the details of the image registration and srite generation used in our aer. The flowchart of our srite generation aroach is shown in Fig. 2. The rocess can be divided into two arts, the image registration and the blending rocess. In the image registration rocess otimal transformation arameters for waring the actual frame I n into the reference

3 coordinate system of Srite S n-1 are calculated. Since the convergence of a high order transformation calculation is very critical we aly hierarchical arameter estimation starting with feature-based robust estimation of the affine transformation arameters (a a 2, b b 2, c 1 =c 2 =) between consecutive frames I n and I n-1. As robust estimation rocedure the Monte Carlo tye random samle consensus (RANSAC) 8 algorithm is used. These short-term arameters are then otimized using Levenberg-Marquardt gradient energy minimization. The energy function is reresented by 1 1 E( n ) = I ( x, y ) I ( x,y ) 2 N Ω (x,y) Ω ( ) 2 n 1 n (3) Srite S n-1 Frame I n-1 Frame I n Robust Feature based Estimation Affine Transf. Gradient based Estimation Affine Transf. Concatenation of Short- and Long- Term Parameter Gradient based Estimation Homograhy H F inal Parameter Set (Long-Term) Srite Udate of newly discovered areas Initial Parameter Set (Short-Term) F inal Parameter Set (Short-Term) Initial Parameter Set (Long-Term) Srite S n Fig. 2. Flowchart of the srite construction rocess (left) and art of reliminary srite of sequence Charlottenburg (right) see artifacts of the indeendently moving foreground object The concatenation of short-term transformation arameters m n,affine with reviously comuted long-term arameters m n-1,ers using H = H H (4),n n 1,n,n 1 is refined by a direct frame-to-srite estimation of the Homograhy H,n alying Levenberg-Marquardt again. Thus, an oen-loo based accumulation of registration errors is revented. In order to do the direct frame-to-srite estimation a reliminary srite is generated and udated for every registered frame. This is achieved by simly blending newly discovered content into the srite. It is clear that indeendently moving foreground objects will distort the visual image quality. However, due to robust registration the arameter estimation will not be affected. Result of this rocess is a set of homograhies {H,1 H,N-1 } that relate every frame I n with n=,,n-1 to the reference image I and can be written as 1 f n f H,n = Hn H = Fn R,n F = fn Rϕ R R f z ϕx ϕ, (5) y 1 1 where R,n defines the rotation matrix between view and view n.

4 x y F -1 Rotation ϕ y Rotation ϕ x F n x y Rotation ϕ z x y Fig. 3. Scheme of the decomosition of homograhy H(m) into several hysical based extrinsic and intrinsic arameter matrices. Note that vector x and x lie in the same image lane and have the same vector norm: 2x 2=2x 2. view x f x view n f 1 ϕ Fig. 4. On the derivation of ratio α,n between the focal lengths of two views of a scene catured with rotating and zooming camera 3. ESTIMATION OF CAMERA PARAMETERS AND SHOT PARTITIONING The use of Euler angles for the decomosition of homograhies can be difficult because of ossible singularities having imact on the numerical stability 7. On the other hand the order of the three indeendent rotations (y-axis, x-axis, and z- axis) can be chosen arbitrarily. Thus, we can write H,n as 1 1,n n ϕz ϕx ϕy ϕz n ϕx ϕy H = F R R R F = R F R R F. (6) Figure 3 shows the decomosed transformation scheme. The final transformation about the z-axis can be regarded as inlane rotation. Hence, for comutation based on vector norms 2 2 in 2D Euclidean sace this rotation can be neglected. The in-lane rotation has also no influence for the rincial oints =(,,1) T and =(,,1) T. 3.1 Camera Parameter Estimation Since for common cameras the rincial oint =(x,y,1) T =(,,1) lies in the image middle the focal ratio can be comuted as α f x tan ϕ,n = = = fn x tan ϕ x x, (7) where x is the image of the rincial oint of view n in view and x the image of the rincial oint of view in view n. See Figure 4 for derivation of equation (7). Having the ratio α of focal length for all image airs, n (1 n N-1) the value for the focal length f is comuted as median value of all real solutions alying Szelisky s linear method 2. Rewriting equation (5) we obtain

5 Fig. 5. Partition of one srite into two subsrites for constant focal length (constant FOV) along horizontal dimension. See that the overall size of the two subsrites is smaller than the original srite due to geometrical distortions. The reference frame is chosen as the middle frame with resect to the view s absolute angle. The field of view (FOV) is marked as gray. r r1 fr2 h h1 h2 1 H,n = r1 r11 fr12 h1 h11 h12 α =. (8),n r 2α,n f r21α,n f r22α,n h2 h21 h 22 Taking into account the orthogonality constraint for row vectors and column vectors of R as well as the vector norm constraint for rows and columns we can arrange 12 indeendent equations for the calculation of focal length f. Note that we obtain 12 equations for every homograhy H,n with n=1,, N-1. From all real solutions we choose the median as final value. As our exerimental results show, this method yields accurate results for a minimum number of frames in a scene, which lies between 15 and 25 frames deending on the sequences. The angles of the rotations are then estimated directly using the images of both rincial oints. Inverting equation (6) yields in which follows in sinϕycosϕy h x = FRϕ R F sin y ϕx n Rϕ = F R R F z ϕy ϕx n = F ϕx, (9) cosϕycosϕ y ftanϕ y tanϕx x = f cosϕ. (1) y 1 After calculating angles ϕ y and ϕ x we can determine the image of rincial oint in the reference image before and after the final z-rotation n ϕx H,n 1 h x = F R Rϕ F y. (11) h x = ϕ z is now calculated as difference of the absolute angles of vector x and x with the horizontal line. ϕz = ϕz ϕz with y y tan ϕz = and tan ϕz =. (12) x x

6 3.2 Shot Partitioning To slit a video shot into several sequences, we first comute angle division for the rotation angle (ϕ y or ϕ x ) with the maximum overall rotation ϕ max. We minimize cost function C with resect to the number of angles M in order to find the number of srites to be generated for one rotation lane. M 1 ϕmax FOV C( ϕmax,m ) = fmax,i 2tan + 2M 2 (13) i= Factor f max,i describes the maximum focal length within the set of frames classified by a certain angle range i ϕ max /N ϕ ϕ min (i+1) ϕ max. The field of view (FOV) is the average aerture angle for the same subset of frames. An examle for subdivision along one dimension is given in Figure 5. After subdividing the sequence in one rotation lane (an or tilt), we aly equation 3 for the erendicular lane as well. Thus, we handle the sequence division as a searable roblem, which is only an aroximation for the non-searable ersective maing. However, for small angles ϕ max /N the introduced error is negligible. Beside its low comutational comlexity this aroach has the advantage that views that are relative close in sace are classified into on subsrite even if they are temoral divided by views classified into another subsrite. 4. MULTIPLE SPRITE CONSTRUCTION In this section we describe the eventual generation of the multile srites for the different subsequences of the video shot. It can be achieved in two stes. First the exact registration into the articular reference frame coordinate system is achieved by direct estimation using the LM-energy minimization framework of section 2. As reference image always the frame I r with rotation angle ϕ closest to the medium angle of a subsequence is used. Since this frame is not the frame with the biggest zoom the reference frame coordinate system is scaled by i fmax s =, (14) f where f i max is the maximum focal length within a subsequence. Thus, we revent resolution degradation due to subsamling of images during the waring rocess. In a second ste we robustly blend the contents of all transformed and wared frames of a subsequence into the final srite. In order to remove artifacts of indeendently moving foreground objects temoral filtering is erformed. Under all ixel candidates we consider only those ixels which hold ( ) τ ( τ ) τ with m= median Iυ ( T r υ(x,y )). I T ( x, y ) m A median I T ( x, y ) m n r n r υ r ( ) T r n ( ) reresents the transformation from the reference frame to a frame at time n. In order to minimize the lowass effect as a result of ixel interolation, out of these candidates the ixel with smallest distance d to integer osition in the original frame is chosen. To enhance the background reconstruction quality additionally correlation analysis can be conducted, which unfortunately would also increase the algorithms comlexity. 5. EXPERIMENTAL RESULTS In this section we first demonstrate the exactness of our calibration technique (section 5.1) while comaring the estimated camera arameter for a synthetic scene with the ones used for rendering the scene. In section 5.2 we deict the results for srite artitioning for real scenes. (15) 5.1 Sequence with ground truth Calibration accuracy Figures 7 and 8 comare the curves of the estimated camera arameters with the original ones of the rendered scene TUB-room (Fig. 6). The reliminary srite is also shown in Figure 7. As the results show, focal length and rotation angles are estimated very exactly. The maximum relative error for the focal length is less than 2% and the maximum

7 angle deviation is about 2 degree. To strengthen our arameter estimation result, we comare the vector norms 2x 2and 2x 2 (images of rincial oint in the reference frame) obtained in two different ways according to equation (11). Smaller values for the difference between these two absolute values indicate a more exact estimation. The diagram in Figure 7 deicts this distance differences 2x 2-2x 2 over all frames of the sequence. The maximal deviation is only about ixels. Fig. 6. Exemlary frames of rendered sequence TUB-room, frame, 5, 1, 15 (left to right 44% of original size). 5 x diff. of vector magnitudes Fig. 7. Preliminary srite of synthetic sequence TUB-room for calibration accuracy assessment (left); Difference 2x 2-2x 2 for vector norm of images x and x of rincial oint (view ), sequence TUB-room (right) small values indicate an accurate estimation of rotation angles ϕ y and ϕ x and focal length f n with resect to homograhy H,n and its inverse H n, =(H,n ) -1 focal lenght in ixel angle in degree y-rot x-rot z-rot Fig. 8. Comarison of estimation (solid) with ground truth values (dashed) for focal length (left) and rotation angles (right)

8 5.2 Sequences without ground truth We calculated extrinsic and intrinsic camera arameters for the well-known Stefan sequence. Since the anning angle is too wide to construct only one reliminary srite a second one was generated using the last registered frame as reference frame. The left diagram of Figure 9 shows the obtained focal length for this sequence comared to the result calculated with a commercial alication (Boujou) 9. The relative difference is about 8.5%. Note that the commercial result is no real ground truth data. The rotation angles (Figure 9 right) are very similar to those estimated with nonlinear methods in Farin s aroach 7. As indication of the calibration accuracy of this method as well the vector length of the reference rincile oint images is comared for 2x 2and 2x 2 (Figure 12). The maximum difference is about ixels. The sequence was then slit into three subsequences according to equation (13) based on the horizontal rotation. Since only very small vertical rotation aears no further artitioning along the erendicular dimension was rocessed. In Figure 9 the artitioning borders and the assignment of frames to the three srites is deicted. The srite obtained by a one-srite-aroach and the generated multile srites are shown in Figures 1 and 11. From the size of the surrounding rectangles it can be seen that memory cost is much higher for the single srite even if not all 3 frames of the sequence are registered. Additionally, we comared the comressed file sizes for the one-srite-aroach (only 264 frames) and the multilesrite-aroach. The amount of data was reduced by 77.4% (Table 1) in the comressed domain at quality level 75 for JPEG comression. Thus we can arove the results for multile srite memory cost minimization found in focal lenght in ixel Proosed method Commercial alication y-rotation -1 x-rotation z-rotation Fig. 9. Focal length (left) and rotation angles with artitions (right) for sequence Stefan angle in degree Srite 1 Srite 2 Srite 3 Fig. 1. Single-srite-aroach - Stefan frame to 263 (9% of orig. size: 6921x2592el).

9 Fig. 11. Multile-srite-aroach Stefan (35% of original size: 11x317 el, frame to 244 uer; 799x317 el, frame 245 to 261 lower left; 679x261 el, frame 262 to 299 lower right). 2 x diff. of vector magnitudes Fig. 12. Difference of vector magnitudes of reference rincile oint images (sequence Stefan ) File sizes for JPEG comression Image Single-srite-aroach (Quality level 75) Srite 1 - multi-srite-aroach (QL 75) Srite 2 - multi-srite-aroach (QL 75) Srite 3 - multi-srite-aroach (QL 75) File Size 694 kbyte 63 kbyte 49 kbyte 45 kbyte Tab. 1. Comarison of file sizes for single and multi-srites

10 6. SUMMARY AND CONCLUSION We resented a geometry based aroach for generation of multile srites for scenes recorded with cameras alying an, tilt, roll, and zoom. In order to derive a rule for subdivision of the video shots, fast and effective intrinsic and extrinsic camera arameter estimation was conducted. Because it is only alied for angle based shot artitioning the calibration does not have to satisfy maximal accuracy constraints. More imortant for this aroach are robustness and low comlexity. However, results have shown that our estimation of camera arameters is very close to other calibration techniques. The construction of multile srites minimizes the memory cost for the background which is an imortant matter for srite based video comression algorithms. Moreover, the reconstruction quality can be reserved or even imroved in case of changing background objects. The main advantage over other multile srite techniques is the ossibility of clustering of temoral non-successive frames into one subsrite. ACKNOWLEDGMENT This work was develoed within 3DTV (FP6-PLT DTV), a Euroean Network of Excellence funded under the Euroean Commission IST FP6 rogramme. REFERENCES 1. D. Farin, P. H.N. de With, W. Effelsberg, Minimizing MPEG-4 Srite Coding-Cost Using Multile Srites, in SPIE Visual Comm. and Image Proc. (VCIP), vol. 538, Jan R. Szelisky, H.-Y. Shum, Creating full view anoramic image mosaics and environment mas, in Comuter Grahics, Annual Converence Series, vol. 31, A. Smolic, T. Sikora, and J.-R. Ohm, Long-Term Global Motion Estimation and Its Alication for Srite Coding, Content Descrition, and Segmentation, IEEE Trans. Circuits Syst. Video Technol., vol. 9(8)., , Dec M. Kunter, J. Kim, T. Sikora, Suer-resolution Mosaicing using Embedded Hybrid Recursive Flow-based Segmentation, Int. Conf. on Information, Communications and Signal Processing (ICICS '5), Dec A. Iketani, et al., Suer-resolved video mosaicing for documents based on extrinsic camera arameter estimation, in Proc. of the 7th Asian Conference on Comuter Vision, (ACCV), vol. 3852, T. Sikora, The MPEG-4 video standard verification model, IEEE Trans. Circuits Syst. Video Technol., vol. 15, , D. Farin, P. H. N. de With, Estimating Physical Camera Parameters based on Multi-Srite Motion Estimation, in SPIE Image and Video Communications and Processing, vol. 5685, January M. A. Fischler and R. C. Bolles, Random samle consensus: a aradigm for model fitting with alications to image analysis and auto-mated cartograhy, Commun. ACM, vol. 24, no. 6, , htt://

An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2

An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2 An Efficient Coding Method for Coding Region-of-Interest Locations in AVS2 Mingliang Chen 1, Weiyao Lin 1*, Xiaozhen Zheng 2 1 Deartment of Electronic Engineering, Shanghai Jiao Tong University, China

More information

Learning Motion Patterns in Crowded Scenes Using Motion Flow Field

Learning Motion Patterns in Crowded Scenes Using Motion Flow Field Learning Motion Patterns in Crowded Scenes Using Motion Flow Field Min Hu, Saad Ali and Mubarak Shah Comuter Vision Lab, University of Central Florida {mhu,sali,shah}@eecs.ucf.edu Abstract Learning tyical

More information

Face Recognition Using Legendre Moments

Face Recognition Using Legendre Moments Face Recognition Using Legendre Moments Dr.S.Annadurai 1 A.Saradha Professor & Head of CSE & IT Research scholar in CSE Government College of Technology, Government College of Technology, Coimbatore, Tamilnadu,

More information

A Novel Iris Segmentation Method for Hand-Held Capture Device

A Novel Iris Segmentation Method for Hand-Held Capture Device A Novel Iris Segmentation Method for Hand-Held Cature Device XiaoFu He and PengFei Shi Institute of Image Processing and Pattern Recognition, Shanghai Jiao Tong University, Shanghai 200030, China {xfhe,

More information

SPARSE SIGNAL REPRESENTATION FOR COMPLEX-VALUED IMAGING Sadegh Samadi 1, M üjdat Çetin 2, Mohammad Ali Masnadi-Shirazi 1

SPARSE SIGNAL REPRESENTATION FOR COMPLEX-VALUED IMAGING Sadegh Samadi 1, M üjdat Çetin 2, Mohammad Ali Masnadi-Shirazi 1 SPARSE SIGNAL REPRESENTATION FOR COMPLEX-VALUED IMAGING Sadegh Samadi 1, M üjdat Çetin, Mohammad Ali Masnadi-Shirazi 1 1. Shiraz University, Shiraz, Iran,. Sabanci University, Istanbul, Turkey ssamadi@shirazu.ac.ir,

More information

Stereo Disparity Estimation in Moment Space

Stereo Disparity Estimation in Moment Space Stereo Disarity Estimation in oment Sace Angeline Pang Faculty of Information Technology, ultimedia University, 63 Cyberjaya, alaysia. angeline.ang@mmu.edu.my R. ukundan Deartment of Comuter Science, University

More information

521493S Computer Graphics Exercise 3 (Chapters 6-8)

521493S Computer Graphics Exercise 3 (Chapters 6-8) 521493S Comuter Grahics Exercise 3 (Chaters 6-8) 1 Most grahics systems and APIs use the simle lighting and reflection models that we introduced for olygon rendering Describe the ways in which each of

More information

Extracting Optimal Paths from Roadmaps for Motion Planning

Extracting Optimal Paths from Roadmaps for Motion Planning Extracting Otimal Paths from Roadmas for Motion Planning Jinsuck Kim Roger A. Pearce Nancy M. Amato Deartment of Comuter Science Texas A&M University College Station, TX 843 jinsuckk,ra231,amato @cs.tamu.edu

More information

A Model-Adaptable MOSFET Parameter Extraction System

A Model-Adaptable MOSFET Parameter Extraction System A Model-Adatable MOSFET Parameter Extraction System Masaki Kondo Hidetoshi Onodera Keikichi Tamaru Deartment of Electronics Faculty of Engineering, Kyoto University Kyoto 66-1, JAPAN Tel: +81-7-73-313

More information

Sensitivity Analysis for an Optimal Routing Policy in an Ad Hoc Wireless Network

Sensitivity Analysis for an Optimal Routing Policy in an Ad Hoc Wireless Network 1 Sensitivity Analysis for an Otimal Routing Policy in an Ad Hoc Wireless Network Tara Javidi and Demosthenis Teneketzis Deartment of Electrical Engineering and Comuter Science University of Michigan Ann

More information

Efficient Parallel Hierarchical Clustering

Efficient Parallel Hierarchical Clustering Efficient Parallel Hierarchical Clustering Manoranjan Dash 1,SimonaPetrutiu, and Peter Scheuermann 1 Deartment of Information Systems, School of Comuter Engineering, Nanyang Technological University, Singaore

More information

A STUDY ON CALIBRATION OF DIGITAL CAMERA

A STUDY ON CALIBRATION OF DIGITAL CAMERA A STUDY ON CALIBRATION OF DIGITAL CAMERA Ryuji Matsuoka a, *, Kiyonari Fukue a, Kohei Cho a, Haruhisa Shimoda a, Yoshiaki Matsumae a, Kenji Hongo b, Seiju Fujiwara b a Tokai University Research & Information

More information

Robust Motion Estimation for Video Sequences Based on Phase-Only Correlation

Robust Motion Estimation for Video Sequences Based on Phase-Only Correlation Robust Motion Estimation for Video Sequences Based on Phase-Only Correlation Loy Hui Chien and Takafumi Aoki Graduate School of Information Sciences Tohoku University Aoba-yama 5, Sendai, 98-8579, Jaan

More information

Grouping of Patches in Progressive Radiosity

Grouping of Patches in Progressive Radiosity Grouing of Patches in Progressive Radiosity Arjan J.F. Kok * Abstract The radiosity method can be imroved by (adatively) grouing small neighboring atches into grous. Comutations normally done for searate

More information

AUTOMATIC EXTRACTION OF BUILDING OUTLINE FROM HIGH RESOLUTION AERIAL IMAGERY

AUTOMATIC EXTRACTION OF BUILDING OUTLINE FROM HIGH RESOLUTION AERIAL IMAGERY AUTOMATIC EXTRACTION OF BUILDING OUTLINE FROM HIGH RESOLUTION AERIAL IMAGERY Yandong Wang EagleView Technology Cor. 5 Methodist Hill Dr., Rochester, NY 1463, the United States yandong.wang@ictometry.com

More information

Improved Image Super-Resolution by Support Vector Regression

Improved Image Super-Resolution by Support Vector Regression Proceedings of International Joint Conference on Neural Networks, San Jose, California, USA, July 3 August 5, 0 Imroved Image Suer-Resolution by Suort Vector Regression Le An and Bir Bhanu Abstract Suort

More information

10. Parallel Methods for Data Sorting

10. Parallel Methods for Data Sorting 10. Parallel Methods for Data Sorting 10. Parallel Methods for Data Sorting... 1 10.1. Parallelizing Princiles... 10.. Scaling Parallel Comutations... 10.3. Bubble Sort...3 10.3.1. Sequential Algorithm...3

More information

P Z. parametric surface Q Z. 2nd Image T Z

P Z. parametric surface Q Z. 2nd Image T Z Direct recovery of shae from multile views: a arallax based aroach Rakesh Kumar. Anandan Keith Hanna Abstract Given two arbitrary views of a scene under central rojection, if the motion of oints on a arametric

More information

AUTOMATIC 3D SURFACE RECONSTRUCTION BY COMBINING STEREOVISION WITH THE SLIT-SCANNER APPROACH

AUTOMATIC 3D SURFACE RECONSTRUCTION BY COMBINING STEREOVISION WITH THE SLIT-SCANNER APPROACH AUTOMATIC 3D SURFACE RECONSTRUCTION BY COMBINING STEREOVISION WITH THE SLIT-SCANNER APPROACH A. Prokos 1, G. Karras 1, E. Petsa 2 1 Deartment of Surveying, National Technical University of Athens (NTUA),

More information

Last time: Disparity. Lecture 11: Stereo II. Last time: Triangulation. Last time: Multi-view geometry. Last time: Epipolar geometry

Last time: Disparity. Lecture 11: Stereo II. Last time: Triangulation. Last time: Multi-view geometry. Last time: Epipolar geometry Last time: Disarity Lecture 11: Stereo II Thursday, Oct 4 CS 378/395T Prof. Kristen Grauman Disarity: difference in retinal osition of same item Case of stereo rig for arallel image lanes and calibrated

More information

Wavelet Based Statistical Adapted Local Binary Patterns for Recognizing Avatar Faces

Wavelet Based Statistical Adapted Local Binary Patterns for Recognizing Avatar Faces Wavelet Based Statistical Adated Local Binary atterns for Recognizing Avatar Faces Abdallah A. Mohamed 1, 2 and Roman V. Yamolskiy 1 1 Comuter Engineering and Comuter Science, University of Louisville,

More information

EE678 Application Presentation Content Based Image Retrieval Using Wavelets

EE678 Application Presentation Content Based Image Retrieval Using Wavelets EE678 Alication Presentation Content Based Image Retrieval Using Wavelets Grou Members: Megha Pandey megha@ee. iitb.ac.in 02d07006 Gaurav Boob gb@ee.iitb.ac.in 02d07008 Abstract: We focus here on an effective

More information

An Efficient Video Program Delivery algorithm in Tree Networks*

An Efficient Video Program Delivery algorithm in Tree Networks* 3rd International Symosium on Parallel Architectures, Algorithms and Programming An Efficient Video Program Delivery algorithm in Tree Networks* Fenghang Yin 1 Hong Shen 1,2,** 1 Deartment of Comuter Science,

More information

Figure 8.1: Home age taken from the examle health education site (htt:// Setember 14, 2001). 201

Figure 8.1: Home age taken from the examle health education site (htt://  Setember 14, 2001). 201 200 Chater 8 Alying the Web Interface Profiles: Examle Web Site Assessment 8.1 Introduction This chater describes the use of the rofiles develoed in Chater 6 to assess and imrove the quality of an examle

More information

Face Recognition Based on Wavelet Transform and Adaptive Local Binary Pattern

Face Recognition Based on Wavelet Transform and Adaptive Local Binary Pattern Face Recognition Based on Wavelet Transform and Adative Local Binary Pattern Abdallah Mohamed 1,2, and Roman Yamolskiy 1 1 Comuter Engineering and Comuter Science, University of Louisville, Louisville,

More information

A CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH

A CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH A CLASS OF STRUCTURED LDPC CODES WITH LARGE GIRTH Jin Lu, José M. F. Moura, and Urs Niesen Deartment of Electrical and Comuter Engineering Carnegie Mellon University, Pittsburgh, PA 15213 jinlu, moura@ece.cmu.edu

More information

Introduction to Image Compresion

Introduction to Image Compresion ENEE63 Fall 2 Lecture-7 Introduction to Image Comresion htt://www.ece.umd.edu/class/enee63/ minwu@eng.umd.edu M. Wu: ENEE63 Digital Image Processing (Fall') Min Wu Electrical & Comuter Engineering Univ.

More information

Texture Mapping with Vector Graphics: A Nested Mipmapping Solution

Texture Mapping with Vector Graphics: A Nested Mipmapping Solution Texture Maing with Vector Grahics: A Nested Mimaing Solution Wei Zhang Yonggao Yang Song Xing Det. of Comuter Science Det. of Comuter Science Det. of Information Systems Prairie View A&M University Prairie

More information

Patterned Wafer Segmentation

Patterned Wafer Segmentation atterned Wafer Segmentation ierrick Bourgeat ab, Fabrice Meriaudeau b, Kenneth W. Tobin a, atrick Gorria b a Oak Ridge National Laboratory,.O.Box 2008, Oak Ridge, TN 37831-6011, USA b Le2i Laboratory Univ.of

More information

Matlab Virtual Reality Simulations for optimizations and rapid prototyping of flexible lines systems

Matlab Virtual Reality Simulations for optimizations and rapid prototyping of flexible lines systems Matlab Virtual Reality Simulations for otimizations and raid rototying of flexible lines systems VAMVU PETRE, BARBU CAMELIA, POP MARIA Deartment of Automation, Comuters, Electrical Engineering and Energetics

More information

Graph Cut Matching In Computer Vision

Graph Cut Matching In Computer Vision Grah Cut Matching In Comuter Vision Toby Collins (s0455374@sms.ed.ac.uk) February 2004 Introduction Many of the roblems that arise in early vision can be naturally exressed in terms of energy minimization.

More information

Perception of Shape from Shading

Perception of Shape from Shading 1 Percetion of Shae from Shading Continuous image brightness variation due to shae variations is called shading Our ercetion of shae deends on shading Circular region on left is erceived as a flat disk

More information

MATHEMATICAL MODELING OF COMPLEX MULTI-COMPONENT MOVEMENTS AND OPTICAL METHOD OF MEASUREMENT

MATHEMATICAL MODELING OF COMPLEX MULTI-COMPONENT MOVEMENTS AND OPTICAL METHOD OF MEASUREMENT MATHEMATICAL MODELING OF COMPLE MULTI-COMPONENT MOVEMENTS AND OPTICAL METHOD OF MEASUREMENT V.N. Nesterov JSC Samara Electromechanical Plant, Samara, Russia Abstract. The rovisions of the concet of a multi-comonent

More information

2-D Fir Filter Design And Its Applications In Removing Impulse Noise In Digital Image

2-D Fir Filter Design And Its Applications In Removing Impulse Noise In Digital Image -D Fir Filter Design And Its Alications In Removing Imulse Noise In Digital Image Nguyen Thi Huyen Linh 1, Luong Ngoc Minh, Tran Dinh Dung 3 1 Faculty of Electronic and Electrical Engineering, Hung Yen

More information

Vehicle Logo Recognition Using Modest AdaBoost and Radial Tchebichef Moments

Vehicle Logo Recognition Using Modest AdaBoost and Radial Tchebichef Moments Proceedings of 0 4th International Conference on Machine Learning and Comuting IPCSIT vol. 5 (0) (0) IACSIT Press, Singaore Vehicle Logo Recognition Using Modest AdaBoost and Radial Tchebichef Moments

More information

arxiv: v1 [cs.mm] 18 Jan 2016

arxiv: v1 [cs.mm] 18 Jan 2016 Lossless Intra Coding in with 3-ta Filters Saeed R. Alvar a, Fatih Kamisli a a Deartment of Electrical and Electronics Engineering, Middle East Technical University, Turkey arxiv:1601.04473v1 [cs.mm] 18

More information

A simulated Linear Mixture Model to Improve Classification Accuracy of Satellite. Data Utilizing Degradation of Atmospheric Effect

A simulated Linear Mixture Model to Improve Classification Accuracy of Satellite. Data Utilizing Degradation of Atmospheric Effect A simulated Linear Mixture Model to Imrove Classification Accuracy of Satellite Data Utilizing Degradation of Atmosheric Effect W.M Elmahboub Mathematics Deartment, School of Science, Hamton University

More information

IMS Network Deployment Cost Optimization Based on Flow-Based Traffic Model

IMS Network Deployment Cost Optimization Based on Flow-Based Traffic Model IMS Network Deloyment Cost Otimization Based on Flow-Based Traffic Model Jie Xiao, Changcheng Huang and James Yan Deartment of Systems and Comuter Engineering, Carleton University, Ottawa, Canada {jiexiao,

More information

Bayesian Oil Spill Segmentation of SAR Images via Graph Cuts 1

Bayesian Oil Spill Segmentation of SAR Images via Graph Cuts 1 Bayesian Oil Sill Segmentation of SAR Images via Grah Cuts 1 Sónia Pelizzari and José M. Bioucas-Dias Instituto de Telecomunicações, I.S.T., TULisbon,Lisboa, Portugal sonia@lx.it.t, bioucas@lx.it.t Abstract.

More information

CS 450: COMPUTER GRAPHICS 2D TRANSFORMATIONS SPRING 2016 DR. MICHAEL J. REALE

CS 450: COMPUTER GRAPHICS 2D TRANSFORMATIONS SPRING 2016 DR. MICHAEL J. REALE CS 45: COMUTER GRAHICS 2D TRANSFORMATIONS SRING 26 DR. MICHAEL J. REALE INTRODUCTION Now that we hae some linear algebra under our resectie belts, we can start ug it in grahics! So far, for each rimitie,

More information

EFFICIENT STOCHASTIC GRADIENT SEARCH FOR AUTOMATIC IMAGE REGISTRATION

EFFICIENT STOCHASTIC GRADIENT SEARCH FOR AUTOMATIC IMAGE REGISTRATION ISSN 76-459 Int j simul model 6 (7), 4-3 Original scientific aer EFFICIENT STOCHASTIC GRADIENT SEARCH FOR AUTOMATIC IMAGE REGISTRATION Li, Q.; Sato, I. & Murakami, Y. GSJ/AIST - National Institute of Advanced

More information

AUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS. Ren Chen and Viktor K.

AUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS. Ren Chen and Viktor K. inuts er clock cycle Streaming ermutation oututs er clock cycle AUTOMATIC GENERATION OF HIGH THROUGHPUT ENERGY EFFICIENT STREAMING ARCHITECTURES FOR ARBITRARY FIXED PERMUTATIONS Ren Chen and Viktor K.

More information

Depth Estimation for 2D to 3D Football Video Conversion

Depth Estimation for 2D to 3D Football Video Conversion International Research Journal of Alied and Basic Sciences 2013 Available online at www.irjabs.com ISSN 2251-838X / Vol, 6 (4): 475-480 Science Exlorer ublications Deth Estimation for 2D to 3D Football

More information

Swift Template Matching Based on Equivalent Histogram

Swift Template Matching Based on Equivalent Histogram Swift emlate Matching ased on Equivalent istogram Wangsheng Yu, Xiaohua ian, Zhiqiang ou * elecommunications Engineering Institute Air Force Engineering University Xi an, PR China *corresonding author:

More information

3D Computer Vision Camera Models

3D Computer Vision Camera Models 3D Comuter Vision Camera Models Nassir Navab based on a course given at UNC by Marc Pollefeys & the book Multile View Geometry by Hartley & Zisserman July 2, 202 chair for comuter aided medical rocedures

More information

Weighted Page Rank Algorithm based on In-Out Weight of Webpages

Weighted Page Rank Algorithm based on In-Out Weight of Webpages Indian Journal of Science and Technology, Vol 8(34), DOI: 10.17485/ijst/2015/v8i34/86120, December 2015 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 eighted Page Rank Algorithm based on In-Out eight

More information

Tracking Multiple Targets Using a Particle Filter Representation of the Joint Multitarget Probability Density

Tracking Multiple Targets Using a Particle Filter Representation of the Joint Multitarget Probability Density Tracing Multile Targets Using a Particle Filter Reresentation of the Joint Multitarget Probability Density Chris Kreucher, Keith Kastella, Alfred Hero This wor was suorted by United States Air Force contract

More information

Single character type identification

Single character type identification Single character tye identification Yefeng Zheng*, Changsong Liu, Xiaoqing Ding Deartment of Electronic Engineering, Tsinghua University Beijing 100084, P.R. China ABSTRACT Different character recognition

More information

Global Illumination with Photon Map Compensation

Global Illumination with Photon Map Compensation Institut für Comutergrahik und Algorithmen Technische Universität Wien Karlslatz 13/186/2 A-1040 Wien AUSTRIA Tel: +43 (1) 58801-18688 Fax: +43 (1) 58801-18698 Institute of Comuter Grahics and Algorithms

More information

Truth Trees. Truth Tree Fundamentals

Truth Trees. Truth Tree Fundamentals Truth Trees 1 True Tree Fundamentals 2 Testing Grous of Statements for Consistency 3 Testing Arguments in Proositional Logic 4 Proving Invalidity in Predicate Logic Answers to Selected Exercises Truth

More information

Applying the fuzzy preference relation to the software selection

Applying the fuzzy preference relation to the software selection Proceedings of the 007 WSEAS International Conference on Comuter Engineering and Alications, Gold Coast, Australia, January 17-19, 007 83 Alying the fuzzy reference relation to the software selection TIEN-CHIN

More information

An accurate and fast point-to-plane registration technique

An accurate and fast point-to-plane registration technique Pattern Recognition Letters 24 (23) 2967 2976 www.elsevier.com/locate/atrec An accurate and fast oint-to-lane registration technique Soon-Yong Park *, Murali Subbarao Deartment of Electrical and Comuter

More information

Interactive Image Segmentation

Interactive Image Segmentation Interactive Image Segmentation Fahim Mannan (260 266 294) Abstract This reort resents the roject work done based on Boykov and Jolly s interactive grah cuts based N-D image segmentation algorithm([1]).

More information

Randomized algorithms: Two examples and Yao s Minimax Principle

Randomized algorithms: Two examples and Yao s Minimax Principle Randomized algorithms: Two examles and Yao s Minimax Princile Maximum Satisfiability Consider the roblem Maximum Satisfiability (MAX-SAT). Bring your knowledge u-to-date on the Satisfiability roblem. Maximum

More information

GEOMETRIC CONSTRAINT SOLVING IN < 2 AND < 3. Department of Computer Sciences, Purdue University. and PAMELA J. VERMEER

GEOMETRIC CONSTRAINT SOLVING IN < 2 AND < 3. Department of Computer Sciences, Purdue University. and PAMELA J. VERMEER GEOMETRIC CONSTRAINT SOLVING IN < AND < 3 CHRISTOPH M. HOFFMANN Deartment of Comuter Sciences, Purdue University West Lafayette, Indiana 47907-1398, USA and PAMELA J. VERMEER Deartment of Comuter Sciences,

More information

CMSC 425: Lecture 16 Motion Planning: Basic Concepts

CMSC 425: Lecture 16 Motion Planning: Basic Concepts : Lecture 16 Motion lanning: Basic Concets eading: Today s material comes from various sources, including AI Game rogramming Wisdom 2 by S. abin and lanning Algorithms by S. M. LaValle (Chats. 4 and 5).

More information

Structure from Motion

Structure from Motion 04/4/ Structure from Motion Comuter Vision CS 543 / ECE 549 University of Illinois Derek Hoiem Many slides adated from Lana Lazebnik, Silvio Saverese, Steve Seitz his class: structure from motion Reca

More information

Improved heuristics for the single machine scheduling problem with linear early and quadratic tardy penalties

Improved heuristics for the single machine scheduling problem with linear early and quadratic tardy penalties Imroved heuristics for the single machine scheduling roblem with linear early and quadratic tardy enalties Jorge M. S. Valente* LIAAD INESC Porto LA, Faculdade de Economia, Universidade do Porto Postal

More information

Cross products. p 2 p. p p1 p2. p 1. Line segments The convex combination of two distinct points p1 ( x1, such that for some real number with 0 1,

Cross products. p 2 p. p p1 p2. p 1. Line segments The convex combination of two distinct points p1 ( x1, such that for some real number with 0 1, CHAPTER 33 Comutational Geometry Is the branch of comuter science that studies algorithms for solving geometric roblems. Has alications in many fields, including comuter grahics robotics, VLSI design comuter

More information

Feature Selection and Pose Estimation From Known Planar Objects Using Monocular Vision

Feature Selection and Pose Estimation From Known Planar Objects Using Monocular Vision Feature Selection and Pose Estimation From Known Planar Objects Using Monocular ision Shengdong Xu and Ming Liu 2 ETH Zurich, Switzerland, Email: Samuel.xu988@gmail.com 2 The Hong Kong University of Science

More information

Gabriel Taubin. Desktop 3D Photography

Gabriel Taubin. Desktop 3D Photography Sring 06 ENGN50 --- D Photograhy Lecture 7 Gabriel Taubin Brown University Deskto D Photograhy htt://www.vision.caltech.edu/bouguetj/iccv98/.index.html D triangulation: ray-lane Intersection lane ray intersection

More information

The Scalability and Performance of Common Vector Solution to Generalized Label Continuity Constraint in Hybrid Optical/Packet Networks

The Scalability and Performance of Common Vector Solution to Generalized Label Continuity Constraint in Hybrid Optical/Packet Networks The Scalability and Performance of Common Vector Solution to Generalized abel Continuity Constraint in Hybrid Otical/Pacet etwors Shujia Gong and Ban Jabbari {sgong, bjabbari}@gmuedu George Mason University

More information

Source-to-Source Code Generation Based on Pattern Matching and Dynamic Programming

Source-to-Source Code Generation Based on Pattern Matching and Dynamic Programming Source-to-Source Code Generation Based on Pattern Matching and Dynamic Programming Weimin Chen, Volker Turau TR-93-047 August, 1993 Abstract This aer introduces a new technique for source-to-source code

More information

Selecting Discriminative Binary Patterns for a Local Feature

Selecting Discriminative Binary Patterns for a Local Feature BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 3 Sofia 015 rint ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-015-0044 Selecting Discriminative Binary atterns

More information

A Method to Determine End-Points ofstraight Lines Detected Using the Hough Transform

A Method to Determine End-Points ofstraight Lines Detected Using the Hough Transform RESEARCH ARTICLE OPEN ACCESS A Method to Detere End-Points ofstraight Lines Detected Using the Hough Transform Gideon Kanji Damaryam Federal University, Lokoja, PMB 1154, Lokoja, Nigeria. Abstract The

More information

AN ANALYTICAL MODEL DESCRIBING THE RELATIONSHIPS BETWEEN LOGIC ARCHITECTURE AND FPGA DENSITY

AN ANALYTICAL MODEL DESCRIBING THE RELATIONSHIPS BETWEEN LOGIC ARCHITECTURE AND FPGA DENSITY AN ANALYTICAL MODEL DESCRIBING THE RELATIONSHIPS BETWEEN LOGIC ARCHITECTURE AND FPGA DENSITY Andrew Lam 1, Steven J.E. Wilton 1, Phili Leong 2, Wayne Luk 3 1 Elec. and Com. Engineering 2 Comuter Science

More information

Remember: The equation of projection. Imaging Geometry 1. Basic Geometric Coordinate Transforms. C306 Martin Jagersand

Remember: The equation of projection. Imaging Geometry 1. Basic Geometric Coordinate Transforms. C306 Martin Jagersand Imaging Geometr 1. Basic Geometric Coordinate Transorms emember: The equation o rojection Cartesian coordinates: (,, z) ( z, z ) C36 Martin Jagersand How do we develo a consistent mathematical ramework

More information

CS 428: Fall Introduction to. Geometric Transformations. Andrew Nealen, Rutgers, /15/2010 1

CS 428: Fall Introduction to. Geometric Transformations. Andrew Nealen, Rutgers, /15/2010 1 CS 428: Fall 21 Introduction to Comuter Grahics Geometric Transformations Andrew Nealen, Rutgers, 21 9/15/21 1 Toic overview Image formation and OenGL (last week) Modeling the image formation rocess OenGL

More information

IEEE Coyright Notice Personal use of this material is ermitted. However, ermission to rerint/reublish this material for advertising or romotional uroses or for creating new collective works for resale

More information

PHOTOGRAMMETRIC TECHNIQUES FOR ROAD SURFACE ANALYSIS

PHOTOGRAMMETRIC TECHNIQUES FOR ROAD SURFACE ANALYSIS The International Archives of the Photogrammetry, Remote Sensing and Satial Information Sciences, Volume XLI-B5, 6 XXIII ISPRS Congress, 9 July 6, Prague, Czech Reublic PHOTOGRAMMETRIC TECHNIQUES FOR ROAD

More information

Lecture 2: Fixed-Radius Near Neighbors and Geometric Basics

Lecture 2: Fixed-Radius Near Neighbors and Geometric Basics structure arises in many alications of geometry. The dual structure, called a Delaunay triangulation also has many interesting roerties. Figure 3: Voronoi diagram and Delaunay triangulation. Search: Geometric

More information

Lecture 3: Geometric Algorithms(Convex sets, Divide & Conquer Algo.)

Lecture 3: Geometric Algorithms(Convex sets, Divide & Conquer Algo.) Advanced Algorithms Fall 2015 Lecture 3: Geometric Algorithms(Convex sets, Divide & Conuer Algo.) Faculty: K.R. Chowdhary : Professor of CS Disclaimer: These notes have not been subjected to the usual

More information

Introduction to Visualization and Computer Graphics

Introduction to Visualization and Computer Graphics Introduction to Visualization and Comuter Grahics DH2320, Fall 2015 Prof. Dr. Tino Weinkauf Introduction to Visualization and Comuter Grahics Grids and Interolation Next Tuesday No lecture next Tuesday!

More information

Image Segmentation Using Topological Persistence

Image Segmentation Using Topological Persistence Image Segmentation Using Toological Persistence David Letscher and Jason Fritts Saint Louis University Deartment of Mathematics and Comuter Science {letscher, jfritts}@slu.edu Abstract. This aer resents

More information

Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data

Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data Efficient Processing of To-k Dominating Queries on Multi-Dimensional Data Man Lung Yiu Deartment of Comuter Science Aalborg University DK-922 Aalborg, Denmark mly@cs.aau.dk Nikos Mamoulis Deartment of

More information

Introduction to Parallel Algorithms

Introduction to Parallel Algorithms CS 1762 Fall, 2011 1 Introduction to Parallel Algorithms Introduction to Parallel Algorithms ECE 1762 Algorithms and Data Structures Fall Semester, 2011 1 Preliminaries Since the early 1990s, there has

More information

Source Coding and express these numbers in a binary system using M log

Source Coding and express these numbers in a binary system using M log Source Coding 30.1 Source Coding Introduction We have studied how to transmit digital bits over a radio channel. We also saw ways that we could code those bits to achieve error correction. Bandwidth is

More information

INFLUENCE POWER-BASED CLUSTERING ALGORITHM FOR MEASURE PROPERTIES IN DATA WAREHOUSE

INFLUENCE POWER-BASED CLUSTERING ALGORITHM FOR MEASURE PROPERTIES IN DATA WAREHOUSE The International Archives of the Photogrammetry, Remote Sensing and Satial Information Sciences, Vol. 38, Part II INFLUENCE POWER-BASED CLUSTERING ALGORITHM FOR MEASURE PROPERTIES IN DATA WAREHOUSE Min

More information

Equality-Based Translation Validator for LLVM

Equality-Based Translation Validator for LLVM Equality-Based Translation Validator for LLVM Michael Ste, Ross Tate, and Sorin Lerner University of California, San Diego {mste,rtate,lerner@cs.ucsd.edu Abstract. We udated our Peggy tool, reviously resented

More information

Blind Separation of Permuted Alias Image Base on Four-phase-difference and Differential Evolution

Blind Separation of Permuted Alias Image Base on Four-phase-difference and Differential Evolution Sensors & Transducers, Vol. 63, Issue, January 204,. 90-95 Sensors & Transducers 204 by IFSA Publishing, S. L. htt://www.sensorsortal.com lind Searation of Permuted Alias Image ase on Four-hase-difference

More information

CENTRAL AND PARALLEL PROJECTIONS OF REGULAR SURFACES: GEOMETRIC CONSTRUCTIONS USING 3D MODELING SOFTWARE

CENTRAL AND PARALLEL PROJECTIONS OF REGULAR SURFACES: GEOMETRIC CONSTRUCTIONS USING 3D MODELING SOFTWARE CENTRAL AND PARALLEL PROJECTIONS OF REGULAR SURFACES: GEOMETRIC CONSTRUCTIONS USING 3D MODELING SOFTWARE Petra Surynková Charles University in Prague, Faculty of Mathematics and Physics, Sokolovská 83,

More information

Use of Multivariate Statistical Analysis in the Modelling of Chromatographic Processes

Use of Multivariate Statistical Analysis in the Modelling of Chromatographic Processes Use of Multivariate Statistical Analysis in the Modelling of Chromatograhic Processes Simon Edwards-Parton 1, Nigel itchener-hooker 1, Nina hornhill 2, Daniel Bracewell 1, John Lidell 3 Abstract his aer

More information

A DEA-bases Approach for Multi-objective Design of Attribute Acceptance Sampling Plans

A DEA-bases Approach for Multi-objective Design of Attribute Acceptance Sampling Plans Available online at htt://ijdea.srbiau.ac.ir Int. J. Data Enveloment Analysis (ISSN 2345-458X) Vol.5, No.2, Year 2017 Article ID IJDEA-00422, 12 ages Research Article International Journal of Data Enveloment

More information

A GPU Heterogeneous Cluster Scheduling Model for Preventing Temperature Heat Island

A GPU Heterogeneous Cluster Scheduling Model for Preventing Temperature Heat Island A GPU Heterogeneous Cluster Scheduling Model for Preventing Temerature Heat Island Yun-Peng CAO 1,2,a and Hai-Feng WANG 1,2 1 School of Information Science and Engineering, Linyi University, Linyi Shandong,

More information

Earthenware Reconstruction Based on the Shape Similarity among Potsherds

Earthenware Reconstruction Based on the Shape Similarity among Potsherds Original Paer Forma, 16, 77 90, 2001 Earthenware Reconstruction Based on the Shae Similarity among Potsherds Masayoshi KANOH 1, Shohei KATO 2 and Hidenori ITOH 1 1 Nagoya Institute of Technology, Gokiso-cho,

More information

PREDICTING LINKS IN LARGE COAUTHORSHIP NETWORKS

PREDICTING LINKS IN LARGE COAUTHORSHIP NETWORKS PREDICTING LINKS IN LARGE COAUTHORSHIP NETWORKS Kevin Miller, Vivian Lin, and Rui Zhang Grou ID: 5 1. INTRODUCTION The roblem we are trying to solve is redicting future links or recovering missing links

More information

OMNI: An Efficient Overlay Multicast. Infrastructure for Real-time Applications

OMNI: An Efficient Overlay Multicast. Infrastructure for Real-time Applications OMNI: An Efficient Overlay Multicast Infrastructure for Real-time Alications Suman Banerjee, Christoher Kommareddy, Koushik Kar, Bobby Bhattacharjee, Samir Khuller Abstract We consider an overlay architecture

More information

Sensitivity of multi-product two-stage economic lotsizing models and their dependency on change-over and product cost ratio s

Sensitivity of multi-product two-stage economic lotsizing models and their dependency on change-over and product cost ratio s Sensitivity two stage EOQ model 1 Sensitivity of multi-roduct two-stage economic lotsizing models and their deendency on change-over and roduct cost ratio s Frank Van den broecke, El-Houssaine Aghezzaf,

More information

A Parallel Algorithm for Constructing Obstacle-Avoiding Rectilinear Steiner Minimal Trees on Multi-Core Systems

A Parallel Algorithm for Constructing Obstacle-Avoiding Rectilinear Steiner Minimal Trees on Multi-Core Systems A Parallel Algorithm for Constructing Obstacle-Avoiding Rectilinear Steiner Minimal Trees on Multi-Core Systems Cheng-Yuan Chang and I-Lun Tseng Deartment of Comuter Science and Engineering Yuan Ze University,

More information

Weight Co-occurrence based Integrated Color and Intensity Matrix for CBIR

Weight Co-occurrence based Integrated Color and Intensity Matrix for CBIR Weight Co-occurrence based Integrated Color and Intensity Matrix for CBIR Megha Agarwal, 2R.P. Maheshwari Indian Institute of Technology Roorkee 247667, Uttarakhand, India meghagarwal29@gmail.com, 2rmaheshwari@gmail.com

More information

11/2/2010. In the last lecture. Monte-Carlo Ray Tracing : Path Tracing. Today. Shadow ray towards the light at each vertex. Path Tracing : algorithm

11/2/2010. In the last lecture. Monte-Carlo Ray Tracing : Path Tracing. Today. Shadow ray towards the light at each vertex. Path Tracing : algorithm Comuter Grahics Global Illumination: Monte-Carlo Ray Tracing and Photon Maing Lecture 11 In the last lecture We did ray tracing and radiosity Ray tracing is good to render secular objects but cannot handle

More information

EVALUATION OF THE ACCURACY OF A LASER SCANNER-BASED ROLL MAPPING SYSTEM

EVALUATION OF THE ACCURACY OF A LASER SCANNER-BASED ROLL MAPPING SYSTEM EVALUATION OF THE ACCURACY OF A LASER SCANNER-BASED ROLL MAPPING SYSTEM R.S. Radovanovic*, W.F. Teskey*, N.N. Al-Hanbali** *University of Calgary, Canada Deartment of Geomatics Engineering rsradova@ucalgary.ca

More information

Visualization, Estimation and User-Modeling for Interactive Browsing of Image Libraries

Visualization, Estimation and User-Modeling for Interactive Browsing of Image Libraries Visualization, Estimation and User-Modeling for Interactive Browsing of Image Libraries Qi Tian, Baback Moghaddam 2 and Thomas S. Huang Beckman Institute, University of Illinois, Urbana-Chamaign, IL 680,

More information

Simulating Ocean Currents. Simulating Galaxy Evolution

Simulating Ocean Currents. Simulating Galaxy Evolution Simulating Ocean Currents (a) Cross sections (b) Satial discretization of a cross section Model as two-dimensional grids Discretize in sace and time finer satial and temoral resolution => greater accuracy

More information

Probabilistic Visual Cryptography Schemes

Probabilistic Visual Cryptography Schemes The Comuter Journal Advance Access ublished December, 25 The Author 25. Published by Oxford University Press on behalf of The British Comuter Society. All rights reserved. For Permissions, lease email:

More information

Application Notes - Pitch Reducing Optical Fiber Array (PROFA)

Application Notes - Pitch Reducing Optical Fiber Array (PROFA) Alication Notes - Pitch Reducing Otical Fiber Array (PROFA) Vertical Grating Couler Inut/Outut Design Pitch reducing otical fiber array (PROFA) couling to vertical grating coulers (VGCs) entails butt-couling

More information

Abstract In camera calibration, due to the correlations between certain camera arameters, e.g, the correlation between the image center and the camera

Abstract In camera calibration, due to the correlations between certain camera arameters, e.g, the correlation between the image center and the camera 1 Accuracy Analysis on the Estimation of Camera Parameters for Active Vision Systems y ShengWen Shih, z YiPing Hung, and y WeiSong Lin y Institute of Electrical Engineering, National Taiwan University

More information

Privacy Preserving Moving KNN Queries

Privacy Preserving Moving KNN Queries Privacy Preserving Moving KNN Queries arxiv:4.76v [cs.db] 4 Ar Tanzima Hashem Lars Kulik Rui Zhang National ICT Australia, Deartment of Comuter Science and Software Engineering University of Melbourne,

More information

Simultaneous Tracking of Multiple Objects Using Fast Level Set-Like Algorithm

Simultaneous Tracking of Multiple Objects Using Fast Level Set-Like Algorithm Simultaneous Tracking of Multile Objects Using Fast Level Set-Like Algorithm Martin Maška, Pavel Matula, and Michal Kozubek Centre for Biomedical Image Analysis, Faculty of Informatics Masaryk University,

More information

Shuigeng Zhou. May 18, 2016 School of Computer Science Fudan University

Shuigeng Zhou. May 18, 2016 School of Computer Science Fudan University Query Processing Shuigeng Zhou May 18, 2016 School of Comuter Science Fudan University Overview Outline Measures of Query Cost Selection Oeration Sorting Join Oeration Other Oerations Evaluation of Exressions

More information