Lossless coding method for black-ink signals of high-quality printing images

1998 ◽  
Author(s):  
Shigeo Kato ◽  
Muling Guo ◽  
Madoka Hasegawa
2019 ◽  
Vol 6 (1) ◽  
pp. 181074 ◽  
Author(s):  
Dongsheng Zhou ◽  
Ruyi Wang ◽  
Xin Yang ◽  
Qiang Zhang ◽  
Xiaopeng Wei

Depth image super-resolution (SR) is a technique that uses signal processing technology to enhance the resolution of a low-resolution (LR) depth image. Generally, external database or high-resolution (HR) images are needed to acquire prior information for SR reconstruction. To overcome the limitations, a depth image SR method without reference to any external images is proposed. In this paper, a high-quality edge map is first constructed using a sparse coding method, which uses a dictionary learned from the original images at different scales. Then, the high-quality edge map is used to guide the interpolation for depth images by a modified joint trilateral filter. During the interpolation, some information of gradient and structural similarity (SSIM) are added to preserve the detailed information and suppress the noise. The proposed method can not only preserve the sharpness of image edge, but also avoid the dependence on database. Experimental results show that the proposed method is superior to some state-of-the-art depth image SR methods.


Author(s):  
Xiaoyi He ◽  
Mingzhou Liu ◽  
Weiyao Lin ◽  
Xintong Han ◽  
Yanmin Zhu ◽  
...  

Entropy ◽  
2020 ◽  
Vol 22 (9) ◽  
pp. 919
Author(s):  
Grzegorz Ulacha ◽  
Ryszard Stasiński ◽  
Cezary Wernik

In this paper, the most efficient (from data compaction point of view) and current image lossless coding method is presented. Being computationally complex, the algorithm is still more time efficient than its main competitors. The presented cascaded method is based on the Weighted Least Square (WLS) technique, with many improvements introduced, e.g., its main stage is followed by a two-step NLMS predictor ended with Context-Dependent Constant Component Removing. The prediction error is coded by a highly efficient binary context arithmetic coder. The performance of the new algorithm is compared to that of other coders for a set of widely used benchmark images.


2013 ◽  
Vol 333-335 ◽  
pp. 718-722
Author(s):  
Xing Ke Liu ◽  
Ke Chen ◽  
Bin Li

Huffman coding is a statistical lossless coding method with high efficiency. The principal and implementation of Huffman coding is discussed and Huffman coding is implemented to the compression of vector maps. The property of the algorithm is discussed. Experiments demonstrated that the algorithm proposed can compress vector maps with high efficiency and no loss.


Sign in / Sign up

Export Citation Format

Share Document