Improving the Clustering Performance of the Scanning n-Tuple Method by Using Self-Supervised Algorithms to Introduce Subclasses
Issue No. 06 - June (2002 vol. 24)
<p>In this paper, the scanning n-tuple technique (as introduced by Lucas and Amiri) is studied in pattern recognition tasks, with emphasis placed on methods that improve its recognition performance. We remove potential edge effect problems and optimize the parameters of the scanning n-tuple method with respect to memory requirements, processing speed, and recognition accuracy for a case study task. Next, we report an investigation of self-supervised algorithms designed to improve the performance of the scanning n-tuple method by focusing on the characteristics of the pattern space. The most promising algorithm is studied in detail to determine its performance improvement and the consequential increase in the memory requirements. Experimental results using both small-scale and real-world tasks indicate that this algorithm results in an improvement of the scanning n-tuple classification performance.</p>
n-tuple pattern recognition method, scanning n-tuple, chain-coding, handwritten character recognition.
George Tambouratzis, "Improving the Clustering Performance of the Scanning n-Tuple Method by Using Self-Supervised Algorithms to Introduce Subclasses", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 24, no. , pp. 722-733, June 2002, doi:10.1109/TPAMI.2002.1008380