An improved fast scanning algorithm based on distance measure and threshold function in region image segmentation

Segmentation is an essential and important process that separates an image into regions that have similar characteristics or features. This will transform the image for a better image analysis and evaluation. An important benefit of segmentation is the identification of region of interest in a particular image. Various algorithms have been proposed for image segmentation and this includes the Fast Scanning algorithm which has been employed on food, sport and medical image segmentation. The clustering process in Fast Scanning algorithm is performed by merging pixels with similar neighbor based on an identified threshold and the use of Euclidean Distance as distance measure. Such an approach leads to a weak reliability and shape matching of the produced segments. Hence, this study proposes an Improved Fast Scanning algorithm that is based on Sorensen distance measure and adaptive threshold function. The proposed adaptive threshold function is based on the grey value in an image’s pixels and variance. The proposed Improved Fast Scanning algorithm is realized on two datasets which contains images of cars and nature. Evaluation is made by calculating the Peak Signal to Noise Ratio (PSNR) for the Improved Fast Scanning and standard Fast Scanning algorithm. Experimental results showed that proposed algorithm produced higher PSNR compared to the standard Fast Scanning. Such a result indicate that the proposed Improved Fast Scanning algorithm is useful in image segmentation and later contribute in identifying region of interesting in pattern recognition

Color pixels classification in an hybrid color space

International audienc

Visual Tracking: From An Individual To Groups Of Animals

This thesis is concerned with the development and application of visual tracking techniques to the domain of animal monitoring. The development and evaluation of a system which uses image analysis to control the robotic placement of a sensor on the back of a feeding pig is presented first. This single-target monitoring application is then followed by the evaluation of suitable techniques for tracking groups of animals, of which the most suitable existing technique is found to be a Markov chain Monte Carlo particle filtering algorithm with a Markov random field motion prior (MCMC MRF, Khan et al. 2004). Finally, a new tracking technique is developed which uses social motion information present in groups of social targets to guide the tracking. This is used in the new Motion Parameter Sharing (MPS) algorithm. MPS is designed to improve the tracking of groups of targets with coordinated motion by incorporating motion information from targets that have been moving in a similar way. Situations where coordinated motion information should improve tracking include animal flocking, people moving as a group or any situation where some targets are moving in a correlated fashion. This new method is tested on a variety of real and artificial data sequences, and its performance compared to that of the MCMC MRF algorithm. The new MPS algorithm is found to outperform the MCMC MRF algorithm during a number of different types of sequences (including during occlusion events and noisy sequences) where correlated motion is present between targets. This improvement is apparent both in the accuracy of target location and robustness of tracking, the latter of which is greatly improved

Visual Tracking: From An Individual To Groups Of Animals

This thesis is concerned with the development and application of visual tracking techniques to the domain of animal monitoring. The development and evaluation of a system which uses image analysis to control the robotic placement of a sensor on the back of a feeding pig is presented first. This single-target monitoring application is then followed by the evaluation of suitable techniques for tracking groups of animals, of which the most suitable existing technique is found to be a Markov chain Monte Carlo particle filtering algorithm with a Markov random field motion prior (MCMC MRF, Khan et al. 2004). Finally, a new tracking technique is developed which uses social motion information present in groups of social targets to guide the tracking. This is used in the new Motion Parameter Sharing (MPS) algorithm. MPS is designed to improve the tracking of groups of targets with coordinated motion by incorporating motion information from targets that have been moving in a similar way. Situations where coordinated motion information should improve tracking include animal flocking, people moving as a group or any situation where some targets are moving in a correlated fashion. This new method is tested on a variety of real and artificial data sequences, and its performance compared to that of the MCMC MRF algorithm. The new MPS algorithm is found to outperform the MCMC MRF algorithm during a number of different types of sequences (including during occlusion events and noisy sequences) where correlated motion is present between targets. This improvement is apparent both in the accuracy of target location and robustness of tracking, the latter of which is greatly improved