By Topic

Binary PACT

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
H. Yoshii ; Canon Inc., Kawasaki, Japan

The pyramid architecture classification tree (PACT) is a novel pattern recognition algorithm which has good capabilities. PACT is a kind of decision tree classifier, though the algorithm is motivated from quite different backgrounds from conventional pattern recognition algorithms. Moreover, PACT motivates us to propose a new hypothesis “a decision region in the feature space having fractal characteristics”. A theoretical model of PACT, a random cantor set problem, is proposed, and using the problem we argue that the hypothesis requires “iterative feature extraction”, which is the key point of PACT and what the conventional pattern recognition algorithms lack. A binary PACT is proposed for an implicit evidence of the hypothesis

Published in:

Pattern Recognition, 1996., Proceedings of the 13th International Conference on  (Volume:4 )

Date of Conference:

25-29 Aug 1996