Polygonal Approximation and Scale-Space Analysis of Closed Digital Curves

Free Standard Shipping

Purchasing Options

ISBN 9781926895338
Cat# N10710



SAVE 20%

eBook (VitalSource)
ISBN 9781466568891
Cat# NE10993



SAVE 30%

eBook Rentals

Other eBook Options:


This book covers the most important topics in the area of pattern recognition, object recognition, computer vision, robot vision, medical computing, computational geometry, and bioinformatics systems. Students and researchers will find a comprehensive treatment of polygonal approximation and its real life applications. The book not only explains the theoretical aspects but also presents applications with detailed design parameters. The systematic development of the concept of polygonal approximation of digital curves and its scale-space analysis are useful and attractive to scholars in many fields. Development for different algorithms of polygonal approximation and scale-space analysis and several experimental results with comparative study for measuring the performance of the algorithms are extremely useful for theoretical- and application-oriented works in the above-mentioned areas.

Table of Contents

Part I: Polygonal Approximation
A Split-and-Merge Technique
A Sequential One-Pass Method
Another Sequential One-Pass Method
A Data-Driven Method
Another Data-Driven Method
A Two-Pass Sequential Method
Polygonal Approximation Using Reverse Engineering on Bresenham's Line Drawing Technique
Polygonal Approximation as Angle Detection
Polygonal Approximation as Angle Detection Using Asymmetric Region of Support
Part II: Scale-space analysis
Scale-Space Analysis and Corner Detection on Chain Coded Curves
Scale-Space Analysis and Corner Detection Using Iterative Gaussian Smoothing With Constant Window Size
Corner detection using Bessel function as smoothing kernel
Adaptive smoothing using convolution with Gaussian Kernel
Part III: Application of Polygonal Approximation for Pattern Classification and Object Recognition
Polygonal Dissimilarity and Scale Preserving Smoothing
Matching Polygon Fragments
Polygonal Approximation to Recognize and Locate Partially Occluded Objects: Hypothesis Generation and Verification Paradigm
Object Recognition With Belief Revision: Hypothesis Generation and Belief Revision Paradigm
Neuro-Fuzzy Reasoning for Occluded Object Recognition: A Learning Paradigm Through Neuro-Fuzzy Concept

Author Bio(s)

Kumar S. Ray, PhD, is a professor in the Electronics and Communication Science Unit at the Indian Statistical Institute, Kolkata, India. He has written a number of articles published in international journals and has presented at several professional meetings. His current research interests include artificial intelligence, computer vision, commonsense reasoning, soft computing, non-monotonic deductive database systems, and DNA computing.

Kishor Kumar Sadasivuni is doing doctoral research in polymer nanocomposites. His research is under a collaborative scheme between University of South Brittany (France) and Mahatma Gandhi University (India). He received his master’s degree from Andhra University, India. He has several years of experience in synthesis and characterization of nanoparticles as well as in manufacturing elastomer nanocomposites. His areas of interest include different types of nanoparticles and their modifications and interactions with both modified and unmodified rubbers. He is also a visiting student of LECAP Laboratory at the Université de Rouen in France. He has presented papers in several international conferences.