Skip to Main Content
Article navigation

The paper deals with a heuristic approach to a Chinese‐writing character search. Due to the small masks of the Chinese words being used in the approach, the database of the masks are compressed. Heuristic information, which is the summation of the values of elements of the mask, has been used in the searching process. It simplifies the approach and accelerates the search. By means of a FFT or FWT (Walsh Transformation) algorithm, a word may be mapped into its image form, which is a two‐dimensional array in a frequency domain; then a small mask is extracted.

This content is only available via PDF.
You do not currently have access to this content.
Don't already have an account? Register

Purchased this content as a guest? Enter your email address to restore access.

Please enter valid email address.
Email address must be 94 characters or fewer.
Pay-Per-View Access
$41.00
Rental

or Create an Account

Close Modal
Close Modal

Gift article access

As a benefit of your subscription, you can share temporary access to restricted articles.

Each link will stop working after 30 days or 10 uses. You may create up to 10 links in a 30 day period.

Please sign in to your personal account to gift article access.

Register

Gift article access

As a benefit of your subscription, you can share temporary access to restricted articles.

Each link will stop working after 30 days or 10 uses. You may create up to 10 links in a 30 day period.

Gift articles remaining: --

Gift article access

Each link will stop working after 30 days or 10 uses. You may create up to 10 links in a 30 day period.

Gift articles remaining: --

Gift article access

As a benefit of your subscription, you can share temporary access to restricted articles.

Each link will stop working after 30 days or 10 uses.

You have reached the limit of 10 links within a 30 day period.