Optimal blurred segments decomposition in linear time

Lecture Notes in Computer Science

Volumn 3429, Issue , 2005, Pages 371-382

  Debled Rennesson, Isabelle ^a   Feschet, Fabien ^b   Rouyer Degli, Jocelyne ^a  

^a LORIA   (France)

^b UNIVERSITÉ CLERMONT AUVERGNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIGITAL ARITHMETIC; GEOMETRY; IMAGE ANALYSIS;

AIRTHMETICAL APPROACH; BLURRED SEGMENTS; CONVEX HULL; LINEAR-TIME ALGORITHMS;

FUZZY SETS;

EID: 24344438924     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31965-8_34     Document Type: Conference Paper

References (16)

1. I. Debled-Rennesson, J.-L. Rémy, and J. Rouyer. Segmentation of discrete curves into fuzzy segments. In 9th International Workshop on Combinatorial Image Analysis, volume 12 of Electronic Notes in Discrete Mathematics, 2003.
2. I. Debled-Rennesson, J.-L. Rémy, and J. Rouyer. Segmentation of discrete curves into fuzzy segments, extended version. Technical report, INRIA Report RR-4989, http://www.inria.fr/rrrt/rr-4989.html, 2003.
3. I. Debled-Rennesson and J.P. Reveillés. A linear algorithm for segmentation of digital curves. IJPRAI, 9(6), December 1995.
4. F. Feschet and L. Tougne. Optimal time computation of the tangent of a discrete curve: application to the curvature. In Discrete Geometry and Computer Imagery, Lecture Notes in Computer Science 1568, pages 31-40. Springer Verlag, 1999.
5. M.E. Houle and G.T. Toussaint. Computing the width of a set. IEEE Trans. on Pattern Analysis and Machine Intelligence, 10(5):761-765, 1988.
6. A. Kolesnikov and P. Fränti. Reduced-search dynamic programming for approximation of polygonal curves. Pattern Recognition Letter, 24(14):2243-2254, 2003.
7. M. Lindenbaum and A. Bruckstein. On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15(9):949-953, 1993.
8. A. Melkman. On-line Construction of the Convex Hull of a Simple Polygon. Information Processing Letters, 25:11-12, 1987.
9. J. Perez and E. Vidal. Optimum polygonal approximation of digitized curves. Pattern Recognition Letter, 15:743-750, 1994.
10. F.P. Preparata and M.I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, 1985.
11. J.P. Reveillès. Géométrie discrète, calculs en nombres entiers et algorithmique. Thèse d'Etat - Université Louis Pasteur, 1991.
12. A. Rosenfeld and R. Klette. Digital Straightness - a review. Discrete Applied Math., 139(1-3): 197-230, 2004.
13. P. L. Rosin. Techniques for assessing polygonal approximations of curves. IEEE Transactions on PAMI, 19(6):659-666, 1997.
14. A.W.M. Smeulders and L. Dorst. Decomposition of discrete curves into piecewise straight segments in linear time. Contemporary Mathematics, 119:169-195, 1991.
15. P. Yin. A tabu search approach to polygonal approximation of digital curves. International Journal of Pattern Recognition and Artificial Intelligence, 14(2):243-255, 2000.
16. D. Zhang and G. Lu. Review of shape representation and description techniques. Pattern Recognition, 37(1): 1-19, 2004.