Real-time robot motion planning using rasterizing computer graphics hardware
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Document Representation and Its Application to Page Decomposition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Journal of Algorithms
A Ground-Truthing Tool for Layout Analysis Performance Evaluation
DAS '02 Proceedings of the 5th International Workshop on Document Analysis Systems V
CAIP '95 Proceedings of the 6th International Conference on Computer Analysis of Images and Patterns
Integrated Algorithms for Newspaper Page Decomposition and Article Tracking
ICDAR '99 Proceedings of the Fifth International Conference on Document Analysis and Recognition
A Novel Recursive Algorithm for Area Location Using Isothetic Polygons
ICPR '00 Proceedings of the International Conference on Pattern Recognition - Volume 3
Case Generation Using Rough Sets with Fuzzy Representation
IEEE Transactions on Knowledge and Data Engineering
Inner and outer approximations of polytopes using boxes
Computational Geometry: Theory and Applications
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital Geometry: Geometric Methods for Digital Picture Analysis
Pattern Recognition Algorithms for Data Mining: Scalability, Knowledge Discovery, and Soft Granular Computing
Dimension Reduction Based on Rough Set in Image Mining
CIT '04 Proceedings of the The Fourth International Conference on Computer and Information Technology
PerfectDoc: A Ground Truthing Environment for Complex Documents
ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
Ranking of Optical Character Prototypes in a Large Database Using Isothetic Chord Lengths
ICCTA '07 Proceedings of the International Conference on Computing: Theory and Applications
Text detection and restoration in natural scene images
Journal of Visual Communication and Image Representation
Measuring Concavity on a Rectangular Mosaic
IEEE Transactions on Computers
Minimum-Perimeter Polygons of Digitized Silhouettes
IEEE Transactions on Computers
Isothetic polygonal approximations of a 2d object on generalized grid
PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
MUSC: multigrid shape codes and their applications to image retrieval
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
TIPS: on finding a tight isothetic polygonal shape covering a 2d object
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
PACE: polygonal approximation of thick digital curves using cellular envelope
ICVGIP'06 Proceedings of the 5th Indian conference on Computer Vision, Graphics and Image Processing
GOAL: towards understanding of graphic objects from architectural to line drawings
GREC'09 Proceedings of the 8th international conference on Graphics recognition: achievements, challenges, and evolution
Construction of 3D orthogonal cover of a digital object
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
International Journal of Digital Library Systems
Approximate partitioning of 2D objects into orthogonally convex components
Computer Vision and Image Understanding
Optimization of polymerase chain reaction on a cyberphysical digital microfluidic biochip
Proceedings of the International Conference on Computer-Aided Design
| Hi-index | 0.00 |
An isothetic cover of a digital object not only specifies a simple representation of the object but also provides an approximate information about its structural content and geometric characteristics. When the cover ''tightly'' encloses the object, it is said to be an outer isothetic cover; and when the cover tightly inscribes the object, it is an inner isothetic cover. If a set of horizontal and vertical grid lines is imposed on the object plane, then the outer (inner) isothetic cover is defined by a set of isothetic polygons, having their edges lying on the grid lines, such that the effective area corresponding to the object is minimized (maximized). Increasing or decreasing the grid size, therefore, decreases or increases the complexity or the accuracy of the isothetic cover corresponding to a given object, which, in turn, extracts the object information at different resolutions. In this paper, a combinatorial algorithm is presented for varying grid sizes, which is free of any backtracking and can produce the isothetic cover of a connected component in a time linear in the length of the perimeter of the cover. The algorithm has also been extended for finding the isothetic covers of real-world digital objects having multiple components with or without holes. Experimental results that demonstrate applications of an isothetic cover to diverse problems of pattern analysis and computer vision, are reported for various data sets.