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

Size: px
Start display at page:

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

Transcription

1 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, , Jaan ABSTRACT In this aer, we resent a robust Phase-Only Correlation (POC)-based motion estimation method for video sequences. Robust motion estimation is indisensable for many alications such as mesh-based video coding, stereo vision, and suer-resolution imaging. In our roosed method, the motion vector of a oint in a video frame is adatively switched between motion vectors obtained by two motion estimation methods: (i) POC-based full search and (ii) POC-based hierarchical search. This aroach can reliably detect both global and local motion in video sequences. We evaluate the robustness of our roosed method in mesh-based motion comensation. Exerimental results show that our roosed method erforms significantly better than conventional full search using Sum of Absolute Differences (SAD). KEY WORDS robust motion estimation, hase-only correlation, SAD, full search, hierarchical search Introduction Motion estimation is the rocess of determining the movement of the objects of a video sequence. The movement is usually exressed in terms of the motion vectors of selected oints within the current frame with resect to another frame known as the reference frame. A motion vector reresents the dislacement of a oint between the current frame and the reference frame. Motion estimation is a fundamental task in numerous fields, such as image rocessing, image analysis, video coding, and comuter vision. Robust highaccuracy motion estimation is essential for alications such as mesh-based motion comensation for video coding [], stereo vision 3D measurement [2], and suer-resolution imaging [3] (the reconstruction of a high-resolution image using multile low-resolution images). Here, robustness refers to consistent ixellevel estimation of motion vectors with minimal false detection. Among the various motion estimation methods, the block matching algorithm is most oular due to its simlicity. In block matching algorithms, an image block centered on a oint in the current frame is comared with candidate blocks in the reference frame based on certain dissimilarity or similarity measures in order to find the best matching block within a redefined search area. An examle of a dissimilarity measure is Sum of Absolute Differences (SAD). The motion vector of the oint is given by the block dislacement. Strategies for finding the best matching block are broadly classified into two tyes: full search methods and hierarchical search methods. The former is suitable for detecting local motion of individual objects, while the latter is suitable for detecting global motion of the scene. Recently, a high-accuracy image matching technique using a Phase-Only Correlation (POC) function [4] [6] has been develoed. Using the POC function, we can estimate the translational dislacement as well as the degree of similarity between two image blocks from the location and height of the correlation eak, resectively. It has been demonstrated that this matching technique can estimate the dislacement between two images with /-ixel accuracy when the image size is about ixels [5]. This aer resents a robust POC-based motion estimation method for video sequences. Our roosed method combines the advantages of hierarchical search with those of full search. The motion vector of a oint is adatively switched between motion vectors obtained from POC-based hierarchical search and POC-based full search, so as to detect both global and local motion in video sequences. We evaluate the robustness of our roosed method using mesh-based motion comensation, where the quality of the motion comensated images is highly deendent on the robustness of the motion estimation method. 2 Phase-Only Correlation Consider two N N 2 images, f(n,n 2 )andg(n,n 2 ), where we assume that the index ranges are n = M,,M and n 2 = M 2,,M 2 for mathematical simlicity, and hence N =2M + and N 2 =

