Patents by Inventor Koichi Hata

Koichi Hata has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 6490373
    Abstract: A decoder decodes encoding binary image data on each block in order to recover a target block of the binary image. The image decoder includes motion compensated blocking which obtains a reference block from a reference binary image by applying motion compensation using motion information. A selector selects a statistical model from among a plurality of statistical models, based on states of pixels surrounding a reference pixel in the reference block, in which the reference pixel also corresponds to a target pixel in the target block. An arithmetic decoder recovers the target block by decoding the encoded data using the selected statistical model. In one embodiment, the pixels surrounding the reference pixel in the reference block are pixels positioned within one pixel distance from the reference pixel.
    Type: Grant
    Filed: May 1, 2001
    Date of Patent: December 3, 2002
    Assignee: Matsushita Electric Industrial Co., Ltd.
    Inventors: Koichi Hata, Minoru Etoh, Takeshi Ankei
  • Publication number: 20020172201
    Abstract: When a received packet contains static information and a CRC section 104 detects an error, the static information alone will be read from a buffer 106 and replace the static information of the received packet. A header reproduction section 107 once again reproduces a header, and upon this reproduced header the CRC section 104 performs CRC. If a bit error is detected, the received packet will be discarded. If no error is detected, determining that the bit error was in the static information portion in the header of the received packet, the packet in which the static information has been replaced will be output as a received packet.
    Type: Application
    Filed: May 14, 2002
    Publication date: November 21, 2002
    Inventors: Daiji Ido, Koji Imura, Akihiro Miyazaki, Koichi Hata, Carsten Burmeister
  • Publication number: 20020164024
    Abstract: In a sending device (100), a fragmenting portion (101) fragments a bit stream according to the predicted relationship of the frames, and the output of the fragmenting portion (101) is allocated to either a TCP (Transmission Control Protocol) or a UDP (User Datagram Protocol) port. In an IP (Internet Protocol) layer, an encrypting portion (102) executes an encryption process only on the port to which bit stream corresponding to the I (Intra) frames is transmitted. In a receiving device (110), a decrypting portion (112) decrypts data on the port to which the bit stream corresponding to the I frames is transmitted, and a reassembling portion (111) restores the data to the original bit stream. This restoration is carried out by lining up the packets in increasing order of TR (Temporal Reference) value. Thus, the amount of time required for encryption and decryption is reduced compared to a case in which encryption is performed on all frames.
    Type: Application
    Filed: April 25, 2002
    Publication date: November 7, 2002
    Inventors: Hiroshi Arakawa, Tomoaki Itoh, Junichi Sato, Takao Yamaguchi, Akihiro Miyazaki, Koichi Hata
  • Publication number: 20020154600
    Abstract: A data communication system capable of eliminating the retransmission of useless data that is too late for the playback time at the receiving side, and, accordingly, capable of eliminating the wasteful utilization of transmission band. In the system, round-trip time RTT of a packet between the server (data transmitting apparatus) 100 and the terminal apparatus (data receiving apparatus) 200 is calculated, and only when the sum of the round-trip time RTT and present time is less than the playback time of the packet, retransmission request for lost packet which has high priority is made.
    Type: Application
    Filed: March 5, 2002
    Publication date: October 24, 2002
    Inventors: Daiji Ido, Koji Imura, Akihiro Miyazaki, Koichi Hata
  • Publication number: 20020150078
    Abstract: Received packets are preserved in a receiving buffer 102; a playback decision section 103 decides whether the preserved packets are in time for the playback time or not; the playback orders and the preservation addresses of the preserved packets which have been decided to be in time are memorized in a pointer 104 for playback; the preserved packets are read and played back according to the pointer 104 for playback. And, the playback orders and the preservation addresses of the preserved packets are memorized in a pointer 106 for preservation; and a media conversion section 107 reads the preserved packets according to the pointer 106 for preservation, and memorizes them after conversion into packets with a form by which the packets may be memorized in a preservation memory 108.
    Type: Application
    Filed: March 1, 2002
    Publication date: October 17, 2002
    Inventors: Daiji Ido, Koji Imura, Akihiro Miyazaki, Koichi Hata
  • Publication number: 20020136307
    Abstract: In a bit counter 214, an amount of codes included in one transmission unit is counted; in a significance decision section 217, the amount of codes counted in the bit counter 214 is divided by the number of coded macroblocks included in the one transmission unit to calculate an average amount of codes per one coded macroblocks; and in a threshold comparing section 220, the significance of the pertinent transmission unit is decided by comparing the average amount of codes to the calculated threshold based on a frame rate and a bit rate.
    Type: Application
    Filed: March 6, 2002
    Publication date: September 26, 2002
    Inventors: Koji Imura, Daiji Ido, Akihiro Miyazaki, Koichi Hata
  • Publication number: 20020136309
    Abstract: An output controller 104 outputs coded data included in a packet arrived later than reproduction and display timing designated by a timestamp to a decoding section 105 together with coded data included in a packet designated by a timestamp next to the above timestamp. The decoding section 105 first decodes coded data included in the packet arrived later and updates the reproduced image that is one earlier than the above decoded reproduced image to the above decoded reproduced image, then decoding coded data included in the packet arrived before reproduction and display timing designated by the timestamp.
    Type: Application
    Filed: March 5, 2002
    Publication date: September 26, 2002
    Inventors: Koji Imura, Daiji Ido, Akihiro Miyazaki, Koichi Hata
  • Publication number: 20020122434
    Abstract: A data transmitting apparatus and a data receiving apparatus, which are capable of retransmitting a packet even when a retransmission request is made by a client after transmitting a session close notice packet to the client. A session is closed by a session closing means 105 when a predetermined period of time has passed after transmitting the session close notice packet, which is generated by a control command generating means 102 as the session close notice packet, from a packet transmitting means 103 to the client.
    Type: Application
    Filed: March 1, 2002
    Publication date: September 5, 2002
    Inventors: Daiji Ido, Koji Imura, Akihiro Miyazaki, Koichi Hata
  • Publication number: 20020098845
    Abstract: There is provided a mobile communication device that flexibly supports various services which utilize both Internet communications and short-distance wireless communications. An instruction data receiving section 208 receives instruction data indicating a protocol in which a set of data exchanges are to be performed. An instruction data analysis section 209 analyzes the received instruction data, and controls a reception switching section 203 and a transmission switching section 205 based on a result of analysis. The reception switching section 203 receives data from either an Internet reception section 201 or a short-distance wireless reception section 202 under the control of the instruction data analysis section 209. The transmission switching section 205 outputs data to either an Internet transmission section 206 or a short-distance wireless transmission section 207 under the control of the instruction data analysis section 209.
    Type: Application
    Filed: January 9, 2002
    Publication date: July 25, 2002
    Inventors: Koichi Hata, Munehito Matsuda, Kiyoshi Ogishi, Hiromi Wada, Atsunobu Kato
  • Publication number: 20020090139
    Abstract: An image encoding apparatus comprises: dynamic range estimating means 10101 for obtaining a dynamic range from a target multi-value image to be encoded; dynamic range encoding means 10105 for encoding the dynamic range and for outputting the same as dynamic range encoded data; smoothing function estimating means 10102 for estimating a smoothing function from the target multi-value image; multi-value to binary converting means 10103 for converting the multi-value image to a binary image based on a multi-value to binary conversion criterion determined to match the smoothing function; binary image encoding means 10104 for encoding the binary image and for outputting the same as binary image encoded data; smoothing function encoding means 10106 for encoding the smoothing function and for outputting the same as smoothing function encoded data. This configuration achieves efficient encoding of the multi-value image.
    Type: Application
    Filed: February 1, 1999
    Publication date: July 11, 2002
    Inventors: KOICHI HATA, MINORU ETOH, TAKESHI ANKEI
  • Patent number: 6404932
    Abstract: A decoder decodes encoded binary image data on each block in order to recover a target block of the binary image. The image decoder includes motion compensated blocking which obtains a reference block from a reference binary image by applying motion compensation using motion information. A selector selects a statistical model from among a plurality of statistical models, based on states of pixels surrounding a reference pixel in the reference block, in which the reference pixel also corresponds to a target pixel in the target block. An arithmetic decoder recovers the target block by decoding the encoded data using the selected statistical model. In one embodiment, the pixels surrounding the reference pixel in the reference block are pixels positioned within one pixel distance from the reference pixel.
    Type: Grant
    Filed: February 1, 1999
    Date of Patent: June 11, 2002
    Assignee: Matsushita Electric Industrial Co., Ltd.
    Inventors: Koichi Hata, Minoru Etoh, Takeshi Ankei
  • Publication number: 20020064224
    Abstract: The transmission end (header compression end) and the reception end (header decompression end) share the same timestamp calculation information which is previously prepared. At the transmission end, in the case that the timestamp of the current packet to be subjected to header compression cannot be compressed with the current timestamp calculation information S33, the history record which covers timestamp calculation information so far transmitted is referred to determine S35 which to transmit a packet header carrying the timestamp without updating the current timestamp calculation information S37, or a packet header carrying the timestamp S34 by updating the current timestamp calculation information.
    Type: Application
    Filed: November 2, 2001
    Publication date: May 30, 2002
    Inventors: Koichi Hata, Akihiro Miyazaki, Koji Imura, Daiji Ido
  • Publication number: 20020059464
    Abstract: A packet compressor 12 operates under a reliable mode or an optimistic mode. A mode determination unit 31 counts the number of ACK packets or NACK packets received by a unit time X by an ACK/NACK packet receiver 14. When the counted number of NACK packets is larger than a predetermined value Y, the mode determination unit 31 switches the operation mode of the packet compressor 12 to the reliable mode. When the counted number of ACK packets is larger than a predetermined value Z, the mode determination unit 31 switches the operation mode of the packet compressor 12 to the optimistic mode.
    Type: Application
    Filed: August 15, 2001
    Publication date: May 16, 2002
    Inventors: Koichi Hata, Akihiro Miyazaki, Koji Imura, Daiji Ido
  • Publication number: 20020031149
    Abstract: In a header decompression apparatus 709, a header decompressor 703 refers to reference information stored in a reference information manager 707 to decompress a compressed header of a packet received by a packet receiver 704. An error detector 702 detects a CRC error in the packet with its header decompressed by the packet receiver 704, and outputs only a correct packet. A successive error counter 705 counts the number of successive errors detected by the error detector 702. A successive decompression success counter 706 counts the number of decompression successes that successively appear. By referring to these counted numbers, an update request unit 708 transmits an update request to a transmitting side as required. A reference information manager 707 manages the reference information for header decompression. With this structure, the header decompression apparatus can request update of the reference information based on the state of the error.
    Type: Application
    Filed: September 10, 2001
    Publication date: March 14, 2002
    Inventors: Koichi Hata, Akihiro Miyazaki, Koji Imura, Daiji Ido
  • Publication number: 20020021700
    Abstract: A data transmitter 10 transmits packets each with a sequence number and a priority added. A data receiver 20 detects any packet loss by referring to the sequence numbers added to the packets, and if detecting any packet of high priority as having been lost, requests for packet retransmission. Based on information about thus detected packet loss, the data receiver 20 generates and transmits an RR packet 110 indicating the packet reception state. The data transmitter 10 extracts from the RR packet 110 a packet loss ratio 200, and therewith, changes manners of priority assignment. The manners are so changed that the packet of high priority is found with a lower ratio when the packet loss ratio 200 is high, and when the packet loss ratio 200 is low, found with a higher ratio.
    Type: Application
    Filed: August 15, 2001
    Publication date: February 21, 2002
    Inventors: Koichi Hata, Akihiro Miyazaki, Koji Imura, Daiji Ido
  • Publication number: 20010031089
    Abstract: An image encoding apparatus comprises: dynamic range estimating means 10101 for obtaining a dynamic range from a target multi-value image to be encoded; dynamic range encoding means 10105 for encoding the dynamic range and for outputting the same as dynamic range encoded data; smoothing function estimating means 10102 for estimating a smoothing function from the target multi-value image; multi-value to binary converting means 10103 for converting the multi-value image to a binary image based on a multi-value to binary conversion criterion determined to match the smoothing function; binary image encoding means 10104 for encoding the binary image and for outputting the same as binary image encoded data; smoothing function encoding means 10106 for encoding the smoothing function and for outputting the same as smoothing function encoded data. This configuration achieves efficient encoding of the multi-value image.
    Type: Application
    Filed: May 1, 2001
    Publication date: October 18, 2001
    Inventors: Koichi Hata, Minoru Etoh, Takeshi Ankei
  • Publication number: 20010024525
    Abstract: An image encoding apparatus comprises: dynamic range estimating means 10101 for obtaining a dynamic range from a target multi-value image to be encoded; dynamic range encoding means 10105 for encoding the dynamic range and for outputting the same as dynamic range encoded data; smoothing function estimating means 10102 for estimating a smoothing function from the target multi-value image; multi-value to binary converting means 10103 for converting the multi-value image to a binary image based on a multi-value to binary conversion criterion determined to match the smoothing function; binary image encoding means 10104 for encoding the binary image and for outputting the same as binary image encoded data; smoothing function encoding means 10106 for encoding the smoothing function and for outputting the same as smoothing function encoded data. This configuration achieves efficient encoding of the multi-value image.
    Type: Application
    Filed: May 1, 2001
    Publication date: September 27, 2001
    Inventors: Koichi Hata, Minoru Etoh, Takeshi Ankei
  • Publication number: 20010014897
    Abstract: Disclosed here is a method and an apparatus for a structured image data processing, and a computer program product used therein. This allows structured image data information to be effectively transmitted and stored, keeping the quality of the information as perfect as possible. When structured image data and region data are entered, the routine firstly determines a region to be divided of document-image data. Structured image data includes image data and corresponding positioning data, while region data indicates the inner structure of image data by regions. Received the input data, the routine divides the document-image data into plural portions according to information on the region to be divided. Then each portion of the document image is processed suitable for its region characteristics. Then, the structured image data is renewed by replacing the positioning data and image data before processing with ones after processing.
    Type: Application
    Filed: December 18, 2000
    Publication date: August 16, 2001
    Inventors: Koichi Hata, Hiroyuki Tada
  • Patent number: 6266158
    Abstract: The invention is characterised in that it has a reference/predictive grouping unit 105 into which a plurality of images which are to be encoded is input together with the relevant camera position data, and whereby the plurality of images which are to be encoded is grouped into reference images and predictive images which are predictively encoded from the reference images, a reference image encoding unit 106 which encodes the reference images, a predictive image encoding unit 108 which uses reconstructed reference images to encode predictive images, and a reference relationship table compilation unit 109 which compiles a reference relationship table detailing reference relationships, encoded data positions and camera positions, and outputs the reference relationship table and the encoded data.
    Type: Grant
    Filed: January 21, 1998
    Date of Patent: July 24, 2001
    Assignee: Matsushita Electric Industrial Co., Ltd.
    Inventors: Koichi Hata, Minoru Etoh
  • Patent number: 4824454
    Abstract: In order to prevent icing of the cryogen, a device for liquefying a gas includes a heater provided in a cooling chamber at the output of a Sterling cycle engine. The heater is controlled by a gas pressure sensor in the cryostat in communication with the chamber and matches the cooling load to the cooling capacity of the Sterling cycle engine.
    Type: Grant
    Filed: March 4, 1988
    Date of Patent: April 25, 1989
    Assignee: Aisin Seiki Kabushiki Kaisha
    Inventors: Hitoshi Kondo, Koichi Hata