EFFICIENT STEREO MATCHING BASED ON A NEW CONFIDENCE METRIC. Won-Hee Lee, Yumi Kim, and Jong Beom Ra

Size: px
Start display at page:

Download "EFFICIENT STEREO MATCHING BASED ON A NEW CONFIDENCE METRIC. Won-Hee Lee, Yumi Kim, and Jong Beom Ra"

Transcription

1 th European Signal Processing Conference (EUSIPCO ) Bucharest, omania, August 7-3, EFFICIENT STEEO MATCHING BASED ON A NEW CONFIDENCE METIC Won-Hee Lee, Yumi Kim, an Jong Beom a Department of Electrical Engineering, KAIST, Daejeon, Korea ABSTACT In this paper, we ose a new confience metric for efficient stereo matching. To measure the confience of a stereo match, we refer to the curvatures aroun the two minimum costs of a cost curve, the size of aggregation kernel, an the occlusion information. Using the ose confience metric, we then esign a weighte meian filter, in orer to refine the initially estimate isparities with a small In the esign of weighte meian filter, we overcome the performance egraation ue to a small kernel size by utilizing the filter information of previously processe pixels. It is foun that the performance of the ose stereo matching algorithm is competitive to the other existing local algorithms even with a small size of Inex Terms stereo matching, confience metric, aggregation kernel size. INTODUCTION With the recent popularity of 3D isplay, various 3D isplays without glasses have been evelope []. Among those isplays, a isplay that uses arrays of vertically oriente cylinrical lenslets shows a remarkably goo actual appearance compare to the others. This lenslet-base isplay nees a series of multiple views to generate the 3D effect. Those multiple view images can be generate by using pixel isparities, which are obtaine from two stereo images transmitte to the isplay. To obtain the isparities, stereo matching between the stereo images is necessary. For the TV application, however, the stereo matching shoul be performe in real-time. Therefore, the algorithm may nee to be implemente in VLSI with consieration of low computational cost. Several stereo matching algorithms ha been implemente in VLSI [, 3]. However, those algorithms may be improve for more efficient VLSI implementation. To esign a stereo matching algorithm with low computational complexity, the aggregation kernel size is to be small because the aggregation process takes a large portion of computation loa. However, a small size of aggregation kernel may cause a problem especially in a textureless area where little information for matching exists insie the To examine the stereo matching performance accoring to the aggregation kernel size, a stereo matching algorithm [4] is performe by using two ifferent sizes of aggregation kernel, 35 x 35 an 5 x 35, respectively, an the corresponing isparity maps are given in Fig.. As expecte, the isparity map obtaine with a smaller aggregation kernel inclues much larger erroneous areas especially in the textureless area (see Fig. ()). However, the increase is usually negligible in the texture area. Therefore, the isparities in the texture area are more reliable for refining incorrect isparities in the neighboring textureless area. Hence, for efficient refinement of the isparity map obtaine with a small size kernel, we ose a new confience metric. Our stereo matching algorithm base on the ose metric is fully local an progressive so as to satisfy a VLSI framework. The paper is organize as follows. In section, we briefly escribe a stereo matching algorithm that we aopt for initial isparity estimation. We also review various confience metrics. The ose confience metric an the corresponing stereo matching algorithm are escribe in section 3. Section 4 shows some experimental results. Finally, we conclue the paper in section 5.. ELATED WOK.. Cross-base stereo matching algorithm To estimate an initial isparity map, we aopt a local stereo matching algorithm, which is calle the cross-base stereo matching algorithm [4]. In the algorithm, the raw matching cost is first compute for every pair of corresponing pixels. Namely, L e x, min I x I x, T, () c c c, G, B where I L an I represent the left an right images, x an enote the spatial coorinate an the isparity, respectively, an T enotes a truncation limit of matching cost. By using the obtaine raw matching cost, the aggregate cost is compute as c x, e s,, () U x su x EUASIP, - ISSN

2 (a) (b) (c) I I L Apply initial stereo matching. Color histogrambase segmentation CS Calculate confience measure. C efinement () (e) Figure. Disparity maps obtaine by using aggregation kernels of ifferent sizes. (a) Left image of the Venus set, (b), (c) isparity map an the corresponing ba pixel map (error > ) obtaine by using a kernel of 35 x 35, an (), (e) isparity map an its ba pixel map (error > ) by using a kernel of 5 x 35. where U (x) is a local support region [4], an U (x) enotes the number of support pixels in U (x). Finally, the isparity is selecte accoring to the Winner-Takes-All strategy, as follows. x arg min c x,,,, (3) where (x) enotes the initial isparity, an max enotes the maximum isparity... Confience metrics Due to the inherent ambiguity of stereo matches, several metrics were ose to measure the confience level of match [5]. Those confience metrics utilize an aggregate cost, curvature of the cost curve, an left-right consistency. The followings are some examples of existing metrics.... Matching score metric (MSM) This metric uses the aggregate cost efine in Eq. () as a confience measure, namely, C MSM ( x ) c ( x, ). (4) Here, i enotes the isparity that reveals the i th minimum cost. Intuitively, a lower cost implies a more correct match.... Curvature of cost curve metric (CU) The curvature of cost curve aroun the minimum cost inicates the confience of a match, because the cost increases rapily near the isparity having the minimum cost. Accoringly, CU is efine as max Figure. Overall iagram of the ose algorithm. C CU x c x, c x, c x,. (5)..3. Naive peak ratio metric (PKN) A istinctive minimum cost in the cost curve can be consiere an evience of confient match. Accoringly, PKN is efine as a ratio of the two minimum costs, i.e., C PKN x c x c x,. (6),..4. Naive winner margin metric (WMNN) Similar to PKN, WMNN utilizes the istinctiveness of the minimum cost. Instea of using a ratio, WMNN computes a margin between two minimum costs an normalize it with the sum of total costs. c x, c x, C x. (7) WMNN c x,..5. Left right ifference metric (LD) Consistency between left an right isparity maps can be use to check if a match is confient. LD is efine by using a margin between two minimum costs an the consistency of the minimum cost across the left an right isparity maps, i.e., C LD x c x, c x,. (8) c x, min c x, Here, min{c (x -, )} implies the minimum value of a cost curve at the corresponing pixel in the right image. 3. THE POPOSED ALGOITHM 4

