Linear Discrete Line Recognition and Reconstruction based on a Generalized Preimage
IWCIA Papers Proceedings, Volume LNCS 4040, pages 174-188, 11th International Workshop on Combinatorial Image Analysis, Berlin, Germany - June 2006
A new efficient standard discrete line recognition method is presented. This algorithm incrementally computes in linear time all straight lines which cross a given set of pixels. Moreover, pixels can be considered in any order and do not need to be connected. A new invertible 2D discrete curve reconstruction algorithm based on the proposed recognition method completes this paper. This algorithm computes a polygonal line so that its standard digitization is equal to the discrete curve. These two methods are based on the definition of a new generalized preimage and the framework is the discrete analytical geometry.
BibTex references
@InProceedings{DA2006_1437,
}
| author | = {Dexet, M. and Andres, E.}, | |
| title | = {Linear Discrete Line Recognition and Reconstruction based on a Generalized Preimage.}, | |
| booktitle | = {IWCIA Papers Proceedings}, | |
| series | = {Lecture Notes on Computer Science}, | |
| volume | = {LNCS 4040}, | |
| pages | = {174-188}, | |
| month | = {June}, | |
| year | = {2006}, | |
| publisher | = {Springer Verlag}, | |
| note | = {11th International Workshop on Combinatorial Image Analysis, Berlin, Germany}, | |
| keywords | = {Discrete Geometry, reconstruction, discrete line, recognition, preimage}, | |
| url | = {http://www.springerlink.com/(5gk0f2455fwb0y4513e0zzzz)/app/home/contribution.asp?referrer=parent\&backto=issue,14,38;journal,19,3897;linkingpublicationresults,1:105633,1}, |