Hitachi, Ltd.

Hitachi Seiko, Ltd.

Hitachi Software Engineering Company, Ltd.

Shigeru Kakumoto

Kazuaki Iwamura

Shigeru Shimada

Toshihiro Hananoi

Yoshiji Fujimoto

Yasunori Emura

Tomoko Hatakeyama

Yukio Ogawa

Kazuo Watanabe

Shinji Okazaki

Takehiro Fujita

Masakazu Ejiri

Osamu Abe

Kunihiro Okada

Yuji Toda

Takatoshi Kodaira

Shunichi Yajima

Yasuei Nomoto

Toshiyuki Yoshimura

Fumitaka Otsu

Masayasu Kato

Hidenori Inouchi

Hirohide Endou

Tetsuo Kurisu

Tatsuo Sumi

Rita M Harder

A map editing device capable of easily supplementing insufficient information and easily re-measuring an object that has changed. An image, a perspective projection map, a projection center and a projection angle are displayed in superposition. When a user manually changes the projection center and the projection angle, a perspective projection map after this change is generated and displayed. When a perspective projection map capable of obtaining insufficient information is determined, an imaging condition capable of obtaining the insufficient information can be determined based on the projection center and the projection angle at that time. The insufficient information can be easily supplemented if the arrangement is so made as to acquire images conforming with the imaging condition. The condition necessary for re-measurement can be determined.

Map editing device for assisting updating of a three-dimensional digital

An information processing apparatus and a method being performed in the information processing apparatus which includes an input device, an output device, a memory having stored therein geographic information of a region including positional information of existing facilities in the region and positional information of users of the facilities and an information processing device for processing the geographic and positional information. The information processing device performs various processing steps using the geographic information to locate the facilities in the region such that the access times required by the users to access the facilities are within a permissible range.

Method for facility location

In a digital cartographic system for processing geographic information, a map projection of a map is converted. The map projection transformation is carried out with a coordinate value in which longitude and latitude are set to a center by way of a linear interpolation so as to simplify a calculation required for transforming the map projection, and also not depending upon a map projection to be converted. Also, after the transformation process operation, a reference line such as longitude/latitude and an equiangular line is superposition-displayed/overlapping-displayed in order to assist an analysis, in response to a demand. In accordance with the present invention, a map can be shown with correctness of a distance and correctness of azimuth by performing various sorts of map-projection transformation, the digital cartographic system can support an intuitive idea of a user, and also can improve an information representation function of this digital cartographic system.

Digital cartographic system for geographical information processing

A high density storage medium which stores predetermined information by matching it on one-to-one basis with multiple levels of depth or height formed in predetermined plural areas of substrate surface, a storing method, a reading method and various systems using them have been disclosed.

High density storage of information on a substrate with multiple depth

In correspondence with the graphic data having a spatial extent, there is the address data table configured of arrays, the dimension of which are not smaller in number than the dimensions of the extent of the graphic data. Coordinate transformation is performed between the graphic data and the address data table, whereby any desired point on each figure can be brought into correspondence with one array number of the address data table. Those memory addresses of a graphic data table at which the individual graphic data items are sorted, are subsequently stored in the address data table. In case of searching for graphic data located at any desired position, the corresponding array number of the address data table is obtained on the basis of the position, whereupon the desired figure can be searched for through that memory address to the graphic data which is stored. In a case where the memory space of the address data table corresponding to any desired one of cells (each of which is a subspace of a graphic space) is full, relevant information of indirectly utilizing a memory space assigned to another of the cells is substitutionally stored in the address data table, conjointly with the memory address of the graphic data table storing the corresponding graphic data so that the address data table can be used efficiently. When the figure discriminators of the graphic data are stored in the address data, lines or points, the relevant attribute information items, or the like can be extracted selectively and efficiently by deciding the figure discriminators on the searching operation.

Graphic data searching and storage method

A figure retrieval method for storing memory addresses for figure data in an address data table which corresponds to positional coordinates of a multi-dimensional array. When retrieving end points, or node points, other points on a line and points on a surface, these points constituting the figure data, memory addresses for figure data for an object to be retrieved are stored in the address data table and then retrieved. Flags indicative of the kind of the constituent points are also stored in the address data table in combination with the memory addresses and are used for figure retrieval.

Figure retrieval method