3 (a) (b) () (e) In aition, a new metric nees to provie a low confience value for a perioic pattern. However, since the perioic pattern can have a large curvature aroun the minimum cost as shown in Fig. 3(), its confience value may become large. To alleviate this problem, a new metric may nee to be esigne using two minimum cost values as in PKN an WMNN metrics. It is observe that a perioic pattern has high curvatures aroun at least two minimum costs. This observation may be utilize for esigning a new confience metric so that it can successfully hanle perioic patterns. Accoringly, a new metric is ose as (c) Figure 3. (a), (b), (c) Cost graphs of correctly estimate ot pixels; (), (e), (f) cost graphs of incorrectly estimate cross pixels. The overall iagram of the ose algorithm is escribe in Fig.. In the algorithm, we first estimate an initial isparity map by using the cross-base stereo matching algorithm with a limite size of We then examine the confience of initial isparity at each pixel by using the ose confience metric. Here, the metric is calculate by using the cost graph obtaine uring the initial isparity estimation process. To refine the isparities of low confience, we etermine neighboring pixels that belong to the same object, because they ten to have correct isparities. To etermine those neighboring pixels, we perform the color segmentation by aopting a simple an efficient histogram-base algorithm [6], an assign the corresponing color segment inex, CS, to each pixel. We then perform the refinement by using the initial isparity, confience measure, an color segment inex. 3.. Propose confience metric Since the limitation on the aggregation kernel size prouces a consierable amount of ba pixels, it is important to iscriminate them from the correctly estimate ones. To esign a new confience metric uner various conitions, we examine many ifferent types of cost graphs. Figs. 3(a), (b), an (c) show the cost graphs for three correctly estimate pixels, while Figs. 3(), (e), an (f) show the graphs for the other three incorrectly estimate pixels. Since the correctly estimate pixels in Figs. 3(a) an (b) commonly provie a large curvature aroun the minimum cost, CU can provie a large confience value. However, CU cannot provie a large confience value for a small curvature in Fig. 3(c), since it is calculate by using only three cost values. Therefore, a new confience metric is neee so that a cost graph with a small curvature in Fig. 3(c) can also provie a high confience value. The metric shoul also iscriminate from flat cost graphs shown in Figs. 3(e) an (f) (f) x U x * c x, LoG * c x,, (9) C LoG where LoG represents a Laplacian of Gaussian filter of n- taps. Note that C inclues an occlusion check as in LD so that it becomes zero if a pixel is foun to be occlue through a cross-check between left an right isparity maps. The LoG filter in Eq. (9) extracts the curvature information across a range larger than that incluing three cost values in the CU metric. This filter characteristic improves the performance of the confience metric especially for a cost graph with a small curvature. Introucing a multiplication factor relying on the number of support pixels, we also improve the metric performance for a cost graph with a small curvature. This is because the number of support pixels corresponing to a small curvature graph is usually large. In aition, subtracting the curvature of the secon minimum cost from that of the first minimum cost, we can successfully istinguish a perioic pattern from a low texture area. 3.. efinement Since the computational cost is our main consieration in esigning a stereo matching algorithm, local approaches such as a weighte meian filter [7], a joint bilateral filter [8], etc., may be esirable rather than a global one. Among them, we aopt a weighte meian filter that is performe only for the isparities of neighboring pixels that belong to the same color segment. x, y MED w, w,..., w N, () N where i represents the initial isparity of neighboring pixels whose color segment inex is the same as that of the center pixel. Meanwhile, enotes a uplication operator, an weight, w i, is efine as a sigmoi function of confience metric, i.e., exp C, w () 4

4 Table. Error percentages accoring to aopte confience metrics in the ose algorithm. Error threshol of. is use. (a) (b) (c) () (e) (f) Figure 4. (a) Initial isparity map, (b) ba pixel map, an (c) ose confience map for Tey; () initial isparity map, (e) ba pixel map, an (f) ose confience map for Venus CU, AUC(.9) MSM, AUC(4.3) PKN, AUC(.45) WMNN,AUC(.5) LD, AUC(.76) POP, AUC(.8) (a) CU, AUC(6.9) MSM, AUC(6.) PKN, AUC(5.5) WMNN,AUC(5.9) LD, AUC(5.5) POP, AUC(4.88) (c) Figure 5. Performance of confience metrics for (a) Venus, (b) Tsukuba, (c) Cones, an () Tey. where enotes an offset an etermines a slope of the sigmoi function. Due to the small size of filtering kernel, the filtering is applie only to the limite number of pixels. Hence, to effectively enlarge a filtering range, we vertically agate the filtere result of a current pixel. The agate ata consist of a filtere isparity, weight, an color segment inex, CS. If the agate isparity has a larger weight than the current filtere isparity, the current weighte meian filtere isparity is replace with the agate isparity. Otherwise, all the agate ata are replace with the current ones. 4. EXPEIMENTAL ESULTS To emonstrate the performance of the ose algorithm, experiments were performe using the benchmark CU, AUC(.4) MSM, AUC(.98) PKN, AUC(.49) WMNN,AUC(.65) LD, AUC(.79) POP, AUC(.4) (b) CU, AUC(6.78) MSM, AUC(5.87) PKN, AUC(5.5) WMNN,AUC(5.85) LD, AUC(4.93) POP, AUC(4.) () Confience metric Venus Tsukuba Cones Tey Avg. CU MSM PKN WMNN LD Propose Table. Error percentages of stereo matching algorithms for several Milebury stereo sets. Error threshol of. is use. Algorithm Venus Tsukuba Cones Tey Avg. [4] [] Propose Milebury stereo atabase [9]. In the experiments, the aggregation kernel is limite to 5 x 35 an the filtering kernel is set to 5 x 63. Parameters T, n,, an are set to 6, 7,, an, respectively. To examine the performance of the ose confience metric subjectively, we visualize the confience metric with a confience map in Fig. 4. A confience map may be compare to the corresponing ba pixel map. Since the correctly estimate isparity is to be assigne to a high value of confience measure, a confience map shoul closely correspon to the ba pixel map as shown in Fig. 4. To examine the performance of the ose confience metric objectively, we aopt an objective measure, the area uner the curve (AUC) [5]. To etermine the AUC, we orer pixels accoring to their confience measure an prouce a curve of error rate as a function of the participation of pixels. The area uner the curve, or AUC, then represents the ability of a confience metric to preict correct matches. A smaller value of AUC implies that the confience metric assigns a larger confience value to a correctly estimate isparity. Fig. 5 shows error rate graphs of four test sets, Venus, Tsukuba, Cones, an Tey, for ifferent confience metrics. It is note in the graphs that the ose metric provies the smallest AUC for all the test sets. The effectiveness of a confience metric can also be examine by applying it to the refinement step of the ose stereo matching algorithm. Table shows that the ose confience metric prouces relatively lower error rates for all the test sets than the other metrics. To examine the performance of the ose local stereo matching algorithm, we compare its matching result with those of the other local algorithms reporte in the Milebury benchmark [9]. We can note in Table that the ose algorithm provies average error percentages similar to those of the others, even with a smaller size of 4

