The 1.5D sieve algorithm

The sieve is a morphological scale-space operator that filters an input signal by removing intensity extrema at a specific scale. In images, this processing can be carried out along a path - the 1D sieve - or over a connected graph - the 2D sieve. The 2D version of the sieve generally performs better; it is however much more complex to implement. In this paper we present the 1.5D sieve, a Hamiltonian path-based version of the sieve algorithm that behaves ''in between'' the 1D or 2D sieve algorithms, depending on the number of paths used. Experiments show that its robustness to the presence of noise and its performance in texture classification are similar to the original 2D sieve formulation, while being much faster and simpler to implement.

[1]  Philippe Salembier,et al.  Binary partition tree as an efficient representation for image processing, segmentation, and information retrieval , 2000, IEEE Trans. Image Process..

[2]  Gavin C. Cawley,et al.  The Segmentation of Images via Scale-Space Trees , 1998, BMVC.

[3]  F. Y. Wu Number of spanning trees on a lattice , 1977 .

[4]  O. Lezoray,et al.  Mathematical Morphology in Any Color Space , 2007, 14th International Conference of Image Analysis and Processing - Workshops (ICIAPW 2007).

[5]  Paul Southam,et al.  Compact rotation-invariant texture classification , 2004, 2004 International Conference on Image Processing, 2004. ICIP '04..

[6]  Michael H. F. Wilkinson,et al.  A Comparison of Algorithms for Connected Set Openings and Closings , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Adrian N. Evans,et al.  Colour Morphological Scale-Spaces from the Positional Colour Sieve , 2005, Digital Image Computing: Techniques and Applications (DICTA'05).

[8]  Graham D. Finlayson,et al.  Hamiltonian Path based Shadow Removal , 2005, BMVC.

[9]  Paul Southam,et al.  Towards Texture Classification in Real Scenes , 2005, BMVC.

[10]  Matti Pietikäinen,et al.  Outex - new framework for empirical evaluation of texture analysis algorithms , 2002, Object recognition supported by user interaction for service robots.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Adrian N. Evans,et al.  Colour Morphological Scale-Spaces for Image Segmentation , 2005, BMVC.

[13]  Gur Saran Adhar Optimal parallel algorithms for cut vertices, bridges, and Hamiltonian path in bounded interval tolerance graphs , 2001, Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001.

[14]  Adrian N. Evans,et al.  Image Noise Reduction using Attribute Morphology Filters , 2003 .

[15]  Philip N. Klein,et al.  A randomized linear-time algorithm to find minimum spanning trees , 1995, JACM.

[16]  Javier Ruiz Hidalgo,et al.  Robust morphological scale-space trees , 1998, NMBIA.

[17]  Pierre Chardaire,et al.  Multiscale Nonlinear Decomposition: The Sieve Decomposition Theorem , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Bela Bollobas,et al.  Graph theory , 1979 .

[19]  Mark Fisher,et al.  Scale-space Trees and Applications as Filters for Stereo Vision and Image Retrieval , 1999, BMVC.

[20]  Daniel Cohen-Or,et al.  Hierarchical Context‐based Pixel Ordering , 2003, Comput. Graph. Forum.

[21]  J. Andrew Bangham,et al.  The robustness of some scale-spaces , 1997, BMVC.

[22]  Sebastiano Battiato,et al.  An efficient Re-indexing algorithm for color-mapped images , 2004, IEEE Transactions on Image Processing.

[23]  J. Andrew Bangham,et al.  Morphological scale-space preserving transforms in many dimensions , 1996, J. Electronic Imaging.

[24]  Hong Shen,et al.  An efficient algorithm for constructing Hamiltonian paths in meshes , 2002, Parallel Comput..