An improved method to compute the convex hull of a shape in a binary image

doi:10.1016/S0031-3203(96)00085-4

Pattern Recognition

Volume 30, Issue 3, March 1997, Pages 397-402

https://doi.org/10.1016/S0031-3203(96)00085-4 Get rights and content

Abstract

A simple method for obtaining the convex hull of a shape, which generates an octagonal approximation, is based on repeatedly filling the central pixel in all 3 × 3 neighborhoods which show a concavity. We propose an extension of this technique that uses larger windows and yields improved results. The performance of our method is demonstrated both on specially generated objects (simulations) as well as on shapes obtained from ultrasound images of ovarian cysts.

References (1)

E.R. Davies
Machine Vision: Theory, Algorithms, Practicalities

Cited by (10)

Decomposition of Chinese character into strokes using mathematical morphology
1999, Pattern Recognition Letters
In off-line character recognition, reliable extraction of strokes greatly influences the overall performance of the system. We propose a novel method of decomposing a Chinese character into a set of strokes, based on the concepts of mathematical morphology. A character is segmented after being thinned using morphological operation. Each segment is expanded by morphological operations such as elongation, fattening and isotropic expansion then intersected with the original input shape. The expanded segments are merged using a convexity measure at the final stage. The final merged segments are regarded as basic strokes of a character. To show the effectiveness of the method, we perform experiments and the results show the validity of the proposed method.
On the computation of the digital convex hull and circular hull of a digital region
1998, Pattern Recognition
The problems of defining convexity and circularity of a digital region are considered. A new definition of digital convexity, called DL- (digital line) convexity, is proposed. A region is DL-convex if, for any two pixels belonging to it, there exists a digital straight line between them all of whose pixels belong to the region. DL-convexity is shown to be stronger that two other definitions, T- (triangle) convexity and L- (line) convexity. A digital region is T-convex if it is DL-convex, but the converse is not generally true. This is because a DL-convex region must be connected, but T- and L-convex regions can be disconnected. An algorithm to compute the DL-convex hull of a digital region is described. A related problem, the computation of the circular hull and its application to testing the circularity of a digital region, is also considered, and an algorithm is given that is computationally cheaper than a previous algorithm for testing circularity.
Image Analysis and Computer Vision: 1997
1998, Computer Vision and Image Understanding
This paper presents a bibliography of nearly 1700 references related to computer vision and image analysis, arranged by subject matter. The topics covered include computational techniques; feature detection and segmentation; image and scene analysis; two-dimensional shape; pattern; color and texture; matching and stereo; three-dimensional recovery and analysis; three-dimensional shape; and motion. A few references are also given on related topics, including geometry and graphics, compression and processing, sensors and optics, visual perception, neural networks, artificial intelligence and pattern recognition, as well as on applications.
Computer-assisted analysis of biomedical images
2021, arXiv
Rapid tree model reconstruction for fruit harvesting robot system based on binocular stereo vision
2017, Vibroengineering Procedia
Automated prostate gland segmentation based on an unsupervised fuzzy C-means clustering technique using multispectral T1w and T2w MR imaging
2017, Information (Switzerland)

View all citing articles on Scopus

View full text

An improved method to compute the convex hull of a shape in a binary image

Abstract

Machine Vision: Theory, Algorithms, Practicalities