5 (a) (b) (c) () Figure 7. Disparity maps obtaine by using the algorithms in [4] (st row) an [9] (n row), an by using the ose algorithm, for (a) Tsukuba, (b) Venus, (c) Tey, an () Cones. 5. CONCLUSIONS In this paper, we esign an efficient stereo matching algorithm with the size limitation on both aggregation an filtering kernels. Applying a weighte meian filter that is base on the ose confience metric, we can successfully refine initial isparities. To overcome the size limitation on aggregation kernel, we effectively utilize previously obtaine filtering results by agating them. The experimental result shows the performance of the ose algorithm with a small size of aggregation kernel is competitive to the existing algorithms with a large size of 6. ACKNOWLEDGEMENT This work was supporte by a grant from LG Display Co. Lt., Korea. 7. EFEENCES [] P. Benzie, J. Watson, P. Surman, I. akkolainen, K. Hopf, H. Urey, V. Sainov, an C. V. Kopylow, A survey of 3DTV isplays: Techniques an technologies, IEEE TCSVT, 7. [] M. Hariyama, N. Yokoyama, an M. Kameyama, frame/sec stereo matching VLSI processor with aaptive winow-size control, IEEE Asian Soli-State Circuits Conference, 6. [3] S. Park, C. Chen, an H. Jeong, VLSI Architecture for MF base stereo matching, in SAMOS, LNCS 4599, 7. [4] K. Zhang, J. Lu, an G. Lafruit, Cross-base local stereo matching using orthogonal integral images, IEEE TCSVT, 9. [5] X. Hu an P. Morohai, Evaluation of stereo confience inoors an outoors, in CVP,. [6] J. Delon, A. Desolneux, J. L. Lisani, an A. B. Petro, A nonparametric approach for histogram segmentation, IEEE TIP, 7. [7] L. Yin,. Yang, M. Gabbouj, an Y. Neuvo, Weighte meian filters: A tutorial, IEEE Trans. Circuits Syst. II, 996. [8] S. Mattoccia, S. Giarino, an A. Gambini, Accurate an efficient cost aggregation strategy for stereo corresponence base on approximate joint bilateral filtering, in ACCV, 9. [9] D. Scharstein an. Szeliski, A taxonomy an evaluation of ense two-frame stereo corresponence algorithms, IJCV. [] K.-J. Yoon an I.-S. Kweon, Aaptive support-weight approach for corresponence search, IEEE TPAMI, 6. 43

Stereo Matching Using Tree Filtering

Stereo Matching Using Tree Filtering 1 Stereo Matching Using Tree Filtering Qingxiong Yang, Member, IEEE, Abstract Matching cost aggregation is one of the olest an still popular methos for stereo corresponence. While effective an efficient,

More information

Fast Window Based Stereo Matching for 3D Scene Reconstruction

Fast Window Based Stereo Matching for 3D Scene Reconstruction The International Arab Journal of Information Technology, Vol. 0, No. 3, May 203 209 Fast Winow Base Stereo Matching for 3D Scene Reconstruction Mohamma Mozammel Chowhury an Mohamma AL-Amin Bhuiyan Department

More information

Dense Disparity Estimation in Ego-motion Reduced Search Space

