The Experts below are selected from a list of 410274 Experts worldwide ranked by ideXlab platform
Gilles Bertrand - One of the best experts on this subject based on the ideXlab platform.
-
a 3d 6 subiteration curve thinning algorithm based on p simple points
International Workshop on Combinatorial Image Analysis, 2005Co-Authors: Christophe Lohou, Gilles BertrandAbstract:In a recent study C. Lohou, G. Bertrand [A new 3D 12-subiteration thinning algorithm based on P-simple points, in: International Workshop on Combinatorial Image Analysis, IWCIA 2001, Philadelphia, PA, USA, ENTCS, vol. 46, 2001, pp. 39-58; A new 3D 6-subiteration thinning algorithm based on P-simple points, in: International Conference on Discrete Geometry for Computer Imagery, DGCI'2002, Bordeaux, France, ENTCS, vol. 2301, Springer, Berlin, 2002, pp. 102-113; A 3D 12-subiteration thinning algorithm based on P-simple points, Discrete Appl. Math. 139(1-3) (2004) 171-195.], we proposed a new methodology to build thinning algorithms based on the deletion of P-simple points. This methodology may permit to conceive a thinning algorithm A^' from an existent thinning algorithm A, such that A^' deletes at least all the points removed by A, while preserving the same end points (in particular, we have already proposed a 12-subiteration thinning algorithm C. Lohou, G. Bertrand [International Workshop on Combinatorial Image Analysis, IWCIA 2001, Philadelphia, PA, USA, ENTCS, vol. 46, 2001, pp. 39-58; A 3D 12-subiteration thinning algorithm based on P-simple points, Discrete Appl. Math. 139(1-3) (2004) 171-195.]). In this paper, by applying this methodology, we propose a 6-subiteration curve thinning algorithm which deletes at least all the points removed by two 6-subiteration curve thinning algorithms: either the one proposed by Palagyi and Kuba [A 3D 6-subiteration thinning algorithm for extracting medial lines, Pattern Recogn. Lett. 19(7) (1998) 613-627.], or the one proposed by Gong and Bertrand [A simple parallel 3D thinning algorithm, in: International Conference on Pattern Recognition, Atlantic City, NJ, USA, 1990, pp. 188-190.]. .
-
a 3d 12 subiteration thinning algorithm based on p simple points
International Workshop on Combinatorial Image Analysis, 2004Co-Authors: Christophe Lohou, Gilles BertrandAbstract:In this paper, we propose a new methodology to conceive a thinning scheme based on the parallel deletion of P-simple points. This scheme needs neither a preliminary labelling nor an extended neighborhood, in the opposite of the already proposed thinning algorithms based on P-simple points. Moreover, from an existent thinning algorithm A, we construct another thinning algorithm A', such that A' deletes at least all the points removed by A, while preserving the same end points. In fact, we propose a 12-subiteration thinning algorithm which deletes at least the points removed by the one proposed by Palagyi and Kuba (Graphical Models Image Process. 61 (1999) 199).
-
a new 3d 6 subiteration thinning algorithm based on p simple points
Discrete Geometry for Computer Imagery, 2002Co-Authors: Christophe Lohou, Gilles BertrandAbstract:In a recent study [1], we proposed a new methodology to build thinning algorithms based on the deletion of P-simple points. This methodology may permit to conceive a thinning algorithm A' from an existent thinning algorithm A, such that A' deletes at least all the points removed by A, while preserving the same end points.In this paper, by applying this methodology, we propose a new 6-subiteration thinning algorithm which deletes at least all the points removed by the 6-subiteration thinning algorithm proposed by Palagyi and Kuba [2].
-
DGCI - A New 3D 6-Subiteration Thinning Algorithm Based on P-Simple Points
Discrete Geometry for Computer Imagery, 2002Co-Authors: Christophe Lohou, Gilles BertrandAbstract:In a recent study [1], we proposed a new methodology to build thinning algorithms based on the deletion of P-simple points. This methodology may permit to conceive a thinning algorithm A' from an existent thinning algorithm A, such that A' deletes at least all the points removed by A, while preserving the same end points.In this paper, by applying this methodology, we propose a new 6-subiteration thinning algorithm which deletes at least all the points removed by the 6-subiteration thinning algorithm proposed by Palagyi and Kuba [2].
-
a new 3d 12 subiteration thinning algorithm based on p simple points
International Workshop on Combinatorial Image Analysis, 2001Co-Authors: Christophe Lohou, Gilles BertrandAbstract:In this paper, we propose a new methodology based on P -simple points, in order to build a thinning algorithm. From an existent thinning algorithm A, we construct another thinning algorithm A � , such that Adeletes at least all the points removed by A, while preserving the same end points. In fact, we propose an algorithm which deletes at least the points removed by a recent 12-subiteration thinning algorithm proposed by Palagyi and Kuba (26).
Basuanup - One of the best experts on this subject based on the ideXlab platform.
-
A note on 'A fully parallel 3D thinning algorithm and its applications'
Pattern Recognition Letters, 2007Co-Authors: Wangtao, BasuanupAbstract:A 3D thinning algorithm erodes a 3D binary image layer by layer to extract the skeletons. This paper presents a correction to Ma and Sonka's thinning algorithm, 'A fully parallel 3D thinning algori...
Christophe Lohou - One of the best experts on this subject based on the ideXlab platform.
-
a 3d 6 subiteration curve thinning algorithm based on p simple points
International Workshop on Combinatorial Image Analysis, 2005Co-Authors: Christophe Lohou, Gilles BertrandAbstract:In a recent study C. Lohou, G. Bertrand [A new 3D 12-subiteration thinning algorithm based on P-simple points, in: International Workshop on Combinatorial Image Analysis, IWCIA 2001, Philadelphia, PA, USA, ENTCS, vol. 46, 2001, pp. 39-58; A new 3D 6-subiteration thinning algorithm based on P-simple points, in: International Conference on Discrete Geometry for Computer Imagery, DGCI'2002, Bordeaux, France, ENTCS, vol. 2301, Springer, Berlin, 2002, pp. 102-113; A 3D 12-subiteration thinning algorithm based on P-simple points, Discrete Appl. Math. 139(1-3) (2004) 171-195.], we proposed a new methodology to build thinning algorithms based on the deletion of P-simple points. This methodology may permit to conceive a thinning algorithm A^' from an existent thinning algorithm A, such that A^' deletes at least all the points removed by A, while preserving the same end points (in particular, we have already proposed a 12-subiteration thinning algorithm C. Lohou, G. Bertrand [International Workshop on Combinatorial Image Analysis, IWCIA 2001, Philadelphia, PA, USA, ENTCS, vol. 46, 2001, pp. 39-58; A 3D 12-subiteration thinning algorithm based on P-simple points, Discrete Appl. Math. 139(1-3) (2004) 171-195.]). In this paper, by applying this methodology, we propose a 6-subiteration curve thinning algorithm which deletes at least all the points removed by two 6-subiteration curve thinning algorithms: either the one proposed by Palagyi and Kuba [A 3D 6-subiteration thinning algorithm for extracting medial lines, Pattern Recogn. Lett. 19(7) (1998) 613-627.], or the one proposed by Gong and Bertrand [A simple parallel 3D thinning algorithm, in: International Conference on Pattern Recognition, Atlantic City, NJ, USA, 1990, pp. 188-190.]. .
-
a 3d 12 subiteration thinning algorithm based on p simple points
International Workshop on Combinatorial Image Analysis, 2004Co-Authors: Christophe Lohou, Gilles BertrandAbstract:In this paper, we propose a new methodology to conceive a thinning scheme based on the parallel deletion of P-simple points. This scheme needs neither a preliminary labelling nor an extended neighborhood, in the opposite of the already proposed thinning algorithms based on P-simple points. Moreover, from an existent thinning algorithm A, we construct another thinning algorithm A', such that A' deletes at least all the points removed by A, while preserving the same end points. In fact, we propose a 12-subiteration thinning algorithm which deletes at least the points removed by the one proposed by Palagyi and Kuba (Graphical Models Image Process. 61 (1999) 199).
-
a new 3d 6 subiteration thinning algorithm based on p simple points
Discrete Geometry for Computer Imagery, 2002Co-Authors: Christophe Lohou, Gilles BertrandAbstract:In a recent study [1], we proposed a new methodology to build thinning algorithms based on the deletion of P-simple points. This methodology may permit to conceive a thinning algorithm A' from an existent thinning algorithm A, such that A' deletes at least all the points removed by A, while preserving the same end points.In this paper, by applying this methodology, we propose a new 6-subiteration thinning algorithm which deletes at least all the points removed by the 6-subiteration thinning algorithm proposed by Palagyi and Kuba [2].
-
DGCI - A New 3D 6-Subiteration Thinning Algorithm Based on P-Simple Points
Discrete Geometry for Computer Imagery, 2002Co-Authors: Christophe Lohou, Gilles BertrandAbstract:In a recent study [1], we proposed a new methodology to build thinning algorithms based on the deletion of P-simple points. This methodology may permit to conceive a thinning algorithm A' from an existent thinning algorithm A, such that A' deletes at least all the points removed by A, while preserving the same end points.In this paper, by applying this methodology, we propose a new 6-subiteration thinning algorithm which deletes at least all the points removed by the 6-subiteration thinning algorithm proposed by Palagyi and Kuba [2].
-
a new 3d 12 subiteration thinning algorithm based on p simple points
International Workshop on Combinatorial Image Analysis, 2001Co-Authors: Christophe Lohou, Gilles BertrandAbstract:In this paper, we propose a new methodology based on P -simple points, in order to build a thinning algorithm. From an existent thinning algorithm A, we construct another thinning algorithm A � , such that Adeletes at least all the points removed by A, while preserving the same end points. In fact, we propose an algorithm which deletes at least the points removed by a recent 12-subiteration thinning algorithm proposed by Palagyi and Kuba (26).
Wangtao - One of the best experts on this subject based on the ideXlab platform.
-
A note on 'A fully parallel 3D thinning algorithm and its applications'
Pattern Recognition Letters, 2007Co-Authors: Wangtao, BasuanupAbstract:A 3D thinning algorithm erodes a 3D binary image layer by layer to extract the skeletons. This paper presents a correction to Ma and Sonka's thinning algorithm, 'A fully parallel 3D thinning algori...
Wang Renmin - One of the best experts on this subject based on the ideXlab platform.
-
edge thinning based on mathematical morphology thinning algorithm
Journal of Computer Applications, 2012Co-Authors: Wang RenminAbstract:Given the improper threshold,Sobel operator could easily lead to the loss of image edges or produce broad pseudo-edges.To solve these problems,appropriate threshold was selected by using the constraint of variance firstly,and then mathematical morphology thinning algorithm was utilized to thin the edge images detected by Sobel operator.The experimental results show that this method can bring about satisfactory thinning effects while retaining the original edge information.