scholarly journals On the time complexity for circumscribing a convex polygon

1985 ◽  
Vol 30 (3) ◽  
pp. 362-363
Author(s):  
Tony C Wood ◽  
Hyun-Chan Lee
Keyword(s):  
Time Complexity ◽  
Convex Polygon

scholarly journals APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR

1996 ◽  
Vol 06 (01) ◽  
pp. 59-77 ◽  
Author(s):  
W.S. CHAN ◽  
F. CHIN
Keyword(s):  
Time Complexity ◽  
Convex Polygon ◽  
Line Segments ◽  
Minimum Error ◽  
Curve Approximation ◽  
Polygonal Curve ◽  
Minimum Number ◽  
Polygonal Curves ◽  
Approximation Problems

We improve the time complexities for solving the polygonal curve approximation problems formulated by Imai and Iri. The time complexity for approximating any polygonal curve of n vertices with minimum number of line segments can be improved from O(n2 log n) to O(n2). The time complexity for approximating any polygonal curve with minimum error can also be improved from O(n2 log 2n) to O(n2 log n). We further show that if the curve to be approximated forms part of a convex polygon, the two problems can be solved in O(n) and O(n2) time respectively for both open and closed polygonal curves.

Recognition of Birds in Blurred and Illumination Images by Local Features

2017 ◽  
Vol 7 (7) ◽  
pp. 243
Author(s):  
Suresha .M ◽  
. Sandeep
Keyword(s):  
Computer Vision ◽  
Time Complexity ◽  
Feature Detection ◽  
Feature Matching ◽  
Fast Algorithms ◽  
Local Features ◽  
Experimental Demonstration ◽  
Harris Corner ◽  
Blurred Image ◽  
Blurred Images

Local features are of great importance in computer vision. It performs feature detection and feature matching are two important tasks. In this paper concentrates on the problem of recognition of birds using local features. Investigation summarizes the local features SURF, FAST and HARRIS against blurred and illumination images. FAST and Harris corner algorithm have given less accuracy for blurred images. The SURF algorithm gives best result for blurred image because its identify strongest local features and time complexity is less and experimental demonstration shows that SURF algorithm is robust for blurred images and the FAST algorithms is suitable for images with illumination.

Sign in / Sign up

Export Citation Format

Share Document