Dense Disparity Estimation in Ego-motion Reduced Search Space Dense Disparity Estimation in Ego-motion Reuce Search Space Luka Fućek, Ivan Marković, Igor Cvišić, Ivan Petrović University of Zagreb, Faculty of Electrical Engineering an Computing, Croatia (e-mail:

More information

Online Appendix to: Generalizing Database Forensics

Online Appendix to: Generalizing Database Forensics Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that

More information

Multimodal Stereo Image Registration for Pedestrian Detection

Multimodal Stereo Image Registration for Pedestrian Detection Multimoal Stereo Image Registration for Peestrian Detection Stephen Krotosky an Mohan Trivei Abstract This paper presents an approach for the registration of multimoal imagery for peestrian etection when

More information

d 3 d 4 d d d d d d d d d d d 1 d d d d d d

d 3 d 4 d d d d d d d d d d d 1 d d d d d d Proceeings of the IASTED International Conference Software Engineering an Applications (SEA') October 6-, 1, Scottsale, Arizona, USA AN OBJECT-ORIENTED APPROACH FOR MANAGING A NETWORK OF DATABASES Shu-Ching

More information

NEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES WITH THE USE OF THE IPAN99 ALGORITHM 1. INTRODUCTION 2.

NEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES WITH THE USE OF THE IPAN99 ALGORITHM 1. INTRODUCTION 2. JOURNAL OF MEDICAL INFORMATICS & TECHNOLOGIES Vol. 13/009, ISSN 164-6037 Krzysztof WRÓBEL, Rafał DOROZ * fingerprint, reference point, IPAN99 NEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES

More information

THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE

THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:

More information

Cloud Search Service Product Introduction. Issue 01 Date HUAWEI TECHNOLOGIES CO., LTD.

Cloud Search Service Product Introduction. Issue 01 Date HUAWEI TECHNOLOGIES CO., LTD. 1.3.15 Issue 01 Date 2018-11-21 HUAWEI TECHNOLOGIES CO., LTD. Copyright Huawei Technologies Co., Lt. 2019. All rights reserve. No part of this ocument may be reprouce or transmitte in any form or by any

More information

Sampling the Disparity Space Image

Sampling the Disparity Space Image Accepte for publication, June 2003. To appear in IEEE Transactions on Pattern Analysis an Machine Intelligence (PAMI) Sampling the Disparity Space Image Richar Szeliski Daniel Scharstein Microsoft Research

More information

A novel heterogeneous framework for stereo matching

A novel heterogeneous framework for stereo matching A novel heterogeneous framework for stereo matching Leonardo De-Maeztu 1, Stefano Mattoccia 2, Arantxa Villanueva 1 and Rafael Cabeza 1 1 Department of Electrical and Electronic Engineering, Public University

More information

Loop Scheduling and Partitions for Hiding Memory Latencies

Loop Scheduling and Partitions for Hiding Memory Latencies Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:

More information

Image Segmentation using K-means clustering and Thresholding

Image Segmentation using K-means clustering and Thresholding Image Segmentation using Kmeans clustering an Thresholing Preeti Panwar 1, Girhar Gopal 2, Rakesh Kumar 3 1M.Tech Stuent, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra,

More information

Stereo Matching with Reliable Disparity Propagation

Stereo Matching with Reliable Disparity Propagation Stereo Matching with Reliable Disparity Propagation Xun Sun, Xing Mei, Shaohui Jiao, Mingcai Zhou, Haitao Wang Samsung Advanced Institute of Technology, China Lab Beijing, China xunshine.sun,xing.mei,sh.jiao,mingcai.zhou,ht.wang@samsung.com

More information

Investigation into a new incremental forming process using an adjustable punch set for the manufacture of a doubly curved sheet metal

Investigation into a new incremental forming process using an adjustable punch set for the manufacture of a doubly curved sheet metal 991 Investigation into a new incremental forming process using an ajustable punch set for the manufacture of a oubly curve sheet metal S J Yoon an D Y Yang* Department of Mechanical Engineering, Korea

More information

Particle Swarm Optimization with Time-Varying Acceleration Coefficients Based on Cellular Neural Network for Color Image Noise Cancellation

Particle Swarm Optimization with Time-Varying Acceleration Coefficients Based on Cellular Neural Network for Color Image Noise Cancellation Particle Swarm Optimization with Time-Varying Acceleration Coefficients Base on Cellular Neural Network for Color Image Noise Cancellation Te-Jen Su Jui-Chuan Cheng Yang-De Sun 3 College of Information

More information

Fast Fractal Image Compression using PSO Based Optimization Techniques

Fast Fractal Image Compression using PSO Based Optimization Techniques Fast Fractal Compression using PSO Base Optimization Techniques A.Krishnamoorthy Visiting faculty Department Of ECE University College of Engineering panruti rishpci89@gmail.com S.Buvaneswari Visiting

More information

A FUZZY FRAMEWORK FOR SEGMENTATION, FEATURE MATCHING AND RETRIEVAL OF BRAIN MR IMAGES

A FUZZY FRAMEWORK FOR SEGMENTATION, FEATURE MATCHING AND RETRIEVAL OF BRAIN MR IMAGES A FUZZY FRAMEWORK FOR SEGMENTATION, FEATURE MATCHING AND RETRIEVAL OF BRAIN MR IMAGES Archana.S 1 an Srihar.S 2 1 Department of Information Science an Technology, College of Engineering, Guiny archana.santhira@gmail.com

More information

New Geometric Interpretation and Analytic Solution for Quadrilateral Reconstruction

New Geometric Interpretation and Analytic Solution for Quadrilateral Reconstruction New Geometric Interpretation an Analytic Solution for uarilateral Reconstruction Joo-Haeng Lee Convergence Technology Research Lab ETRI Daejeon, 305 777, KOREA Abstract A new geometric framework, calle

More information

Refinement of scene depth from stereo camera ego-motion parameters

Refinement of scene depth from stereo camera ego-motion parameters Refinement of scene epth from stereo camera ego-motion parameters Piotr Skulimowski, Pawel Strumillo An algorithm for refinement of isparity (epth) map from stereoscopic sequences is propose. The metho

More information

Open Access Adaptive Image Enhancement Algorithm with Complex Background

Open Access Adaptive Image Enhancement Algorithm with Complex Background Sen Orers for Reprints to reprints@benthamscience.ae 594 The Open Cybernetics & Systemics Journal, 205, 9, 594-600 Open Access Aaptive Image Enhancement Algorithm with Complex Bacgroun Zhang Pai * epartment

More information

All-to-all Broadcast for Vehicular Networks Based on Coded Slotted ALOHA

All-to-all Broadcast for Vehicular Networks Based on Coded Slotted ALOHA Preprint, August 5, 2018. 1 All-to-all Broacast for Vehicular Networks Base on Coe Slotte ALOHA Mikhail Ivanov, Frerik Brännström, Alexanre Graell i Amat, an Petar Popovski Department of Signals an Systems,

More information

Modifying ROC Curves to Incorporate Predicted Probabilities

Modifying ROC Curves to Incorporate Predicted Probabilities Moifying ROC Curves to Incorporate Preicte Probabilities Cèsar Ferri DSIC, Universitat Politècnica e València Peter Flach Department of Computer Science, University of Bristol José Hernánez-Orallo DSIC,

More information

Linear stereo matching

Linear stereo matching Linear stereo matching Leonardo De-Maeztu 1 Stefano Mattoccia 2 Arantxa Villanueva 1 Rafael Cabeza 1 1 Public University of Navarre Pamplona, Spain 2 University of Bologna Bologna, Italy {leonardo.demaeztu,avilla,rcabeza}@unavarra.es

More information

Shift-map Image Registration

Shift-map Image Registration Shift-map Image Registration Svärm, Linus; Stranmark, Petter Unpublishe: 2010-01-01 Link to publication Citation for publishe version (APA): Svärm, L., & Stranmark, P. (2010). Shift-map Image Registration.

More information

A Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition

A Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition ITERATIOAL JOURAL OF MATHEMATICS AD COMPUTERS I SIMULATIO A eural etwork Moel Base on Graph Matching an Annealing :Application to Han-Written Digits Recognition Kyunghee Lee Abstract We present a neural

More information

Computer Organization

Computer Organization Computer Organization Douglas Comer Computer Science Department Purue University 250 N. University Street West Lafayette, IN 47907-2066 http://www.cs.purue.eu/people/comer Copyright 2006. All rights reserve.

More information

Estimation of large-amplitude motion and disparity fields: Application to intermediate view reconstruction

Estimation of large-amplitude motion and disparity fields: Application to intermediate view reconstruction c 2000 SPIE. Personal use of this material is permitte. However, permission to reprint/republish this material for avertising or promotional purposes or for creating new collective works for resale or

More information

Shift-map Image Registration

Shift-map Image Registration Shift-map Image Registration Linus Svärm Petter Stranmark Centre for Mathematical Sciences, Lun University {linus,petter}@maths.lth.se Abstract Shift-map image processing is a new framework base on energy

More information

An Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources

An Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract

More information

Coupling the User Interfaces of a Multiuser Program

Coupling the User Interfaces of a Multiuser Program Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces

More information

A FAST SEGMENTATION-DRIVEN ALGORITHM FOR ACCURATE STEREO CORRESPONDENCE. Stefano Mattoccia and Leonardo De-Maeztu

A FAST SEGMENTATION-DRIVEN ALGORITHM FOR ACCURATE STEREO CORRESPONDENCE. Stefano Mattoccia and Leonardo De-Maeztu A FAST SEGMENTATION-DRIVEN ALGORITHM FOR ACCURATE STEREO CORRESPONDENCE Stefano Mattoccia and Leonardo De-Maeztu University of Bologna, Public University of Navarre ABSTRACT Recent cost aggregation strategies

More information

Probabilistic Medium Access Control for. Full-Duplex Networks with Half-Duplex Clients

Probabilistic Medium Access Control for. Full-Duplex Networks with Half-Duplex Clients Probabilistic Meium Access Control for 1 Full-Duplex Networks with Half-Duplex Clients arxiv:1608.08729v1 [cs.ni] 31 Aug 2016 Shih-Ying Chen, Ting-Feng Huang, Kate Ching-Ju Lin, Member, IEEE, Y.-W. Peter

More information

A new fuzzy visual servoing with application to robot manipulator

A new fuzzy visual servoing with application to robot manipulator 2005 American Control Conference June 8-10, 2005. Portlan, OR, USA FrA09.4 A new fuzzy visual servoing with application to robot manipulator Marco A. Moreno-Armenariz, Wen Yu Abstract Many stereo vision

More information

Temporally Consistence Depth Estimation from Stereo Video Sequences

Temporally Consistence Depth Estimation from Stereo Video Sequences Temporally Consistence Depth Estimation from Stereo Video Sequences Ji-Hun Mun and Yo-Sung Ho (&) School of Information and Communications, Gwangju Institute of Science and Technology (GIST), 123 Cheomdangwagi-ro,

More information

Solution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation

Solution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation Solution Representation for Job Shop Scheuling Problems in Ant Colony Optimisation James Montgomery, Carole Faya 2, an Sana Petrovic 2 Faculty of Information & Communication Technologies, Swinburne University

More information

Estimating Velocity Fields on a Freeway from Low Resolution Video

Estimating Velocity Fields on a Freeway from Low Resolution Video Estimating Velocity Fiels on a Freeway from Low Resolution Vieo Young Cho Department of Statistics University of California, Berkeley Berkeley, CA 94720-3860 Email: young@stat.berkeley.eu John Rice Department

More information

A Comparative Evaluation of Iris and Ocular Recognition Methods on Challenging Ocular Images

A Comparative Evaluation of Iris and Ocular Recognition Methods on Challenging Ocular Images A Comparative Evaluation of Iris an Ocular Recognition Methos on Challenging Ocular Images Vishnu Naresh Boeti Carnegie Mellon University Pittsburgh, PA 523 naresh@cmu.eu Jonathon M Smereka Carnegie Mellon

More information

A SoPC design of a real-time high-definition stereo matching algorithm based on SAD

A SoPC design of a real-time high-definition stereo matching algorithm based on SAD A SoPC esign of a real-time high-efinition stereo matching algorithm base on SAD Abstract Xiang Zhang *, Huaixiang Zhang, Yifan Wu School of Computer, Hangzhou Dianzi University, Hangzhou 310018, China

More information

State Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway

State Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway State Inexe Policy Search by Dynamic Programming Charles DuHaway Yi Gu 5435537 503372 December 4, 2007 Abstract We consier the reinforcement learning problem of simultaneous trajectory-following an obstacle

More information

filtering LETTER An Improved Neighbor Selection Algorithm in Collaborative Taek-Hun KIM a), Student Member and Sung-Bong YANG b), Nonmember

