Loading…
Adaptive sorting by prototype populations
An algorithm for unsupervised adaptive sorting is presented, based on a finite number of ‘prototype populations’, with distinctly different feature distributions, each representing a typically different source population of the inspected products. Updated feature distributions, of samples collected...
Saved in:
Published in: | Pattern recognition letters 1994-02, Vol.15 (2), p.111-123 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | An algorithm for unsupervised adaptive sorting is presented, based on a finite number of ‘prototype populations’, with distinctly different feature distributions, each representing a typically different source population of the inspected products. Updated feature distributions, of samples collected from the currently sorted products, are compared to the distributions of the stored prototype populations, and accordingly the system switches to the most appropriate classifier. Although the goal is similar to the objectives of previously proposed ‘Decision Directed’ adaptive classification algorithms, the present algorithm is particularly suitable for automatic inspection and classification on a production line, when the inspected items may come from different sources. The practical feasibility of the approach is demonstrated by two synthetic examples, using Bayes classifiers. This is followed by an applied example, wherein two prototype populations of apples are sorted by size, derived by machine vision. It is shown that misclassification by adaptive classification is reduced, in comparison to non-adaptive classification. |
---|---|
ISSN: | 0167-8655 1872-7344 |
DOI: | 10.1016/0167-8655(94)90040-X |