This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Morphological Reversible Contour Representation
March 2000 (vol. 22 no. 3)
pp. 227-240

Abstract—In this paper, a novel morphological reversible contour representation of discrete binary images is proposed. A binary image is represented by a set of nonoverlapping multilevel contours and a residual image. In this proposed representation, the total number of pixels representing an image is far less than the total number of pixels obtained by the seed-based morphological contour-skeleton lossless representation. The proposed contour representation is simple, unique, and general without restrictions on the binary image to be represented. Moreover, it requires fewer number of operations to compute the proposed representation compared with other lossless morphological representation methods. The resulting multicontour image component is also robust to noise. An efficient differential chain contour coding scheme is employed to further compress the represented image. The proposed method yields very low bit rates compared to the existing morphological techniques. To exactly reconstruct an original image, an automatic filling procedure, which properly fills a proper multicontour image according to its topological structure without need of seed points, is proposed. The morphological unique contour representation and its lossless reconstruction techniques have been tested on images with varying size and complexity. Examples are presented to illustrate the performance of the proposed method.

[1] J. Serra, Image Analysis and Mathematical Morphology. London: Academic Press, 1982.
[2] H.J.A.M. Heijmans, Morphological Image Operators. London: Academic Press, 1994.
[3] P. Maragos, “Tutorial on Advances in Morphological Image Processing and Analysis,” Optical Eng., vol. 26, pp. 623-632, July 1987.
[4] Z. Zhou and A.N. Venetsanopoulos, "Morphological Skeleton Representation and Shape Recognition," Proc. IEEE Second Int'l Conf. ASSP,New York, pp. 948-951, 1988.
[5] K. Lam and C. Yu, “A Clustered Search Algorithm Incorporating Arbitrary Term Dependencies,” ACM Trans. Database Systems, Sept. 1982.
[6] V. Anastassopoulos and A.N. Venetsanopoulos, "Classification Properties of the Spectrum and Its Use for Pattern Identification," Circuits, Systems, and Signal Processing, vol. 10, no. 3, 1991.
[7] Y. Chen and E.R. Dougherty, “Gray-Scale Morphological Granulometric Texture Classification,” Optical Eng., vol. 33, no. 8, pp. 2,713-2,722, 1994.
[8] G.K. Matsopoolos and S. Marshall, “Use of Morphology Image Processing Techniques for the Measurement of Fetal Head from Ultrasound Images,” Pattern Recognition, pp. 1,317-1,324, 1994.
[9] S.R. Sternberg and E.S. Sternberg, “Industrial Inspection by Morphological Virtual Gauging,” Proc. IEEE Workshop Computer Architecture Pattern Analysis Image Database Management, Oct. 1983.
[10] R. Kasturi and M.M. Trivedi, Image Analysis Applications. New York: Marcel Dekker, Inc., 1990.
[11] RACE, “Morpheco: Morphological Codec for Storage and Transmission,” Research in Advanced Comm. in Europe (RACE) Project R2053, 1995.
[12] ESPRIT, “Noblesse: Nonlinear Model-Based Analysis and Description of Images for Multimedia Applications,” ESPRIT LTR Project 20229, 1996.
[13] P. Salembier, P. Brigger, J.R. Casas, and M. Pardas, “Morphological Operators for Image and Video Compression,” IEEE Trans. Image Processing, vol. 5, pp. 881-897, June 1996.
[14] J. Goutias and D. Schonfeld, “Morphological Representation of Discrete and Binary Images,” IEEE Trans. Image Processing, vol. 39, pp. 1,369-1,379, June 1991.
[15] I. Pitas and A.N. Venetsanopoulous, “Morphological Shape Representation,” Pattern Recognition, vol. 25, no. 6, pp. 555-565, 1992.
[16] J.M. Reinhardt and W.E. Higgins, "Efficient Morphological Shape Representation," IEEE Trans. Image Processing, vol. 5, no. 1, pp. 89- 101, Jan. 1996.
[17] C.K.W.J. Ma and X.R. Lu, “A Fast Shape Descriptor,” Computer Vision, Graphics, and Image Processing, vol. 34, no. 3, pp. 282-291, 1986.
[18] I. Pitas and A.N. Venetsanopoulous, “Morphological Shape Decomposition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 1, Jan. 1990.
[19] P.A. Maragos and R.W. Schafer, "Morphological Skeleton Representation and Coding of Binary Images," IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 34, pp. 1,228-1,244, Oct. 1986.
[20] L. Ji and J. Piper, "Fast Homotopy-Preserving Skeletons Using Mathematical Morphology," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, no. 6, pp. 653-664, June 1992.
[21] J. Xu, “Morphological Decomposition of 2-D Binary Shapes into Conditionally Maximal Convex Polygon,” Pattern Recognition, vol. 29, no. 7, pp. 1,75-1,104, 1996.
[22] P. Maragos, "Pattern Spectrum and Multiscale Shape Representation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, pp. 701-716, 1989.
[23] A.C.P. Loui, A.N. Venetsanopoulos, and K.C. Smith, “Morphological Autocorrelation Transform: A New Representation and Classification Scheme for Two-Dimensional Images,” IEEE Trans. Image Processing, vol. 1, pp. 337-353, July 1992.
[24] S.W.L. Pong and A.N. Venetsanopoulos, “Rotationally Invariant Pecstrum,” Circuit Systems and Signal Processing, vol. 22, no. 4, pp. 455-492, 1992.
[25] M. Charif and D. Schonfeld, “On the Invertability of Morphological Representation of Binary Images,” IEEE Trans. Image Processing, vol. 3, pp. 847-849, Nov. 1994.
[26] M. Charif and D. Schonfeld, “Author Reply on (on the Invertability of Morphological Representation of Binary Images),” IEEE Trans. Image Processing, vol. 15, pp. 531-532, Mar. 1996.
[27] T.W. Pai and J.H.L. Hansen, “An Improved Image Coding Algorithm Using Morphological Operator Theory,” Proc. IEEE Int'l Conf. Acoustics, Speech, and Signal Processing, pp. 2,761-2,764, 1991.
[28] T.-W. Pai and J.H.L. Hansen, "Boundary-Constrained Morphological Skeleton Minimization and Skeleton Reconstruction," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, pp. 201-208, Feb. 1994.
[29] C.A. Cabrelli and U.M. Molter, “Automatic Representation of Binary Images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 12, pp. 1,190-1,195, Dec. 1990.
[30] M.J. Turner and N.E. Wiseman, “Efficient Lossless Image Contour Coding,” Computer Graphics Forum, vol. 15, no. 2, pp. 107-117, 1996.
[31] Z. Cai, “Restoration of Binary Images Using Contour Direction Chain Codes Description,” Computer Vision, Graphics, and Image Processing, vol. 41, pp. 101-106, 1988.
[32] B.D. Ackland and N. Weste, “The Edge Flag Algorithm—A Fill Method for Raster Scan Display,” IEEE Trans. Computers, vol. 30, pp. 41-47, 1981.
[33] K. Ohta, J. Zhao, Y. Shimazu, R. Hayasaka, and Y. Matsushita, “A jpeg Codec Reflecting Human Sense,” Proc. IEEE Int'l Conf. Signal Processing ICSP '96, pp. 1,002-1,006, 1996.
[34] L.W. Chang and K.L. Leu, “A Fast Algorithm for the Restoration of Images Based on Chain Codes Description and Its Applications,” Computer Vision, Graphics, and Image Processing, vol. 50, pp. 296-307, 1990.
[35] G.Y. Tang, “Region Filling with the Use of the Discrete Green Theorem,” Computer Vision, Graphics, and Image Processing, vol. 42, pp. 297-305, 1988.
[36] J.D. Foley et al., Computer Graphics: Principles and Practice, Second Edition in C, Addison-Wesley, Reading, Mass., 1995.
[37] G.X. Ritter and J.N. Wilson, Handbook of Computer Vision Algorithms in Image Algebra. New York: CRC Press, Inc., 1996.
[38] B. Jang and R.T. Chin, “Analysis of Thinning Algorithms Using Mathematical Morphology,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 6, pp. 541-551, 1990.
[39] X. Zhuang and R. Haralick, “Morphological Structuring Element Decomposition,” Computer Vision, Graphics, and Image Processing, vol. 35, pp. 370–382, 1986.
[40] J.M. Reinhardt and W.E. Higgins, “Comparison between the Morphological Skeleton and Morphological Shape Decomposition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 9, pp. 951-957, Sept. 1996.
[41] G. Lu, “An Approach to Image Retrieval Based on Shape,” J. Information Science, vol. 123, no. 2, pp. 119-127, 1997.
[42] Y.B. Mahdy and M.T. EL-Melegy, “Encoding Patterns for Efficient Classification by Nearest Neighbor Classifier and Neural Networks with application to Handwritten Hindi Numeral Recognition,” Proc. IEEE Int'l Conf. Signal Processing ICSP '96, pp. 1,362-1,365, 1996.
[43] J.L. Michel and W.B. Pennebaker, “Software Implementation of the q-Coder,” IBM J. Research and Development, vol. 32, pp. 753-774, Nov. 1988.
[44] S. Marshall, “Application of Image Contours to Three Aspects of Image Processing: Compression, Shape Recognition and Stereopsis,” IEE Proc.-I, vol. 139, pp. 1-8, Feb. 1992.

Index Terms:
Shape analysis, binary images, mathematical morphology, shape representation, homotopy, topology, contour coding, contour filling.
Citation:
Yassin M.Y. Hasan, Lina J. Karam, "Morphological Reversible Contour Representation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 3, pp. 227-240, March 2000, doi:10.1109/34.841755
Usage of this product signifies your acceptance of the Terms of Use.