filtering LETTER An Improved Neighbor Selection Algorithm in Collaborative Taek-Hun KIM a), Student Member and Sung-Bong YANG b), Nonmember 107 IEICE TRANS INF & SYST, VOLE88 D, NO5 MAY 005 LETTER An Improve Neighbor Selection Algorithm in Collaborative Filtering Taek-Hun KIM a), Stuent Member an Sung-Bong YANG b), Nonmember SUMMARY Nowaays,

More information

Threshold Based Data Aggregation Algorithm To Detect Rainfall Induced Landslides

Threshold Based Data Aggregation Algorithm To Detect Rainfall Induced Landslides Threshol Base Data Aggregation Algorithm To Detect Rainfall Inuce Lanslies Maneesha V. Ramesh P. V. Ushakumari Department of Computer Science Department of Mathematics Amrita School of Engineering Amrita

More information

CS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics

CS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics CS 106 Winter 2016 Craig S. Kaplan Moule 01 Processing Recap Topics The basic parts of speech in a Processing program Scope Review of syntax for classes an objects Reaings Your CS 105 notes Learning Processing,

More information

MORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks

MORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks : a Movement-Base Routing Algorithm for Vehicle A Hoc Networks Fabrizio Granelli, Senior Member, Giulia Boato, Member, an Dzmitry Kliazovich, Stuent Member Abstract Recent interest in car-to-car communications

More information

Classifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means

Classifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu

More information

The Journal of Systems and Software

The Journal of Systems and Software The Journal of Systems an Software 83 (010) 1864 187 Contents lists available at ScienceDirect The Journal of Systems an Software journal homepage: www.elsevier.com/locate/jss Embeing capacity raising

More information

