The paper presents an algorithm JCURVE for compression of binary images with linear or curvilinear features, which is a kind of generalization of the JBEAM coder. The proposed algorithm is based on second order beamlet representation, where second order beamlets are defined as hierarchically organized segments of conic curves. The algorithm can compress images in both a lossy and losless way, and it is also progressive. The experiments performed on benchmark images have shown that the proposed algorithm significantly outperforms the known JBIG2 standard and the base JBEAM algorithm both in losless and lossy compression. It is characterized, additionally, by the same time complexity as JBEAM, namely O(N² log₂ N) for image of size N × N pixels.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.