Color scene matching

Proceedings of the 27th Southeastern Symposium on System Theory, SSST 1995

Volumn , Issue , 1995, Pages 284-288

  Celenk, Mehmet ^a  

^a OHIO UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COLOR; GRAPH THEORY; IMAGE PROCESSING; SYSTEM THEORY; TEXTURES;

ADJACENCY GRAPHS; ADJACENCY RELATIONS; DISTANCE MEASURE; GRAPH-THEORETIC METHODS; IRREGULAR TEXTURES; OUTDOOR SCENES; RELATIONAL GRAPH; SCENE MATCHING;

COLOR MATCHING;

EID: 0010054012     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SSST.1995.390568     Document Type: Conference Paper

References (7)

1. R.J. Schalkoff, Diaital Imase Processins and Computer Vision, John Wiley, 1989.
2. R.M. Haralick and L.G. Shapiro, Computer and Robot Vision, Vol. 11, Addison Wesley, 1993.
3. A. Rosenfeld, R.A. Hummel, and S.W. Zucker, "Scene labeling by relaxation operations, IEEE Trans. on SMC, Vol. SMC-6, No. 6, pp. 420-433, June 1976.
4. R.A. Hummel, and S.W. Zucker, 'Ion the foundations of relaxation labeling processesIvt IEEE Trans. on PAMI, Vol. PAMI-5, No. 3, pp. 267-287, May 1983.
5. T.C. Henderson, "A note on discrete relaxation,I) CVGIP 28, pp. 384-388, 1984.
6. M. Celenk, "A color clustering technique for image segmentation,ll CVGIP 52, pp. 145-170, 1990.
7. M. Celenk, "Color scene representation for model-based matching," Proc. SPIE, Vol. 2353, pp. 537-548, 1994.