[[abstract]]© 1988 Elsevier-A parallel algorithm for corner finding on the skeletons of digital curves is described in this paper. Instead of computing the abrupt change of slopes (discontinuity) with the chain code sequence, the degree of bending via an extended (k-step) 3×3 mask is considered in corner finding[[department]]電機工程學
[[abstract]]© 1989 Elsevier-Describes a systematic approach for designing parallel thinning algorith...
International audienceIn this paper, we present a generic topological and geometrical framework whic...
This paper presents a statistical approach for detect-ing corners from chain encoded digital arcs. A...
A new parallel algorithm for detecting corners of planar curves or shapes is proposed in this paper....
HOUGH has proposed a procedure for detecting lines in pictures. DUDA-HART extended the method for a ...
There are many algorithms for computing curve skeletons. Most of them have their own notion of what ...
A parallel algorithm is presented for detecting dominant points on a digital closed curve. The proce...
A new algorithm is proposed for detection of corners and other high curvature points in planar curve...
[[abstract]]An efficient algorithm for corner detection is proposed in this paper. It utilizes the c...
AbstractIn this paper we define the notion of pseudo-parallel curves, extending, in the plane, that ...
[[abstract]]The authors review their pseudo-one-subcycle parallel thinning algorithm. They present t...
International audienceSkeletons are widely used in pattern recognition and image analysis. A way to ...
We describe RankFrag: a technique which uses machine learning to detect corner points in hand-drawn ...
This work generalizes the ideas in the Nearest-Neighbor-Crust algorithm by Dey and Kumar. It allows ...
The problem of high-speed traversal of sharp toolpath corners, within a prescribed geometrical toler...
[[abstract]]© 1989 Elsevier-Describes a systematic approach for designing parallel thinning algorith...
International audienceIn this paper, we present a generic topological and geometrical framework whic...
This paper presents a statistical approach for detect-ing corners from chain encoded digital arcs. A...
A new parallel algorithm for detecting corners of planar curves or shapes is proposed in this paper....
HOUGH has proposed a procedure for detecting lines in pictures. DUDA-HART extended the method for a ...
There are many algorithms for computing curve skeletons. Most of them have their own notion of what ...
A parallel algorithm is presented for detecting dominant points on a digital closed curve. The proce...
A new algorithm is proposed for detection of corners and other high curvature points in planar curve...
[[abstract]]An efficient algorithm for corner detection is proposed in this paper. It utilizes the c...
AbstractIn this paper we define the notion of pseudo-parallel curves, extending, in the plane, that ...
[[abstract]]The authors review their pseudo-one-subcycle parallel thinning algorithm. They present t...
International audienceSkeletons are widely used in pattern recognition and image analysis. A way to ...
We describe RankFrag: a technique which uses machine learning to detect corner points in hand-drawn ...
This work generalizes the ideas in the Nearest-Neighbor-Crust algorithm by Dey and Kumar. It allows ...
The problem of high-speed traversal of sharp toolpath corners, within a prescribed geometrical toler...
[[abstract]]© 1989 Elsevier-Describes a systematic approach for designing parallel thinning algorith...
International audienceIn this paper, we present a generic topological and geometrical framework whic...
This paper presents a statistical approach for detect-ing corners from chain encoded digital arcs. A...
DOI
Add to ORKG