로그인시 본인확인과정이 필요할 수 있습니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
DataON 바로가기
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
Edison 바로가기
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
Kafe 바로가기
| 국가/구분 | United States(US) Patent 등록 |
|---|---|
| 국제특허분류(IPC7판) |
|
| 출원번호 | US-0560658 (1990-07-31) |
| 발명자 / 주소 |
|
| 출원인 / 주소 |
|
| 인용정보 | 피인용 횟수 : 347 인용 특허 : 0 |
Weighted and unweighted convolution filtering processes are provided for decoding bitmap image space representations of self-clocking glyph shape codes and for tracking the number and locations of the ambiquities or “errors”that are encountered during the decoding. This error detection may be linked
Weighted and unweighted convolution filtering processes are provided for decoding bitmap image space representations of self-clocking glyph shape codes and for tracking the number and locations of the ambiquities or “errors”that are encountered during the decoding. This error detection may be linked to or compared against the error statistics from an alternative decoding process, such as the binary image processing techniques that are described herein to increase the reliability of the decoding that is obtained.
A process for decoding a spatially periodic bitmap image space representation of a self-clocking glyph shape code of unknown spatial periodicity; said code being composed of glyphs having shapes that encode digital data values, such that each distinct data value that is encoded by said code is repre
A process for decoding a spatially periodic bitmap image space representation of a self-clocking glyph shape code of unknown spatial periodicity; said code being composed of glyphs having shapes that encode digital data values, such that each distinct data value that is encoded by said code is represented by the shape of a respective glyph; said glyphs being selected from a set of n permissible glyph shapes, with each said glyph shapes being preassigned to the encoding of a predetermined digital data value; said glyphs being spatially distributed in said bitmap image space in substantial accordance with a spatial formatting rule; said process comprising the steps of analyzing said bitmap image space representation of said code for determining its spatial periodicity along an X axis and an Y axis; scaling said spatial formatting rule to match the determined spatial periodicity of said glyph code; filtering said bitmap image space representation of said code with at least n discrimination filters, each of said discrimination filters being selected to match a respective one of said permissible glyph shapes, thereby providing at least n filtered versions of said bitmap image space representation; evaluating said filtered version, glyph-by-glyph in accordance with said scaled spatial formatting rule for determining a filtered value for each glyph as filtered by each filter; comparing the filtered values for each of said glyphs for classifying said glyphs by their shapes; and assigning decoded data values to said shape classified glyphs in accordance with the data values preassigned to said glyph shapes.
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.