2 2M 2 +. Let F (k,k 2 )andg(k,k 2 ) denote the 2D Discrete Fourier Transforms (2D DFTs) of the two images. F (k,k 2 )andg(k,k 2 )aregivenby F (k,k 2 ) = f(n,n 2 )W kn N W k2n2 N 2 n n 2 = A F (k,k 2 )e jθf (k,k2), () G(k,k 2 ) = g(n,n 2 )W kn N W k2n2 N 2 n n 2 = A G (k,k 2 )e jθg(k,k2), (2) where k = M,,M, k 2 = M 2,,M 2, 2π 2π j N j W N = e N, W N2 = e 2, and the oerator n n 2 denotes M M2 n = M n 2= M 2. A F (k,k 2 )and jθf (k,k2) A G (k,k 2 ) are amlitude comonents, and e and e jθg(k,k2) are hase comonents. The cross-hase sectrum (or normalized cross sectrum) ˆR(k,k 2 ) is defined as ˆR(k,k 2 ) = F (k,k 2 )G(k,k 2 ) F (k,k 2 )G(k,k 2 ) = e jθ(k,k2), (3) where G(k,k 2 ) denotes the comlex conjugate of G(k,k 2 )andθ(k,k 2 )=θ F (k,k 2 ) θ G (k,k 2 ). The Phase-Only Correlation (POC) function ˆr(n,n 2 )is the 2D Inverse Discrete Fourier Transform (2D IDFT) of ˆR(k,k 2 )andisgivenby ˆr(n,n 2 ) = N N 2 k k 2 ˆR(k,k 2 )W kn N W k2n2 N 2, (4) where k k 2 denotes M M2 k = M Now consider f c (x,x 2 ) as a 2D image defined in continuous sace with real-number indices x and x 2.Letδ and δ 2 reresent sub-ixel dislacements of f c (x,x 2 )tox and x 2 directions, resectively. So, the dislaced image can be reresented as f c (x δ,x 2 δ 2 ). Assume that f(n,n 2 )andg(n,n 2 ) are satially samled images of f c (x,x 2 )andf c (x δ,x 2 δ 2 ), and are defined as k 2= M 2. f(n,n 2 ) = f c (x,x 2 ) x=n T,x 2=n 2T 2, g(n,n 2 ) = f c (x δ,x 2 δ 2 ) x=n T,x 2=n 2T 2, where T and T 2 are the satial samling intervals, and index ranges are given by n = M,,M and n 2 = M 2,,M 2. The POC function ˆr(n,n 2 ) between f(n,n 2 )andg(n,n 2 ) will be given by ˆr(n,n 2 ) α sin{π(n + δ )} sin{π(n 2 + δ 2 )} N N 2 sin{ π N (n + δ )} sin{ π N 2 (n 2 + δ 2 )},(5) where α. The eak osition of the POC function corresonds to the dislacement between the two images, and the eak value α corresonds to the degree of correlation between the two images. ( n,n 2 ) ^r n n Figure. Function fitting for estimating the eak osition. For high accuracy sub-ixel image matching, the following techniques [5] are imortant: function fitting using equation (5) for high-accuracy estimation of subixel dislacement (δ,δ 2 )andeakvalueα, alication of Hanning window to reduce image boundary effects and low-ass filtering to reduce aliasing and noise effects. Figure shows an examle of function fitting using equation (5) to estimate the true osition and height of the correlation eak. In this aer, we use two versions of the POC function for image matching. We use a simlified version where only windowing technique and low-ass filtering is emloyed for fast comutation. The dislacement between two image blocks is estimated by detecting the osition of the maximum value of the POC function ˆr(n,n 2 ) in equation (4) with ixel accuracy. We also emloy a high-accuracy version that uses function fitting, windowing and low-ass filtering technique for high-accuracy estimation of correlation eak α and sub-ixel dislacement (δ,δ 2 ). 3 POC-Based Motion Estimation In this section, our roosed POC-based motion estimation method is described. We describe two different search strategies for block matching: POC-based full search and POC-based hierarchical search. We also roose an adative search strategy that adatively switches between the result of the above two algorithms for more robust motion estimation. 3. Full Search Method In this section, we describe a POC-based full search motion estimation method (known thereafter as POC- FS) that requires less calculation than conventional full search while having almost no loss in otimality

3 We consider two image blocks of size W W with Hanning window function of the same size alied. Since the half-width of the Hanning window function is W 2, we may consider the maximum reliable dislacement estimate between the two image blocks to be ± W 4 both horizontally and vertically. Hence, instead of examining every candidate block, we only need to examine candidate blocks at W 4 ixel intervals in the search area. Procedure for POC-FS Inut: current image I(n,n 2 ), reference image J(n,n 2 ), oint in I(n,n 2 ) Outut: corresonding oint q of oint in J(n,n 2 ), motion vector v FS of oint Ste : Extract an image block of size W W centered on oint in the current frame I(n,n 2 ). Ste 2: Calculate POC function between the image block in the current frame I(n,n 2 ) and candidate blocks in the reference frame J(n,n 2 )every W 4 ixels in the search area. We use the simlified version of the POC function to obtain the rough correlation eak (defined as the maximum value of the POC function ˆr(n,n 2 ) in Equation (4)) and the eak osition which gives the dislacement between the two blocks with ixel accuracy. Ste 3: Identify the to 3 matching blocks in Ste 2, and dislace the blocks by their dislacement estimates. This brings the correlation eaks to the centers of the blocks. Re-calculate the POC function for the 3 new candidate blocks. The best matching block is the block with the highest correlation eak among the 3 blocks. Again, the simlified version of the POC function is used. The corresonding oint q is centered on the best matching block. Ste 4: Find the motion vector v FS = q. In our exeriments we set the window size as and the search range as ±6 or ±32 both horizontally and vertically, deending on the exected range of motion. 3.2 Hierarchical Search Method In the POC-based hierarchical search motion estimation method (known thereafter as POC-HS), some coarser versions of the original inut images are created. This method is also known as the coarse-to-fine corresondence search technique [6]. The POC-based block matching starts at the coarsest image layer and the oeration gradually moves to the finer layers. The motion vector detected at each layer is roagated to the next finer layer in order to guide the search at that layer. An overview of the technique is shown in Figure 2. Let o be the given oint in the current image, and q be the corresonding oint in the reference image, and let l and q l be the matching oints at the l-th layer. The aim of the corresondence search is to find the corresonding oint q of oint andindoingso, we obtain the motion vector of as q. Procedure for POC-HS Inut: current image I (n,n 2 )(=I(n,n 2 )), reference image J (n,n 2 )(=J(n,n 2 )), oint (= ) ini (n,n 2 ) Outut: corresonding oint q of oint in J (n,n 2 ), motion vector v HS of oint Ste : For l =, 2,,l max,createthel-th layer images I l (n,n 2 )andj l (n,n 2 ), i.e., coarser versions of I (n,n 2 )andj (n,n 2 ), recursively as follows: I l (n,n 2 ) = 4 J l (n,n 2 ) = 4 i = i 2= i = i 2= I l (2n + i, 2n 2 + i 2 ), J l (2n + i, 2n 2 + i 2 ). In our exeriments we set the value of l max to2or3 deending on the exected range of motion. Ste 2: For every layer l =, 2,,l max,calculate the coordinate l =( l, l2 ) corresonding to the original oint recursively as follows: l = 2 l =( 2 l, 2 l 2 ). (6) Ste 3: We assume that q lmax = lmax in the coarsest layer. Let l = l max. Ste 4: From the l-th layer images I l (n,n 2 ) and J l (n,n 2 ), extract two image blocks (of size W W ) f l (n,n 2 )andg l (n,n 2 ) with their centers on l and 2q l+, resectively. For accurate matching, the size of image blocks should be reasonably large. In our exeriments, we use image blocks. Ste 5: Estimate the dislacement between f l (n,n 2 ) and g l (n,n 2 ) with ixel accuracy using the simlified l max l+ l l- l l l+ q l+ To layer l- I l+ J l+ I l f l (n,n 2 ) POC 2q l+ g l (n,n 2 ) q l = 2q l+ + δ l J l To layer l- Figure 2. Block matching using a hierarchical coarseto-fine aroach. 443

