Abstract
In this paper, we present a new fast architecture to compute the distance between cliques in different graphs. The distance obtained is used as a support function for graph labelling using probabilistic relaxation techniques. The architecture presented consists on a pipe-lined structure which computes the distance between an input clique and k reference cliques. The number of processing elements needed is m 2, and the number of cycles required to compute the distance is n i (being m the number of external nodes in the input clique, and n i the number of external nodes in the i-th reference clique). The processing elements are very simple basic cells and very simple communication between them is needed, which makes it suitable for VLSI implementation.
Chapter PDF
Keywords
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.
References
H. Bunke. “String Matching for Structural Pattern Recognition”. H.Bunke and A.Sanfeliu Eds, Syntactic and Structural Pattern Recognition. Theroy and Applications, pp.381–414, World Scientific, 1990.
H.D. Cheng, and K.S. Fu. “VLSI Architectures for String Matching and Pattern Matching”. Pattern Recognition, vol.20, n. 1, pp. 125–141. 1987.
J.Gregor, and M.G. Thomason. “Efficient Dynamic Programming Alignment of Cyclic Strings by Shift Elimination”. Pattern recognition, vol.29, n.7, pp. 1179–1185, 1996.
R.A. Hummel, and S.W. Zucker. “On the Foundations of Relaxation Labelling Processes”. IEEE Trans. Pattern Anal. Mach. Intell. Vo1.5, N.3, pp. 267–286. 1983.
J.Kittler, W.C.Christmas, M.Petrou. “Probabilistic Relaxation for Maching of Symbolic Structures”. Advances in structural and syntactic pattern recognition. Ed. by H. Bunke pp. 471–480.1995.
R.J. Lipton, and D. Lopresti. “A Systolic Array for Rapid String Comparison”. 1985 Chapel Hill Conf. on VLSI, H. Fuchs, de., Rockville, Md.: Computer Science Press, pp. 363–376. 1985.
D. Lopestri. “P-NAC: A Systolic array for comparing nucleic acid sequences”. Computer, vol.20, pp. 98–99. 1987.
M. Maes. “On a Cyclic String-to-String Correction Problem”. Information Proc. Letters, 35, pp.73–78. June 1990.
R.Sastry, N. Ranganathan, and K. Remedios. “CASM:: A VLSI Chip for Approximate String Matching”. IEEE Trans. Pattern Anal. Mach. Intell. Vol. 17, N.8, pp. 824–830. 1995.
F. Serratosa and A. Sanfeliu. “Function-Described Graphs Applied to 3D Object Representation”.Image Analysis and Processing, proc. 9th International Conference ICIAP, Florence, pp. 701–708,1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Climent, J., Grau, A., Aranda, J., Sanfeliu, A. (1998). Clique-to-clique distance computation using a specific architecture. In: Amin, A., Dori, D., Pudil, P., Freeman, H. (eds) Advances in Pattern Recognition. SSPR /SPR 1998. Lecture Notes in Computer Science, vol 1451. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0033260
Download citation
DOI: https://doi.org/10.1007/BFb0033260
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64858-1
Online ISBN: 978-3-540-68526-5
eBook Packages: Springer Book Archive