作者: Wilfried Philips
关键词:
摘要: Segmented image coding segments an into non-rectangular regions and approximates the texture in each region by a weighted sum of orthonormal base functions. These functions, which are region-specific, used to be generated Gram-Schmidt (GS) algorithm, is unfortunately very time-consuming. This paper presents polynomial recursive orthogonalization (PRO) algorithm generates same functions as GS, but faster than GS because it based on recurrence has fewer terms corresponding equation. The theoretical experimental results show that PRO two three times practice (depending number computed functions).