Industrial Technology Research Institute

Other

Ju-Wei Chen

Tse Cheng

Shu-Cheng Huang

Suh-Yin Lee

Jen-Shun Yang

Kai-Hsiang Chou

Li-Der Chou

Jui-Ming Chen

The invention relates to building spherical panoramas for image-based virtual reality systems. The image-based spherical panoramas can be navigated in any desired view direction (360-degrees) by suitable three-dimensional image browsers or viewers. The method and system also includes computing the number of photographs required to be taken and the azimuth angle of the center point of each photograph for building a spherical environment map representative of the spherical panorama. The method and system also includes an algorithm for computing the accurate azimuth angles of these taken photographs and seaming them together to build the spherical environment map.

Image-based method and system for building spherical panoramas

The present invention provides a method and system for selecting an access network in a heterogeneous network environment. The method records user configuration information in a mobile device and applies the mobile device to first collect and record current status information of each access network, then determines a network stability coefficient for each access network based on both the user configuration information and the current status information, and finally selects an access network with a maximum network stability coefficient to thus establish a connection with the access network selected.

Method and system for selecting an access network in a heterogeneous network environment

A hierarchical database system for on-line Chinese character recognition is disclosed. The hierarchical database system comprises: (1) the database of character description; (b) the database of stroke correspondence rules of components; (3) the database of character structures; (4) the database of standard component patterns; and (5) the database of spatial relationships between strokes of components. The database of character description stores the rule code(s) of the constituent component(s) and the character structure for all the characters included in the vocabulary. The database of stroke correspondence rules of components stores stroke correspondence rules for all the components denoted by the above mentioned rule codes. The database of character structure stores the synthesis rules of character patterns, the decomposition rules of character structures, and the spatial relationships between components, for all the 208 character structures utilized in a preferred embodiment. The database of standard component patterns stores the coordinates of extreme points of line segments constituting the standard patterns of components. And the database of spatial relationships between strokes of components stores the spatial relationships between strokes of each component. When an input script is matched against a template character, the input script is decomposed into constituent component(s) according to the decomposition rule of that character described as a rule code (stored in the database of character description). Then, the stroke correspondence rules are retrieved from the database of stroke correspondence rules of components via the rule code(s) of that template character. After the matching is completed at the stroke level, the character distance is computed using the database of spatial relationships between strokes of components and the character pattern, which can be synthesized using the database of standard component patterns and the database of character structures. The present invention also discloses a method of finding the best decomposition rule of components for each character, by which various 'geometric features' of strokes and possible decomposition sequences are taken into consideration to thereby derive the best rule for each character for minimizing the number of erroneously decomposed strokes.

Hierarchical representation of reference database for an on-line Chinese

A stroke-order-free and stroke-number-free method for the on-line recognition of Chinese characters comprising the steps of: (a) inputting a handwritten input script on an on-line basis, (b) preprocessing the input script to reduce a number of possible matching template characters; (c) performing basic stroke recognition using a database of basic strokes to identify all possible basic strokes contained in the handwritten input script; (d) performing stroke correspondence using a database of stroke correspondence rules to find matching strokes in template characters for the strokes contained in the handwritten input script; and (e) performing computation of discrimination functions using a database of character patterns and a database of spatial relationships between strokes of characters to find one or more template characters with minimum error. Some of the key features of the method include: (a) the strokes recognized during the stroke correspondence are expanded to include fore strokes, back strokes, and points, in which the fore strokes are strokes that actually appear in a character, the back strokes are fictitious strokes provided to allow for stroke connections that should not appear, and the points are provided to allow for truncated back strokes in the input script; and (b) each stroke correspondence rule contains a specific set of stroke information including (i) allowed stroke types, (ii) at least one geometric feature measure, and (iii) criterion for applying the geometric feature measure; the geometric feature measure is a geometrically related characteristic measure, which can be x or y coordinates, length, or distance, associated with a particular stroke, to facilitate stroke recognition. In a preferred embodiment, eight types of stroke correspondences are allowed:(a) fore.fwdarw.fore, (2) back.fwdarw.back, (3) back.fwdarw.fore, (4) back.fwdarw.point, (5) back.fwdarw.null, (6) null.fwdarw.back, (7) fore.fwdarw.null, and (8) null.fwdarw.fore.

Growing community of inventors

Hsinchu, Taiwan

Ju-Wei Chen