Ravi et al 2009a - Revision history

Scipediacontent at 13:59, 21 January 2021

2021-01-21T13:59:19Z

Scipediacontent: Scipediacontent moved page Draft Content 115398534 to Ravi et al 2009a

2020-10-14T12:10:30Z

Scipediacontent moved page Draft Content 115398534 to Ravi et al 2009a

Scipediacontent: Created page with " == 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 i..."

2020-10-14T12:10:28Z

Created page with " == 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 i..."

New page

== 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.

Document type: Part of book or chapter of book

== Full document ==
<pdf>Media:Draft_Content_115398534-beopen479-8088-document.pdf</pdf>

== Original document ==

The different versions of the original document can be found in:

* [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]

← Older revision		Revision as of 13:59, 21 January 2021
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.
−
−	~~Document type: Part of book or chapter of book~~
−
−	~~== Full document ==~~
−	~~<pdf>Media:Draft_Content_115398534-beopen479-8088-document.pdf</pdf>~~


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]

← Older revision	Revision as of 12:10, 14 October 2020
(No difference)