(Cat? OR feline) AND NOT dog?
Cat? W/5 behavior
(Cat? OR feline) AND traits
Cat AND charact*

This guide provides a more detailed description of the syntax that is supported along with examples.

This search box also supports the look-up of an IP.com Digital Signature (also referred to as Fingerprint); enter the 72-, 48-, or 32-character code to retrieve details of the associated file or submission.

Concept Search - What can I type?

For a concept search, you can enter phrases, sentences, or full paragraphs in English. For example, copy and paste the abstract of a patent application or paragraphs from an article.

Concept search eliminates the need for complex Boolean syntax to inform retrieval. Our Semantic Gist engine uses advanced cognitive semantic analysis to extract the meaning of data. This reduces the chances of missing valuable information, that may result from traditional keyword searching.

Optimized Point Selection Process

Publishing Venue

IBM

Related People

Boorom, KF: AUTHOR

Abstract

This invention relates to a method for obtaining a discrete, best-fit continuum color space using a two-pass process for ascertaining the closest one of a set of spatially distributed points to an arbitrary point. The coordinates of each point in the set and the arbitrary point are known a priori. The two-pass process permits (a) the sorting of points (coarse stage), and (b) executing a fast path to the minimal distance point (fine stage).

Country

United States

Language

English (United States)

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

Page 1 of 3

Optimized Point Selection Process

This invention relates to a method for obtaining a discrete, best-fit continuum
color space using a two-pass process for ascertaining the closest one of a set of
spatially distributed points to an arbitrary point. The coordinates of each point in
the set and the arbitrary point are known a priori. The two-pass process permits (a) the sorting of points (coarse stage), and (b) executing a fast path to the
minimal distance point (fine stage).

In the coarse stage, the method attempts to select a predetermined point
from the set of otherwise static points which is close to the arbitrary or objective
point. In the fine stage, the method uses this selected point to determine the
ultimate point closest to the arbitrary or objective point.

Given a point P, any other point not at point P can be said to be in a quadrant
relative to point P. Graphically, this can be represented as follows:

(Image Omitted)

The numbering of the quadrants is the same as the numbering convention
used in most mathematics texts.

Here, A and F are first quadrant points of P, B and E are second quadrant
points of P, C is a third quadrant point of P, and D is a fourth quadrant point of P.
Points are arbitrarily assigned on the coordinate axis to the quadrant immediately
counterclockwise, so G is a first quadrant point of P.

Initialization: In the initialization stage, the routine examines each "static
point" and searches for four other static points, one in each quadrant relative to
the original static point, which are closest to the original static point. Thus, for a
static point SP', the routine determines which other static point in the first
quadrant relative to SP' is closest to SP'. It performs a similar operation for the
three other quadrants.

The Coarse Stage: In the coarse stage, the routine attempts to
locate a point near the "objective point". It does this with the
following logic:
(1) Assume that all static points have not yet been