A fast stripe-based connected component labelling algorithm is proposed for binary image labelling. Stripe extraction strategy is used to transform the pixel-connected issues, which most of the previously proposed algorithms focused on, into stripe-connected issues. The stripe-union strategy treats the combination of the neighbouring stripes as the mergence of rooted trees. Finally, comparisons are performed with other famous fast labelling algorithms. The proposed algorithm has shown better performance than the state-of-the-art algorithm in real images test, while the auxiliary memory is not required at all compared with all competitors.