Nec Corporation

Casio Computer Co., Ltd.

Nippon Steel Corporation

Hitachi High-tech Corporation

Calsonic Corporation

Sbi Pharmaceuticals Co., Ltd.

Reprocell, Inc.

Toshiba Tec Kabushiki Kaisha

Hiroyuki Ishikawa

Tohru Tanaka

Kouichi Matsumoto

Sunao Tsuchida

Hiroyasu Koizumi

Satoshi Kuroda

Hidenori Ito

Kohji Numata

Hidehiro Matsumoto

Ricardo Musashi Okamoto

Yoshiaki Honjo

Kenji Fukui

Yutaka Mizuno

Yoshiro Suemitsu

Takao Uchikura

Katsumi Muroi

Isao Kotani

Akira Takano

Yoshikazu Saigou

Shunsuke Yoshida

Mitsuru Inamura

A stem cell removing method that certainly-removes an undifferentiated stem cell is provided. For this object, a cell group including a stem cell and a somatic cell performed differentiation induction is cultivated in culture medium composition including photosensitizer. Light of a specific wavelength is irradiated with the cell group, and the stem cell is removed, selectively. The stem cell is a pluripotent stem cell or a somatic stem cell. The pluripotent stem cell includes either an ES cell (Embryonic Stem Cell) or an iPS cell (induced Pluripotent Stem Cell). Also, somatic stem cell includes any one of a germ stem cell, a productive cell, a pluripotent stem cell and a stem cell having unipotency.

Method of removing pluripotent cells from culture

Provided is a technique capable of implementing efficient transport and processing related to multi-step processing in the case of a link-type vacuum processing apparatus with related to an operating method of a vacuum processing apparatus. The operating method of the vacuum processing apparatus according to the embodiment, in order to minimize time required for all processing of a plurality of wafers in a multi-step processing, includes a first step (stepsto) of selecting one first processing unit and one second processing unit from a plurality of processing units for each wafer and determining a transport schedule including a transport path using the selected processing units. In the first step, for at least one wafer, a transport schedule including a transport path is configured using the selected first processing unit by excluding at least one first processing unit from the plurality of first processing units. The operating method selects an optimal transport schedule when a second step is rate-limited.

Operating method of vacuum processing apparatus

In a picture compression managing apparatus, a reduced picture producing section () produces, in response to an index affix request, a reduced input picture by reducing a current input picture of a succession of input pictures included in a picture file which is subjected to picture compression. The reduced picture producing section carries out at least one of output of the reduced input picture to a display unit and storage of the reduced input picture into the recording medium. An index producing section () produces, in response to the index affix request, a marking position which is a position of the current input picture with respect to a leading position of the picture file. The index producing section carries out storage of the marking position as a particular index into the recording medium. A reference frame producing section () produces at least one of remaining pictures of a succession of the input pictures. The above-mentioned at least one of remaining pictures is used as at least one reference frame in later compressing the current input picture into a compressed picture. The reference frame producing section carries out storage of the above-mentioned at least one reference frame into the recording medium.

Picture compression managing apparatus and picture compression managing method used therefor

A moving picture coding method and apparatus is provided that performs motion compensation interframe predictive coding, thus improving the compression efficiency. The magnitude of a forward motion vector, acquired through a forward motion vector search to a P-frame, is reduced in accordance with a frame distance between each B-frame and a reference frame (an I- or P-frame). The reduced forward motion vector is distributed as a forward motion vector to each of B-frames which undergoes bidirectionally motion compensation interframe predictive coding. Of B-frames, a B-frame following an I- or P-frame is subjected to a backward motion vector search while the I- or P-frame is used as a reference frame. The magnitude of the resultant backward motion vector is reduced in accordance with a frame distance between each B-frame and the reference frame (I- or P-frame). The reduced vector is distributed as a backward motion vector. Bidirectionally motion compensation interframe predictive coding is performed using the forward motion vector and the backward motion vector.

Method and apparatus for coding moving pictures

When all frames, which are used for reference, are stored, vector retrieval meansfind correlation with a reference frame. Compression type determination meanscompare a predictive error of the found vector position and an average deviation within the frame, and select the compression type with high compression efficiency. Compression mode determination meansselect anyone of the compression process at the time of the high-speed mode and the compression process at the time of the normal mode based on the compression type. In the compression process at the time of the high-speed mode, for the macro block the difference between it and the predictive block is not taken in motion predictive meansit is converted into a frequency component in frequency conversion meansis quantized in quantization meansand is coded by the compression in variable-length coding meansto output the compression code from output means

Moving picture high-speed coder and moving picture high-speed coding method

A high-speed motion retrieval device is provided that certainly unerring motion vector at high speed. The first-stage motion retrieval means retrieves a retrieval range determined by referring to the retrieval result in the previous frame. If a minimum predictive error is smaller than a threshold value, the motion retrieval process is ended at the time the retrieval range has been retrieved. If the minimum predictive error is larger than the threshold value, the second-stage motion retrieval means retrieves the region which has not been retrieved through the first-stage motion retrieval within a predetermined retrieval range, thus obtaining the location with a minimum predictive error. Thus, the retrieval is divided into two steps. Motion vectors can be retrieved with small error detection and at high speed by suitably changing the first-stage retrieval range.

Device and method of retrieving high-speed motion

