Contour Extraction and Compression Scheme Utilizing Both the Transform and Spatial Image Domains
- 346 Downloads
Two new simple but fast and pretty efficient approaches for contour data detection, extraction and approximation are presented in this paper. The High-Pass Filter (HPF) method, designed to detect and extract contours from greyscale images is the first presented method. It operates in spectral domains either of the Periodic Haar Piecewise-Linear (PHL) transform or the Haar Wavelet one. The other presented method, known as the Segments Distances Ratios (SDR) approach, is used, in turn, to approximate the contour lines given by the HPF method. Its spatial approximation accuracy is carefully investigated and reported as well as referred to the universally recognized Ramer algorithm. Efficiency of both presented methods as well as their performance aspects are finally discussed and concluded.
KeywordsContour detection and extraction Contour compression Haar wavelet PHL transform Bit-plane slicing Spatial approximation
This work was partially supported by The Horizon 2020 project SCISSOR - Security In trusted SCADA and smart-grids (Grant agreement no: 644425) and also by The Polish National Centre for Research and Development (NCBR), as a part of the Project no. DZP/RID-I-68/14/NCBIR/2016 (RID - InPreDo).
- 3.Parker, J.R.: Algorithms for Image Processing and Computer Vision. Wiley, New York (1997)Google Scholar
- 4.Dziech, A., Besbas, W.S., Nabout, A., Nour Eldin, H.A.: Fast algorithm for closed contour extraction. In: Proceedings of the 4th International Workshop on Systems, Signals and Image Processing, Poznan, Poland, 28–30 May 1997, pp. 203–206 (1997)Google Scholar
- 5.Jain, A.K.: Fundamentals of Digital Image Processing. Prentice-Hall, Englewood Cliffs (1989)Google Scholar
- 7.Baran, R., Kleszcz, A.: The efficient spatial methods of contour approximation. In: Proceedings of the 18th IEEE Conference on Signal Processing: Algorithms, Architectures, Arrangements, and Applications, pp. 116–121 (2014)Google Scholar
- 9.Pavlidis, T., Ali, F.: Computer recognition of handwritten numerals by polygonal approximations. IEEE Trans. Syst. Man Cybern. (SMC-5), 610–614 (1975)Google Scholar
- 10.Sirjani, A., Cross, G.: An algorithm for polygonal approximation of digital objects. Pattern Recogn. Lett., 299–303 (1988). Elsevier Science PublishersGoogle Scholar
- 11.Carvalho, J.D., Guliato, D., Santiago, S.A., Rangayyan, R.M.: Polygonal modeling of contours using the turning angle function. In: Canadian Conference on Electrical and Computer Engineering (CCECE 2007), pp. l090–1093, 22–26 April 2007Google Scholar
- 13.Dziech, W., Baran, R., Wiraszka, D.: Signal compression based on zonal selection methods. In: Proceedings of the International Conference on Mathematical Methods in Electromagnetic Theory, vol. 1, pp. 224–226 (2000)Google Scholar
- 14.Belgassem, F., Dziech, A.: Fast algorithms for the periodic haar piecewise linear transforms. In: Proceedings of the AMSE International Conference on Signal and Systems, Brno, Slovakia, vol. 1 (1996)Google Scholar
- 15.Ukasha, A., Dziech, A., Elsherif, E., Baran, R.: An efficient method of contour compression. In: International Conference on Visualization, Imaging and Image Processing, pp. 213–218 (2009)Google Scholar