Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Reduction of Image

IP.com Disclosure Number: IPCOM000043989D
Original Publication Date: 1984-Oct-01
Included in the Prior Art Database: 2005-Feb-05
Document File: 2 page(s) / 44K

Publishing Venue

IBM

Related People

Kitazawa, I: AUTHOR [+3]

Abstract

This article describes an algorithm for reducing the number of image pels (picture elements), in which image pels, to be picked up at every Nth pel position, are merged into one byte in any sequence, then the content of this byte is used as an offset address for accessing a table consisting of 256-byte entries each of which includes the reduced image pels arranged in the proper sequence. Steps 1, 2 and 3, shown in the figure, describe the algorithm. The exemplary reduction factor is 1/2. In step 1, pels in one pel line of the image are grouped into two pel groups. Each group includes 8 bits or 8 pels. Bit or pel positions of the first group are shown as 1, 2, 3, ---- 8, and bit positions of the second group are shown as a, b, c, ---- h. Alternate bit positions of the groups, 1, 3, 5, 7 and a, c, e, g, are extracted.

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 100% of the total text.

Page 1 of 2

Reduction of Image

This article describes an algorithm for reducing the number of image pels (picture elements), in which image pels, to be picked up at every Nth pel position, are merged into one byte in any sequence, then the content of this byte is used as an offset address for accessing a table consisting of 256-byte entries each of which includes the reduced image pels arranged in the proper sequence. Steps 1, 2 and 3, shown in the figure, describe the algorithm. The exemplary reduction factor is 1/2. In step 1, pels in one pel line of the image are grouped into two pel groups. Each group includes 8 bits or 8 pels. Bit or pel positions of the first group are shown as 1, 2, 3, ---- 8, and bit positions of the second group are shown as a, b, c, ---- h. Alternate bit positions of the groups, 1, 3, 5, 7 and a, c, e, g, are extracted. In step 2, the extracted bit pattern of the second group is one- bit shifted, and the shift pattern and the extracted first group are merged into 8 bits or 1 byte. In step 3, the byte is used as an address for accessing the table. The reassembled bit pattern "1357aceg" is fetched from the table, which is the reduced bit pattern of the first and second groups. It is noted that each bit position has "1" or "0" for representing the image, and the table stores the reassembled various bit patterns.

1

Page 2 of 2

2

[This page contains 3 pictures or other non-text objects]