Mitsubishi Denki Kabushiki Kaisha

Shigenori Kino

Tomohiro Kimura

Masayuki Yoshida

Fumitaka Ono

Yasuyuki Mochizuki

Takehisa Mizuguchi

Kazuhiro Koike

Kazuhiko Maruyama

Hisafumi Ozawa

It is aimed to provide a system for collecting, storing and distributing a photographic subject image which an image reader wants to watch, by intermediating an image photographer who photographs an image of a photographic subject using portable equipment with a digital camera function and the image reader who acquires the photographed image via a data communications network. A photographic subject list registration part 13 registers a photographic subject list where photographic subject specification information input by an input part 11 of photographic subject specification information from a registrant terminal corresponds to a photographic subject identifier. A photographic subject list disclose part 14 discloses the photographic subject list. An input part 15 of a photographic subject image application inputs a photographic subject identifier used for identifying a photographic subject which an applicant wants to be photographed, and a disclose part 17 of photograph application collection list discloses it to a photographer. A photographic subject image registration part 18 registers the photographed image, and a registration image distribution part 32 distributes the registered photographed image.

Image registration server and an image mediation distributing system

An inter-application data transmitting system having an application intermediary unit which mediates data to be transmitted between a network and one of multiple business applications for exchanging the data among the multiple applications interconnected over the network without changing the business application even if the access procedures, data formats, and communication protocols of the multiple applications are different from each other. The application intermediary unit is provided with an access procedure control unit for controlling an access procedure, a data format conversion unit for converting a data format, and a communication control unit for controlling communication between the multiple business applications having different communication protocols. The application intermediary unit further includes an application control unit for controlling those elements.

Inter-application data transmitting system and method

Data is exchanged among interconnected applications over a network in a mutual use of data and functions without modifying an existing application system. The inter-application data transmission/reception is achieved by a resident agent for controlling an application based upon a flow control rule to obtain data in a format dependent on the application and converting the format of the obtained data into an intermediate format based upon a first data format conversion rule so as to transmit the obtained and converted data in the intermediate format or converting the intermediate format of received data into the format dependent on the application based upon a second data format conversion rule so as to update the obtained data in the format dependent on the application with the received and converted data in the format dependent on the application based upon the flow control rule.

Inter-application data transmitting/receiving system and method

A code conversion system converts an MH code into an arithmetic code. In code conversion system, a template 93 which is necessary for an arithmetic decoding process is obtained in such a manner that MH code words corresponding to the template 93, which are derived from already MH coded reference lines 90 and 91 respectively, are decoded, and the decoded data are shifted in three shift registers A77, B72 or C80. By means of a signal indicative of completion of the arithmetic decoding process in an arithmetic decoding device 71 and a signal indicative of completion of a shift-in process in shift registers A77 and so on, the process of the arithmetic decoding device 71, a decoding process of an MH code word in an MH decoding device and an MH coding process in an MH coding device 74 can be executed simultaneously.

Code conversion system

This invention relates to a coding system and the coding method in encoding information source symbols of an image. When the total number of original information source symbols cannot be known at the decoding site just from the encoded symbols, it is an object to finish the decoding process correctly and decode the symbols equal to the number of original information source symbols. At an encoding site, the total number of information source unit composed of a finite number of information source symbols is placed at the tail of code at the completion of encoding process. For example, at the encoding site, the number of horizontal pels of an image are transmitted in advance as an information source unit and the total number of lines are placed at the tail of code at the completion of encoding process. At the decoding site, the number of decoded lines is counted and decoded up to the number of lines placed at the tail of code. As a result, it is possible to judge the end of information source symbols without missing the total number.

Coding system

A coding system comprises the comparing circuit which compares a magnitude of the range on the number line which is allocated to the most probability symbol with a magnitude of the fixed range on the number line which is allocated to the Less Probability Symbol. If the range allocated to the MPS is smaller than that to the LPS, and when the symbol is the MPS, the range allocated to the LPS is generated. If the range allocated to the MPS is smaller than that to the LPS, and when the symbol is the LPS, the range allocated to the MPS is generated. By the system, a coding efficiency is improved especially when a probability of occurrence of LPS (Less Probability Symbol) is approximate to 1/2.

Although data is transmitted with efficiency by an arithmetic encoding system, the number of carry control signals increases in proportion to the number of consecutive bits '1' s or bytes X`FF` s in a conventional system. In the present invention, an arithmetic encoder 302 `detects the possibility of a carry generated during arithmetic coding operation being propagated beyond at least a predetermined number of consecutive bytes X`FF` s in a supplied arithmetic code 315. When the propagation of the carry is impossible, a carry control signal is inserted into the first 2 bits of the byte other than X`FF` which occurs immediately after the consecutive bytes X`FF` s so as to transmit the presence or absence of a carry. An arithmetic decoder 303 detects the continuation of at least a predetermined number of bytes X`FF` s in the arithmetic code 315, and arithmetically decodes an output value YN316 on the basis of the predicted value MPS317 of the occurrence probability of the output value YN316 to be encoded and the region width Qe of the complementary predicted value LPS. Since the number of total bits of the inserted carry control signals is reduced by this 'one-time 2-bits insertion system', the total number of transmitted code bits is also reduced.

Code transmitting apparatus with limited carry propagation

A coding method of a binary Markov information source comprises the steps of providing a range on a number line from 0 to 1 which corresponds to an output symbol sequence from the information source, and performing data compression by binary expressing the position information on the number line corresponding to the output symbol sequence. The present method further includes the steps of providing a normalization number line to keep a desired calculation accuracy by expanding a range of the number line which includes a mapping range, by means of a multiple of a power of 2, when the mapping range becomes below 0.5 of the range of the number line; allocating a predetermined mapping range on the normalization number line for less probable symbols LPS proportional to its normal occurrence probability; allocating the remaining mapping range on the normalization number line for more probable symbols MPS; and reassigning the predetermined mapping range to the remaining mapping range the half of a portion where the allocated remaining range is less than 0.5, when the allocated remaining range becomes below 0.5.

Growing community of inventors

Kanagawa, Japan

Shigenori Kino