Browse Prior Art Database

CORRECTING LINE-GROWTH IN HIGHLIGHT COLOR COPIERS

IP.com Disclosure Number: IPCOM000026908D
Original Publication Date: 1994-Apr-30
Included in the Prior Art Database: 2004-Apr-07
Document File: 4 page(s) / 98K

Publishing Venue

Xerox Disclosure Journal

Abstract

Proposed is a method to compensate for the line growth in highlight color copiers. Compensation is accomplished in the bit stream. The compensation is utilized in a way that is independent of the document content. Thinning of the highlight color is done by using a 3 x 3 window, also referred to as a 3 line buffer, with a look-up table. The matrix illustrated in Figure 1 shows the nomenclature for the proposed method, where E represents the current point, A and C represent various points. B and D represent future points for processing. Using the nomenclature of Figure 1, the algorithm can be expressed as

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 58% of the total text.

Page 1 of 4

XEROX DISCLOSURE JOURNAL

CORRECTING LINE-GROWTH IN Proposed Classification HIGHLIGHT COLOR COPIERS U.S. C1.358/477
Reiner Eschbach Int. C1. H04n 01/24

FIG. 1

FIG. 2a

XEROX DISCLOSURE JOURNAL - Vol. 19, No. 2 MarcWApril 1994 181

[This page contains 1 picture or other non-text object]

Page 2 of 4

CORRECTING LINE-GROWTH IN HIGHLIGHT COLOR COPIERStCont'd)

A4 B-

C4

D-

Eout

A+l

182 XEROX DISCLOSURE JOURNAL - Vol. 19, No. 2 MarcWApril 1994

E

FIG. 2b

[This page contains 1 picture or other non-text object]

Page 3 of 4

CORRECTING LINE-GROWTH IN HIGHLIGHT COLOR COPIE RS(Cont'd)

Proposed is a method to compensate for the line growth in highlight color copiers. Compensation is accomplished in the bit stream. The compensation is utilized in a way that is independent of the document content. Thinning of the highlight color is done by using a 3 x 3 window, also referred to as a 3 line buffer, with a look-up table. The matrix illustrated in Figure 1 shows the nomenclature for the proposed method, where E represents the current point, A and C represent various points. B and D represent future points for processing. Using the nomenclature of Figure 1, the algorithm can be expressed as

Eout = E&&(!A 11 B)&&(!C 11 D)

where:

&& denotes a logical AND operation 11 denotes a logical OR operation and,

! denotes a logical NOT operation.

The algorithm is conceptually designed as a form of constrained erosion, wherein a three bit structure is reduced to two bits, a two bit structure is reduc...