[2006] IEEE. Reprinted, with permission, from [Damith C. Herath, Sarath Kodagoda and Gamini Dissanayake, Simultaneous Localisation and Mapping: A

[2006] IEEE. Reprinted, with permission, from [Damith C. Herath, Sarath Kodagoda and Gamini Dissanayake, Simultaneous Localisation and Mapping: A [6] IEEE. Reprinte, with permission, from [Damith C. Herath, Sarath Koagoa an Gamini Dissanayake, Simultaneous Localisation an Mapping: A Stereo Vision Base Approach, Intelligent Robots an Systems, 6 IEEE/RSJ

More information

IN TRADITIONAL 2-D videos, users can only see a signal

IN TRADITIONAL 2-D videos, users can only see a signal IEEE TANSACTIONS ON CICUITS AND SYSTEMS FO VIDEO TECNOOGY, VO. 1, NO. 4, API 011 485 Moel-Base Joint Bit Allocation Between Texture Vieos an Depth Maps for 3-D Vieo Coing ui Yuan, Stuent Member, IEEE,

More information

Random Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation

Random Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation DEIM Forum 2018 I4-4 Abstract Ranom Clustering for Multiple Sampling Units to Spee Up Run-time Sample Generation uzuru OKAJIMA an Koichi MARUAMA NEC Solution Innovators, Lt. 1-18-7 Shinkiba, Koto-ku, Tokyo,

More information

MICROARRAY IMAGE GRIDDING USING GRID LINE REFINEMENT TECHNIQUE

MICROARRAY IMAGE GRIDDING USING GRID LINE REFINEMENT TECHNIQUE DOI: 10.21917/ijivp.2015.0148 MICROARRAY IMAGE GRIDDING USING GRID LINE REFINEMENT TECHNIQUE V.G. Biju 1 an P. Mythili 2 School of Engineering, Cochin University of Science an Technology, Inia E-mail:

More information

EXTRACTION OF MAIN AND SECONDARY ROADS IN VHR IMAGES USING A HIGHER-ORDER PHASE FIELD MODEL

EXTRACTION OF MAIN AND SECONDARY ROADS IN VHR IMAGES USING A HIGHER-ORDER PHASE FIELD MODEL EXTRACTION OF MAIN AND SECONDARY ROADS IN VHR IMAGES USING A HIGHER-ORDER PHASE FIELD MODEL Ting Peng a,b, Ian H. Jermyn b, Véronique Prinet a, Josiane Zerubia b a LIAMA & PR, Institute of Automation,

More information

Bends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways

Bends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways Ben, Jogs, An Wiggles for Railroa Tracks an Vehicle Guie Ways Louis T. Klauer Jr., PhD, PE. Work Soft 833 Galer Dr. Newtown Square, PA 19073 lklauer@wsof.com Preprint, June 4, 00 Copyright 00 by Louis

More information

Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks

Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication

More information

Chalmers Publication Library

Chalmers Publication Library Chalmers Publication Library All-to-all Broacast for Vehicular Networks Base on Coe Slotte ALOHA This ocument has been ownloae from Chalmers Publication Library (CPL). It is the author s version of a work

More information

A fast embedded selection approach for color texture classification using degraded LBP

A fast embedded selection approach for color texture classification using degraded LBP A fast embee selection approach for color texture classification using egrae A. Porebski, N. Vanenbroucke an D. Hama Laboratoire LISIC - EA 4491 - Université u Littoral Côte Opale - 50, rue Ferinan Buisson

More information

Politehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques

Politehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques Politehnica University of Timisoara Mobile Computing, Sensors Network an Embee Systems Laboratory ing Techniques What is testing? ing is the process of emonstrating that errors are not present. The purpose

More information

WLAN Indoor Positioning Based on Euclidean Distances and Fuzzy Logic

WLAN Indoor Positioning Based on Euclidean Distances and Fuzzy Logic WLAN Inoor Positioning Base on Eucliean Distances an Fuzzy Logic Anreas TEUBER, Bern EISSFELLER Institute of Geoesy an Navigation, University FAF, Munich, Germany, e-mail: (anreas.teuber, bern.eissfeller)@unibw.e

More information

Performance Modelling of Necklace Hypercubes

Performance Modelling of Necklace Hypercubes erformance Moelling of ecklace ypercubes. Meraji,,. arbazi-aza,, A. atooghy, IM chool of Computer cience & harif University of Technology, Tehran, Iran {meraji, patooghy}@ce.sharif.eu, aza@ipm.ir a Abstract

More information

AnyTraffic Labeled Routing

AnyTraffic Labeled Routing AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,

More information

Dual Arm Robot Research Report

Dual Arm Robot Research Report Dual Arm Robot Research Report Analytical Inverse Kinematics Solution for Moularize Dual-Arm Robot With offset at shouler an wrist Motivation an Abstract Generally, an inustrial manipulator such as PUMA

More information

Stereo Vision-based Subpixel Level Free Space Boundary Detection Using Modified u-disparity and Preview Dynamic Programming

Stereo Vision-based Subpixel Level Free Space Boundary Detection Using Modified u-disparity and Preview Dynamic Programming 2015 IEEE Intelligent Vehicles Symposium (IV) June 28 - July 1, 2015. COEX, Seoul, Korea Stereo Vision-base Subpixel Level Free Space Bounary Detection Using Moifie u-isparity an Preview Dynamic Programming

More information

Using Ray Tracing for Site-Specific Indoor Radio Signal Strength Analysis 1

Using Ray Tracing for Site-Specific Indoor Radio Signal Strength Analysis 1 Using Ray Tracing for Site-Specific Inoor Raio Signal Strength Analysis 1 Michael Ni, Stephen Mann, an Jay Black Computer Science Department, University of Waterloo, Waterloo, Ontario, NL G1, Canaa Abstract

More information

Indexing the Edges A simple and yet efficient approach to high-dimensional indexing

Indexing the Edges A simple and yet efficient approach to high-dimensional indexing Inexing the Eges A simple an yet efficient approach to high-imensional inexing Beng Chin Ooi Kian-Lee Tan Cui Yu Stephane Bressan Department of Computer Science National University of Singapore 3 Science

More information

Object Recognition Using Colour, Shape and Affine Invariant Ratios

Object Recognition Using Colour, Shape and Affine Invariant Ratios Object Recognition Using Colour, Shape an Affine Invariant Ratios Paul A. Walcott Centre for Information Engineering City University, Lonon EC1V 0HB, Englan P.A.Walcott@city.ac.uk Abstract This paper escribes

More information

Cluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters

Cluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters Available online at www.scienceirect.com Proceia Engineering 4 (011 ) 34 38 011 International Conference on Avances in Engineering Cluster Center Initialization Metho for K-means Algorithm Over Data Sets

More information

Calculation on diffraction aperture of cube corner retroreflector

Calculation on diffraction aperture of cube corner retroreflector November 10, 008 / Vol., No. 11 / CHINESE OPTICS LETTERS 8 Calculation on iffraction aperture of cube corner retroreflector Song Li (Ó Ø, Bei Tang (», an Hui Zhou ( ï School of Electronic Information,

More information

A PSO Optimized Layered Approach for Parametric Clustering on Weather Dataset

A PSO Optimized Layered Approach for Parametric Clustering on Weather Dataset Vol.3, Issue.1, Jan-Feb. 013 pp-504-508 ISSN: 49-6645 A PSO Optimize Layere Approach for Parametric Clustering on Weather Dataset Shikha Verma, 1 Kiran Jyoti 1 Stuent, Guru Nanak Dev Engineering College

More information

Inuence of Cross-Interferences on Blocked Loops: to know the precise gain brought by blocking. It is even dicult to determine for which problem

Inuence of Cross-Interferences on Blocked Loops: to know the precise gain brought by blocking. It is even dicult to determine for which problem Inuence of Cross-Interferences on Blocke Loops A Case Stuy with Matrix-Vector Multiply CHRISTINE FRICKER INRIA, France an OLIVIER TEMAM an WILLIAM JALBY University of Versailles, France State-of-the art

More information

Exploring Context with Deep Structured models for Semantic Segmentation

Exploring Context with Deep Structured models for Semantic Segmentation 1 Exploring Context with Deep Structure moels for Semantic Segmentation Guosheng Lin, Chunhua Shen, Anton van en Hengel, Ian Rei between an image patch an a large backgroun image region. Explicitly moeling

More information

Kinematic Analysis of a Family of 3R Manipulators

Kinematic Analysis of a Family of 3R Manipulators Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,

More information

PERFECT ONE-ERROR-CORRECTING CODES ON ITERATED COMPLETE GRAPHS: ENCODING AND DECODING FOR THE SF LABELING

PERFECT ONE-ERROR-CORRECTING CODES ON ITERATED COMPLETE GRAPHS: ENCODING AND DECODING FOR THE SF LABELING PERFECT ONE-ERROR-CORRECTING CODES ON ITERATED COMPLETE GRAPHS: ENCODING AND DECODING FOR THE SF LABELING PAMELA RUSSELL ADVISOR: PAUL CULL OREGON STATE UNIVERSITY ABSTRACT. Birchall an Teor prove that

More information

Chapter 5 Proposed models for reconstituting/ adapting three stereoscopes

Chapter 5 Proposed models for reconstituting/ adapting three stereoscopes Chapter 5 Propose moels for reconstituting/ aapting three stereoscopes - 89 - 5. Propose moels for reconstituting/aapting three stereoscopes This chapter offers three contributions in the Stereoscopy area,

More information

The Panum Proxy algorithm for dense stereo matching over a volume of interest

The Panum Proxy algorithm for dense stereo matching over a volume of interest The Panum Proxy algorithm for ense stereo matching over a volume of interest A. Agarwal an A. Blake Microsoft Research Lt. 7 J J Thomson Ave, Cambrige, CB3 FB, UK http://research.microsoft.com/vision/cambrige

More information

Offloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization

Offloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization 1 Offloaing Cellular Traffic through Opportunistic Communications: Analysis an Optimization Vincenzo Sciancalepore, Domenico Giustiniano, Albert Banchs, Anreea Picu arxiv:1405.3548v1 [cs.ni] 14 May 24

More information

Learning Subproblem Complexities in Distributed Branch and Bound

Learning Subproblem Complexities in Distributed Branch and Bound Learning Subproblem Complexities in Distribute Branch an Boun Lars Otten Department of Computer Science University of California, Irvine lotten@ics.uci.eu Rina Dechter Department of Computer Science University

More information

Adaptive Load Balancing based on IP Fast Reroute to Avoid Congestion Hot-spots

Adaptive Load Balancing based on IP Fast Reroute to Avoid Congestion Hot-spots Aaptive Loa Balancing base on IP Fast Reroute to Avoi Congestion Hot-spots Masaki Hara an Takuya Yoshihiro Faculty of Systems Engineering, Wakayama University 930 Sakaeani, Wakayama, 640-8510, Japan Email:

More information

Particle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem

Particle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base

More information

A Versatile Model-Based Visibility Measure for Geometric Primitives

A Versatile Model-Based Visibility Measure for Geometric Primitives A Versatile Moel-Base Visibility Measure for Geometric Primitives Marc M. Ellenrieer 1,LarsKrüger 1, Dirk Stößel 2, an Marc Hanheie 2 1 DaimlerChrysler AG, Research & Technology, 89013 Ulm, Germany 2 Faculty

More information

NAND flash memory is widely used as a storage

NAND flash memory is widely used as a storage 1 : Buffer-Aware Garbage Collection for Flash-Base Storage Systems Sungjin Lee, Dongkun Shin Member, IEEE, an Jihong Kim Member, IEEE Abstract NAND flash-base storage evice is becoming a viable storage

More information

Bilateral and Trilateral Adaptive Support Weights in Stereo Vision

Bilateral and Trilateral Adaptive Support Weights in Stereo Vision Cost -based In GPU and Support Weights in Vision Student, Colorado School of Mines rbeethe@mines.edu April 7, 2016 1 / 36 Overview Cost -based In GPU 1 Cost 2 3 -based 4 In GPU 2 / 36 Cost -based In GPU

More information

Characterizing Decoding Robustness under Parametric Channel Uncertainty

Characterizing Decoding Robustness under Parametric Channel Uncertainty Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric

More information

Generalized Edge Coloring for Channel Assignment in Wireless Networks

Generalized Edge Coloring for Channel Assignment in Wireless Networks TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html

More information

Using the disparity space to compute occupancy grids from stereo-vision

Using the disparity space to compute occupancy grids from stereo-vision The 2010 IEEE/RSJ International Conference on Intelligent Robots an Systems October 18-22, 2010, Taipei, Taiwan Using the isparity space to compute occupancy gris from stereo-vision Mathias Perrollaz,

More information

Skyline Community Search in Multi-valued Networks

Skyline Community Search in Multi-valued Networks Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h

More information

Non-homogeneous Generalization in Privacy Preserving Data Publishing

Non-homogeneous Generalization in Privacy Preserving Data Publishing Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h

More information

On Effectively Determining the Downlink-to-uplink Sub-frame Width Ratio for Mobile WiMAX Networks Using Spline Extrapolation

On Effectively Determining the Downlink-to-uplink Sub-frame Width Ratio for Mobile WiMAX Networks Using Spline Extrapolation On Effectively Determining the Downlink-to-uplink Sub-frame With Ratio for Mobile WiMAX Networks Using Spline Extrapolation Panagiotis Sarigianniis, Member, IEEE, Member Malamati Louta, Member, IEEE, Member

More information

Discriminative Filters for Depth from Defocus

Discriminative Filters for Depth from Defocus Discriminative Filters for Depth from Defocus Fahim Mannan an Michael S. Langer School of Computer Science, McGill University Montreal, Quebec HA 0E9, Canaa. {fmannan, langer}@cim.mcgill.ca Abstract Depth

More information

Coordinating Distributed Algorithms for Feature Extraction Offloading in Multi-Camera Visual Sensor Networks

Coordinating Distributed Algorithms for Feature Extraction Offloading in Multi-Camera Visual Sensor Networks Coorinating Distribute Algorithms for Feature Extraction Offloaing in Multi-Camera Visual Sensor Networks Emil Eriksson, György Dán, Viktoria Foor School of Electrical Engineering, KTH Royal Institute

More information

A Classification of 3R Orthogonal Manipulators by the Topology of their Workspace

A Classification of 3R Orthogonal Manipulators by the Topology of their Workspace A Classification of R Orthogonal Manipulators by the Topology of their Workspace Maher aili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S.

More information

Using Vector and Raster-Based Techniques in Categorical Map Generalization

Using Vector and Raster-Based Techniques in Categorical Map Generalization Thir ICA Workshop on Progress in Automate Map Generalization, Ottawa, 12-14 August 1999 1 Using Vector an Raster-Base Techniques in Categorical Map Generalization Beat Peter an Robert Weibel Department

More information

BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES

BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES OLIVIER BERNARDI AND ÉRIC FUSY Abstract. We present bijections for planar maps with bounaries. In particular, we obtain bijections for triangulations an quarangulations

More information

Multilevel Linear Dimensionality Reduction using Hypergraphs for Data Analysis

Multilevel Linear Dimensionality Reduction using Hypergraphs for Data Analysis Multilevel Linear Dimensionality Reuction using Hypergraphs for Data Analysis Haw-ren Fang Department of Computer Science an Engineering University of Minnesota; Minneapolis, MN 55455 hrfang@csumneu ABSTRACT

More information

Feature Extraction and Rule Classification Algorithm of Digital Mammography based on Rough Set Theory

Feature Extraction and Rule Classification Algorithm of Digital Mammography based on Rough Set Theory Feature Extraction an Rule Classification Algorithm of Digital Mammography base on Rough Set Theory Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative

More information

CAMERAS AND GRAVITY: ESTIMATING PLANAR OBJECT ORIENTATION. Zhaoyin Jia, Andrew Gallagher, Tsuhan Chen

CAMERAS AND GRAVITY: ESTIMATING PLANAR OBJECT ORIENTATION. Zhaoyin Jia, Andrew Gallagher, Tsuhan Chen CAMERAS AND GRAVITY: ESTIMATING PLANAR OBJECT ORIENTATION Zhaoyin Jia, Anrew Gallagher, Tsuhan Chen School of Electrical an Computer Engineering, Cornell University ABSTRACT Photography on a mobile camera

More information

MANJUSHA K.*, ANAND KUMAR M., SOMAN K. P.

MANJUSHA K.*, ANAND KUMAR M., SOMAN K. P. Journal of Engineering Science an echnology Vol. 13, No. 1 (2018) 141-157 School of Engineering, aylor s University IMPLEMENAION OF REJECION SRAEGIES INSIDE MALAYALAM CHARACER RECOGNIION SYSEM BASED ON

More information

Computer Graphics Chapter 7 Three-Dimensional Viewing Viewing

Computer Graphics Chapter 7 Three-Dimensional Viewing Viewing Computer Graphics Chapter 7 Three-Dimensional Viewing Outline Overview of Three-Dimensional Viewing Concepts The Three-Dimensional Viewing Pipeline Three-Dimensional Viewing-Coorinate Parameters Transformation

More information

Rough Set Approach for Classification of Breast Cancer Mammogram Images

Rough Set Approach for Classification of Breast Cancer Mammogram Images Rough Set Approach for Classification of Breast Cancer Mammogram Images Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative Methos an Information Systems

More information

Correlation-based color mosaic interpolation using a connectionist approach

Correlation-based color mosaic interpolation using a connectionist approach Correlation-base color mosaic interpolation using a connectionist approach Gary L. Embler * Agilent Technologies, Inc. 75 Bowers Avenue, MS 87H Santa Clara, California 9554 USA ABSTRACT This paper presents

More information

Improving Spatial Reuse of IEEE Based Ad Hoc Networks

Improving Spatial Reuse of IEEE Based Ad Hoc Networks mproving Spatial Reuse of EEE 82.11 Base A Hoc Networks Fengji Ye, Su Yi an Biplab Sikar ECSE Department, Rensselaer Polytechnic nstitute Troy, NY 1218 Abstract n this paper, we evaluate an suggest methos

More information

On the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems

On the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems On the Role of Multiply Sectione Bayesian Networks to Cooperative Multiagent Systems Y. Xiang University of Guelph, Canaa, yxiang@cis.uoguelph.ca V. Lesser University of Massachusetts at Amherst, USA,

More information