Pattern Recognition Using Neighborhood Coding

  • I. R. Tsang
  • I. J. Tsang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4141)


We propose a new coding algorithm for binary images based on neighborhood relations. The shape is transformed into a set of representative vectors (position invariant) by coding each pixel according to the number of neighbors in the four directions (north, east, south, west). These neighborhood vectors are transformed into a set of codes satisfying the boundary condition imposed by the size of the image in which the shape is imbedded. A label is attached to the codes to indicate a sequential order of the pixels. The combined code and label characterize an exact shape. Thus following the label ordering and performing simple comparison of the codes an exact shape match is obtained. It is interesting to note that each shape will represent a polyomino. Neighborhood image operators are developed by applying mathematical and logical operations on the code vectors. A code reduction scheme for the purpose of information reduction and generalization of the shape image is proposed. Using the digits 1 and 0 of the NIST handwritten segmented characters set, we show a preliminary application for pattern recognition.


Neighborhood Relation Exact Shape Connected Component Analysis Shape Image Morphological Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Pavlidis, T.: Survey a Review of Algorithms for Shape Analysis. Computer Graphics and Image Processing 7(9), 243–258 (1978)CrossRefGoogle Scholar
  2. 2.
    Sinha, D., Giardina, C.R.: Discrete Black and White Object Recognition via Morphological Functions. IEEE Transactions on PAMI 12(3), 275–293 (1990)Google Scholar
  3. 3.
    Chuang, J.H.: A Potential-Based Approach for Shape Matching and Recognition. Pattern Recognition 29(3), 463–470 (1996)CrossRefGoogle Scholar
  4. 4.
    Kupeev, K.Y., Wolfson, H.J.: A New Method of Estimating Shape Similarity. Pattern Recognition Letter 17, 873–887 (1996)CrossRefGoogle Scholar
  5. 5.
    Haralick, R.M., Shapiro, L.G.: Computer and Robot Vision. Addison-Wesley, Reading (1992)Google Scholar
  6. 6.
    Hoshen, J., Kopelman, R.: Percolation and Cluster Distribution. I. Cluster Multiple Labeling Technique and Critical Concentration Algorithm. Phys. Rev. B 14(8), 3438–3445 (1976)Google Scholar
  7. 7.
    Golomb, S.W.: Polyominoes: Puzzles, Patterns, Problems, and Packings. Princeton University Press, Princeton (1994)MATHGoogle Scholar
  8. 8.
    Garris, M.D., Wilkinson, R.A.: Handwritten Segmented Characters Database, NIST special database 3, NIST Technical Report and CDROM (February 1992)Google Scholar
  9. 9.
    Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical recipes in C. Cambridge University Press, Cambridge (1992)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • I. R. Tsang
    • 1
  • I. J. Tsang
    • 2
  1. 1.Center for InformaticsFederal University of Pernambuco (UFPE)Recife PEBrazil
  2. 2.Alcatel Bell N.V.Research & InnovationAntwerpenBelgium

Personalised recommendations