Stereo Disparity Estimation in Moment Space

Size: px
Start display at page:

Download "Stereo Disparity Estimation in Moment Space"

Transcription

1 Stereo Disarity Estimation in oment Sace Angeline Pang Faculty of Information Technology, ultimedia University, 63 Cyberjaya, alaysia. R. ukundan Deartment of Comuter Science, University of Canterbury, Christchurch, ew Zealand. g Liang Shing Faculty of Engineering, ultimedia University, 63 Cyberjaya, alaysia. Abstract This aer exlores various ways by which ixel disarities along eiolar rows of a stereo image air could be obtained using Chebyshev moments of the corresonding D images. Chebyshev moments allow us to reresent the image features based on orthogonal basis functions, and hence to reconstruct the intensity distribution from a set of moments fairly accurately. Disarity estimates can be obtained either analytically from the inverse moment transform, or by comaring the reconstructed intensity values. The aer also resents some reliminary results obtained using both synthetic and real images. Keywords: Stereo Image Processing, Disarity Estimation, Discrete Orthogonal oments, Chebyshev Polynomials. Introduction oment functions such as geometric and Zernike moments, are used in several comuter vision alications for reresenting global and invariant shae characteristics of image features. Orthogonal moments (Zernike, Pseudo-Zernike etc.) have been roved to be less sensitive to image noise when comared to geometric moments, and ossess far better feature reresentation caabilities [-3]. For examle, the information redundancy measure is minimum in an orthogonal moment set. Recently, discrete orthogonal moments based on Chebyshev (Tchebichef) olynomials were introduced [4-6], which can also be used as image descritors with minimum information redundancy. Chebyshev moments are orthogonal in the image coordinate sace itself, and thus rovide more accurate reconstructions of the original image; while the comutation of Zernike moments involves discrete aroximations and coordinate transformations which severely affect their orthogonality roerties in the image sace. Since the image intensity distribution can be very accurately reresented by Chebyshev moments, the matching of intensity values in alications such as stereosis, can also be attemted in the moment sace. Along eiolar stereo image rows, the corresondence between two intensity values I(x) and I(x+d x ) is reresented by the disarity d x at ixel x. Using discrete orthogonal moments, we can have an accurate olynomial aroximation of the intensity distribution I(x) in terms of the kernel functions (Chebyshev olynomials of degree ) t (x). Thus, in the moment sace, the corresondence between two ixels in a stereo air can be exressed as a relation involving terms t (x+d x ) of different orders, where the coefficients are moments comuted from the two images. The analytical characteristics of the kernel functions are well known. We can therefore try to 26 Image and Vision Comuting Z

2 imlement some novel aroaches to disarity estimation, such as obtaining the values of d x by comaring moment terms rather than by comaring intensity values. deriving analytical solutions for d x from moment equations. The above considerations were the main motivation behind the work reorted in this aer. The next section outlines the framework of Chebychev moments and their inverse moment transforms. A few analytical derivations of the disarity values from moment equations are given in Section 3. Exerimental results and a discussion on the advantages and limitations of moment based stereosis are given in Section 4. t (x)= 2 ( ) ( 2 ) t( x) t ( x) ( ) t 2 2, > (5) The image intensity function f(x, y) has a olynomial reresentation given by f(x, y) = T qt tq ( y) (6) = q= where the coefficients T q are the Chebyshev moments defined in (2). 2 Chebyshev oments Given an x image, discrete orthogonal olynomials {t n (x)} over the image coordinate sace satisfy the condition tm t n = ρ ( n, ) δ, m, n =,,. () mn Left Image Right Image where n,) is the squared norm of the olynomial set t n. The classical discrete Chebyshev olynomials [7,8] satisfy the above roerty of orthogonality (). For image analysis alications, we can aroriately scale the above olynomials to avoid numerical instabilities in the comutation of large-order moments. Some of the ossible sets of scale factors are discussed in [4]. Alternatively, we can also make the olynomial functions orthonormal with n,)=, (which also amounts to introducing a scale factor) and minimize the roagation of errors using the rocess of renormalization [9]. The Chebyshev moments of order +q are defined as [4-6] T q = t tq ( y) f ( x, y),, ) q, ) y=, q =,,. (2) and, one set of scaled Chebyshev olynomials t (x) can be comuted using the following recurrence relation: t (x) =. (3) t (x) = 2x + (4) Row 3 of L-image Reconstructed Images Row 3 of R-image Figure : Original and reconstructed intensity distributions on an image row of a stereo air. We can easily write the one-dimensional versions of equations (2), (6) as Palmerston orth, ovember 23 26