In a moving picture encoding method and a moving picture encoding apparatus of the present invention, after calculating an absolute value of a difference for every corresponding pixel data between continuous two frames, an interframe difference calculation means calculates an average value per frame and an average value per scene of the absolute value of the difference, and a scene change determination means determines that a scene change has occurred, when the average value per frame is more than or equal to a predetermined number times as large as the average value per scene, and in case that the scene change is detected by the scene change determination means a frame type change means changes a frame type so that interframe predictive coding is not conducted.

Moving picture encoding method and moving picture encoding apparatus

A compression-encoding method allowing any discrepancy such as a delay caused by a change in frame rate to be avoided is disclosed. It is determined whether a predetermined number of frames required for forming a GOP have been inputted and, when the predetermined number of frames have not been all supplied, a dropped frame is compensated for by interpolation of a proceeding frame previous to the dropped frame to produce an interpolated group of pictures. Each frame of the interpolated GOP is compression-encoded to produce encoded moving picture data to be stored into a memory.

Moving-picture compressing technique

A moving picture coding apparatus is provided which is capable of controlling a bit rate of output codes so as not to exceed a target bit rate and reducing noises in a decoded image. The apparatus comprises: a converter for converting prediction errors of a plurality of pixel data into frequency components on a block basis; a quantizer for quantizing converted prediction errors with reference to a quantization table; a dequantizer for dequantizing quantized prediction errors with reference to a quantization table; a coder for coding the quantized prediction errors to generate codes; an output buffer for buffering the codes; a buffer checker for checking a code occupied ratio in the output buffer; a plurality of quantization tables; and a quantization table selector for selecting on quantization table from the plurality of quantization tables in accordance with the code occupied ratio. The quantizer employs the selected on quantization table, and the dequantizer employs a quantization table determined for a group of pictures.

Apparatus and method for coding a moving picture

In a picture encoding apparatus, block type determining means,judges whether a frame rate is lower than a threshold value A, and compares a block moving amount with a threshold value B when the frame rate is lower than the threshold value A. If the block moving amount is larger than the threshold value B, the current block is determined as a block to be compressed in a high picture-quality mode. Further, the differential value between the current block and a reference block is calculated, and the value of the high frequency component of the differential block is compared with a threshold value C. If it is larger than the threshold value C, the block is judged as a block to be compressed in the high picture-quality mode. Data amount assignment means,generates a quantization scale factor to assign a data amount to each block in accordance with the block type determined by the block type determining means,, and then supplies the quantization scale factor to quantizing means

Picture encoding apparatus

An image processing apparatus includes an image processing section, a module table, a module storage section, and a program generation section. The image processing section compresses/encodes an image by using an intraframe code obtained by dividing an image into small blocks, performing orthogonal transform for each block, quantizing the transform result, and performing high-efficiency encoding the quantized result, and an interframe code obtained by performing motion search by searing for blocks of previous and subsequent frames such that the differences between the blocks and divided blocks of a current frame become minimum, calculating the differences between the blocks of the current frame and the blocks of the frames having undergone the motion search, performing orthogonal transform for the difference blocks, quantizing the transform result, and performing high-efficiency encoding for the quantized result. The module table is used to designate modules required to constitute an optimal image processing program for each type of CPU. The module storage section stores a plurality of modules designated by the module table. The program generation section generates an optimal image processing program for a CPU in use by loading designated modules from the module storage means with reference to the module table.

Image processing apparatus

In a first PHS terminal, a system calling code for identifying a system in which the first PHS terminal is registered and a slave ID number for discriminating the first PHS terminal are stored in advance in an ID chip. While a user is out, he or she sets the ID chip in a second PHS terminal which does not have the same system calling code as that of the first PHS terminal. When the user performs an operation for peer-to-peer communication on the first PHS terminal, the second PHS terminal is called using a controlling physical slot. The second PHS terminal is informed that it is called by discriminating a system calling code and a PS calling number of the physical slot on the basis of the system calling code of the ID chip, and then transmits a response signal to the first PHS terminal based on the system calling code and PS calling number of the ID chip. Thus, peer-to-peer communication can be performed even between radio communication terminals which do not have the same system calling code.

Radio communication system and radio communication terminal

In a data-compression of a moving picture employing MPEG system, the quantization step used for quantizing coefficients of frequency components obtained in DCT (discrete cosine transform), is determined on a first frame of the moving picture, and is used for all the frames of the moving picture. A frame is processed by first run of data-compression. Code volume is allotted for each block in accordance with data obtained by the first run of data-compression, and in second run of data-compression, Huffman coding is discontinued when generated code volume of a block becomes larger than the code volume allotted to the block. When generated code volume of a frame is smaller than the target code volume of a frame, the surplus target code volume is added to a target code volume of a succeeding frame.

Method for restricting total code volume in data-compression

A magnetic recording system having a magnetic head and a magnetic-field generating device including a compensation circuit for supplying a current generating a magnetic field to cancel a leakage magnetic field applied to the magnetic recording medium, the leakage field arising from at least one of an actuator magnetically driven to drive the magnetic head and an actuator magnetically driven to focus and track a laser beam on the magneto-optical disk.

Magnetic recording system for compensating leakage flux

A method for detecting a scene change in an input image data composed of a plurality of frames. First, a DC component for each of blocks into which each of the frames is divided is calculated by orthogonal transformation such as discrete cosine transformation. An absolute value of the difference between the DC component of a current frame and the DC component of a frame adjacent to the current frame is calculated for each block of the current frame. The number of blocks for which the absolute value exceeds a first threshold value Is then counted, and a scene change between tile current frame and the adjacent frame is detected when the number of the blocks is higher than a second threshold value.

Growing community of inventors

Tokyo, Japan

Hiroyuki Ishikawa