A figure data display method and system in which the contents to be stored and constituting data are stored in the form of figure data divided into a plurality of partial areas, a file information table is prepared which registers therein figure area information, along with volume information of the figure data, in the sequence of serial numbers allocated to the partial areas dependent on their positions, and those partial areas, which are necessary for display of the figure data, are searched within a range of the registered serial numbers. By preparing the figure data represented in the compressed form by taking relative values between the coordinate values of respective features points in the figure data, or by retrieving file names in a manner involving direct searching the figure data from a storage medium, operation from the step of reading the figure data to the step of displaying the same can be speeded up. High-speed infinite scrolling can also be achieved by setting an adjacent area based on the above retrieval when the predetermined area to be displayed is exceeded upon scrolling of the display area, and then deleting the unnecessary area.

Figure data display method and system

A data communication apparatus comprises: means for dividing data to be transmitted into a plurality of blocks and extracting the data from each block; a first multi-layered neural network of three or more layers which has weighting coefficients to output the same data as the input data for the data extracted from each block and which can output data from an intermediate layer; the transmission data extracted from each block being inputted to the first neural network and outputted from the intermediate layer; means for encoding the transmission data which is outputted from the intermediate layer of the first neural network and, thereafter, transmitting; means for receiving and decoding the transmitted data; a second multi-layered neural network of three or more layers which has the same weight coefficients as those of the first neural network and can input data from an intermediate layer; the decoded data of each block being inputted to the second neural network and outputted from an output layer; and means for restoring the data on the basis of the output data from the output layer of the second neural network.

Data communication method and apparatus using neural-networks

A pattern having a plurality of bands in each of a plurality of lanes is photoelectrically converted, and the sum (histogram) of the density data (pixel data) of pixels lying in lines, each of which passes through a plurality of points in a direction perpendicular to the lanes, is detected on the basis of the density data of the respective pixels photoelectrically converted. Points representative of the existence regions of the respective lanes, for example the central positions of the respective lanes, are detected from the histogram, and the density data items of the pixels in the detected central positions of the respective lanes are collected to obtain the spectra of the respective lanes. The spectra are used to detect the plurality of maximum positions of each of them as band positions, whereby the band positions are automatically read.

Method of and apparatus for automatically reading 5 band arrayal pattern

A line recognition adapted for recognizing a drawing in which a plurality of lines overlapping one another are indicated by a given one of the mutually overlapping lines and overlap symbols representative of the other lines. The overlap symbols are so configured as to give information as to line kinds of the other lines such as solid line, dash line and chain line and/or information as to colors of the other lines. The paths of the other lines are estimated on the basis of the overlap symbols as well as the positions at which they are inserted, for thereby recognizing the whole line paths or patterns of the drawing.

Line recognition

In a pattern recognition apparatus for recognizing a pattern including a line pattern consisting of a plurality of line segments, there is proposed a line recognition method which comprises steps of: recognizing the coordinates of end points of each of segments constituting a line pattern; employing the coordinates of an end point of a first line segment as base point coordinates; deciding whether the distance between the base point and an end point of a second line segment is less than a certain value or not; employing as a suitable point the end point of the second line segment with said distance being less than the certain value; and selecting a connectable second line segment and connecting said suitable point to the base point of the first line segment.

Line recognition method

In an apparatus for pattern recognition provided with convertion means for converting a two-dimensional image carried on a picture into pattern signals, memory means for temporally storing the pattern signals from said convertion means, and recognition means for recognizing the pattern signals read out from said memory means, disclosed is a method wherein said picture is divided into a plurality of partial pictures in a manner that adjacent ones of the partial pictures hold in common a partially overlapped region, said convertion means convert, on a one-by-one basis of the partial pictures, the two-dimentional image into pattern signals to be stored in said memory means, and the stored pattern signals are, on a one-by-one basis of the partial pictures, read out to be recognized by said recognition means.

Method of pattern recognition and apparatus thereof

A pattern processing system comprising a filtering processor which enhances the edge of a character signal picked up by an image pickup tube, a comparator which binary-codes the character signal on the basis of threshold values of two different levels, a circuit which provides the logical product between outputs from the filtering processor and the comparator, and a filtering processor which subjects the output of the circuit to a filtering processing by the use of a smoothing filter.

Pattern processing system

A pattern preliminary processing system wherein high and low frequency noise other than the pattern signal from a pick-up tube are eliminated by a filtering circuit thereby to 'relieve' the pattern against the background and the thus obtained pattern signal is tri-valued into signals of high, medium and low levels by means of a processing circuit having two different threshold values, and then the signal of the medium level is converted into a signal of high or low level with reference to peripheral information thereby to finally bi-value the pattern signal.

Growing community of inventors

Kodaira, Japan

Shigeru Kakumoto