Efficient texture descriptors for image segmentation
- Authors: Tania, Sheikh
- Date: 2022
- Type: Text , Thesis , PhD
- Full Text:
- Description: Colour and texture are the most common features used in image processing and computer vision applications. Unlike colour, a local texture descriptor needs to express the unique variation pattern in the intensity differences of pixels in the neighbourhood of the pixel-of-interest (POI) so that it can sufficiently discriminate different textures. Since the descriptor needs spatial manipulation of all pixels in the neighbourhood of the POI, approximation of texture impacts not only the computational cost but also the performance of the applications. In this thesis, we aim to develop novel texture descriptors, especially for hierarchical image segmentation techniques that have recently gained popularity for their wide range of applications in medical imaging, video surveillance, autonomous navigation, and computer vision in general. To pursue the aim, we focus in reducing the length of the texture feature and directly modelling the distribution of intensity-variation in the parametric space of a probability density function (pdf). In the first contributory chapter, we enhance the state-of-the-art Weber local descriptor (WLD) by considering the mean value of neighbouring pixel intensities along radial directions instead of sampling pixels at three scales. Consequently, the proposed descriptor, named Radial Mean WLD (RM-WLD), is three-fold shorter than WLD and it performs slightly better than WLD in hierarchical image segmentation. The statistical distributions of pixel intensities in different image regions are diverse by nature. In the second contributory chapter, we propose a novel texture feature, called ‘joint scale,’ by directly modelling the probability distribution of intensity differences. The Weibull distribution, one of the extreme value distributions, is selected for this purpose as it can represent a wide range of probability distributions with a couple of parameters. In addition, gradient orientation feature is calculated from all pixels in the neighbourhood with an extended Sobel operator, instead of using only the vertical and horizontal neighbours as considered in WLD. The length of the texture descriptor combining joint scale and gradiet orientation features remains the same as RM-WLD, but it exhibits significantly improved discrimination capability for better image segmentation. Initial regions in hierarchical segmentation play an important role in approximating texture features. Traditional arbitrary-shaped initial regions maintain the uniform colour property and thus may not retain the texture pattern of the segment they belong to. In the final contributory chapter, we introduce regular-shaped initial regions by enhancing the cuboidal partitioning technique, which has recently gained popularity in image/video coding research. Since the regions (cuboids) of cuboidal partitioning are of rectangular shape, they do not follow the colour-based boundary adherence of traditional initial regions. Consequently, the cuboids retain sufficient texture pattern cues to provide better texture approximation and discriminating capability. We have used benchmark segmentation datasets and metrics to evaluate the proposed texture descriptors. Experimental results on benchmark metrics and computational time are promising when the proposed texture features are used in the state-of-the-art iterative contraction and merging (ICM) image segmentation technique.
- Description: Doctor of Philosophy
- Authors: Tania, Sheikh
- Date: 2022
- Type: Text , Thesis , PhD
- Full Text:
- Description: Colour and texture are the most common features used in image processing and computer vision applications. Unlike colour, a local texture descriptor needs to express the unique variation pattern in the intensity differences of pixels in the neighbourhood of the pixel-of-interest (POI) so that it can sufficiently discriminate different textures. Since the descriptor needs spatial manipulation of all pixels in the neighbourhood of the POI, approximation of texture impacts not only the computational cost but also the performance of the applications. In this thesis, we aim to develop novel texture descriptors, especially for hierarchical image segmentation techniques that have recently gained popularity for their wide range of applications in medical imaging, video surveillance, autonomous navigation, and computer vision in general. To pursue the aim, we focus in reducing the length of the texture feature and directly modelling the distribution of intensity-variation in the parametric space of a probability density function (pdf). In the first contributory chapter, we enhance the state-of-the-art Weber local descriptor (WLD) by considering the mean value of neighbouring pixel intensities along radial directions instead of sampling pixels at three scales. Consequently, the proposed descriptor, named Radial Mean WLD (RM-WLD), is three-fold shorter than WLD and it performs slightly better than WLD in hierarchical image segmentation. The statistical distributions of pixel intensities in different image regions are diverse by nature. In the second contributory chapter, we propose a novel texture feature, called ‘joint scale,’ by directly modelling the probability distribution of intensity differences. The Weibull distribution, one of the extreme value distributions, is selected for this purpose as it can represent a wide range of probability distributions with a couple of parameters. In addition, gradient orientation feature is calculated from all pixels in the neighbourhood with an extended Sobel operator, instead of using only the vertical and horizontal neighbours as considered in WLD. The length of the texture descriptor combining joint scale and gradiet orientation features remains the same as RM-WLD, but it exhibits significantly improved discrimination capability for better image segmentation. Initial regions in hierarchical segmentation play an important role in approximating texture features. Traditional arbitrary-shaped initial regions maintain the uniform colour property and thus may not retain the texture pattern of the segment they belong to. In the final contributory chapter, we introduce regular-shaped initial regions by enhancing the cuboidal partitioning technique, which has recently gained popularity in image/video coding research. Since the regions (cuboids) of cuboidal partitioning are of rectangular shape, they do not follow the colour-based boundary adherence of traditional initial regions. Consequently, the cuboids retain sufficient texture pattern cues to provide better texture approximation and discriminating capability. We have used benchmark segmentation datasets and metrics to evaluate the proposed texture descriptors. Experimental results on benchmark metrics and computational time are promising when the proposed texture features are used in the state-of-the-art iterative contraction and merging (ICM) image segmentation technique.
- Description: Doctor of Philosophy
Hierarchical colour image segmentation by leveraging RGB channels independently
- Tania, Sheikh, Murshed, Manzur, Teng, Shyh, Karmakar, Gour
- Authors: Tania, Sheikh , Murshed, Manzur , Teng, Shyh , Karmakar, Gour
- Date: 2019
- Type: Text , Conference paper
- Relation: 9th Pacific-Rim Symposium on Image and Video Technology, PSIVT 2019 Vol. 11854 LNCS, p. 197-210
- Full Text:
- Reviewed:
- Description: In this paper, we introduce a hierarchical colour image segmentation based on cuboid partitioning using simple statistical features of the pixel intensities in the RGB channels. Estimating the difference between any two colours is a challenging task. As most of the colour models are not perceptually uniform, investigation of an alternative strategy is highly demanding. To address this issue, for our proposed technique, we present a new concept for colour distance measure based on the inconsistency of pixel intensities of an image which is more compliant to human perception. Constructing a reliable set of superpixels from an image is fundamental for further merging. As cuboid partitioning is a superior candidate to produce superpixels, we use the agglomerative merging to yield the final segmentation results exploiting the outcome of our proposed cuboid partitioning. The proposed cuboid segmentation based algorithm significantly outperforms not only the quadtree-based segmentation but also existing state-of-the-art segmentation algorithms in terms of quality of segmentation for the benchmark datasets used in image segmentation. © 2019, Springer Nature Switzerland AG.
- Authors: Tania, Sheikh , Murshed, Manzur , Teng, Shyh , Karmakar, Gour
- Date: 2019
- Type: Text , Conference paper
- Relation: 9th Pacific-Rim Symposium on Image and Video Technology, PSIVT 2019 Vol. 11854 LNCS, p. 197-210
- Full Text:
- Reviewed:
- Description: In this paper, we introduce a hierarchical colour image segmentation based on cuboid partitioning using simple statistical features of the pixel intensities in the RGB channels. Estimating the difference between any two colours is a challenging task. As most of the colour models are not perceptually uniform, investigation of an alternative strategy is highly demanding. To address this issue, for our proposed technique, we present a new concept for colour distance measure based on the inconsistency of pixel intensities of an image which is more compliant to human perception. Constructing a reliable set of superpixels from an image is fundamental for further merging. As cuboid partitioning is a superior candidate to produce superpixels, we use the agglomerative merging to yield the final segmentation results exploiting the outcome of our proposed cuboid partitioning. The proposed cuboid segmentation based algorithm significantly outperforms not only the quadtree-based segmentation but also existing state-of-the-art segmentation algorithms in terms of quality of segmentation for the benchmark datasets used in image segmentation. © 2019, Springer Nature Switzerland AG.
Cuboid colour image segmentation using intuitive distance measure
- Tania, Sheikh, Murshed, Manzur, Teng, Shyh, Karmakar, Gour
- Authors: Tania, Sheikh , Murshed, Manzur , Teng, Shyh , Karmakar, Gour
- Date: 2018
- Type: Text , Conference proceedings
- Relation: 2018 International Conference on Image and Vision Computing New Zealand, IVCNZ 2018; Auckland, New Zealand; 19th-21st November 2018 Vol. 2018-November, p. 1-6
- Full Text:
- Reviewed:
- Description: In this paper, an improved algorithm for cuboid image segmentation is proposed. To address the two main limitations of the recently proposed cuboid segmentation algorithm, the improved algorithm substitutes colour quantization in HCL colour space with infinity norm distance in RGB colour space along with a different way to impose area thresholding. We also propose a new metric to evaluate the quality of segmentation. Experimental results show that the proposed cuboid segmentation algorithm significantly outperforms the existing cuboid segmentation algorithm in terms of quality of segmentation.
- Description: International Conference Image and Vision Computing New Zealand
- Authors: Tania, Sheikh , Murshed, Manzur , Teng, Shyh , Karmakar, Gour
- Date: 2018
- Type: Text , Conference proceedings
- Relation: 2018 International Conference on Image and Vision Computing New Zealand, IVCNZ 2018; Auckland, New Zealand; 19th-21st November 2018 Vol. 2018-November, p. 1-6
- Full Text:
- Reviewed:
- Description: In this paper, an improved algorithm for cuboid image segmentation is proposed. To address the two main limitations of the recently proposed cuboid segmentation algorithm, the improved algorithm substitutes colour quantization in HCL colour space with infinity norm distance in RGB colour space along with a different way to impose area thresholding. We also propose a new metric to evaluate the quality of segmentation. Experimental results show that the proposed cuboid segmentation algorithm significantly outperforms the existing cuboid segmentation algorithm in terms of quality of segmentation.
- Description: International Conference Image and Vision Computing New Zealand
- «
- ‹
- 1
- ›
- »