Use of random graph parsing for scene labelling by probabilistic relaxation

Pattern Recognition Letters

Volumn 20, Issue 9, 1999, Pages 949-956

  Skomorowski, Marek ^a  

^a JAGIELLONIAN UNIVERSITY   (Poland)

Author keywords

Graph distance; Parsing for graph grammars; Random graphs; Scene labelling

Indexed keywords

COMPUTATIONAL GRAMMARS; GRAPH THEORY; MATHEMATICAL MODELS; RANDOM PROCESSES;

RANDOM GRAPHS; SCENE LABELLING;

PATTERN RECOGNITION;

EID: 0032594804     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(99)00062-8     Document Type: Article

References (15)

1. Flasiński M. Parsing of edNLC-graph grammars for scene analysis. Pattern Recognition. 21:1988;623-629.
2. Flasiński M. On the parsing of deterministic graph languages for syntactic pattern recognition. Pattern Recognition. 26:1993;1-16.
3. Flasiński M., Skomorowski M. Parsing of random graph languages for automated inspection in statistical-based quality assurance systems. Machine GRAPHICS & VISION. 7:1998;565-623.
4. Hsiao, J.Y., Sawchuck, A., 1989. Supervised textured image segmentation using feature smoothing and probabilistic relaxation techniques. IEEE Trans. Syst. Man Cybern. SMC-11, 1279-1292.
5. Hummel R., Zucker S. On the foundations of relaxation labelling processes. IEEE Trans. Pattern Anal. Machine Intell. PAMI-5:1983;267-287.
6. Janssens D., Rozenberg G., Verraedt R. On sequential and parallel node-rewriting graph grammars. Computer Graphics and Image Processing. 18:1982;279-304.
7. Niemann, H., 1990. Pattern Analysis and Understanding. Springer, Berlin.
8. Parent P., Zucker S.W. Radial projection: an efficient update rule for relaxation labeling. IEEE Trans. Pattern Anal. Machine Intell. PAMI-11:1989;886-889.
9. Peleg S., Rosenfeld A. Determining compatibility coefficients for curve enhancement relaxation processes. IEEE Trans. Syst. Man Cybern. SMC-8:1978;548-555.
10. Rosenfeld A., Hummel R., Zucker S. Scene labeling by relaxation operations. IEEE Trans. Syst. Man Cybern. SMC-6:1976;420-433.
11. Skomorowski M. On the parsing of random graphs for syntactic pattern recognition. Machine GRAPHICS & VISION. 5:1996;433-464.
12. Wong A.K.C., Ghahraman D.E. Random graphs: structural-contextual dichotomy. IEEE Trans. Pattern Anal. Machine Intell. PAMI-2:1980;341-348.
13. Wong A.K.C., You M.L. Entropy and distance of random graphs with application to structural pattern recognition. IEEE Trans. Pattern Anal. Machine Intell. PAMI-7:1985;599-609.
14. Wong, A.K.C., Constant, J., You, M.L., 1990. Random graphs. In: Bunke, H., Sanfeliu, A. (Eds.), Syntactic and Structural Pattern Recognition Theory and Applications. World Scientific Publishing Co., Singapore, pp. 197-234.
15. Zucker S., Krishnamurthy E., Haar R. Relaxation processes for scene labeling: convergence, speed, and stability. IEEE Trans. Syst. Man Cybern. SMC-8:1978;41-48.