Real-time aspects of SOM-based visual surface inspection

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 4664, Issue , 2002, Pages 123-134

  Niskanen, Matti ^a   Kauppinen, Hannu ^a   Silvén, Olli ^a  

^a UNIVERSITY OF OULU   (Finland)

Author keywords

Code vector; Fast search speed; Lumber inspection; Nearest neighbor search; Vector quantization

Indexed keywords

COMPUTER CONTROL SYSTEMS; COMPUTER SOFTWARE; COMPUTER VISION; ERRORS; LUMBER; REAL TIME SYSTEMS; SELF ORGANIZING MAPS; SURFACE PROPERTIES; USER INTERFACES; VECTOR QUANTIZATION;

CODE VECTOR; FAST SEARCH SPEED; LUMBER INSPECTION; NEAREST NEIGHBOR SEARCH; REAL TIME ASPECTS; VISUAL SURFACE INSPECTION;

INSPECTION;

EID: 0036404059     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.460189     Document Type: Conference Paper

References (24)

1. M. Niskanen, O. Silvén, and H. Kauppinen, "Color and Texture Based Wood Inspection with Non-supervised Clustering", Proceedings of The 12th Scandinavian Conference on Image Analysis (SCIA2001), pp. 336-342, Bergen, 2001.
2. M. Niskanen, O. Silvén, and H. Kauppinen, "Experiments with SOM Based Inspection of Wood", International Conference on Quality Control by Artificial Vision (QCAV2001), 2, pp. 311-316, Le Creusot, 2001
3. H. Kauppinen, O. Silvén, and T. Piirainen, "Self-organizing map based user interface for visual surface inspection", 11th Scandinavian Conference on Image Analysis (SCIA'99), pp. 801-808, Kangerlussuaq, 1999.
4. T. Kohonen, Self-organizing maps. 426 p., Springer-Verlag, Berlin, 1997.
5. T. Ojala, M. Pietikäinen, and D. Harwood. "A comparative study of texture measures with classification based on feature distributions". Pattern Recognition 29, pp. 51-59, 1996.
6. E. S. H. Cheung and A. G. Constantinides, "Fast Nearest Neighbour Algorithms for self-Organising Map and Vector Quantisation", 27th Asilomar Conference on Signals, Systems and Computers, 2, pp. 946-950, Los Alamitos, 1993.
7. S. Kaski. "Fast Winner Search for SOM-Based Monitoring and Retrieval of High-Dimensional Data", 9th Conference on Artificial Neural Networks, 2, pp. 940-945, London, 1999.
8. E. Lopez-Gonzalo and L. A. Hernandez-Gomez. "Fast Vector Quantization Using Neural Maps for CELP at 2400 bps", 3rd European Conference on Speech Communication and Technology, 1, pp. 55-58, Berlin, 1993
9. M. -C. Su and H. -T. Chang. "Fast Self-Organizing Feature Map Algorithm", IEEE Transactions on Neural Networks 11(03), pp. 721-733, 2000.
10. C. -D. Bei and R. M. Gray, "An improvement of the minimum distortion encoding algorithm for vector quantization", IEEE Transactions on Communications 33(10), pp. 1132-1133, 1985.
11. C. M. Huang, Q. Bi, G. S. Stiles, and R. W. Harris, "Fast Full Search Equivalent Encoding Algorithms for Image Compression Using Vector Quantization", IEEE Transactions on Image Processing 1, pp. 413-416, 1992.
12. S. -W. Ra and J. K. Kim, "Fast weight-ordered search algorithm for image vector quantization", Electronics Letters 27(22), pp. 2081-2083, 1991.
13. S. C. Tai, C. C. Lai, and Y. C. Lin, "Two Fast Nearest Neighbor Searching Algorithms for Image Vector Quantization", IEEE Transactions on Communications 44, pp. 1623-1628, 1996.
14. P. Koikkalainen. "Fast Deterministic Self-Organizing Maps", International Conference on Artificial Neural Networks, pp. 63-68, Paris, 1995.
15. S. H. Huang and S. H. Chen, "Fast encoding algorithm for VQ-based image coding", Electronics Letters 26, pp. 1618-1619, 1990.
16. D. -Y. Cheng and A. Gersho. "A Fast Codebook Search Algorithm for Nearest-Neighbor Pattern Matching", International Conference on Acoustics, Speech, and Signal Processing, 1, pp. 265-268, Tokyo, 1986.
17. J. H. Friedman, J. L. Bentley, and R. A. Finkel. "An algorithm for finding best matches in logarithmic expected time", ACM Transactions on Mathematical Software 3(3), pp. 209-226, 1977.
18. N. Katayama and S. Satoh, "The SR-tree: an index structure for spatial searching", ACM SIGMOD International Conference on Management of data, pp. 369-380, Tucson, 1997.
19. S. Berchtold, D. Keim, and H. -P. Kriehel. "The X-tree: An index structure for high-dimensional data", International Conference on Very Large Databases (VLDB), Bombay, pp. 28-39, 1996.
20. R. Weber, H. -J. Schek, and S. Blott. "A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces", International Conference on Very Large Databases (VLDB), New York, 1998.
21. E. Kushilevitz, R. Ostrovsky, and Y. Rabani, "Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces", 30th ACM Symposium on Theory of Computing, Dallas, pp. 614-623, 1998.
22. P. Indyk and R. Motwani. "Approximate Nearest Neighbors: Towards removing the Curse of Dimensionality", 30th Annual ACM Symposium on Theory of Computing, Dallas, pp. 604-613, 1998.
23. J. Kleinberg. "Two Algorithms for Nearest-Neighbor Search in High Dimensions", 29th Annual ACM Symposium on Theory of Computing, pp. 599-608, El Paso, 1997.
24. J. Lampinen and E. Oja. "Fast Self-Organization by the probing algorithm", International Joint Conference on Neural Networks, 2, pp. 503-507, Washington DC, 1989.