[go: up one dir, main page]

Chiavetta et al., 1993 - Google Patents

Parallel computation of the Euler number via connectivity graph

Chiavetta et al., 1993

Document ID
5696700337311901746
Author
Chiavetta F
Di Gesù V
Publication year
Publication venue
Pattern Recognition Letters

External Links

Snippet

This paper regards the computation of the Euler number (EN) of a binary image by means of the Connectivity Graph (CG), which is derived from the Cylindrical Algebraic Decomposition of the Euclidean plane. The corresponding decomposition of the discrete plane has shown …
Continue reading at www.sciencedirect.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30961—Trees
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30994—Browsing or visualization
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G06F17/30321—Indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30587—Details of specialised database models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F17/30705—Clustering or classification
    • G06F17/3071—Clustering or classification including class or cluster creation or modification
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/141—Discrete Fourier transforms
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/36—Image preprocessing, i.e. processing the image information without deciding about the identity of the image
    • G06K9/46—Extraction of features or characteristics of the image
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/00—2D [Two Dimensional] image generation
    • G06T11/20—Drawing from basic elements, e.g. lines or circles
    • G06T11/206—Drawing of charts or graphs
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00—Image analysis

Similar Documents

Publication Publication Date Title
Chiang et al. Dynamic algorithms in computational geometry
Livnat et al. A near optimal isosurface extraction algorithm using the span space
Samet Connected component labeling using quadtrees
Rambau TOPCOM: Triangulations of point configurations and oriented matroids
Bentley et al. An optimal worst case algorithm for reporting intersections of rectangles
Wilkinson et al. High-dimensional visual analytics: Interactive exploration guided by pairwise views of point distributions
Hwang et al. A fast nearest neighbor search algorithm by nonlinear embedding
US20130080443A1 (en) Multi-scale segmentation and partial matching 3d models
Mueller et al. A comparison of vertex ordering algorithms for large graph visualization
Bespalov et al. Scale-space representation of 3d models and topological matching
Chiavetta et al. Parallel computation of the Euler number via connectivity graph
Olson Locating geometric primitives by pruning the parameter space
Grossi et al. Efficient splitting and merging algorithms for order decomposable problems
Lewerentz et al. Crococosmos—3d visualization of large object-oriented programs
Dyken et al. Accelerating Web-Based Graph Drawing with Bottom-Up GPU Quadtree Construction
Schulz A framework for visual data mining of structures
van Kreveld Efficient methods for isoline extraction from a digital elevation model based on triangulated irregular networks
Bryant et al. Following boundaries of discrete binary objects in space
Kasif et al. A Hough transform technique for subgraph isomorphism
Pavlidis Advanced Segmentation Techniques
Hendrix et al. On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs
Hildebrandt et al. A two and three dimensional ship database application
Kerber et al. Persistent homology and nested dissection
Bremer et al. Representing Whole Slide Cancer Image Features with Hilbert Curves
Wilkinson Graph-theoretic graphics