论文信息 - Oyster hinge line detection using image processing

Oyster hinge line detection using image processing

Abstract A program to process oyster hinge-end images and extract object features was developed using the IBM PC. A two-level minimum distance classifier was trained and applied to recognize an oyster hinge line using the extracted features. The average error rate was 3.2% of the 513 oyster samples classified. Results will be used in an automated oyster shucking system.

Fredrick W. Wheaton | S. S. Chen | F. Wheaton | S. S. Chen

[1] R. R. Wolfe,et al. An Algorithm for Stem Detection Using Digital Image Analysis , 1985 .

[2] T. Pavlidis. Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.

[3] Mike James,et al. Classification Algorithms , 1986, Encyclopedia of Machine Learning and Data Mining.

[4] Ming-Kuei Hu,et al. Visual pattern recognition by moment invariants , 1962, IRE Trans. Inf. Theory.

[5] Jayaram K. Udupa,et al. Some new concepts for encoding line patterns , 1975, Pattern Recognit..

[6] Sarah J. Roberts,et al. Algorithm AS 199: A Branch and Bound Algorithm for Determining the Optimal Feature Subset of Given Size , 1984 .

[7] Herbert Freeman,et al. Computer Processing of Line-Drawing Images , 1974, CSUR.

[8] E. R. Davies,et al. Thinning algorithms: A critique and a new methodology , 1981, Pattern Recognit..

[9] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[10] M. J. McDonnell,et al. Box-filtering techniques , 1981 .

[11] John F. O'Callaghan,et al. Quantitative measurement of soil cracking patterns , 1973, Pattern Recognit..

[12] Worthie Doyle,et al. Operations Useful for Similarity-Invariant Pattern Recognition , 1962, JACM.

[13] Keinosuke Fukunaga,et al. A Branch and Bound Algorithm for Feature Subset Selection , 1977, IEEE Transactions on Computers.