Circular Analysis based Line Detection Filters for Watermark Extraction in X-ray images of Etchings
|
|
- Dwight Chambers
- 5 years ago
- Views:
Transcription
1 Circular Analysis based Line Detection Filters for Watermark Extraction in X-ray images of Etchings M. van Staalduinen, J. C. A. van der Lubbe, E. Backer {M.vanStaalduinen, J.C.A.vanderLubbe, Dept. of Mediamatics, Information and Communication Theory group, Delft University of Technology, P.O. Box 53, 26 GA Delft Keywords: Line Detection, Shape Matching, oisy Images, Circular Analysis, Kuwahara Filtering, Template-Based Filtering, Watermark Analysis Abstract Watermarks and chain lines are paper features that are used to prove the authenticity of etchings. If an artist has printed etchings on paper with the same paper features, then he has used this paper probably in the same period. The aim of the Rembrandtproject is to find automatically paper with similar watermarks and chain lines in a large database. Watermarks and chain lines are made visible by means of X-ray technique. For matching the line patterns among others, they should be extracted from the noisy X-ray images. This paper investigates two line detection filters: an Extended Kuwahara Filter and a Template-Based Filter. These filters are based on a circular analysis for each pixel. To assess the quality of the filters a set of model images with artificial noise is used. Because of a better performance with tracings it is useful to extract the line patterns from X-ray images and to use these patterns for the matching procedure. The aim of the Rembrandt-project is to extract watermarks and chain lines and to search in a large database for papers with similar watermarks and chain lines. To extract these patterns, line detection methods are applied. Because of the absence of a ground truth watermark, synthetic line images are generated to evaluate the quality of the line detection filters automatically. This paper investigates two line detection filters: an Extended Kuwahara Filter and a Template-Based Filter. These filters determine for each pixel on the. Introduction The authenticity of etchings can be proved by concluding that two etchings have been printed on paper coming from the same sieve [3]. Both watermark and chain lines are unique sieve features that are used to derive this conclusion. Etchings on paper with similar watermark and chain lines used by the same artist have probably been printed in the same period. Reproductions of these line patterns are generated by X-ray images of the paper as visualized in Figure. The line patterns should be extracted from noisy X-ray images in order to make matching possible [4,5,6]. In [,2] retrieval results for two types of watermark databases are presented: one for tracings, which are just the line patterns of watermarks, and one for the X-ray images themselves. In general the retrieval performance is better for tracing images than for X- ray images, but is still not perfect as shown in [,2]. Figure a. Example of a sieve that is used for paper production, b. A X-ray image of a watermark, c. Part of an etching with a visible watermark.
2 Circle A Radius: 2 pixels Square A Length: 2 pixels Cross A Junction A Line end A Circle B Radius: 4 pixels Square B Length: 4 pixels Cross B Junction B Line end B Figure 2. Set of model images basis of its circular environment the most probable intensity value. In order to evaluate the filters, model images are distorted with additive Gaussian noise and with help of the filters the original images are reconstructed. This paper is organized as follows. The used approach is presented in Section 2. Section 3 explains the circular analysis. The Extended Kuwahara Filter and the Template-Based Filter that use features of the circular analysis are presented in Sections 4 and 5, respectively. Results of the filtering of distorted model images are presented in Section 6. Future work is considered in Section 7. Section 8 presents the conclusions. 2. Methodology Automatic evaluation of line detection filters applied to real X-ray images is very difficult, because a ground truth image is not available in general. To evaluate the filters automatically a set of ary model images is created. This set of ary images covers the most frequently occurring basic line features like: straight lines, curved lines, corners, crosses, junctions and end points. Figure 2 shows the set of model images. Within a watermark image it is reasonable that line patterns have a constant line width. These lines are in fact caused by metal wires in the sieve, which have a constant wire thickness. To assess the performance dependency on line width, the set of model images consists of line patterns with two different line widths, i.e. 2 and 4 pixels. The line detection filters are investigated as follows. To a ary model image I noise σ is added, the resulting image I σ is normalized to I and filtered by one of the two line detection filters F. The result is an enhanced image I e. This image is thresholded, which leads to ary image and evaluated by I e comparing it with the original model image. Figure 3 presents this approach schematically. The performance is expressed in terms of precision and recall. It takes into account the pixels that are classified as pattern, thus with intensity value. Precision (Pr) is defined as the number of correctly classified pixels in comparison with the total number of classified pixels. (Rc) is defined as the number of correctly classified pixels with respect to the total number of classified pixels in the ary source image. e = e e m,n m,n Pr[ II, ] Imn [, ] I [ mn, ] I [ mn, ], e Rc[ II, ] = Imn [, ] I [ mn, ] Imn [, ]. m,n e Where Imn [, ] and Ie [ m, n] are the intensity values of pixel [m,n]; i.e. or in this ary case. m,n
3 Binary Line Pattern I + Iσ ormalization I Filter F Ie T I e Evaluation Precision (Pr) oise σ (Rc) Figure 3. System description that presents the process of constructing the noisy line patterns, normalization process and Filtering position. a. σ = b. σ = 64 c. σ = 28 d. σ = 92 e. σ = Figure 4. Four different noise realizations that are added to model image Square B The performance of the filters is investigated for different noise levels. The ary model images have intensity values and 255, to which Gaussian noise is added with a standard deviation σ of, 64, 28, 92 and, which correspond to Signal-to-oise ratios (SR) [8] of, 2, 6, 3, db, respectively. Figure 4 shows five different noise realizations added to image Square B. Within a watermark image the mean intensity value of the background µ BG and of the pattern µ PAT are not constant. While for the final classification of each pixel, whether it belongs to the line pattern or background, a threshold should be applied. Because of the mean intensity variance the optimal threshold is image and position dependent. To avoid this problem each image is normalized to the domain where negative values represent the background and positive the line pattern, and with a zero threshold. A general normalization function that satisfies the requirements for each pixel [m,n] is the following: I I [ m, n] [, ] [, ] BG m n m n σ µ = () µ [ mn, ] µ [ mn, ] PAT BG For the X-ray images the values µ BG and µ PAT will not always be constant, so these should be estimated. For the model images their values are constant µ = and µ = 255 so equation () becomes: BG PAT I [ m, n] I[ m, n] = σ 255 The line detection is in fact a classification problem where each pixel should be classified as pattern or background. Within the normalized images pixels with positive intensity values belong to the pattern and negative values belong to the background. As a matter of fact some pixels are not classified correctly due to noise. The aim of the filters is enhancing the classification of these pixels to the right class. The final classification is performed by zero thresholding the enhanced image. The two investigated filters F are the Extended Kuwahara Filter F K and the Template-Based Filter F T. The Extended Kuwahara Filter enhances the noisy line pattern based on the most probable path that can be followed from a certain pixel. While the Template-Based Filter enhances the noisy line pattern based on best matching line pattern template. These filters are based on the Circular Analysis, which takes the circular environment of each pixel into account. 3. Circular Analysis The Circular Analysis can be considered as a context descriptor of a pixel; the context is described by a set of intensity paths with a certain length and under a certain angle from a central pixel. Figure 5 presents the Circular Analysis in a certain pixel. The Circular Analysis is formalized as follows: r : radius, θ : angle in radians, CA[ r, θ, m, n] = I[ m', n'], ( θ ) ( θ ) m' = m+ rcos, n' = n+ rsin, mn, and m', n' R.
4 m n m θ n r 3 3 Figure 5. Visualization of the Circular Analysis for R=7 and resolution 24 σ = σ = 64 σ = 28 σ = 92 σ = Pr = ; Rc = ; Pr = 9; Rc = 9; Pr = ; Rc = 9; Pr = ; Rc = 3; Pr =.4; Rc = 6; Figure 6. Five output examples of the Extended Kuwahara Filter for different noise levels. I[ m', n' ] is calculated by first order interpolation of the nearest neighbor pixels [8]. In the following CA [ r,θ ] in position [m,n] will be used as an CA r,θ, m, n. alternative notation for [ ] The filters enhance the noisy images based on the path sample mean and path sample standard deviation. R is the maximal radius and the path length of the Circular Analysis. R CA R, = CA[ r, ], R + r= µ θ θ R CA R, =, R + r= 2 ( CA r CA R, ). σ θ θ µ θ 4. Extended Kuwahara Filter Kuwahara filtering [7] is a non-linear filter that suppresses noise and preserves edges. In the present research line preserving noise suppression is required. A Kuwahara filter takes the mean of the quadrant with the lowest variance as a representation of the central pixel intensity. Here the mean of the path with the smallest variance is chosen as an intensity value for the central pixel value. This filter is called the Extended Kuwahara Filter. According to the Extended Kuwahara Filter for each pixel [m,n] the CA is computed. θmin = argmin σca R, θ, θ< 2π FK[ m, n] = µ CA R, θmin. Figure 6 presents some examples of the output of the Extended Kuwahara Filter. These examples show the line preserving property of the Extended Kuwahara Filter. The performance scores are calculated by applying the threshold to F K. 5. Template-Based Filter Template-Based filtering classifies each pixel based on the best matching template. A template consists of four perpendicular paths, which have a High or a Low mean value. Six templates are defined:
5 σ = σ = 64 σ = 28 σ = 92 σ = Pr = ; Rc = ; Pr = 9; Rc = ; Pr = ; Rc = 9 Pr =.36; Rc = 2; Pr =.7; Rc = ; Figure 7. Five model images with the five added noise levels (upper part) and the filter output (lower part) with performance scores for Template-Based Filtering. LLLL, HLLL, HHLL, HHHL, HLHL, HHHH. L represents a low path sample mean and H represents a high path sample mean. Each template has its own meaning, like HLHL represents a line and LLLL represents background. Application of this filter to a model image without noise should result in the model image itself. It is possible to have templates that match best, which usually results in the conclusion that a pixel belongs to the pattern. This usually occurs in the neighborhood of patterns. To classify correctly, the path standard deviation should be taken into account. If one of the templates HLLL, HHLL and HHHL matches best, the mean of the path with the lowest variance will be decisive for the central pixel. An overview of the meanings and classification of each template is presented in Table. Table. Meaning and possible Classes per Template Template Meaning Classification LLLL Background Background HLLL End pixel Background/Pattern HHLL Corner pixel Background/Pattern HHHL Junction pixel Background/Pattern HLHL Line pixel Pattern HHHH Cross pixel Pattern A template τ in the Template-Based Filter can be described as follows: L =, H =, τ { LLLLHLLLHHLLHHHLHLHLHHHH},,,,,, { } τ n L, H for n=,,2,3. The template match mean are computed as follows: max τ 3 n= θ< 2π max max τ = τ τ max µ τ µ [ ]*, n τ θ τ n µ CA R θ π = +, 2 θ = arg max µ τ θ, µ µ θ. and the angle max θ τ At this moment it is not clear how to compute a representative value for a central pixel out of this filter. Tentatively, a fixed value f v = is used. This value is chosen, because it represents in the positive case µ PAT and in the negative case µ BG. The final classification is done based on the best matching template τ B : max τ τ B = arg max µ, all τ {, } fv if τ B HHHH HLHL fv if τ B = LLLL FT [ m, n] = if τ B { HLLL, HHLL, HHHL} fv and τ B[ j] = H fv otherwise, with j = arg min σ CA R, θ iπ τ +. B 2 i=,,2,3 The output of this filter for five different noise levels added to five model images is presented in Figure 7. The performance scores are computed by applying the zero threshold to F T. ext section investigates the performance of the filters for different settings and various noise realizations.
6 6. Results Experiments are used to show the quality of the filters. The quality is considered to what degree the model images can be reconstructed by the line detection filters. If the precision and recall scores are equal to one, then the original image is perfectly reconstructed. The results are presented in precisionrecall plots, where each point represents the mean precision and recall score for different noise realizations. The precision and recall scores are assumed to be of equal importance. Table 2 shows all the different parameters and the options. Precision Circle - Kuwahara Circle - Template Square - Kuwahara Square - Template Cross - Kuwahara Cross - Template Junction - Kuwahara Junction - Template Line End - Kuwahara Line End - Template.3.3 Figure 9. Performance scores for all model images with σ = 28 and line width 2 Table 2. An overview of all parameters and options Parameter Options Images Figure oise levels, 64, 28, 92, Filter Kuwahara, Template Radius 6,8 First Square A with σ = 28 is considered. The performance scores for different configurations and for different radius R are shown in Figure 8. The dashed lines are the lines where the sum of precision and recall is constant. Precision Circle - Kuwahara Circle - Template Square - Kuwahara Square - Template Cross - Kuwahara Cross - Template Junction - Kuwahara Junction - Template Line End - Kuwahara Line End - Template.3.3 Figure. Performance scores for all model images with σ = 28 and line width 4 Precision Kuwahara R=6 Kuwahara R=8 Template R=6 Template R=8.3.3 Figures 9 and show best performance for the Template-Based Filter. Figure presents the performance of the filters for image Square A with all the noise levels. Figure 8. Performance scores for model image Square A with σ = 28 for the two filters at different radii. Figure 8 shows that the Template-Based Filter performs better than the Extended Kuwahara Filtering for both radii. Figures 9 and show the performance for all the model images again at a noise level of σ = 28.
7 Precision.3.2 Kuwahara R=6 Kuwahara R=8 Template R=6 Template R= Figure. Performance for Square A for various noise levels. Figure shows that the Template-Based Filtering outperforms Extended Kuwahara Filtering for all the noise levels. It also shows that for a larger radius of the Circular Analysis the precision scores better, while for a smaller radius it results in better recall scores. Finally, Figure 2 shows the Template-Based Filter performance for all the model images and the various noise levels. Precision.3.2. Circle W=2 R=2 Circle W=4 R=4 Square W=2 L=2 Square W=4 L=4 Cross W=2 Cross W=4 Junction W=2 Junction W=4 Line End W=2 Line End W= Figure 2 Performance for two different settings and all the images Template-Based Filter is a filter with perspective. In this paper the fact that the line width is constant has not been taken into account, which can lead possibly to better results. The final classification of a pixel to pattern or background is based on the smallest variance or the best matching template by using the Circular Analysis. In these cases respectively one or four paths of the total set are considered. However, the order of pixels in a path has not been considered. Methods will be investigated that take more information into account, like all the paths and information within a path. The aim of the Rembrandt-project is to find matches of similar line patterns. For this purpose the Template-Based Filtering could provide extra information like corner points, which can be useful for matching. Matching will be a computationally complex task, thus a pattern should be represented in such a way that search space reduction methods could be applied to find the matches within reasonable time. Before these methods can be applied to X-ray images the created model should be extended for example to correlated backgrounds. The normalization function should be investigated before it can be applied to real X-ray images. The function should be adaptive to artifacts in the images, like contrast flow and correlated noise elements caused for example by paper pulp and holes in the paper. 8. Conclusions For line patterns the Template-Based Filter performs best. For both filters a larger radius of the Circular Analysis results in a larger precision and a smaller radius results in a larger recall. Taking into account additional knowledge about the images, like the constant line width, will possibly result in better quality scores. It can be concluded from Figure 2 that the Template-Based Filtering performs best for all images with some exceptions. The latter is due to properties of the line patterns and possibly to the chosen quality measure. 7. Future work The previous section presented the performance results of the investigated filters and showed that the Acknowledgements The Rembrandt-project is carried out within the framework of the ToKe2 project, which focuses on the application of both informatics and cognitive sciences to cultural heritage, medical care and field of justice.
8 References [] K. J. Riley, and J. P. Eakins, Content-Based Retrieval of Historical Watermark Images: I Tracings, Proceedings of CIVR22, , London, July 22. [2] K. J. Riley, J. D. Edwards, J. P. Eakins, Content- Based Retrieval of Historical Watermark Images: II - Electron Radiographs, Proceedings of CIVR23, 3-4, July 23. [3] J. C. A. van der Lubbe, E. P. van Someren and M. J. T. Reinders, Dating and Authentication of Rembrandt's Etchings with the Help of Computational Intelligence, ICHIM (), , September 2. [4] R. C. Veltkamp, Shape Matching: Similarity Measures and Algorithms, invited talk, Proc. Int'l Conf. on Shape Modeling and Applications 2, pp , Genova, Italy, May 2. [5] S. Belongie, J. Malik, and J. Puzicha, "Matching Shapes," Proc. Eighth Int'l. Conf. Computer Vision, pp , July 2 [6] G. Mori, and J. Malik, Recognizing objects in adversarial clutter breaking a visual captcha, In Proc. Conf. Computer Vision and Pattern Recognition, Madison, USA, June 23 [7] Kuwahara, M., K. Hachimura, S. Eiho, and M. Kinoshita, Processing of RI-angiocardiographic image, in K. Preston, Jr. and M. Onoe, eds., Digital Processing of Biomedical Images, ew York: Plenum, pp , 976 [8] I.T. Young, J.J. Gerbrands, and L.J. Van Vliet, Fundamentals of Image Processing, Delft University of Technology, etherlands, 995.
A MORPHOLOGY-BASED FILTER STRUCTURE FOR EDGE-ENHANCING SMOOTHING
Proceedings of the 1994 IEEE International Conference on Image Processing (ICIP-94), pp. 530-534. (Austin, Texas, 13-16 November 1994.) A MORPHOLOGY-BASED FILTER STRUCTURE FOR EDGE-ENHANCING SMOOTHING
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 informationGeneralized Hough Transform, line fitting
Generalized Hough Transform, line fitting Introduction to Computer Vision CSE 152 Lecture 11-a Announcements Assignment 2: Due today Midterm: Thursday, May 10 in class Non-maximum suppression For every
More informationCS 231A Computer Vision (Fall 2012) Problem Set 3
CS 231A Computer Vision (Fall 2012) Problem Set 3 Due: Nov. 13 th, 2012 (2:15pm) 1 Probabilistic Recursion for Tracking (20 points) In this problem you will derive a method for tracking a point of interest
More informationEE 584 MACHINE VISION
EE 584 MACHINE VISION Binary Images Analysis Geometrical & Topological Properties Connectedness Binary Algorithms Morphology Binary Images Binary (two-valued; black/white) images gives better efficiency
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 informationEdge and local feature detection - 2. Importance of edge detection in computer vision
Edge and local feature detection Gradient based edge detection Edge detection by function fitting Second derivative edge detectors Edge linking and the construction of the chain graph Edge and local feature
More informationFiltering Images. Contents
Image Processing and Data Visualization with MATLAB Filtering Images Hansrudi Noser June 8-9, 010 UZH, Multimedia and Robotics Summer School Noise Smoothing Filters Sigmoid Filters Gradient Filters Contents
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 informationIdentifying Layout Classes for Mathematical Symbols Using Layout Context
Rochester Institute of Technology RIT Scholar Works Articles 2009 Identifying Layout Classes for Mathematical Symbols Using Layout Context Ling Ouyang Rochester Institute of Technology Richard Zanibbi
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 informationCS 223B Computer Vision Problem Set 3
CS 223B Computer Vision Problem Set 3 Due: Feb. 22 nd, 2011 1 Probabilistic Recursion for Tracking In this problem you will derive a method for tracking a point of interest through a sequence of images.
More informationChapter 11 Representation & Description
Chain Codes Chain codes are used to represent a boundary by a connected sequence of straight-line segments of specified length and direction. The direction of each segment is coded by using a numbering
More informationDigital Image Processing
Digital Image Processing Part 9: Representation and Description AASS Learning Systems Lab, Dep. Teknik Room T1209 (Fr, 11-12 o'clock) achim.lilienthal@oru.se Course Book Chapter 11 2011-05-17 Contents
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 informationRobotics Programming Laboratory
Chair of Software Engineering Robotics Programming Laboratory Bertrand Meyer Jiwon Shin Lecture 8: Robot Perception Perception http://pascallin.ecs.soton.ac.uk/challenges/voc/databases.html#caltech car
More informationAnnouncements. Edges. Last Lecture. Gradients: Numerical Derivatives f(x) Edge Detection, Lines. Intro Computer Vision. CSE 152 Lecture 10
Announcements Assignment 2 due Tuesday, May 4. Edge Detection, Lines Midterm: Thursday, May 6. Introduction to Computer Vision CSE 152 Lecture 10 Edges Last Lecture 1. Object boundaries 2. Surface normal
More informationCS 231A Computer Vision (Winter 2014) Problem Set 3
CS 231A Computer Vision (Winter 2014) Problem Set 3 Due: Feb. 18 th, 2015 (11:59pm) 1 Single Object Recognition Via SIFT (45 points) In his 2004 SIFT paper, David Lowe demonstrates impressive object recognition
More informationArtistic Stylization of Images and Video Part III Anisotropy and Filtering Eurographics 2011
Artistic Stylization of Images and Video Part III Anisotropy and Filtering Eurographics 2011 Hasso-Plattner-Institut, University of Potsdam, Germany Image/Video Abstraction Stylized Augmented Reality for
More informationcse 252c Fall 2004 Project Report: A Model of Perpendicular Texture for Determining Surface Geometry
cse 252c Fall 2004 Project Report: A Model of Perpendicular Texture for Determining Surface Geometry Steven Scher December 2, 2004 Steven Scher SteveScher@alumni.princeton.edu Abstract Three-dimensional
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 informationCoarse-to-fine image registration
Today we will look at a few important topics in scale space in computer vision, in particular, coarseto-fine approaches, and the SIFT feature descriptor. I will present only the main ideas here to give
More informationSegmentation and Grouping
Segmentation and Grouping How and what do we see? Fundamental Problems ' Focus of attention, or grouping ' What subsets of pixels do we consider as possible objects? ' All connected subsets? ' Representation
More information- Low-level image processing Image enhancement, restoration, transformation
() Representation and Description - Low-level image processing enhancement, restoration, transformation Enhancement Enhanced Restoration/ Transformation Restored/ Transformed - Mid-level image processing
More information1 Trigonometry. Copyright Cengage Learning. All rights reserved.
1 Trigonometry Copyright Cengage Learning. All rights reserved. 1.1 Radian and Degree Measure Copyright Cengage Learning. All rights reserved. Objectives Describe angles. Use radian measure. Use degree
More informationA Method of Measuring Shape Similarity between multi-scale objects
A Method of Measuring Shape Similarity between multi-scale objects Peng Dongliang, Deng Min Department of Geo-informatics, Central South University, Changsha, 410083, China Email: pengdlzn@163.com; dengmin028@yahoo.com
More informationSignature Recognition by Pixel Variance Analysis Using Multiple Morphological Dilations
Signature Recognition by Pixel Variance Analysis Using Multiple Morphological Dilations H B Kekre 1, Department of Computer Engineering, V A Bharadi 2, Department of Electronics and Telecommunication**
More informationA NEW FEATURE BASED IMAGE REGISTRATION ALGORITHM INTRODUCTION
A NEW FEATURE BASED IMAGE REGISTRATION ALGORITHM Karthik Krish Stuart Heinrich Wesley E. Snyder Halil Cakir Siamak Khorram North Carolina State University Raleigh, 27695 kkrish@ncsu.edu sbheinri@ncsu.edu
More informationComputer Vision for HCI. Topics of This Lecture
Computer Vision for HCI Interest Points Topics of This Lecture Local Invariant Features Motivation Requirements, Invariances Keypoint Localization Features from Accelerated Segment Test (FAST) Harris Shi-Tomasi
More informationMORPHOLOGICAL BOUNDARY BASED SHAPE REPRESENTATION SCHEMES ON MOMENT INVARIANTS FOR CLASSIFICATION OF TEXTURES
International Journal of Computer Science and Communication Vol. 3, No. 1, January-June 2012, pp. 125-130 MORPHOLOGICAL BOUNDARY BASED SHAPE REPRESENTATION SCHEMES ON MOMENT INVARIANTS FOR CLASSIFICATION
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 informationELEC Dr Reji Mathew Electrical Engineering UNSW
ELEC 4622 Dr Reji Mathew Electrical Engineering UNSW Review of Motion Modelling and Estimation Introduction to Motion Modelling & Estimation Forward Motion Backward Motion Block Motion Estimation Motion
More informationDietrich Paulus Joachim Hornegger. Pattern Recognition of Images and Speech in C++
Dietrich Paulus Joachim Hornegger Pattern Recognition of Images and Speech in C++ To Dorothea, Belinda, and Dominik In the text we use the following names which are protected, trademarks owned by a company
More informationFeature Extractors. CS 188: Artificial Intelligence Fall Some (Vague) Biology. The Binary Perceptron. Binary Decision Rule.
CS 188: Artificial Intelligence Fall 2008 Lecture 24: Perceptrons II 11/24/2008 Dan Klein UC Berkeley Feature Extractors A feature extractor maps inputs to feature vectors Dear Sir. First, I must solicit
More informationWikipedia - Mysid
Wikipedia - Mysid Erik Brynjolfsson, MIT Filtering Edges Corners Feature points Also called interest points, key points, etc. Often described as local features. Szeliski 4.1 Slides from Rick Szeliski,
More informationA New Algorithm for Shape Detection
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 19, Issue 3, Ver. I (May.-June. 2017), PP 71-76 www.iosrjournals.org A New Algorithm for Shape Detection Hewa
More information1. INTRODUCTION. AMS Subject Classification. 68U10 Image Processing
ANALYSING THE NOISE SENSITIVITY OF SKELETONIZATION ALGORITHMS Attila Fazekas and András Hajdu Lajos Kossuth University 4010, Debrecen PO Box 12, Hungary Abstract. Many skeletonization algorithms have been
More informationDetecting and Identifying Moving Objects in Real-Time
Chapter 9 Detecting and Identifying Moving Objects in Real-Time For surveillance applications or for human-computer interaction, the automated real-time tracking of moving objects in images from a stationary
More informationA WATERMARKING METHOD RESISTANT TO GEOMETRIC ATTACKS
A WATERMARKING METHOD RESISTANT TO GEOMETRIC ATTACKS D. Simitopoulos, D. Koutsonanos and M.G. Strintzis Informatics and Telematics Institute Thermi-Thessaloniki, Greece. Abstract In this paper, a novel
More informationEdge and corner detection
Edge and corner detection Prof. Stricker Doz. G. Bleser Computer Vision: Object and People Tracking Goals Where is the information in an image? How is an object characterized? How can I find measurements
More informationCOMPARATIVE STUDY OF IMAGE EDGE DETECTION ALGORITHMS
COMPARATIVE STUDY OF IMAGE EDGE DETECTION ALGORITHMS Shubham Saini 1, Bhavesh Kasliwal 2, Shraey Bhatia 3 1 Student, School of Computing Science and Engineering, Vellore Institute of Technology, India,
More informationEdges and Lines Readings: Chapter 10: better edge detectors line finding circle finding
Edges and Lines Readings: Chapter 10: 10.2.3-10.3 better edge detectors line finding circle finding 1 Lines and Arcs Segmentation In some image sets, lines, curves, and circular arcs are more useful than
More informationLocal Features: Detection, Description & Matching
Local Features: Detection, Description & Matching Lecture 08 Computer Vision Material Citations Dr George Stockman Professor Emeritus, Michigan State University Dr David Lowe Professor, University of British
More informationEvaluation of texture features for image segmentation
RIT Scholar Works Articles 9-14-2001 Evaluation of texture features for image segmentation Navid Serrano Jiebo Luo Andreas Savakis Follow this and additional works at: http://scholarworks.rit.edu/article
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 informationComplex Numbers, Polar Equations, and Parametric Equations. Copyright 2017, 2013, 2009 Pearson Education, Inc.
8 Complex Numbers, Polar Equations, and Parametric Equations Copyright 2017, 2013, 2009 Pearson Education, Inc. 1 8.5 Polar Equations and Graphs Polar Coordinate System Graphs of Polar Equations Conversion
More informationSchedule for Rest of Semester
Schedule for Rest of Semester Date Lecture Topic 11/20 24 Texture 11/27 25 Review of Statistics & Linear Algebra, Eigenvectors 11/29 26 Eigenvector expansions, Pattern Recognition 12/4 27 Cameras & calibration
More informationHidden Loop Recovery for Handwriting Recognition
Hidden Loop Recovery for Handwriting Recognition David Doermann Institute of Advanced Computer Studies, University of Maryland, College Park, USA E-mail: doermann@cfar.umd.edu Nathan Intrator School of
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 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 informationLecture 10: Image Descriptors and Representation
I2200: Digital Image processing Lecture 10: Image Descriptors and Representation Prof. YingLi Tian Nov. 15, 2017 Department of Electrical Engineering The City College of New York The City University of
More informationAnnouncements. Hough Transform [ Patented 1962 ] Generalized Hough Transform, line fitting. Assignment 2: Due today Midterm: Thursday, May 5 in class
Announcements Generalized Hough Transform, line fitting Assignment 2: Due today Midterm: Thursday, May 5 in class Introduction to Computer Vision CSE 152 Lecture 11a What is region like if: 1. λ 1 = 0?
More informationComparative Study of ROI Extraction of Palmprint
251 Comparative Study of ROI Extraction of Palmprint 1 Milind E. Rane, 2 Umesh S Bhadade 1,2 SSBT COE&T, North Maharashtra University Jalgaon, India Abstract - The Palmprint region segmentation is an important
More informationSupporting Information. High-Throughput, Algorithmic Determination of Nanoparticle Structure From Electron Microscopy Images
Supporting Information High-Throughput, Algorithmic Determination of Nanoparticle Structure From Electron Microscopy Images Christine R. Laramy, 1, Keith A. Brown, 2, Matthew N. O Brien, 2 and Chad. A.
More informationconvolution shift invariant linear system Fourier Transform Aliasing and sampling scale representation edge detection corner detection
COS 429: COMPUTER VISON Linear Filters and Edge Detection convolution shift invariant linear system Fourier Transform Aliasing and sampling scale representation edge detection corner detection Reading:
More informationSubpixel Corner Detection Using Spatial Moment 1)
Vol.31, No.5 ACTA AUTOMATICA SINICA September, 25 Subpixel Corner Detection Using Spatial Moment 1) WANG She-Yang SONG Shen-Min QIANG Wen-Yi CHEN Xing-Lin (Department of Control Engineering, Harbin Institute
More informationPractical Image and Video Processing Using MATLAB
Practical Image and Video Processing Using MATLAB Chapter 18 Feature extraction and representation What will we learn? What is feature extraction and why is it a critical step in most computer vision and
More informationScott Smith Advanced Image Processing March 15, Speeded-Up Robust Features SURF
Scott Smith Advanced Image Processing March 15, 2011 Speeded-Up Robust Features SURF Overview Why SURF? How SURF works Feature detection Scale Space Rotational invariance Feature vectors SURF vs Sift Assumptions
More informationPARAMETRIC EQUATIONS AND POLAR COORDINATES
10 PARAMETRIC EQUATIONS AND POLAR COORDINATES PARAMETRIC EQUATIONS & POLAR COORDINATES A coordinate system represents a point in the plane by an ordered pair of numbers called coordinates. PARAMETRIC EQUATIONS
More informationNorbert Schuff VA Medical Center and UCSF
Norbert Schuff Medical Center and UCSF Norbert.schuff@ucsf.edu Medical Imaging Informatics N.Schuff Course # 170.03 Slide 1/67 Objective Learn the principle segmentation techniques Understand the role
More informationHistograms of Oriented Gradients
Histograms of Oriented Gradients Carlo Tomasi September 18, 2017 A useful question to ask of an image is whether it contains one or more instances of a certain object: a person, a face, a car, and so forth.
More informationComparison of HK and SC curvature description methods
Comparison of and SC curvature description methods H. Cantzler and R. B. Fisher Machine Vision Unit, Institute for Perception, Action and Behaviour, Division of Informatics, University of Edinburgh, Edinburgh,
More informationAnalysis of the Impact of Non-Quadratic Optimization-based SAR Imaging on Feature Enhancement and ATR Performance
1 Analysis of the Impact of Non-Quadratic Optimization-based SAR Imaging on Feature Enhancement and ATR Performance Müjdat Çetin, William C. Karl, and David A. Castañon This work was supported in part
More informationChapter 3 Image Registration. Chapter 3 Image Registration
Chapter 3 Image Registration Distributed Algorithms for Introduction (1) Definition: Image Registration Input: 2 images of the same scene but taken from different perspectives Goal: Identify transformation
More informationFeature Detectors and Descriptors: Corners, Lines, etc.
Feature Detectors and Descriptors: Corners, Lines, etc. Edges vs. Corners Edges = maxima in intensity gradient Edges vs. Corners Corners = lots of variation in direction of gradient in a small neighborhood
More informationCHAPTER 6. 6 Huffman Coding Based Image Compression Using Complex Wavelet Transform. 6.3 Wavelet Transform based compression technique 106
CHAPTER 6 6 Huffman Coding Based Image Compression Using Complex Wavelet Transform Page No 6.1 Introduction 103 6.2 Compression Techniques 104 103 6.2.1 Lossless compression 105 6.2.2 Lossy compression
More informationCorner Detection. GV12/3072 Image Processing.
Corner Detection 1 Last Week 2 Outline Corners and point features Moravec operator Image structure tensor Harris corner detector Sub-pixel accuracy SUSAN FAST Example descriptor: SIFT 3 Point Features
More informationMachine vision. Summary # 6: Shape descriptors
Machine vision Summary # : Shape descriptors SHAPE DESCRIPTORS Objects in an image are a collection of pixels. In order to describe an object or distinguish between objects, we need to understand the properties
More informationMotivation. Gray Levels
Motivation Image Intensity and Point Operations Dr. Edmund Lam Department of Electrical and Electronic Engineering The University of Hong ong A digital image is a matrix of numbers, each corresponding
More informationModel Fitting. Introduction to Computer Vision CSE 152 Lecture 11
Model Fitting CSE 152 Lecture 11 Announcements Homework 3 is due May 9, 11:59 PM Reading: Chapter 10: Grouping and Model Fitting What to do with edges? Segment linked edge chains into curve features (e.g.,
More informationScanner Parameter Estimation Using Bilevel Scans of Star Charts
ICDAR, Seattle WA September Scanner Parameter Estimation Using Bilevel Scans of Star Charts Elisa H. Barney Smith Electrical and Computer Engineering Department Boise State University, Boise, Idaho 8375
More informationModule 7 VIDEO CODING AND MOTION ESTIMATION
Module 7 VIDEO CODING AND MOTION ESTIMATION Version ECE IIT, Kharagpur Lesson Block based motion estimation algorithms Version ECE IIT, Kharagpur Lesson Objectives At the end of this less, the students
More informationExtract an Essential Skeleton of a Character as a Graph from a Character Image
Extract an Essential Skeleton of a Character as a Graph from a Character Image Kazuhisa Fujita University of Electro-Communications 1-5-1 Chofugaoka, Chofu, Tokyo, 182-8585 Japan k-z@nerve.pc.uec.ac.jp
More informationEdges and Binary Image Analysis. Thurs Jan 26 Kristen Grauman UT Austin. Today. Edge detection and matching
/25/207 Edges and Binary Image Analysis Thurs Jan 26 Kristen Grauman UT Austin Today Edge detection and matching process the image gradient to find curves/contours comparing contours Binary image analysis
More informationGetting a New Perspective
Section 6.3 Polar Coordinates Getting a New Perspective We have worked etensively in the Cartesian coordinate system, plotting points, graphing equations, and using the properties of the Cartesian plane
More informationAnnouncements. CS 188: Artificial Intelligence Spring Generative vs. Discriminative. Classification: Feature Vectors. Project 4: due Friday.
CS 188: Artificial Intelligence Spring 2011 Lecture 21: Perceptrons 4/13/2010 Announcements Project 4: due Friday. Final Contest: up and running! Project 5 out! Pieter Abbeel UC Berkeley Many slides adapted
More information1. Use the Trapezium Rule with five ordinates to find an approximate value for the integral
1. Use the Trapezium Rule with five ordinates to find an approximate value for the integral Show your working and give your answer correct to three decimal places. 2 2.5 3 3.5 4 When When When When When
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 informationImage Segmentation Techniques for Object-Based Coding
Image Techniques for Object-Based Coding Junaid Ahmed, Joseph Bosworth, and Scott T. Acton The Oklahoma Imaging Laboratory School of Electrical and Computer Engineering Oklahoma State University {ajunaid,bosworj,sacton}@okstate.edu
More informationBlood vessel tracking in retinal images
Y. Jiang, A. Bainbridge-Smith, A. B. Morris, Blood Vessel Tracking in Retinal Images, Proceedings of Image and Vision Computing New Zealand 2007, pp. 126 131, Hamilton, New Zealand, December 2007. Blood
More information3.1. Solution for white Gaussian noise
Low complexity M-hypotheses detection: M vectors case Mohammed Nae and Ahmed H. Tewk Dept. of Electrical Engineering University of Minnesota, Minneapolis, MN 55455 mnae,tewk@ece.umn.edu Abstract Low complexity
More informationCSE 573: Artificial Intelligence Autumn 2010
CSE 573: Artificial Intelligence Autumn 2010 Lecture 16: Machine Learning Topics 12/7/2010 Luke Zettlemoyer Most slides over the course adapted from Dan Klein. 1 Announcements Syllabus revised Machine
More informationImage Enhancement: To improve the quality of images
Image Enhancement: To improve the quality of images Examples: Noise reduction (to improve SNR or subjective quality) Change contrast, brightness, color etc. Image smoothing Image sharpening Modify image
More informationImage representation. 1. Introduction
Image representation Introduction Representation schemes Chain codes Polygonal approximations The skeleton of a region Boundary descriptors Some simple descriptors Shape numbers Fourier descriptors Moments
More informationAutomatic Image Alignment (feature-based)
Automatic Image Alignment (feature-based) Mike Nese with a lot of slides stolen from Steve Seitz and Rick Szeliski 15-463: Computational Photography Alexei Efros, CMU, Fall 2006 Today s lecture Feature
More informationFace detection and recognition. Many slides adapted from K. Grauman and D. Lowe
Face detection and recognition Many slides adapted from K. Grauman and D. Lowe Face detection and recognition Detection Recognition Sally History Early face recognition systems: based on features and distances
More informationDYNAMIC BACKGROUND SUBTRACTION BASED ON SPATIAL EXTENDED CENTER-SYMMETRIC LOCAL BINARY PATTERN. Gengjian Xue, Jun Sun, Li Song
DYNAMIC BACKGROUND SUBTRACTION BASED ON SPATIAL EXTENDED CENTER-SYMMETRIC LOCAL BINARY PATTERN Gengjian Xue, Jun Sun, Li Song Institute of Image Communication and Information Processing, Shanghai Jiao
More informationPartial Shape Matching using Transformation Parameter Similarity - Additional Material
Volume xx (y), Number z, pp. 7 Partial Shape Matching using Transformation Parameter Similarity - Additional Material paper66. An Example for Local Contour Descriptors As mentioned in Section 4 of the
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 informationEE795: Computer Vision and Intelligent Systems
EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 FDH 204 Lecture 10 130221 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Canny Edge Detector Hough Transform Feature-Based
More informationCOMPARISON OF SOME EFFICIENT METHODS OF CONTOUR COMPRESSION
COMPARISON OF SOME EFFICIENT METHODS OF CONTOUR COMPRESSION REMIGIUSZ BARAN ANDRZEJ DZIECH 2 Department of Electronics and Intelligent Systems, Kielce University of Technology, POLAND 2 AGH University
More informationDigital Image Processing Chapter 11: Image Description and Representation
Digital Image Processing Chapter 11: Image Description and Representation Image Representation and Description? Objective: To represent and describe information embedded in an image in other forms that
More informationFeature Based Registration - Image Alignment
Feature Based Registration - Image Alignment Image Registration Image registration is the process of estimating an optimal transformation between two or more images. Many slides from Alexei Efros http://graphics.cs.cmu.edu/courses/15-463/2007_fall/463.html
More informationComputer Vision I. Announcements. Fourier Tansform. Efficient Implementation. Edge and Corner Detection. CSE252A Lecture 13.
Announcements Edge and Corner Detection HW3 assigned CSE252A Lecture 13 Efficient Implementation Both, the Box filter and the Gaussian filter are separable: First convolve each row of input image I with
More informationCoE4TN4 Image Processing
CoE4TN4 Image Processing Chapter 11 Image Representation & Description Image Representation & Description After an image is segmented into regions, the regions are represented and described in a form suitable
More informationComputer Vision 2. SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung. Computer Vision 2 Dr. Benjamin Guthier
Computer Vision 2 SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung Computer Vision 2 Dr. Benjamin Guthier 3. HIGH DYNAMIC RANGE Computer Vision 2 Dr. Benjamin Guthier Pixel Value Content of this
More informationCombining Appearance and Topology for Wide
Combining Appearance and Topology for Wide Baseline Matching Dennis Tell and Stefan Carlsson Presented by: Josh Wills Image Point Correspondences Critical foundation for many vision applications 3-D reconstruction,
More informationPreviously. Edge detection. Today. Thresholding. Gradients -> edges 2/1/2011. Edges and Binary Image Analysis
2//20 Previously Edges and Binary Image Analysis Mon, Jan 3 Prof. Kristen Grauman UT-Austin Filters allow local image neighborhood to influence our description and features Smoothing to reduce noise Derivatives
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 informationTextural Features for Image Database Retrieval
Textural Features for Image Database Retrieval Selim Aksoy and Robert M. Haralick Intelligent Systems Laboratory Department of Electrical Engineering University of Washington Seattle, WA 98195-2500 {aksoy,haralick}@@isl.ee.washington.edu
More information