| B. Batchelor. Using concavity trees for shape description. Computers and Digital Techniques, 2(4):157--167, August 1978. |
....hull of this set. A non convex pattern can be analyzed by computing the set difference between its convex hull and the pattern itself. The concavity regions of a set are defined as the connected components of this difference image. The use of concavity trees for shape recognition is presented in [3]. Computational geometry algorithms for computing the convex hull of a set of points of the Euclidean plane can be found in [15, chaps. 4 5] 20] and [14] Algorithms for extracting the convex hull or concavity regions of binary images are proposed in many papers (e.g. 21, 17, 2, 18, 1, 4] ....
B. Batchelor. Using concavity trees for shape description. Computers and Digital Techniques, 2(4):157--167, August 1978.
....of its convex hull. Alternatively, the difference between the convex hull of a shape and the shape itself can be performed. The connected components of this difference image are called concavity regions. A hierarchical description of the shape is then achieved by constructing its concavity tree [2, 26]. The root of the tree is associated with the shape. The nodes at the first level of the tree are associated with the concavity regions of the shape and so on. The nodes of the concavity Address for correspondence: Image Analysis and Control Group, Silsoe Research Institute, Wrest Park, Silsoe, ....
B. Batchelor. Using concavity trees for shape description. Computers and Digital Techniques, 2(4):157-169, August 1979.
No context found.
B. Batchelor. Using concavity trees for shape description. Computers and Digital Techniques, 2(4):157--169, Aug. 1979.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC