m (Scipediacontent moved page Draft Content 115398534 to Ravi et al 2009a) |
|||
| Line 3: | Line 3: | ||
The proposed paper describes a compression test analysis of JBIG standard algorithm. The aim of such work is to proof the effectiveness of this standard for images acquired through scanners and processed into a printer pipeline. The main issue of printer pipelines is the necessity to use a memory buffer to store scanned images for multiple prints. This work demonstrates that for very large scales the buffer can be fixed using medium compression case, using multiple scans in case of uncommon random patterns. | The proposed paper describes a compression test analysis of JBIG standard algorithm. The aim of such work is to proof the effectiveness of this standard for images acquired through scanners and processed into a printer pipeline. The main issue of printer pipelines is the necessity to use a memory buffer to store scanned images for multiple prints. This work demonstrates that for very large scales the buffer can be fixed using medium compression case, using multiple scans in case of uncommon random patterns. | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| Line 15: | Line 10: | ||
* [https://link.springer.com/content/pdf/10.1007%2F978-3-642-03265-3_19.pdf https://link.springer.com/content/pdf/10.1007%2F978-3-642-03265-3_19.pdf] | * [https://link.springer.com/content/pdf/10.1007%2F978-3-642-03265-3_19.pdf https://link.springer.com/content/pdf/10.1007%2F978-3-642-03265-3_19.pdf] | ||
| + | |||
| + | * [http://link.springer.com/content/pdf/10.1007/978-3-642-03265-3_19 http://link.springer.com/content/pdf/10.1007/978-3-642-03265-3_19], | ||
| + | : [http://dx.doi.org/10.1007/978-3-642-03265-3_19 http://dx.doi.org/10.1007/978-3-642-03265-3_19] under the license http://www.springer.com/tdm | ||
| + | |||
| + | * [https://link.springer.com/chapter/10.1007/978-3-642-03265-3_19 https://link.springer.com/chapter/10.1007/978-3-642-03265-3_19], | ||
| + | : [https://www.scipedia.com/public/Ravi_et_al_2009a https://www.scipedia.com/public/Ravi_et_al_2009a], | ||
| + | : [https://rd.springer.com/chapter/10.1007%2F978-3-642-03265-3_19 https://rd.springer.com/chapter/10.1007%2F978-3-642-03265-3_19], | ||
| + | : [https://academic.microsoft.com/#/detail/1875948651 https://academic.microsoft.com/#/detail/1875948651] | ||
Latest revision as of 15:59, 21 January 2021
Abstract
The proposed paper describes a compression test analysis of JBIG standard algorithm. The aim of such work is to proof the effectiveness of this standard for images acquired through scanners and processed into a printer pipeline. The main issue of printer pipelines is the necessity to use a memory buffer to store scanned images for multiple prints. This work demonstrates that for very large scales the buffer can be fixed using medium compression case, using multiple scans in case of uncommon random patterns.
Original document
The different versions of the original document can be found in:
- http://dx.doi.org/10.1007/978-3-642-03265-3_19 under the license http://www.springer.com/tdm
Back to Top
Document information
Published on 01/01/2009
Volume 2009, 2009
DOI: 10.1007/978-3-642-03265-3_19
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?