Result: A composite and quasi linear time method for digital plane recognition

Title:
A composite and quasi linear time method for digital plane recognition
Authors:
BUZER, Lilian
Source:
Discrete geometry for computer imagery (13th International conference, DGCI 2006, Szeged, Hungary, October 25-27, 2006)0DGCI 2006. :331-342
Publisher Information:
Berlin; Heidelberg; New York: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 12 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Intelligence artificielle, Artificial intelligence, Reconnaissance des formes. Traitement numérique des images. Géométrie algorithmique, Pattern recognition. Digital image processing. Computational geometry, Complexité temps, Time complexity, Complejidad tiempo, Géométrie discrète, Discrete geometry, Geometría discreta, Hyperplan, Hyperplane, Hiperplano, Méthode cas pire, Worst case method, Método caso peor, Méthode géométrique, Geometrical method, Método geométrico, Optimisation programme, Program optimization, Optimización programa, Oracle, Programmation convexe, Convex programming, Programación convexa, Programmation discrète, Discrete programming, Programación discreta, Programmation linéaire, Linear programming, Programación lineal, Temps linéaire, Linear time, Tiempo lineal, Traitement image, Image processing, Procesamiento imagen
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Laboratory CNRS-UMLV-ESIEE, UMR 8049 ESIEE, 2, boulevard Biaise Pascal, Cité Descartes, BP 99, 93162 Noisy le Grand, France
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19150510
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19150510
Database:
PASCAL Archive

Further Information

This paper introduces a new method for the naive digital plane recognition problem. As efficient as existing alternatives, it is the only method known to the author that also guarantees a quasi linear time complexity in the worst case. The approach presented can be used to determine if a set of n points is a naive digital hyperplane in Zd in O(n log2 D) worst case time where D represents the size of a bounding box that encloses the points. In addition, the approach succeeds in reducing the naive digital plane recognition problem to a two-dimensional convex optimization program. Thus, the solution space is planar and only simple two-dimensional geometrical methods need to be applied during the recognition process. The algorithm is a composite of simple techniques based on one-dimensional optimization: Megiddo Oracle for linear programming and two-dimensional discrete geometry.