3 T = t, ) f, =,,. (7) and, f(x) = T t. (8) = Figure gives an examle of a synthetic stereo image air, and the original and reconstructed intensity distributions on a articular row. 3 Disarity Values and oment Equations In this section, we attemt to derive analytical relationshis between disarity values and the intensity moments using the equations given above. If we denote the one-dimensional intensity distributions along eiolar lines of the left and the right image by f l (x) and f r (x) resectively, then a disarity value d x at the ixel x establishes a corresondence in the intensity domain given by f l (x) = f r (x+d x ) (9) If we use the olynomial reresentation of the intensity function as given in (8), we get = ( t ( x + d ) T t ). T () x (l) (r) where T, T denote the th order Chebychev moments of intensity functions (7) along the left and the right eiolar image rows, and is a sufficiently large value (tyically /2 or greater) denoting the maximum order of moments. Several analytical reresentations for the disarity function d x can be derived from (). For examle, we can write d x = ( T T ) t = = T t () where t (x) denotes the derivative of t (x). A th order olynomial will have zeros, and hence for large values of, the derivative of the function t (x) will have many oints where the value is either zero or is very large. Thus () will not, in many cases, rovide any meaningful results. An alternative aroach is to comute the coarse disarity estimates using low-order moments (using(3),(4)) as d x = ( T T ) + ( T T ) 2T 2x + (2) and then develo an iterative udate scheme for d x using higher order moments, alying the constraint (). The lot of d x for a fixed value of x is given in figure 2. d = d = = = Figure 2: Variation of disarity with resect to coarse-to-fine reconstruction using moments. 4 Exerimental Analysis Instead of using the analytical aroaches detailed in the revious section, we could also attemt to estimate disarity values in the moment sace, by minimizing the difference between reconstructed intensity values: In other words, for each x, we seek a value d x which minimizes λ x = ( T t x + d ) T t ) = ( (3) x Assuming that the disarity function is continuous in a neighborhood [x k, x+k] of x for small values of k, we can redefine the cost function as: k λ x = ( T t x + d + i) T t ( x + i) ) i= k = 2 2 ( x (4) The disarity values obtained for the 3 th row of the image air in figure., and for the whole image, are shown below. 262 Image and Vision Comuting Z

4 d = 5 d = Row 3 Whole image Figure 3: Disarity ma for the stereo air in figure. Left Image Right Image Figure 5. Real images used in exerimental analysis. The rimary advantage of moment based stereo disarity estimation is that the disarity values can be reresented as offsets in the arguments of kernel functions, whose characteristics are well known (unlike the intensity distribution). This allows us to choose cost functions that deend on the maximum order of moments used. The reconstructed olynomial aroximation of the intensity values, can exhibit Gibb s henomenon (as in the case of inverse Fourier transform) near regions of large intensity gradients. Such effects will have to be eliminated for imroving the accuracy of the estimates. Figure 4 shows the reconstruction of row 42 of the left-image in figure, and the effect of the Gibb s henomenon on disarity estimates. Figure 6. Disarity ma obtained using images in figure 5. Some ossible extensions of the work reorted in this aer are listed below. A rogressive udate of disarity values using (2) with local smoothness constraints. Combining the minimization roblem (3) with a dynamic rogramming aroach [] for refining the disarity ma. Row 42 Disarity Figure 4: Effect of Gibb s henomenon on disarity values. The olynomial aroximation of the intensity function can reduce the effects of image noise. However, since an entire row is reresented by a single function, background intensities will not be searable from those of the foreground objects. This can also be observed in figure. Such a blending of intensities might lead to erroneous estimates. Figure 6 gives the initial exerimental results with real images in figure 5. Further imrovements in the disarity estimates can be obtained using a dynamic rogramming aroach and rectangular windows. Alication of a coarse-to-fine reconstruction strategy together with coarseto-fine dynamic rogramming [] to minimize the comutation time. 5 Conclusions The aer has resented a method based on discrete Chebyshev moments using which the disarity values in a stereo image air could be reresented in the moment sace. Such a reresentation allows ixel disarities to be equivalently denoted by offsets in the argument of continuous olynomial functions. Consequently, several analytical as well as numerical characterizations of the disarity values could be ossible, given a large set of equations involving moments (of various orders) of the left and right images. The ossibility of using this aroach in stereosis has been exlored, and some exerimental results were resented. Palmerston orth, ovember

5 6 References [].R. Teague: Image analysis via the general theory of moments, J. of Ot. Soc. of America 7 (98), [2] S.O. Belkasim, Pattern recognition with moment invariants A comarative study and new results, Pattern Recognition, vol. 24,. 7-38, 99.. [3] R. ukundan, K.R. Ramakrishnan: oment Functions in Image Analysis-Theory and Alications, World Scientific, Singaore (998). [4] R. ukundan, S. H. Ong, P. A. Lee, Image analysis by Tchebichef moments, IEEE Trans. Image Processing, vol. (9), (2). [5] R. ukundan, S. H. Ong, P. A. Lee, Discrete orthogonal moment features using Chebyshev olynomials, Proc. Image and Vision Comuting ew Zealand IVCZ-2,. 2-25, 2. [6] R. ukundan, S. H. Ong, P. A. Lee, Discrete vs. Continuous Orthogonal oments for Image Analysis, Proc. Intl. Conf. Imaging Science Systems and Technology CISST-2, vol., , 2. [7] Erdelyi, A. et al, Higher Transcendental Functions, Vol. 2, cgraw Hill, (ew York: 953). [8] ikiforov A.V, Suslov S.K, Uvarov V.B, Classical Orthogonal Polynomials of a Discrete Variable, Sringer-Verlag (99). [9] R.ukundan, Imroving Image Reconstruction Accuracy Using Discrete Orthonormal oments, Proc. Intl. Conf. Imaging Science Systems and Technology CISST-23, vol., , 23. [] J.Cox, et.al. A maximum likelihood stereo algorithm, Comuter Vision and Image Understanding, Vol. 63(3), [] C.Rahael, Coarse-to-fine dynamic rogramming, IEEE Trans. On Pattern Analysis and achine Intell., vol. 23 (2), (2). 264 Image and Vision Comuting Z

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

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

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

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

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

Extracting Optimal Paths from Roadmaps for Motion Planning

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

More information

A 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

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

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

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

Invariant Descriptors and Classifiers Combination for Recognition of Isolated Printed Tifinagh Characters

Invariant Descriptors and Classifiers Combination for Recognition of Isolated Printed Tifinagh Characters IJACSA Secial Issue on Selected aers from Third international symosium on Automatic Amazigh rocessing (SITACAM 3) Invariant Descritors and Classifiers Combination for Recognition of Isolated rinted Tifinagh

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

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

Pivot Selection for Dimension Reduction Using Annealing by Increasing Resampling *

Pivot Selection for Dimension Reduction Using Annealing by Increasing Resampling * ivot Selection for Dimension Reduction Using Annealing by Increasing Resamling * Yasunobu Imamura 1, Naoya Higuchi 1, Tetsuji Kuboyama 2, Kouichi Hirata 1 and Takeshi Shinohara 1 1 Kyushu Institute of

More information

Short Papers. Symmetry Detection by Generalized Complex (GC) Moments: A Close-Form Solution 1 INTRODUCTION

Short Papers. Symmetry Detection by Generalized Complex (GC) Moments: A Close-Form Solution 1 INTRODUCTION 466 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE VOL 2 NO 5 MAY 999 Short Paers Symmetry Detection by Generalized Comlex (GC) Moments: A Close-Form Solution Dinggang Shen Horace HS I

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

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

Facial Expression Recognition using Image Processing and Neural Network

Facial Expression Recognition using Image Processing and Neural Network Keerti Keshav Kanchi / International Journal of Comuter Science & Engineering Technology (IJCSET) Facial Exression Recognition using Image Processing and eural etwork Keerti Keshav Kanchi PG Student, Deartment

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

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

Submission. Verifying Properties Using Sequential ATPG

Submission. Verifying Properties Using Sequential ATPG Verifying Proerties Using Sequential ATPG Jacob A. Abraham and Vivekananda M. Vedula Comuter Engineering Research Center The University of Texas at Austin Austin, TX 78712 jaa, vivek @cerc.utexas.edu Daniel

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

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

Chapter 8: Adaptive Networks

Chapter 8: Adaptive Networks Chater : Adative Networks Introduction (.1) Architecture (.2) Backroagation for Feedforward Networks (.3) Jyh-Shing Roger Jang et al., Neuro-Fuzzy and Soft Comuting: A Comutational Aroach to Learning and

More information

Multi-fractal Techniques for Emphysema Classification in Lung Tissue Images

Multi-fractal Techniques for Emphysema Classification in Lung Tissue Images 204 3rd International Conference on Environment, Chemistry and Biology IPCBEE vol.78 (204) (204) IACSIT Press, Singaore DOI: 0.7763/IPCBEE. 204. V78. 2 Multi-fractal Techniques for Emhysema Classification

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

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

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

More information

Bayesian Oil Spill Segmentation of SAR Images via Graph Cuts 1

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

More information

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

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

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

GRAPH CUT OPTIMIZATION FOR THE MUMFORD-SHAH MODEL

GRAPH CUT OPTIMIZATION FOR THE MUMFORD-SHAH MODEL GRAPH CUT OPTIMIZATION FOR THE MUMFORD-SHAH MODEL Noha El Zehiry 1,2, Steve Xu 2, Prasanna Sahoo 2 and Adel Elmaghraby 1 1 Deartment of Comuter Engineering and Comuter Science, University of Louisville,

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

Improve Precategorized Collection Retrieval by Using Supervised Term Weighting Schemes Λ

Improve Precategorized Collection Retrieval by Using Supervised Term Weighting Schemes Λ Imrove Precategorized Collection Retrieval by Using Suervised Term Weighting Schemes Λ Ying Zhao and George Karyis University of Minnesota, Deartment of Comuter Science Minneaolis, MN 55455 Abstract The

More information

Robot Path and End-Effector Orientation Planning Using Augmented Reality

Robot Path and End-Effector Orientation Planning Using Augmented Reality Available online at www.sciencedirect.com Procedia CIRP 3 (2012 ) 191 196 45 th CIRP Conference on Manufacturing Systems 2012 Robot Path and End-Effector Orientation Planning Using Augmented Reality H.C.

More information

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

Constrained Path Optimisation for Underground Mine Layout

Constrained Path Optimisation for Underground Mine Layout Constrained Path Otimisation for Underground Mine Layout M. Brazil P.A. Grossman D.H. Lee J.H. Rubinstein D.A. Thomas N.C. Wormald Abstract The major infrastructure comonent reuired to develo an underground

More information

Learning Robust Locality Preserving Projection via p-order Minimization

Learning Robust Locality Preserving Projection via p-order Minimization Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence Learning Robust Locality Preserving Projection via -Order Minimization Hua Wang, Feiing Nie, Heng Huang Deartment of Electrical

More information

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission. An Interactive Programming Method for Solving the Multile Criteria Problem Author(s): Stanley Zionts and Jyrki Wallenius Source: Management Science, Vol. 22, No. 6 (Feb., 1976),. 652-663 Published by:

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

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

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

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

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

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

More information

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

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

More information

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

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

More information

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

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

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

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

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

More information

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

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

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

Th SRS1 14 Generalizing and Stabilizing Reverse Time Migration Deconvolution Imaging

Th SRS1 14 Generalizing and Stabilizing Reverse Time Migration Deconvolution Imaging Th SRS1 14 Generalizing and Stabilizing Reverse Time Migration Deconvolution Imaging J. Messud* (CGG) & G. Lambaré (CGG) SUMMARY For reverse time migration, the deconvolution imaging condition offers the

More information

Visual Correspondence Using Energy Minimization and Mutual Information

Visual Correspondence Using Energy Minimization and Mutual Information Visual Corresondence Using Energy Minimization and Mutual Information Junhwan Kim Vladimir Kolmogorov Ramin Zabih Comuter Science Deartment Cornell University Ithaca, NY 14853 Abstract We address visual

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

Use of Multivariate Statistical Analysis in the Modelling of Chromatographic Processes

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

More information

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

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

More information

A New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism

A New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism A New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism Erlin Yao, Mingyu Chen, Rui Wang, Wenli Zhang, Guangming Tan Key Laboratory of Comuter System and Architecture Institute

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

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

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

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

Hardware-Accelerated Formal Verification

Hardware-Accelerated Formal Verification Hardare-Accelerated Formal Verification Hiroaki Yoshida, Satoshi Morishita 3 Masahiro Fujita,. VLSI Design and Education Center (VDEC), University of Tokyo. CREST, Jaan Science and Technology Agency 3.

More information

Multi-robot SLAM with Unknown Initial Correspondence: The Robot Rendezvous Case

Multi-robot SLAM with Unknown Initial Correspondence: The Robot Rendezvous Case Multi-robot SLAM with Unknown Initial Corresondence: The Robot Rendezvous Case Xun S. Zhou and Stergios I. Roumeliotis Deartment of Comuter Science & Engineering, University of Minnesota, Minneaolis, MN

More information

CS 229 Final Project: Single Image Depth Estimation From Predicted Semantic Labels

CS 229 Final Project: Single Image Depth Estimation From Predicted Semantic Labels CS 229 Final Project: Single Image Deth Estimation From Predicted Semantic Labels Beyang Liu beyangl@cs.stanford.edu Stehen Gould sgould@stanford.edu Prof. Dahne Koller koller@cs.stanford.edu December

More information

NEW APPROACH FOR 3D OBJECT RECOGNITION USING NON UNIFORM FOURIER AND MOMENTS COEFFICIENTS

NEW APPROACH FOR 3D OBJECT RECOGNITION USING NON UNIFORM FOURIER AND MOMENTS COEFFICIENTS Journal of Engineering Science and Technology Vol. 12, No. 5 (2017) 1354-1365 School of Engineering, Taylor s University NEW APPROACH FOR 3D OBJECT RECOGNITION USING NON UNIFORM FOURIER AND MOMENTS COEFFICIENTS

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

An Iteratively Reweighted Norm Algorithm for Total Variation Regularization

An Iteratively Reweighted Norm Algorithm for Total Variation Regularization An Iteratively eweighted Norm Algorithm for Total Variation egularization Paul odríguez and Brendt Wohlberg Abstract Total Variation TV regularization has become a oular method for a wide variety of image

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

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

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

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

3D RECONSTRUCTION OF ROADS AND TREES FOR CITY MODELLING

3D RECONSTRUCTION OF ROADS AND TREES FOR CITY MODELLING 3D RECONSTRUCTION OF ROADS AND TREES FOR CITY MODELLING George Vosselman Deartment of Geodesy, Delft University of Technology, Thijsseweg 11, NL-2629 JA Delft, The Netherlands g.vosselman@geo.tudelft.nl

More information

SPITFIRE: Scalable Parallel Algorithms for Test Set Partitioned Fault Simulation

SPITFIRE: Scalable Parallel Algorithms for Test Set Partitioned Fault Simulation To aear in IEEE VLSI Test Symosium, 1997 SITFIRE: Scalable arallel Algorithms for Test Set artitioned Fault Simulation Dili Krishnaswamy y Elizabeth M. Rudnick y Janak H. atel y rithviraj Banerjee z y

More information

A Symmetric FHE Scheme Based on Linear Algebra

A Symmetric FHE Scheme Based on Linear Algebra A Symmetric FHE Scheme Based on Linear Algebra Iti Sharma University College of Engineering, Comuter Science Deartment. itisharma.uce@gmail.com Abstract FHE is considered to be Holy Grail of cloud comuting.

More information

Detecting Multiple Copies of Copy-Move Forgery Based on SURF

Detecting Multiple Copies of Copy-Move Forgery Based on SURF ISSN (Online) : 2319-8753 ISSN (Print) : 2347-6710 International Journal of Innovative Research in Science, Engineering and Technology Volume 3, Secial Issue 3, March 2014 2014 International Conference

More information

Protecting Mobile Agents against Malicious Host Attacks Using Threat Diagnostic AND/OR Tree

Protecting Mobile Agents against Malicious Host Attacks Using Threat Diagnostic AND/OR Tree Protecting Mobile Agents against Malicious Host Attacks Using Threat Diagnostic AND/OR Tree Magdy Saeb, Meer Hamza, Ashraf Soliman. Arab Academy for Science, Technology & Maritime Transort Comuter Engineering

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

Identity-sensitive Points-to Analysis for the Dynamic Behavior of JavaScript Objects

Identity-sensitive Points-to Analysis for the Dynamic Behavior of JavaScript Objects Identity-sensitive Points-to Analysis for the Dynamic Behavior of JavaScrit Objects Shiyi Wei and Barbara G. Ryder Deartment of Comuter Science, Virginia Tech, Blacksburg, VA, USA. {wei,ryder}@cs.vt.edu

More information

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

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

More information

Using Permuted States and Validated Simulation to Analyze Conflict Rates in Optimistic Replication

Using Permuted States and Validated Simulation to Analyze Conflict Rates in Optimistic Replication Using Permuted States and Validated Simulation to Analyze Conflict Rates in Otimistic Relication An-I A. Wang Comuter Science Deartment Florida State University Geoff H. Kuenning Comuter Science Deartment

More information

Swift Template Matching Based on Equivalent Histogram

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

More information

A Texture Based Matching Approach for Automated Assembly of Puzzles

A Texture Based Matching Approach for Automated Assembly of Puzzles A Texture Based Matching Aroach for Automated Assembly of Puzzles Mahmut amil Saırolu 1, Aytül Erçil Sabancı University 1 msagiroglu@su.sabanciuniv.edu, aytulercil@sabanciuniv.edu Abstract The uzzle assembly

More information

Theoretical Analysis of Graphcut Textures

Theoretical Analysis of Graphcut Textures Theoretical Analysis o Grahcut Textures Xuejie Qin Yee-Hong Yang {xu yang}@cs.ualberta.ca Deartment o omuting Science University o Alberta Abstract Since the aer was ublished in SIGGRAPH 2003 the grahcut

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

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

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

More information

Lecture 2: Fixed-Radius Near Neighbors and Geometric Basics

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

More information

Dense 3D Reconstruction from Specularity Consistency

Dense 3D Reconstruction from Specularity Consistency Dense 3D Reconstruction from Secularity Consistency Diego Nehab Microsoft Research Tim Weyrich Princeton University Szymon Rusinkiewicz Princeton University Abstract In this work, we consider the dense

More information

Auto-Tuning Distributed-Memory 3-Dimensional Fast Fourier Transforms on the Cray XT4

Auto-Tuning Distributed-Memory 3-Dimensional Fast Fourier Transforms on the Cray XT4 Auto-Tuning Distributed-Memory 3-Dimensional Fast Fourier Transforms on the Cray XT4 M. Gajbe a A. Canning, b L-W. Wang, b J. Shalf, b H. Wasserman, b and R. Vuduc, a a Georgia Institute of Technology,

More information

Brief Contributions. A Geometric Theorem for Network Design 1 INTRODUCTION

Brief Contributions. A Geometric Theorem for Network Design 1 INTRODUCTION IEEE TRANSACTIONS ON COMPUTERS, VOL. 53, NO., APRIL 00 83 Brief Contributions A Geometric Theorem for Network Design Massimo Franceschetti, Member, IEEE, Matthew Cook, and Jehoshua Bruck, Fellow, IEEE

More information

Probabilistic Visual Cryptography Schemes

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

More information

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

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

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

More information

Lecture 8: Orthogonal Range Searching

Lecture 8: Orthogonal Range Searching CPS234 Comutational Geometry Setember 22nd, 2005 Lecture 8: Orthogonal Range Searching Lecturer: Pankaj K. Agarwal Scribe: Mason F. Matthews 8.1 Range Searching The general roblem of range searching is

More information

A Multiscale Representation Including Opponent Color Features for Texture Recognition

A Multiscale Representation Including Opponent Color Features for Texture Recognition 14 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 7, NO. 1, JANUARY 1998 nonlinear restoration algorithm. The results indicate that reasonably good assband restoration was accomlished, and there is evidence

More information

Ioannis PITAS b. TIMC-IMAG Grenoble laboratory, UMR CNRS 5525, Domaine de la Merci, LA TRONCHE Cedex, FRANCE,

Ioannis PITAS b. TIMC-IMAG Grenoble laboratory, UMR CNRS 5525, Domaine de la Merci, LA TRONCHE Cedex, FRANCE, ylindrical Surface Localization in Monocular Vision William PUEH a Jean-Marc HASSERY a and Ioannis PITAS b a TIM-IMAG Grenoble laboratory, UMR NRS 5525, Domaine de la Merci, 38706 LA TRONHE edex, FRANE,

More information

Image Segmentation Using Topological Persistence

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

More information

LANDSLIDE IN DOSSENA (BG): COMPARISON BETWEEN INTERFEROMETRIC TECHNIQUES

LANDSLIDE IN DOSSENA (BG): COMPARISON BETWEEN INTERFEROMETRIC TECHNIQUES LANDSLIDE IN DOSSENA (BG): COMPARISON BETWEEN INTERFEROMETRIC TECHNIQUES ABSTRACT Daniele Perissin, Riccardo Piantanida, Davide Piccagl Fabio Rocca Politecnico di Milano, Via Ponzio 34/5, 20133 Milano,

More information