TY - GEN
T1 - Successive refinement for pattern recognition
AU - O'Sullivan, Joseph A.
AU - Singla, Naveen
AU - Westover, M. Brandon
PY - 2006
Y1 - 2006
N2 - In this paper we examine the achievable rate region for the problem of successive refinement of information for pattern recognition systems. The pattern recognition system has two stages, going from coarse to fine recognition as more resources become available for storing internal representations of the patterns. We present an inner and an outer bound on the true achievable rate region. Using these results we derive conditions under which a pattern recognition system is successively refinable. These conditions are similar to the Markov condition for successive refinement in the rate-distortion problem.
AB - In this paper we examine the achievable rate region for the problem of successive refinement of information for pattern recognition systems. The pattern recognition system has two stages, going from coarse to fine recognition as more resources become available for storing internal representations of the patterns. We present an inner and an outer bound on the true achievable rate region. Using these results we derive conditions under which a pattern recognition system is successively refinable. These conditions are similar to the Markov condition for successive refinement in the rate-distortion problem.
UR - https://www.scopus.com/pages/publications/33751045614
M3 - Conference contribution
AN - SCOPUS:33751045614
SN - 142440035X
SN - 9781424400355
T3 - 2006 IEEE Information Theory Workshop, ITW 2006
SP - 141
EP - 145
BT - 2006 IEEE Information Theory Workshop, ITW 2006
T2 - 2006 IEEE Information Theory Workshop, ITW 2006
Y2 - 13 March 2006 through 17 March 2006
ER -