4 version of the POC function, in which the dislacement is determined to ixel-level accuracy. Let the estimated dislacement vector be δ l. The l-th layer corresondence q l is determined as follows: q l = 2q l+ + δ l. (7) Ste 6: Decrement the counter by as l = l and reeat from Ste 4 to Ste 6 while l. Ste 7: Find the motion vector v HS = q. 3.3 Adative Search Method To adat to both global and local motion in video sequences, we roose a POC-based adative search motion estimation method (known thereafter as POC- HS/FS) that adatively switches between POC-HS and POC-FS to detect correct motion. When switching between POC-HS and POC-FS, two factors come into consideration. The first factor is how well the image block matches with its best matching block. This is given by the correlation eak α of the POC function. The second factor is to what extent the motion vector at a oint correlates with the motion vectors of the set of its surrounding oints S. We introduce a measure D, which reresents how much the motion vector v differs from the motion vectors of the oints in S. S may not necessarily refer to the adjacent ixels of. We can freely define the surrounding oints to have some distance from. D(v )= s S v v s. (8) POC-FS is effective for detecting local motions of individual objects, but the ossibility of mismatching with a similar-looking block is high. On the other hand, POC-HS uses a larger matching area to increase the reliability, but may fail to detect the correct motion when the block overlas with two or more objects with different motion. We use the following discriminant Z for each oint to decide which result to use. reference image J(n,n 2 ), oint in I(n,n 2 ) Outut: motion vector v of oint Ste : Use POC-HS to find v HS and α HS. Ste 2: Use the following rocedure to obtain v. If α HS v = v HS else > threshold value k then Use POC-FS to find v FS Calculate discriminant Z If Z. then v = v FS else and α FS v = v HS end end In our exeriments we let k =.5. An examle of motion estimation using POC-FS, POC-HS and POC-HS/FS is shown in Figure 3 for the video sequence F lower Garden. POC-FS fails to detect the correct motion for some oints close to the tree boundary because of occlusion. On the other hand, due to different motion of the tree and the background, POC-HS fails to detect the correct motion for some oints within the tree. By adatively switching between POC-FS and POC-HS, a more satisfactory result is obtained by POC-HS/FS. 4 Exeriment and Evaluation In our first exeriment we investigate the robustness of POC-HS/FS for mesh-based motion comensation using a wide variety of MPEG-4 standard test video sequences that have mostly global motion, local motion or a good mix of both. We create the motion comensated image of the current frame and comare it with the current frame to calculate PSNR. The motion comensation rocedure for the current frame t is as follows. Nodes are ositioned every 6 ixels to form a square mesh that artitions the image into square blocks. To avoid boundary occlusion effects, we exclude a frame boundary of 6 ixels Z = αfs α HS ) D(vHS D(v FS ). (9) Here, α FS, α HS are the correlation eaks of the POC function for the best matching block found using POC- FS, POC-HS resectively. We use the function fitting technique described in Section 2 for high-accuracy estimation of the eak values. If Z., then the v FS is chosen, otherwise if Z<., then v HS is chosen. Procedure for POC-HS/FS Inut: current image I(n,n 2 ), (a) (b) (c) Figure 3. Motion estimation for F lower Garden using (a) POC-FS, (b) POC-HS, and (c) POC-HS/FS. 444

5 from the motion comensation rocess. Motion estimation is done for every node in the current frame t with resect to the reference frame t. The rojective transformation of a oint (n,n 2 )inframet to the oint (n,n 2)inframet is defined as n n 2 = h h 2 h 3 h 4 h 5 h 6 n n 2, () h 7 h 8 Reference frame t- (n,n2 ) H H Current frame t (n,n2) Motion comensated image of frame t where h h 8 are the rojective arameters of the rojective transformation matrix H, showninfigure 4. The coordinates of the four corner nodes of an image block in frame t and the coordinates of their corresonding nodes in frame t are used to calculate H. Next, the inverse matrix H is used to create the motion comensated image block of frame t, asshown in Figure 4. This rocedure is reeated for every block to generate the motion comensated image of frame t. To calculate H accurately, sub-ixel accuracy of motion vectors is required. We use the high-accuracy version of the POC function described in Section 2, where function fitting is emloyed to calculate the subixel dislacement after the motion vectors have been estimated to ixel-level accuracy using POC-HS/FS. In our exeriment, we also comare our roosed method with SAD-based full search motion estimation method (known thereafter as SAD-FS). The block size for SAD-FS is set at 6 6, corresonding to the halfwidth of the Hanning window used for POCbased image matching. For sub-ixel estimation of motion vector, we use bilinear interolation to estimate to.25-ixel accuracy. Video sequences often contain uniform, textureless and featureless regions that cause mismatching. An examle of this is the sky in the video sequences Shinjuku and F lower Garden. To revent such mismatching, we identify nodes in areas that have low standard deviation of luminance and set their motion vectors to zero. The average PSNR of the motion comensated images is given in Table. We see that the average PSNR is higher for POC-HS/FS than for SAD-FS. In general, POC-HS/FS roduced more robust estimation of motion vectors than SAD-FS, hence resulting in more accurate motion comensation. For video sequences that contained similar-looking textures such as Shinjuku, Church and Mobile Calendar, POC- HS/FS was significantly more robust, outerforming SAD-FS by 2.5 db. Kiel Harbour, which contains a gradual zoom-in, had only a slightly higher PSNR for POC-HS/FS. In Table, we also observe that the average number of block matches for ixel-level matching is significantly lower for POC-HS/FS. Figures 5 and 6 lot the PSNR er frame for Mobile Calendar and Shinjuku resectively. In both cases the PSNR for POC-HS/FS is consistently higher than for SAD-FS. Figures 7 and 8 give examles of mo- Figure 4. Motion comensation rocedure for a block. tion comensated images. We observe that the motion comensated images for POC-HS/FS are much closer to the original images. In our second exeriment we investigate the effectiveness of the adative switching mechanism of POC- HS/FS. We emloy 5 frames of the video sequence F lower Garden, which contains fast horizontal camera motion, along with an even faster-moving foreground tree object (an examle is showninsection3.3). We call this sequence F lower Garden. We erform the motion comensation rocedure for each current frame t with resect to reference frames t b, whereb =,2,3 and 4, to simulate various degrees of global and local motion. The average PSNR for POC-HS, POC-FS, and POC-HS/FS, along with the ercentage of vectors that were adatively switched from POC-HS to POC-FS are shown in Table 2. We observe that the ercentage of switched vectors increases with larger aarent disarity between the global motion of the background and the local motion of the tree object. For each value of b, the average PSNR for POC-HS/FS is highest, thus demonstrating the effectiveness of the switching mechanism. 5 Conclusion This aer resents a robust POC-based motion estimation method for video sequences. In the roosed method, the motion vector is adatively chosen from the result of POC-based hierarchical search and POCbased full search, so as to accommodate both global and local motion. The roosed method is evaluated using mesh-based motion comensation, where robust motion estimation is essential. We have demonstrated that the roosed method is generally more robust than the conventional SAD-based full search method. Further comarison of POC-based methods with SAD-based methods, as well as the alication of the roosed method to stereo image matching, moving object segmentation, etc. are left for future study. 445

6 PSNR (db) POC HS/FS SAD FS Frame Number Figure 5. PSNR of motion comensated images for Mobile Calendar. 36 (a) (b) (c) Figure 7. Motion comensation images for Mobile Calendar: (a) Original image, (b) POC-HS/FS, and (c) SAD-FS. PSNR (db) POC HS/FS SAD FS Frame Number Figure 6. PSNR of motion comensated images for Shinjuku. (a) (b) (c) Figure 8. Motion comensation images for Shinjuku: (a) Original image, (b) POC-HS/FS, and (c) SAD-FS. Acknowledgements The authors wish to thank Mr. Satoshi Kondo and the team at AV Core Technology Develoment Center/Image Processing Grou, Matsushita Electric Industrial Co., Ltd., for their kind suort and advice. References [] G. J. Sullivan and R. L. Baker, Motion comensation for video comression using control grid interolation, Proc. IEEE ICASSP, Vol. 4, , May 99. [2] O. D. Faugeras, Three-Dimensional Comuter Vision, MIT Press, 993. [3] C. P. Sung, K. P. Min, and G. K. Moon, Suerresolution image reconstruction: A technical overview, IEEE Signal Processing Magazine, Vol. 2, No. 3,. 2 36, 23. [4] C. D. Kuglin and D. C. Hines, The hase correlation image alignment method, Proc. Int. Conf. on Cybernetics and Society, , 975. [5] K. Takita, T. Aoki, Y. Sasaki, T. Higuchi, and K. Kobayashi, High-accuracy subixel image registration based on hase-only correlation, IEICE Trans. Fundamentals, Vol. E86-A, No. 8, , August 23. [6] K. Takita, M. A. Muquit, T. Aoki, and T. Higuchi, A sub-ixel corresondence search technique for comuter vision alications, IEICE Trans. Fundamentals, August 24,(to be ublished). Table. Average PSNR of motion comensated images for POC-HS/FS, SAD-FS (unit: db). (The average number of block matches for ixel-level matching is shown in arentheses.) Sequence POC-HS/FS SAD-FS Shinjuku (.2 3 ) (2.5 5 ) Church (8.2 2 ) (4. 5 ) Kiel Harbour (.4 3 ) (4. 5 ) F lower Garden (7.8 2 ) (3.3 5 ) Foreman (.5 3 ) (4.6 5 ) Mobile Calendar (. 3 ) (4.8 5 ) Table 2. Average PSNR of motion comensated images for POC-HS, POC-FS, and POC-HS/FS (unit: db) for F lower Garden, and average ercentage of switched vectors. b POC-HS POC-FS POC-HS/FS %

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

A Sub-Pixel Correspondence Search Technique for Computer Vision Applications

A Sub-Pixel Correspondence Search Technique for Computer Vision Applications IEICE TRANS. FUNDAMENTALS, VOL.E87 A, NO.8 AUGUST 004 1913 PAPER Special Section on Digital Signal Processing A Sub-Pixel Correspondence Search Technique for Computer Vision Applications Kenji TAKITA,

More information

OpenCL-Based Design of an FPGA Accelerator for Phase-Based Correspondence Matching

OpenCL-Based Design of an FPGA Accelerator for Phase-Based Correspondence Matching 90 Int'l Conf. Par. and Dist. Proc. Tech. and Appl. PDPTA'15 OpenCL-Based Design of an FPGA Accelerator for Phase-Based Correspondence Matching Shunsuke Tatsumi, Masanori Hariyama, Mamoru Miura, Koichi

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

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

An Efficient Image Matching Method for Multi-View Stereo

An Efficient Image Matching Method for Multi-View Stereo An Efficient Image Matching Method for Multi-View Stereo Shuji Sakai 1, Koichi Ito 1, Takafumi Aoki 1, Tomohito Masuda 2, and Hiroki Unten 2 1 Graduate School of Information Sciences, Tohoku University,

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

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

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

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

Accurate and Dense Wide-Baseline Stereo Matching Using SW-POC

Accurate and Dense Wide-Baseline Stereo Matching Using SW-POC Accurate and Dense Wide-Baseline Stereo Matching Using SW-POC Shuji Sakai, Koichi Ito, Takafumi Aoki Graduate School of Information Sciences, Tohoku University, Sendai, 980 8579, Japan Email: sakai@aoki.ecei.tohoku.ac.jp

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

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

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

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

Face Recognition Using Phase-Based Correspondence Matching

Face Recognition Using Phase-Based Correspondence Matching Face Recognition Using Phase-Based Correspondence Matching Koichi Ito Takafumi Aoki Graduate School of Information Sciences, Tohoku University, 6-6-5, Aramaki Aza Aoba, Sendai-shi, 98 8579 Japan ito@aoki.ecei.tohoku.ac.jp

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

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

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

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

Leak Detection Modeling and Simulation for Oil Pipeline with Artificial Intelligence Method

Leak Detection Modeling and Simulation for Oil Pipeline with Artificial Intelligence Method ITB J. Eng. Sci. Vol. 39 B, No. 1, 007, 1-19 1 Leak Detection Modeling and Simulation for Oil Pieline with Artificial Intelligence Method Pudjo Sukarno 1, Kuntjoro Adji Sidarto, Amoranto Trisnobudi 3,

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

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

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

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

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

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

Decoding-Workload-Aware Video Encoding

Decoding-Workload-Aware Video Encoding Decoding-Workload-Aware Video Encoding Yicheng Huang, Guangming Hong, Vu An Tran and Ye Wang Deartment of Comuter Science ational University of Singaore Law Link, Singaore 117590 Reulic of Singaore {huangyic,

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

METHOD OF LANDSLIDE MEASUREMENT BY GROUND BASED LIDAR

METHOD OF LANDSLIDE MEASUREMENT BY GROUND BASED LIDAR METHOD OF LANDSLIDE MEASUREMENT BY GROUND BASED LIDAR Ryo INADA* and Masataka TAKAGI** Kochi University of Technology, Kami-shi, Kochi, 782-8502, Jaan *135082@gs.kochi-tech.ac.j **takagi.masataka@kochi-tech.ac.j

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

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 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

An Efficient VLSI Architecture for Adaptive Rank Order Filter for Image Noise Removal

An Efficient VLSI Architecture for Adaptive Rank Order Filter for Image Noise Removal International Journal of Information and Electronics Engineering, Vol. 1, No. 1, July 011 An Efficient VLSI Architecture for Adative Rank Order Filter for Image Noise Removal M. C Hanumantharaju, M. Ravishankar,

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

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

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

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 of Protocols for Low-Latency Video Transport over the Internet

A Study of Protocols for Low-Latency Video Transport over the Internet A Study of Protocols for Low-Latency Video Transort over the Internet Ciro A. Noronha, Ph.D. Cobalt Digital Santa Clara, CA ciro.noronha@cobaltdigital.com Juliana W. Noronha University of California, Davis

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

Dr Pavan Chakraborty IIIT-Allahabad

Dr Pavan Chakraborty IIIT-Allahabad GVC-43 Lecture - 5 Ref: Donald Hearn & M. Pauline Baker, Comuter Grahics Foley, van Dam, Feiner & Hughes, Comuter Grahics Princiles & Practice Dr Pavan Chakraborty IIIT-Allahabad Summary of line drawing

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

A NN Image Classification Method Driven by the Mixed Fitness Function

A NN Image Classification Method Driven by the Mixed Fitness Function Comuter and Information Science November, 2009 A NN Image Classification Method Driven by the Mixed Fitness Function Shan Gai, Peng Liu, Jiafeng Liu & Xianglong Tang School of Comuter Science and Technology,

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

Detection of Occluded Face Image using Mean Based Weight Matrix and Support Vector Machine

Detection of Occluded Face Image using Mean Based Weight Matrix and Support Vector Machine Journal of Comuter Science 8 (7): 1184-1190, 2012 ISSN 1549-3636 2012 Science Publications Detection of Occluded Face Image using Mean Based Weight Matrix and Suort Vector Machine 1 G. Nirmala Priya and

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

TD C. Space filling designs in R

TD C. Space filling designs in R TD C Sace filling designs in R 8/05/0 Tyical engineering ractice : One-At-a-Time (OAT design X P P3 P X Main remarks : OAT brings some information, but otentially wrong Eloration is oor : on monotonicity?

More information

Fuzzy Logic and ANFIS based Image Centroid Tracking and Filtering Schemes

Fuzzy Logic and ANFIS based Image Centroid Tracking and Filtering Schemes Fuzzy Logic and ANFIS based Image Centroid Tracking and Filtering Schemes Parimala, A., Asstt. Prof., Det. of Telecommunication, MSRIT; Jain University Research Scholar, Bangalore. Raol, J. R., Prof. Emeritus,

More information

Fast Algorithm to Estimate Dense Disparity Fields

Fast Algorithm to Estimate Dense Disparity Fields Fast Algorithm to Estimate Dense Disarity Fields M Kardouchi a, E Hervet a University of Moncton, Comuter Science Det, Moncton, NB, Canada {kardoum,hervete}@umonctonca This aer describes a method to comute

More information

A 2D Random Walk Mobility Model for Location Management Studies in Wireless Networks Abstract: I. Introduction

A 2D Random Walk Mobility Model for Location Management Studies in Wireless Networks Abstract: I. Introduction A D Random Walk Mobility Model for Location Management Studies in Wireless Networks Kuo Hsing Chiang, RMIT University, Melbourne, Australia Nirmala Shenoy, Information Technology Deartment, RIT, Rochester,

More information

Multipoint Filtering with Local Polynomial Approximation and Range Guidance

Multipoint Filtering with Local Polynomial Approximation and Range Guidance Multioint Filtering with Local Polynomial Aroximation and Range Guidance Xiao Tan, Changming Sun, and Tuan D. Pham The University of New South Wales, Canberra, ACT 2600, Australia CSIRO Comutational Informatics,

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

NON-UNIFORM TO UNIFORM IMAGE RESAMPLING UTILIZING A 2D FARROW STRUCTURE

NON-UNIFORM TO UNIFORM IMAGE RESAMPLING UTILIZING A 2D FARROW STRUCTURE NON-UNIFORM TO UNIFORM IMAGE RESAMPLING UTILIZING A D FARROW STRUCTURE Harish Essay Sanaran, Mihail Georgiev, Atanas Gotchev and Karen Egiaarian Noia Cororation, Hermianatu, Tamere, FINLAND, harish.essaysanaran@noia.com

More information

An integrated system for virtual scene rendering, stereo reconstruction, and accuracy estimation.

An integrated system for virtual scene rendering, stereo reconstruction, and accuracy estimation. An integrated system for virtual scene rendering, stereo reconstruction, and accuracy estimation. Marichal-Hernández J.G., Pérez Nava F*., osa F., estreo., odríguez-amos J.M. Universidad de La Laguna,

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

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

3D Surface Simplification Based on Extended Shape Operator

3D Surface Simplification Based on Extended Shape Operator 3D Surface Simlification Based on Extended Shae Oerator JUI-LIG TSEG, YU-HSUA LI Deartment of Comuter Science and Information Engineering, Deartment and Institute of Electrical Engineering Minghsin University

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

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

Adaptive Reciprocal Cell based Sparse Representation for Satellite Image Restoration

Adaptive Reciprocal Cell based Sparse Representation for Satellite Image Restoration Vol.49 (SoftTech 04),.8-85 htt://dx.doi.org/0.457/astl.04.49.50 Adative Recirocal Cell based Sarse Reresentation for Satellite Image Restoration Yanfei He and Shunfeng Wang Deartment of Math and Statistic,

More information

Beijing ), 3 Marvell Semiconductor Inc., Santa Clara 95054, USA,

Beijing ),   3 Marvell Semiconductor Inc., Santa Clara 95054, USA, Game Theoretic Analysis of Camera Source Identification Hui Zeng, Yunwen Jiang, Xiangui Kang,2, Li Liu 3 School of Information Science and Technology, Sun Yat-sen University, Guangzhou, GD, China, 56 2

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

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

Measuring and modeling per-element angular visibility in multiview displays

Measuring and modeling per-element angular visibility in multiview displays Measuring and modeling er-element angular visibility in multiview dislays Atanas Boev, Robert Bregovic, Atanas Gotchev Deartment of Signal Processing, Tamere University of Technology, Tamere, Finland firstname.lastname@tut.fi

More information

Hou Zhenjie 1 *, Xiao Fei 1,Yuan Dezheng 2 1 School of Information Science & Engineering, Changzhou University, Gehu Str.1,

Hou Zhenjie 1 *, Xiao Fei 1,Yuan Dezheng 2 1 School of Information Science & Engineering, Changzhou University, Gehu Str.1, [Tye text] [Tye text] [Tye text] ISSN : 0974-7435 Volume 10 Issue 23 BioTechnology 2014 An Indian Journal FULL PAPER BTAIJ, 10(23), 2014 [14237-14243] Fast algorithm for image interolation based on data

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

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

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

Semi-Markov Process based Model for Performance Analysis of Wireless LANs

Semi-Markov Process based Model for Performance Analysis of Wireless LANs Semi-Markov Process based Model for Performance Analysis of Wireless LANs Murali Krishna Kadiyala, Diti Shikha, Ravi Pendse, and Neeraj Jaggi Deartment of Electrical Engineering and Comuter Science Wichita

More information

Using Rational Numbers and Parallel Computing to Efficiently Avoid Round-off Errors on Map Simplification

Using Rational Numbers and Parallel Computing to Efficiently Avoid Round-off Errors on Map Simplification Using Rational Numbers and Parallel Comuting to Efficiently Avoid Round-off Errors on Ma Simlification Maurício G. Grui 1, Salles V. G. de Magalhães 1,2, Marcus V. A. Andrade 1, W. Randolh Franklin 2,

More information

THE COMPARISON OF DRAINAGE NETWORK EXTRACTION BETWEEN SQUARE AND HEXAGONAL GRID-BASED DEM

THE COMPARISON OF DRAINAGE NETWORK EXTRACTION BETWEEN SQUARE AND HEXAGONAL GRID-BASED DEM The International Archives of the Photogrammetry, Remote Sensing and Satial Information Sciences, Volume XLII-4, 208 ISPRS TC IV Mid-term Symosium 3D Satial Information Science The Engine of Change, 5

More information

High Quality Offset Printing An Evolutionary Approach

High Quality Offset Printing An Evolutionary Approach High Quality Offset Printing An Evolutionary Aroach Ralf Joost Institute of Alied Microelectronics and omuter Engineering University of Rostock Rostock, 18051, Germany +49 381 498 7272 ralf.joost@uni-rostock.de

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

Optimal Multiple Sprite Generation based on Physical Camera Parameter Estimation

Optimal Multiple Sprite Generation based on Physical Camera Parameter Estimation 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,

More information

To appear in IEEE TKDE Title: Efficient Skyline and Top-k Retrieval in Subspaces Keywords: Skyline, Top-k, Subspace, B-tree

To appear in IEEE TKDE Title: Efficient Skyline and Top-k Retrieval in Subspaces Keywords: Skyline, Top-k, Subspace, B-tree To aear in IEEE TKDE Title: Efficient Skyline and To-k Retrieval in Subsaces Keywords: Skyline, To-k, Subsace, B-tree Contact Author: Yufei Tao (taoyf@cse.cuhk.edu.hk) Deartment of Comuter Science and

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

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

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

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

Mining Association rules with Dynamic and Collective Support Thresholds

Mining Association rules with Dynamic and Collective Support Thresholds Mining Association rules with Dynamic and Collective Suort Thresholds C S Kanimozhi Selvi and A Tamilarasi Abstract Mining association rules is an imortant task in data mining. It discovers the hidden,

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

Development of an automated detection system for microcalcifications on mammograms by using the higher-order autocorrelation features

Development of an automated detection system for microcalcifications on mammograms by using the higher-order autocorrelation features Develoment of an automated detection system for microcalcifications on mammograms by using the higher-order autocorrelation features Y. Ohe, N. Shinohara, T. Hara, H. Fujita, T. Endo *, T. Iwase ** Deartment

More information

An empirical analysis of loopy belief propagation in three topologies: grids, small-world networks and random graphs

An empirical analysis of loopy belief propagation in three topologies: grids, small-world networks and random graphs An emirical analysis of looy belief roagation in three toologies: grids, small-world networks and random grahs R. Santana, A. Mendiburu and J. A. Lozano Intelligent Systems Grou Deartment of Comuter Science

More information

Model-Based Annotation of Online Handwritten Datasets

Model-Based Annotation of Online Handwritten Datasets Model-Based Annotation of Online Handwritten Datasets Anand Kumar, A. Balasubramanian, Anoo Namboodiri and C.V. Jawahar Center for Visual Information Technology, International Institute of Information

More information

Parametric Optimization in WEDM of WC-Co Composite by Neuro-Genetic Technique

Parametric Optimization in WEDM of WC-Co Composite by Neuro-Genetic Technique Parametric Otimization in WEDM of WC-Co Comosite by Neuro-Genetic Technique P. Saha*, P. Saha, and S. K. Pal Abstract The resent work does a multi-objective otimization in wire electro-discharge machining

More information

Semi-Supervised Learning Based Object Detection in Aerial Imagery

Semi-Supervised Learning Based Object Detection in Aerial Imagery Semi-Suervised Learning Based Obect Detection in Aerial Imagery Jian Yao Zhongfei (Mark) Zhang Deartment of Comuter Science, State University of ew York at Binghamton, Y 13905, USA yao@binghamton.edu Zhongfei@cs.binghamton.edu

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

MULTI-CAMERA SURVEILLANCE WITH VISUAL TAGGING AND GENERIC CAMERA PLACEMENT. Jian Zhao and Sen-ching S. Cheung

MULTI-CAMERA SURVEILLANCE WITH VISUAL TAGGING AND GENERIC CAMERA PLACEMENT. Jian Zhao and Sen-ching S. Cheung MULTI-CAMERA SURVEILLANCE WITH VISUAL TAGGING AND GENERIC CAMERA PLACEMENT Jian Zhao and Sen-ching S. Cheung University of Kentucky Center for Visualization and Virtual Environment 1 Quality Street, Suite

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

PATTERN matching, also known as template matching, is

PATTERN matching, also known as template matching, is IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 34, NO. X, XXXXXXX 2012 1 Performance Evaluation of Full Search Equivalent Pattern Matching Algorithms Wanli Ouyang, Member, IEEE, Federico

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

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

Two-Dimensional l 1 -Norm Minimization in SAR Image Reconstruction

Two-Dimensional l 1 -Norm Minimization in SAR Image Reconstruction BULGARIAN ACADEMY O SCIENCES CYBERNEICS AND INORMAION ECHNOLOGIES Volume 5, No 7 Secial Issue on Information usion Sofia 5 Print ISSN: 3-97; Online ISSN: 34-48 DOI:.55/cait-5-9 wo-dimensional l -Norm Minimization

More information

High Quality Offset Printing An Evolutionary Approach

High Quality Offset Printing An Evolutionary Approach High Quality Offset Printing An Evolutionary Aroach Ralf Joost Institute of Alied Microelectronics and omuter Engineering University of Rostock Rostock, 18051, Germany +49 381 498 7272 ralf.joost@uni-rostock.de

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

Efficient stereo vision for obstacle detection and AGV Navigation

Efficient stereo vision for obstacle detection and AGV Navigation Efficient stereo vision for obstacle detection and AGV Navigation Rita Cucchiara, Emanuele Perini, Giuliano Pistoni Diartimento di Ingegneria dell informazione, University of Modena and Reggio Emilia,

More information

This is the peer reviewed version of the following article: Susín, A. and Ramírez, J.E. (2015). Segmentation-based skinning. Computer animation and

This is the peer reviewed version of the following article: Susín, A. and Ramírez, J.E. (2015). Segmentation-based skinning. Computer animation and This is the eer reviewed version of the following article: Susín, A. and Ramírez, J.E. (). Segmentation-based skinning. Comuter animation and virtual worlds, (), 1 which has been ublished in final form

More information

Implementations of Partial Document Ranking Using. Inverted Files. Wai Yee Peter Wong. Dik Lun Lee

Implementations of Partial Document Ranking Using. Inverted Files. Wai Yee Peter Wong. Dik Lun Lee Imlementations of Partial Document Ranking Using Inverted Files Wai Yee Peter Wong Dik Lun Lee Deartment of Comuter and Information Science, Ohio State University, 36 Neil Ave, Columbus, Ohio 4321, U.S.A.

More information

Vector sigma filters for noise detection and removal in color images

Vector sigma filters for noise detection and removal in color images J. Vis. Commun. Image R. 7 (26) 26 www.elsevier.com/locate/jvci Vector sigma filters for noise detection and removal in color images Rastislav Lukac a, *,, Bogdan Smolka b, Konstantinos N. Plataniotis

More information