Globally Stabilized 3L Curve Fitting
|
|
- Isabella Jenkins
- 5 years ago
- Views:
Transcription
1 Globally Stabilized 3L Curve Fitting Turker Sahin and Mustafa Unel Department of Computer Engineering, Gebze Institute of Technology Cayirova Campus 44 Gebze/Kocaeli Turkey Abstract. Although some of the linear curve fitting techniques provide improvements over the classical least squares fit algorithm, most of them cannot globally stabilize majority of data sets, and are not robust enough to handle moderate levels of noise or missing data. In this paper, we apply ridge regression regularization to strengthen the stability and robustness of a linear fitting method, 3L fitting algorithm, while maintaining its Euclidean invariance. Introduction Implicit polynomial (IP) models have proven to be more suitable than parametric representations for fitting algebraic curves to data with their advantages like global shape representation, smoothing noisy data and robustness against occlusion [,,3,4,5,6,7,8]. Nonlinear optimization methods have been commonly applied for IP curve modelling; however, they suffer from high computational complexity and cost [,3,4]. Recently linear approaches to curve fitting have started to emerge, which address such problems [9,,]. However, these techniques usually cannot provide globally stabilized fits for many cases and are not robust versus perturbational effects like noise. In this paper as a way to overcome these problems, we apply ridge regression regularization to the 3L fitting method. We have observed that the ridge regression regularization of Gradient method expressed in [] does not provide satisfactory results for reasons like oversensitivity to changes in parameters and normalization. We have obtained better results with regularization of 3L, which we present for verifying the noticeable improvements in global stability and robustness, as well as insensitivity to parameter changes. Implicit Curve Models and Data Set Normalization. Algebraic Curves Algebraic curves are represented by implicit polynomial models of arbitrary degree, n, as: f n (x, y) =a + a x + a y a n x n + a n, x n y a n y n A. Campilho, M. Kamel (Eds.): ICIAR 4, LNCS 3, pp , 4. c Springer-Verlag Berlin Heidelberg 4
2 496 T. Sahin and M. Unel Fig.. The 3 Levels of data for a free from boundary = [ xy... y n] [ ] T a a a... a n = Y T A = () }{{}}{{} Y T A where Y T is the vector of monomials and A is the vector of IP coefficients.. Normalization An important concept integrated into many fitting methods is data set normalization to reduce the pathological effects in the resulting IP s, which usually arise because of their high degree terms taking large values. In our experiments radial distance normalization is used. This is a linear process, based on dividing every data point, (x i,y i ) N i=, with the average radial distance of the set i (x i + y i )/ after the center of data has been shifted to origin. It has been N observed to give better results than other proposed normalizations [] in our experiments. 3 The 3L Linear Fitting Method The objective of all linear IP curve fitting techniques is to approximate a given data set with a polynomial as closely as possible by minimization of their algebraic distance. The adopted 3L algorithm [9] uses the following principle for this minimization procedure: closed-bounded IP s should have zero values at the data points, negative values for inside points and positive values for outside points, or vice versa. Thus any data set to be curve fitted is first integrated with two more data sets with points at a distance, inside and outside the original data as in figure. Accordingly the IP function is forced to take + value at the outer layer, at the inner level, and at the intermediate layer. Thus a b vector and the matrix of 3 layers of data as M is prepared such that: b = [ ] T (3N ), M = M + M M = Y T Y T... Y T 3N 3N c
3 Globally Stabilized 3L Curve Fitting Fig.. Some stable 4th and 6th degree 3L fits Fig. 3. Examples of unstable 3L fits (a) a 4th degree fit for a B plane (b) 6th degree fit of a Shoe; and (c) 8th degree for a Glider where Y i are the vectors of monomials for the 3 layers of data, N is the number of data points, n is the degree of polynomial and c =(n + )(n +)/ isthe number of the coefficients of the IP curve. The resulting curve coefficient vector is obtained by: A = M b () where M =(M T M) M T is the pseudo-inverse matrix for M. This method is Invariant under Euclidean transformations, as the two synthetic layers is formed by using the distance measure. 4 Global Stability by the Ridge Regression Regularization Linear curve fitting techniques achieve local stability around the data points; however, are weak in providing global stability. A reason for this is the near collinearity in the data, which cause the M T M matrix of products of the monomials to be almost singular with some eigenvalues much smaller than the others. Such eigenvalues do not contribute to the fit around the data set and cause extra open unstable branches. Ridge regression is a computationally efficient method for reducing data collinearity and the resulting instability []. By this technique, the condition number of M T M is improved, and the extra curves are moved to infinity, where they disappear giving a stable closed bounded fit. To achieve this, a κd term is applied to equation ( ) as: A κ =(M T M + κd) M T b (3)
4 498 T. Sahin and M. Unel Here κ is the ridge regression parameter, which is to be increased from to higher values until a stable closed bounded curve is obtained. The other part of the ridge regression term is the diagonal D matrix, which has the same number of terms as the the coefficient vector, A κ. The entries of D can be obtained by: j!k! D ii = β j+k (j + k)! (4) where the index for each diagonal element is calculated according to variation of the degrees of the x and y components in equation ( ) by i = k+ (j+k)(j+k+) +. Also β j+k is chosen to be : β j+k = r,s ;r+s=j+k (r + s)! r!s! N l= x r l yl s (5) or when expanded: β =!!! l β = β = N x 4 l +!!! N x l yl = N l= x l + yl = l= l. l β n = l x l y l +!!!. (x k + y k). (x l + y l ) n yl 4 = l l (x l + y l ) with n the degree of the resulting IP and (x l,y l ) N l= are the elements of the normalized object data. As a result the entries of D are set to the invariantly weighted sum of the diagonal elements of M T M, which is an Euclidean invariant measure. Therefore inherent Euclidean invariance properties of fitting methods are preserved by this approach. 5 Experimental Results and Discussion In this section many fits obtained from ridge regression technique are compared to those of non-regularized 3L, to depict the resulting stability and robustness improvements. The 3L fitting technique occasionally gives reasonable results. Some examples are a boot, a Racket and a Siemens mobile phone in Figure. Here the boot is a 6th degree fit example, while the others are 4th degree IP s. However, generally this fitting method has weak global stability properties, which cause significant problems for applications. One related issue is that usually a
5 Globally Stabilized 3L Curve Fitting Fig. 4. Stabilization of the B plane fit by ridge regression method: (a) κ = 4 (b) κ =5 4 (c) κ = Fig. 5. Stabilization of the Shoe fit by ridge regression method: (a) κ = 4 κ =5 4 (c) κ =.5 3 (b) Fig. 6. Stabilized 8th degree Glider fit by ridge regression method: (a) κ = 4 (b) κ =4 4 (c) κ =5 4 Fig. 7. The regularized fit for Cd Box of (a) =. (b) =.7. Stabilizing κ = 4 3 for both cases data to be modelled can be fit stably by IP s of one or two different degrees, but not by others. For example, among the objects in Figure, the boot does not have stable 4th or 8th degree fits, while the racket cannot be stabilized above 6th degree IP s. A further problem is this method cannot cannot give stable fits for many important data at all. Some examples are depicted in Figure 3. These curves are with a 4th degree IP for the B plane, 6th degree for the shoe and 8th degree for the glider. Each of these data cannot be stabilized for fits of either
6 5 T. Sahin and M. Unel Fig. 8. Robustness improvement of ridge regression method versus noise. First row depict the degradation of 3L Vase fit, and the second row is the robustness of ridge regression based fit, both subjected to no noise in left subplots; moderate noise of σ =.75 in the middle; and much higher noise of σ =. in the right Fig. 9. The robustness of regularized curve fitting approach against Occlusion: In the first row plots, the left one is data is with no occlusion, middle is with % occlusion, and right is with % occlusion; In the second row are the corresponding fits. 4th or 6th or 8th degrees, but they were modelled by IP s of one of these three degrees for more compact examplification. All data data in Figure 3 can be globally stabilized by ridge regression regularization, which is depicted in figures 4-6. Again these are 4th, 6th and 8th degree fits for the B, the shoe and the glider which indicate the ability of this technique to model data with various degree curves. As presented in their subplots, when the κ parameter is increased from zero to the range 4, the extra unstable curves tend to move away from the actual data set and disappear. The insensitivity of ridge regression based 3L method to variations in the parameter is examplified in Figure 7 for two CD Box fits of =. and
7 Globally Stabilized 3L Curve Fitting 5 Fig.. Some globally stabilized curves of marine creatures and man-made objects. The first four objects are modelled by 8th degree, the next six of them are modelled by 6th degree and the last two are modelled by 4th degree algebraic curves.7. As observable these fits cannot be distinguished from each other; moreover the stabilizing κ s are the same for both cases. Thus a single can be used for modelling all data sets. In deed, =.5 has been used in all other example figures. Robustness of the this approach has also been verified by fits to noisy and occluded cases. Figure 8 shows the improvement in robustness against noise by ridge regression application over the 3L only case. Here the top row is the nonregularized fits, while the second row is the ridge regression based fits. Also the left subplots depict noise free cases; the middle plots are with moderate noise level of σ =.75; and the right ones are for the much higher noise of σ =.. It can be observed the vase data can be stably fit in presence of much higher noise levels with ridge regression technique, which verifies the remarkable robustness of this technique to Gaussian perturbations. In figure 9 robustness of this regularization for occlusion or data loss has been examplified. The first row depict the employed car data for cases of no occlusion, % of data chopped, and % occlusion from left to right. The lower row shows the corresponding curve fits to each case, which are all stable and very near to each other in shape. Thus this method can also be applied to cases of missing data with reasonable accuracy. Finally we present 4 8th degree fits of various objects in Figure. Nearly all these data could be globally stabilized using κ values of no more than 5 3 and none require κ s more than, which indicate the strong global stabilizability properties of this method. 6 Conclusions The ridge regression Regularization dramatically improves the poor global stability properties of the 3L technique it has been applied. Thus by application of this global stabilization method, a much wider range of data can be accurately fit by IP s of all degrees. Ridge regression also improves the robustness of curves
8 5 T. Sahin and M. Unel to occlusion and especially noise significantly. The parameter tuning process of this approach is also much simpler, as it is much less sensitive to parameter and normalization changes. Moreover, this method preserves the Euclidean invariance, thus should be very suitable for many important applications in motion identification, pose estimation and object recognition. Acknowledgments. This research was supported from GYTE research grant BAP #3A3. The data of employed marine creatures are courtesy of University of Surrey, UK. References. M. Pilu, A. Fitzgibbon and R. Fisher, Ellipse Specific Direct Least Squares Fitting, Proc. IEEE, International Conference on Image Processing, Lausanne, Switzerland, September G. Taubin, Estimation of Planar Curves, Surfaces and Nonplanar Space Curves Defined by Implicit Equations with Applications to Edge and Range Segmentation, IEEE TPAMI, Vol. 3, pp. 5-38, G. Taubin, et al. Parametrized Families of Polynomials fo Bounded Algebraic Curve and Surface Fitting, IEEE Transactions on Pattern Analysis and Machine Vision, 6(3):87-33, March D. Keren, D. Cooper and J. Subrahmonia, Describing Complicated Objects by Implicit Polynomials, IEEE Transactions on Pattern Analysis and Machine Vision, Vol. 6, pp , W. A. Wolovich and M. Unel, The Determination of Implicit Polynomail Canonical Curves, IEEE TPAMI, Vol. (8), M Unel and W. A. Wolovich, On the Construction of Complete Sets of Geometric Invariants for Algebraic Curves, Advances In Applied Mathematics 4, 65-87,. 7. M Unel and W. A. Wolovich, A New Representation for Quartic Curves and Complete Sets of Geometric Invariants, International Journal of Pattern Recognition and Artificail Intelligence, Vol. 3(8), J. Subrahmonia, D. B. Cooper and D. Keren, Practical Reliable Bayesian Recognition of D and 3D Objects using Implicit Polynomials and Algebraic Invariants, IEEE TPAMI, 8(5):55-59, M.Blane, Z.Lei et al., The 3L algorithm for Fitting Implicit Polynomial Curves and Surfaces to Data, IEEE Transaction on Pattern Analysis and Machine Intelligence, Bol., No.3, March.. Z. Lei and D. B. Cooper, New, Faster, More Controlled Fitting of Implicit Polynomial D Curves and 3D Surfaces to Data, IEEE Conference on Computer Vision and Pattern Recognition, June T. Tasdizen, J-P Tarel and D. B. Cooper, Improving the Stability of Algebraic Curves for Applications, IEEE Transactions on Image Processing, Vol. 9, No: 3, pp , March.
Image Based Visual Servoing Using Algebraic Curves Applied to Shape Alignment
The 29 IEEE/RSJ International Conference on Intelligent Robots and Systems October 11-15, 29 St. Louis, USA Image Based Visual Servoing Using Algebraic Curves Applied to Shape Alignment Ahmet Yasin Yazicioglu,
More informationA New Affine Invariant Fitting Algorithm for Algebraic Curves
A New Affine Invariant Fitting Algorithm for Algebraic Curves Sait Sener and Mustafa Unel Department of Computer Engineering, Gebze Institute of Technolog Cairova Campus 44 Gebze/Kocaeli Turke {ssener,
More informationA Linear Dual-Space Approach to 3D Surface Reconstruction from Occluding Contours using Algebraic Surfaces
A Linear Dual-Space Approach to 3D Surface Reconstruction from Occluding Contours using Algebraic Surfaces Kongbin Kang Jean-Philippe Tarel Richard Fishman David Cooper Div. of Eng. LIVIC (INRETS-LCPC)
More informationExtracting Axially Symmetric Geometry From Limited 3D Range Data
Extracting Axially Symmetric Geometry From Limited 3D Range Data Andrew Willis, Xavier Orriols, Senem Velipasalar, Xavier Binefa, David B. Cooper Brown University, Providence, RI 02912 Computer Vision
More informationImage Enhancement Techniques for Fingerprint Identification
March 2013 1 Image Enhancement Techniques for Fingerprint Identification Pankaj Deshmukh, Siraj Pathan, Riyaz Pathan Abstract The aim of this paper is to propose a new method in fingerprint enhancement
More information3 Nonlinear Regression
CSC 4 / CSC D / CSC C 3 Sometimes linear models are not sufficient to capture the real-world phenomena, and thus nonlinear models are necessary. In regression, all such models will have the same basic
More informationRelaxing the 3L algorithm for an accurate implicit polynomial fitting
Relaxing the 3L algorithm or an accurate implicit polynomial itting Mohammad Rouhani Computer Vision Center Ediici O, Campus UAB 08193 Bellaterra, Barcelona, Spain rouhani@cvc.uab.es Angel D. Sappa Computer
More informationModel-Based Human Motion Capture from Monocular Video Sequences
Model-Based Human Motion Capture from Monocular Video Sequences Jihun Park 1, Sangho Park 2, and J.K. Aggarwal 2 1 Department of Computer Engineering Hongik University Seoul, Korea jhpark@hongik.ac.kr
More informationPatch-based Object Recognition. Basic Idea
Patch-based Object Recognition 1! Basic Idea Determine interest points in image Determine local image properties around interest points Use local image properties for object classification Example: Interest
More information3 Nonlinear Regression
3 Linear models are often insufficient to capture the real-world phenomena. That is, the relation between the inputs and the outputs we want to be able to predict are not linear. As a consequence, nonlinear
More informationCorner Detection. Harvey Rhody Chester F. Carlson Center for Imaging Science Rochester Institute of Technology
Corner Detection Harvey Rhody Chester F. Carlson Center for Imaging Science Rochester Institute of Technology rhody@cis.rit.edu April 11, 2006 Abstract Corners and edges are two of the most important geometrical
More informationAn Adaptive Eigenshape Model
An Adaptive Eigenshape Model Adam Baumberg and David Hogg School of Computer Studies University of Leeds, Leeds LS2 9JT, U.K. amb@scs.leeds.ac.uk Abstract There has been a great deal of recent interest
More informationA Unified Linear Fitting Approach for Singular and Non-Singular 3D Quadrics from Occluding Contours
A Unified Linear Fitting Approach for Singular and Non-Singular 3D Quadrics from Occluding Contours Kongbin Kang Division of Engineering Brown University Providence, RI 2912 Kongbin Kang@brown.edu Jean-Philippe
More informationEE368 Project Report CD Cover Recognition Using Modified SIFT Algorithm
EE368 Project Report CD Cover Recognition Using Modified SIFT Algorithm Group 1: Mina A. Makar Stanford University mamakar@stanford.edu Abstract In this report, we investigate the application of the Scale-Invariant
More informationLocal Image Registration: An Adaptive Filtering Framework
Local Image Registration: An Adaptive Filtering Framework Gulcin Caner a,a.murattekalp a,b, Gaurav Sharma a and Wendi Heinzelman a a Electrical and Computer Engineering Dept.,University of Rochester, Rochester,
More informationEllipse fitting using orthogonal hyperbolae and Stirling s oval
Ellipse fitting using orthogonal hyperbolae and Stirling s oval Paul L. Rosin Abstract Two methods for approximating the normal distance to an ellipse using a) its orthogonal hyperbolae, and b) Stirling
More informationThe Novel Approach for 3D Face Recognition Using Simple Preprocessing Method
The Novel Approach for 3D Face Recognition Using Simple Preprocessing Method Parvin Aminnejad 1, Ahmad Ayatollahi 2, Siamak Aminnejad 3, Reihaneh Asghari Abstract In this work, we presented a novel approach
More informationAutomatic Feature Extraction of Pose-measuring System Based on Geometric Invariants
Automatic Feature Extraction of Pose-measuring System Based on Geometric Invariants Yan Lin 1,2 Bin Kong 2 Fei Zheng 2 1 Center for Biomimetic Sensing and Control Research, Institute of Intelligent Machines,
More informationExploring Curve Fitting for Fingers in Egocentric Images
Exploring Curve Fitting for Fingers in Egocentric Images Akanksha Saran Robotics Institute, Carnegie Mellon University 16-811: Math Fundamentals for Robotics Final Project Report Email: asaran@andrew.cmu.edu
More informationMultiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 Structure Computation Lecture 18 March 22, 2005 2 3D Reconstruction The goal of 3D reconstruction
More informationLeave-One-Out Support Vector Machines
Leave-One-Out Support Vector Machines Jason Weston Department of Computer Science Royal Holloway, University of London, Egham Hill, Egham, Surrey, TW20 OEX, UK. Abstract We present a new learning algorithm
More informationOn Skeletons Attached to Grey Scale Images. Institute for Studies in Theoretical Physics and Mathematics Tehran, Iran ABSTRACT
On Skeletons Attached to Grey Scale Images M. Karimi Behbahani, Arash Rafiey, 2 Mehrdad Shahshahani 3 Institute for Studies in Theoretical Physics and Mathematics Tehran, Iran ABSTRACT In [2], [3] and
More informationSUMMARY: DISTINCTIVE IMAGE FEATURES FROM SCALE- INVARIANT KEYPOINTS
SUMMARY: DISTINCTIVE IMAGE FEATURES FROM SCALE- INVARIANT KEYPOINTS Cognitive Robotics Original: David G. Lowe, 004 Summary: Coen van Leeuwen, s1460919 Abstract: This article presents a method to extract
More informationSIFT: SCALE INVARIANT FEATURE TRANSFORM SURF: SPEEDED UP ROBUST FEATURES BASHAR ALSADIK EOS DEPT. TOPMAP M13 3D GEOINFORMATION FROM IMAGES 2014
SIFT: SCALE INVARIANT FEATURE TRANSFORM SURF: SPEEDED UP ROBUST FEATURES BASHAR ALSADIK EOS DEPT. TOPMAP M13 3D GEOINFORMATION FROM IMAGES 2014 SIFT SIFT: Scale Invariant Feature Transform; transform image
More informationA Fast and Accurate Eyelids and Eyelashes Detection Approach for Iris Segmentation
A Fast and Accurate Eyelids and Eyelashes Detection Approach for Iris Segmentation Walid Aydi, Lotfi Kamoun, Nouri Masmoudi Department of Electrical National Engineering School of Sfax Sfax University
More informationProbabilistic Facial Feature Extraction Using Joint Distribution of Location and Texture Information
Probabilistic Facial Feature Extraction Using Joint Distribution of Location and Texture Information Mustafa Berkay Yilmaz, Hakan Erdogan, Mustafa Unel Sabanci University, Faculty of Engineering and Natural
More informationData Mining Practical Machine Learning Tools and Techniques. Slides for Chapter 6 of Data Mining by I. H. Witten and E. Frank
Data Mining Practical Machine Learning Tools and Techniques Slides for Chapter 6 of Data Mining by I. H. Witten and E. Frank Implementation: Real machine learning schemes Decision trees Classification
More informationModel-based segmentation and recognition from range data
Model-based segmentation and recognition from range data Jan Boehm Institute for Photogrammetry Universität Stuttgart Germany Keywords: range image, segmentation, object recognition, CAD ABSTRACT This
More informationRobust Pole Placement using Linear Quadratic Regulator Weight Selection Algorithm
329 Robust Pole Placement using Linear Quadratic Regulator Weight Selection Algorithm Vishwa Nath 1, R. Mitra 2 1,2 Department of Electronics and Communication Engineering, Indian Institute of Technology,
More informationAN ALGORITHM FOR BLIND RESTORATION OF BLURRED AND NOISY IMAGES
AN ALGORITHM FOR BLIND RESTORATION OF BLURRED AND NOISY IMAGES Nader Moayeri and Konstantinos Konstantinides Hewlett-Packard Laboratories 1501 Page Mill Road Palo Alto, CA 94304-1120 moayeri,konstant@hpl.hp.com
More informationRobust Ring Detection In Phase Correlation Surfaces
Griffith Research Online https://research-repository.griffith.edu.au Robust Ring Detection In Phase Correlation Surfaces Author Gonzalez, Ruben Published 2013 Conference Title 2013 International Conference
More informationSnakes reparameterization for noisy images segmentation and targets tracking
Snakes reparameterization for noisy images segmentation and targets tracking Idrissi Sidi Yassine, Samir Belfkih. Lycée Tawfik Elhakim Zawiya de Noaceur, route de Marrakech, Casablanca, maroc. Laboratoire
More informationContents. 1 Introduction Background Organization Features... 7
Contents 1 Introduction... 1 1.1 Background.... 1 1.2 Organization... 2 1.3 Features... 7 Part I Fundamental Algorithms for Computer Vision 2 Ellipse Fitting... 11 2.1 Representation of Ellipses.... 11
More informationHonors Precalculus: Solving equations and inequalities graphically and algebraically. Page 1
Solving equations and inequalities graphically and algebraically 1. Plot points on the Cartesian coordinate plane. P.1 2. Represent data graphically using scatter plots, bar graphs, & line graphs. P.1
More informationApproximation of 3D-Parametric Functions by Bicubic B-spline Functions
International Journal of Mathematical Modelling & Computations Vol. 02, No. 03, 2012, 211-220 Approximation of 3D-Parametric Functions by Bicubic B-spline Functions M. Amirfakhrian a, a Department of Mathematics,
More informationIRIS SEGMENTATION OF NON-IDEAL IMAGES
IRIS SEGMENTATION OF NON-IDEAL IMAGES William S. Weld St. Lawrence University Computer Science Department Canton, NY 13617 Xiaojun Qi, Ph.D Utah State University Computer Science Department Logan, UT 84322
More informationPlanar Symmetry Detection by Random Sampling and Voting Process
Planar Symmetry Detection by Random Sampling and Voting Process Atsushi Imiya, Tomoki Ueno, and Iris Fermin Dept. of IIS, Chiba University, 1-33, Yayo-cho, Inage-ku, Chiba, 263-8522, Japan imiya@ics.tj.chiba-u.ac.jp
More informationDETECTION OF CHANGES IN SURVEILLANCE VIDEOS. Longin Jan Latecki, Xiangdong Wen, and Nilesh Ghubade
DETECTION OF CHANGES IN SURVEILLANCE VIDEOS Longin Jan Latecki, Xiangdong Wen, and Nilesh Ghubade CIS Dept. Dept. of Mathematics CIS Dept. Temple University Temple University Temple University Philadelphia,
More informationProf. Fanny Ficuciello Robotics for Bioengineering Visual Servoing
Visual servoing vision allows a robotic system to obtain geometrical and qualitative information on the surrounding environment high level control motion planning (look-and-move visual grasping) low level
More informationA Robust Method for Circle / Ellipse Extraction Based Canny Edge Detection
International Journal of Research Studies in Science, Engineering and Technology Volume 2, Issue 5, May 2015, PP 49-57 ISSN 2349-4751 (Print) & ISSN 2349-476X (Online) A Robust Method for Circle / Ellipse
More informationPose Estimation of Free-Form 3D Objects without Point Matching using Algebraic Surface Models
Pose Estimation of Free-Form 3D Objects without Point Matching using Algebraic Surface Models Jean-Philippe Tarel INRIA Domaine de oluceau Rocquencourt B.P. 105 78153 Le Chesnay Cedex France. David B.
More informationA Bottom Up Algebraic Approach to Motion Segmentation
A Bottom Up Algebraic Approach to Motion Segmentation Dheeraj Singaraju and RenéVidal Center for Imaging Science, Johns Hopkins University, 301 Clark Hall, 3400 N. Charles St., Baltimore, MD, 21218, USA
More informationAn Edge-Based Approach to Motion Detection*
An Edge-Based Approach to Motion Detection* Angel D. Sappa and Fadi Dornaika Computer Vison Center Edifici O Campus UAB 08193 Barcelona, Spain {sappa, dornaika}@cvc.uab.es Abstract. This paper presents
More informationHOUGH TRANSFORM CS 6350 C V
HOUGH TRANSFORM CS 6350 C V HOUGH TRANSFORM The problem: Given a set of points in 2-D, find if a sub-set of these points, fall on a LINE. Hough Transform One powerful global method for detecting edges
More informationEvaluation of Loop Subdivision Surfaces
Evaluation of Loop Subdivision Surfaces Jos Stam Alias wavefront, Inc. 8 Third Ave, 8th Floor, Seattle, WA 980, U.S.A. jstam@aw.sgi.com Abstract This paper describes a technique to evaluate Loop subdivision
More informationAutomated Segmentation Using a Fast Implementation of the Chan-Vese Models
Automated Segmentation Using a Fast Implementation of the Chan-Vese Models Huan Xu, and Xiao-Feng Wang,,3 Intelligent Computation Lab, Hefei Institute of Intelligent Machines, Chinese Academy of Science,
More informationFingerprint Classification Using Orientation Field Flow Curves
Fingerprint Classification Using Orientation Field Flow Curves Sarat C. Dass Michigan State University sdass@msu.edu Anil K. Jain Michigan State University ain@msu.edu Abstract Manual fingerprint classification
More informationarxiv: v1 [cs.cv] 28 Sep 2018
Camera Pose Estimation from Sequence of Calibrated Images arxiv:1809.11066v1 [cs.cv] 28 Sep 2018 Jacek Komorowski 1 and Przemyslaw Rokita 2 1 Maria Curie-Sklodowska University, Institute of Computer Science,
More informationProblems with template matching
Problems with template matching The template represents the object as we expect to find it in the image The object can indeed be scaled or rotated This technique requires a separate template for each scale
More informationImproved Non-Local Means Algorithm Based on Dimensionality Reduction
Improved Non-Local Means Algorithm Based on Dimensionality Reduction Golam M. Maruf and Mahmoud R. El-Sakka (&) Department of Computer Science, University of Western Ontario, London, Ontario, Canada {gmaruf,melsakka}@uwo.ca
More informationImplicitization of Parametric Curves by Matrix Annihilation
International Journal of Computer Vision 54(1//3), 105 115, 003 c 003 Kluwer Academic Publishers Manufactured in The Netherlands Implicitization of Parametric Curves by Matrix Annihilation HULYA YALCIN
More informationCurve and Surface Basics
Curve and Surface Basics Implicit and parametric forms Power basis form Bezier curves Rational Bezier Curves Tensor Product Surfaces ME525x NURBS Curve and Surface Modeling Page 1 Implicit and Parametric
More informationThe SIFT (Scale Invariant Feature
The SIFT (Scale Invariant Feature Transform) Detector and Descriptor developed by David Lowe University of British Columbia Initial paper ICCV 1999 Newer journal paper IJCV 2004 Review: Matt Brown s Canonical
More informationOrientation of manifolds - definition*
Bulletin of the Manifold Atlas - definition (2013) Orientation of manifolds - definition* MATTHIAS KRECK 1. Zero dimensional manifolds For zero dimensional manifolds an orientation is a map from the manifold
More informationPerformance Evaluation Metrics and Statistics for Positional Tracker Evaluation
Performance Evaluation Metrics and Statistics for Positional Tracker Evaluation Chris J. Needham and Roger D. Boyle School of Computing, The University of Leeds, Leeds, LS2 9JT, UK {chrisn,roger}@comp.leeds.ac.uk
More informationGeneralized Principal Component Analysis CVPR 2007
Generalized Principal Component Analysis Tutorial @ CVPR 2007 Yi Ma ECE Department University of Illinois Urbana Champaign René Vidal Center for Imaging Science Institute for Computational Medicine Johns
More informationMotion Estimation and Optical Flow Tracking
Image Matching Image Retrieval Object Recognition Motion Estimation and Optical Flow Tracking Example: Mosiacing (Panorama) M. Brown and D. G. Lowe. Recognising Panoramas. ICCV 2003 Example 3D Reconstruction
More informationA Fast Registration Method Using IP and Its Application to Ultrasound Image Registration
IPSJ Transactions on Computer Vision and Applications Vol. 1 209 219 (Sep. 2009) Research Paper A Fast Registration Method Using IP and Its Application to Ultrasound Image Registration Bo Zheng, 1 Ryo
More informationAdaptive osculatory rational interpolation for image processing
Journal of Computational and Applied Mathematics 195 (2006) 46 53 www.elsevier.com/locate/cam Adaptive osculatory rational interpolation for image processing Min Hu a, Jieqing Tan b, a College of Computer
More informationTraining-Free, Generic Object Detection Using Locally Adaptive Regression Kernels
Training-Free, Generic Object Detection Using Locally Adaptive Regression Kernels IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIENCE, VOL.32, NO.9, SEPTEMBER 2010 Hae Jong Seo, Student Member,
More informationEngineered Diffusers Intensity vs Irradiance
Engineered Diffusers Intensity vs Irradiance Engineered Diffusers are specified by their divergence angle and intensity profile. The divergence angle usually is given as the width of the intensity distribution
More informationBasic Algorithms for Digital Image Analysis: a course
Institute of Informatics Eötvös Loránd University Budapest, Hungary Basic Algorithms for Digital Image Analysis: a course Dmitrij Csetverikov with help of Attila Lerch, Judit Verestóy, Zoltán Megyesi,
More informationAn Automated Image-based Method for Multi-Leaf Collimator Positioning Verification in Intensity Modulated Radiation Therapy
An Automated Image-based Method for Multi-Leaf Collimator Positioning Verification in Intensity Modulated Radiation Therapy Chenyang Xu 1, Siemens Corporate Research, Inc., Princeton, NJ, USA Xiaolei Huang,
More informationSome questions of consensus building using co-association
Some questions of consensus building using co-association VITALIY TAYANOV Polish-Japanese High School of Computer Technics Aleja Legionow, 4190, Bytom POLAND vtayanov@yahoo.com Abstract: In this paper
More informationHuman Motion Synthesis by Motion Manifold Learning and Motion Primitive Segmentation
Human Motion Synthesis by Motion Manifold Learning and Motion Primitive Segmentation Chan-Su Lee and Ahmed Elgammal Rutgers University, Piscataway, NJ, USA {chansu, elgammal}@cs.rutgers.edu Abstract. We
More informationStereo Vision. MAN-522 Computer Vision
Stereo Vision MAN-522 Computer Vision What is the goal of stereo vision? The recovery of the 3D structure of a scene using two or more images of the 3D scene, each acquired from a different viewpoint in
More informationA Comparative Study of LOWESS and RBF Approximations for Visualization
A Comparative Study of LOWESS and RBF Approximations for Visualization Michal Smolik, Vaclav Skala and Ondrej Nedved Faculty of Applied Sciences, University of West Bohemia, Univerzitni 8, CZ 364 Plzen,
More informationOccluded Facial Expression Tracking
Occluded Facial Expression Tracking Hugo Mercier 1, Julien Peyras 2, and Patrice Dalle 1 1 Institut de Recherche en Informatique de Toulouse 118, route de Narbonne, F-31062 Toulouse Cedex 9 2 Dipartimento
More informationMulti-Scale Free-Form Surface Description
Multi-Scale Free-Form Surface Description Farzin Mokhtarian, Nasser Khalili and Peter Yuen Centre for Vision Speech and Signal Processing Dept. of Electronic and Electrical Engineering University of Surrey,
More informationRobust Lip Contour Extraction using Separability of Multi-Dimensional Distributions
Robust Lip Contour Extraction using Separability of Multi-Dimensional Distributions Tomokazu Wakasugi, Masahide Nishiura and Kazuhiro Fukui Corporate Research and Development Center, Toshiba Corporation
More informationStructural and Syntactic Techniques for Recognition of Ethiopic Characters
Structural and Syntactic Techniques for Recognition of Ethiopic Characters Yaregal Assabie and Josef Bigun School of Information Science, Computer and Electrical Engineering Halmstad University, SE-301
More informationCurve Representation ME761A Instructor in Charge Prof. J. Ramkumar Department of Mechanical Engineering, IIT Kanpur
Curve Representation ME761A Instructor in Charge Prof. J. Ramkumar Department of Mechanical Engineering, IIT Kanpur Email: jrkumar@iitk.ac.in Curve representation 1. Wireframe models There are three types
More informationpolygonal approximations
An improved method for obtaining optimal polygonal approximations A. Carmona-Poyato; F. J. Madrid-Cuevas; N. L. Fernández-García; R. Medina-Carnicer Abstract In computer vision, polygonal approximations
More informationIntroduction. Introduction. Related Research. SIFT method. SIFT method. Distinctive Image Features from Scale-Invariant. Scale.
Distinctive Image Features from Scale-Invariant Keypoints David G. Lowe presented by, Sudheendra Invariance Intensity Scale Rotation Affine View point Introduction Introduction SIFT (Scale Invariant Feature
More informationAugmented Reality VU. Computer Vision 3D Registration (2) Prof. Vincent Lepetit
Augmented Reality VU Computer Vision 3D Registration (2) Prof. Vincent Lepetit Feature Point-Based 3D Tracking Feature Points for 3D Tracking Much less ambiguous than edges; Point-to-point reprojection
More informationLevel lines based disocclusion
Level lines based disocclusion Simon Masnou Jean-Michel Morel CEREMADE CMLA Université Paris-IX Dauphine Ecole Normale Supérieure de Cachan 75775 Paris Cedex 16, France 94235 Cachan Cedex, France Abstract
More informationA Linear Approximation Based Method for Noise-Robust and Illumination-Invariant Image Change Detection
A Linear Approximation Based Method for Noise-Robust and Illumination-Invariant Image Change Detection Bin Gao 2, Tie-Yan Liu 1, Qian-Sheng Cheng 2, and Wei-Ying Ma 1 1 Microsoft Research Asia, No.49 Zhichun
More informationNormals of subdivision surfaces and their control polyhedra
Computer Aided Geometric Design 24 (27 112 116 www.elsevier.com/locate/cagd Normals of subdivision surfaces and their control polyhedra I. Ginkel a,j.peters b,,g.umlauf a a University of Kaiserslautern,
More informationIntroduction to Computer Vision
Introduction to Computer Vision Michael J. Black Nov 2009 Perspective projection and affine motion Goals Today Perspective projection 3D motion Wed Projects Friday Regularization and robust statistics
More informationVisual Tracking (1) Tracking of Feature Points and Planar Rigid Objects
Intelligent Control Systems Visual Tracking (1) Tracking of Feature Points and Planar Rigid Objects Shingo Kagami Graduate School of Information Sciences, Tohoku University swk(at)ic.is.tohoku.ac.jp http://www.ic.is.tohoku.ac.jp/ja/swk/
More informationMETRIC PLANE RECTIFICATION USING SYMMETRIC VANISHING POINTS
METRIC PLANE RECTIFICATION USING SYMMETRIC VANISHING POINTS M. Lefler, H. Hel-Or Dept. of CS, University of Haifa, Israel Y. Hel-Or School of CS, IDC, Herzliya, Israel ABSTRACT Video analysis often requires
More informationAffine-invariant shape matching and recognition under partial occlusion
Title Affine-invariant shape matching and recognition under partial occlusion Author(s) Mai, F; Chang, CQ; Hung, YS Citation The 17th IEEE International Conference on Image Processing (ICIP 2010), Hong
More informationA New Approach to Computation of Curvature Scale Space Image for Shape Similarity Retrieval
A New Approach to Computation of Curvature Scale Space Image for Shape Similarity Retrieval Farzin Mokhtarian, Sadegh Abbasi and Josef Kittler Centre for Vision Speech and Signal Processing Department
More informationSpatio-Temporal Stereo Disparity Integration
Spatio-Temporal Stereo Disparity Integration Sandino Morales and Reinhard Klette The.enpeda.. Project, The University of Auckland Tamaki Innovation Campus, Auckland, New Zealand pmor085@aucklanduni.ac.nz
More informationExperiments with Edge Detection using One-dimensional Surface Fitting
Experiments with Edge Detection using One-dimensional Surface Fitting Gabor Terei, Jorge Luis Nunes e Silva Brito The Ohio State University, Department of Geodetic Science and Surveying 1958 Neil Avenue,
More informationLecture 2.2 Cubic Splines
Lecture. Cubic Splines Cubic Spline The equation for a single parametric cubic spline segment is given by 4 i t Bit t t t i (..) where t and t are the parameter values at the beginning and end of the segment.
More informationTowards the completion of assignment 1
Towards the completion of assignment 1 What to do for calibration What to do for point matching What to do for tracking What to do for GUI COMPSCI 773 Feature Point Detection Why study feature point detection?
More informationCoarse-to-Fine Search Technique to Detect Circles in Images
Int J Adv Manuf Technol (1999) 15:96 102 1999 Springer-Verlag London Limited Coarse-to-Fine Search Technique to Detect Circles in Images M. Atiquzzaman Department of Electrical and Computer Engineering,
More informationFace Alignment Under Various Poses and Expressions
Face Alignment Under Various Poses and Expressions Shengjun Xin and Haizhou Ai Computer Science and Technology Department, Tsinghua University, Beijing 100084, China ahz@mail.tsinghua.edu.cn Abstract.
More informationSTATISTICS AND ANALYSIS OF SHAPE
Control and Cybernetics vol. 36 (2007) No. 2 Book review: STATISTICS AND ANALYSIS OF SHAPE by H. Krim, A. Yezzi, Jr., eds. There are numerous definitions of a notion of shape of an object. These definitions
More informationTexture Mapping using Surface Flattening via Multi-Dimensional Scaling
Texture Mapping using Surface Flattening via Multi-Dimensional Scaling Gil Zigelman Ron Kimmel Department of Computer Science, Technion, Haifa 32000, Israel and Nahum Kiryati Department of Electrical Engineering
More informationImproving Recognition through Object Sub-categorization
Improving Recognition through Object Sub-categorization Al Mansur and Yoshinori Kuno Graduate School of Science and Engineering, Saitama University, 255 Shimo-Okubo, Sakura-ku, Saitama-shi, Saitama 338-8570,
More informationAccurately Estimating Sherd 3D Surface Geometry with Application to Pot Reconstruction 1
Accurately Estimating Sherd 3D Surface Geometry with Application to Pot Reconstruction Andrew Willis, Xavier Orriols, David B. Cooper Brown University, Providence, RI 02912 Computer Vision Center (UAB),
More informationOutline 7/2/201011/6/
Outline Pattern recognition in computer vision Background on the development of SIFT SIFT algorithm and some of its variations Computational considerations (SURF) Potential improvement Summary 01 2 Pattern
More informationAn Efficient Method for Solving the Direct Kinematics of Parallel Manipulators Following a Trajectory
An Efficient Method for Solving the Direct Kinematics of Parallel Manipulators Following a Trajectory Roshdy Foaad Abo-Shanab Kafr Elsheikh University/Department of Mechanical Engineering, Kafr Elsheikh,
More informationEdge linking. Two types of approaches. This process needs to be able to bridge gaps in detected edges due to the reason mentioned above
Edge linking Edge detection rarely finds the entire set of edges in an image. Normally there are breaks due to noise, non-uniform illumination, etc. If we want to obtain region boundaries (for segmentation)
More informationSEMI-BLIND IMAGE RESTORATION USING A LOCAL NEURAL APPROACH
SEMI-BLIND IMAGE RESTORATION USING A LOCAL NEURAL APPROACH Ignazio Gallo, Elisabetta Binaghi and Mario Raspanti Universitá degli Studi dell Insubria Varese, Italy email: ignazio.gallo@uninsubria.it ABSTRACT
More informationAutomatic Tracking of Moving Objects in Video for Surveillance Applications
Automatic Tracking of Moving Objects in Video for Surveillance Applications Manjunath Narayana Committee: Dr. Donna Haverkamp (Chair) Dr. Arvin Agah Dr. James Miller Department of Electrical Engineering
More informationModel Based Perspective Inversion
Model Based Perspective Inversion A. D. Worrall, K. D. Baker & G. D. Sullivan Intelligent Systems Group, Department of Computer Science, University of Reading, RG6 2AX, UK. Anthony.Worrall@reading.ac.uk
More informationScale Space and PDE methods in image analysis and processing. Arjan Kuijper
Scale Space and PDE methods in image analysis and processing Arjan Kuijper Fraunhofer Institute for Computer Graphics Research Interactive Graphics Systems Group, TU Darmstadt Fraunhoferstrasse 5, 64283
More information