Abstract: According to one embodiment, a semiconductor device includes first to third electrodes, first to third nitride regions, and first and second insulating films. The first nitride region includes Alx1Ga1?x1N, and includes first and second partial regions, a third partial region between the first and second partial regions, a fourth partial region between the first and third partial regions, and a fifth partial region between the third and second partial regions. The first nitride region includes first to fifth partial regions. The second nitride region includes Alx2Ga1?x2N, and sixth and seventh partial regions. At least a portion of the third electrode is between the sixth and seventh partial regions. The first insulating film includes silicon and oxygen and includes first and second insulating regions. The third nitride region includes Alx3Ga1?x3N, and first to seventh portions. The second insulating film includes silicon and oxygen and includes third to seventh insulating regions.

Abstract: This invention provides an apparatus which re-encodes encoded image data to generate encoded data at a higher compression ratio while suppressing any increase in the load of re-encoding. A decoder decodes each block stored in a storage, stores the decoding result in a buffer, and stores, in a holding unit, block information representing the location of the encoded data of each block in the storage. A discrimination unit discriminates a text area in the decoded image data. The image in the text area undergoes binarization and then character image data encoding. A fill-up unit replaces the value of a character/line art pixel in the text area with the average of non-character/line art pixel values. A re-encoder encodes the blocks after replacement. Inside the text area, a selector selects and outputs encoded data generated by the re-encoder. Outside the text area, the selector selects and outputs encoded data in the storage.

Abstract: Resolution interpolation data is generated by relatively simple processing. This enables image encoding by simple and quick processing to attain high image quality and high compression performance. To do this, a tile divider extracts tile data of 32×32 pixels from encoding target original image data. A resolution converter samples one pixel of a block of 2×2 pixels in the tile data, thereby generating reduced tile data of a reduced image. An interpolation data generator generates interpolation data to be used to generate tile data having the original resolution from the reduced tile data. Based on the interpolation data of a tile of interest, an encoding method selector outputs a control signal indicating which one of lossless encoding and lossy encoding should be executed for the reduced tile data. A code stream generator outputs the generated encoded data and interpolation data as encoded image data.

Abstract: This invention generates efficient encoded data to restore original image data from reduced image data. An input unit inputs block data of 2×2 pixels from original image data. A converter generates reduced image data having a size smaller than the original image data by sampling one pixel data at a preset position in the input block data. A generator generates encoded data to restore three non-sampling target pixel data in each block data so as to restore the original image data from the reduced image data generated by the resolution converter. To do this, the generator determines whether all non-sampling target pixels in a block of interest are restorable from a sampling target pixel in the block of interest or from sampling target pixels in three blocks adjacent to the block of interest, and generates and outputs three kinds of additional information based on the determination result.

Abstract: This invention provides a technique of easily encoding image data to generate encoded data having high image quality within a target code amount using a small memory capacity by image encoding processing of performing frequency transform and quantization of each pixel block. A frequency transform unit separates image data into low frequency band data and high frequency band data. A coefficient quantizing unit, coefficient encoder, and code amount controller operate to encode the high frequency band data within a predetermined amount. When the encoding processing of the high frequency band data has ended, the quantization parameter of the low frequency band data is set based on the generated code amount of the high frequency band data. A coefficient quantizing unit, coefficient encoder, code amount detector, and quantization parameter updating unit operate to encode the low frequency band data into codes within a low frequency band target code amount.

Abstract: The invention losslessly encodes multidimensional data such as a color lookup table in which neighboring elements in a space have high correlations, by a simple arrangement at a high compression ratio. To this end, a multidimensional data input unit inputs data of an X-Y plane in an order of Z=0, 1, 2, . . . from a lookup table expressed by three-dimensional X-, Y-, and Z-coordinates. An inter-plane difference generation unit calculates differences D between elements of two neighboring planes, and outputs the calculation result as two-dimensional inter-plane differences. A prediction error generation unit considers data Di of interest in the inter-plane differences D as an element of two-dimensional data, and outputs a difference e from a predicted value p, which is obtained with reference to already encoded data, to a prediction error encoding unit. The prediction error encoding unit generates and outputs a codeword from the inputted difference e.

Abstract: A moving image decoding apparatus for decoding encoded moving image data, which is generated by decomposing each frame of moving image data into a plurality of subbands, and bitplane-encoding coefficients of the subbands for each predetermined unit, includes a decoding process time measurement unit (105) for acquiring information used to examine a difference of a time required for the decoding process of encoded moving image data for the predetermined unit, a non-decoding bitplane determination unit (107) for determining bitplanes which are not to be decoded on the basis of the obtained information, a bitplane decoder for reclaiming the coefficients of the subbands from encoded data of bitplanes other than the non-decoding bitplanes, and an inverse discrete wavelet transformer (104) for generating frame data by compositing the reclaimed coefficients of the subbands.

Abstract: This technique prevents errors from being gradually accumulated on the decoding side, while maintaining high scalability, even when transformation to subbands as a plurality of frequency components is used for moving image coding. The image data of one input frame is decomposed into a plurality of subbands having different frequency components by a discrete wavelet transformation unit. A lower bitplane coding unit codes, for each bitplane, predetermined lower bits of each coefficient data of a subband LL and the coefficient data of subbands other than the subband LL. The data of the upper bits of the subband LL is stored in a frame memory. A motion vector detection unit detects a predicted value and motion vector on the basis of the decoded data of the subband LL in a preceding frame. A subtracter obtains the difference between the detected predicted value and the current frame.

Abstract: The present invention is able to determine an encoding parameter using a simple method with little processing load or memory cost, and enables encoding of image data with excellent compression performance. To this end, a prediction error generating unit of an encoding apparatus according to the present invention calculates the difference (prediction error) between a pixel of interest and a predicted value. A prediction order conversion unit converts the prediction error to a non-negative integer, and outputs the non-negative integer as a prediction order M(e). A Golomb encoding unit performs encoding in accordance with a k parameter supplied from a k parameter updating unit. The k parameter updating unit updates the k parameter for use in the next updating based on the prediction order M(e) of the pixel of interest and the k parameter supplied to the Golomb encoding unit.

Abstract: Resolution interpolation data is generated by relatively simple processing. This enables image encoding by simple and quick processing to attain high image quality and high compression performance. To do this, a tile divider extracts tile data of 32×32 pixels from encoding target original image data. A resolution converter samples one pixel of a block of 2×2 pixels in the tile data, thereby generating reduced tile data of a reduced image. An interpolation data generator generates interpolation data to be used to generate tile data having the original resolution from the reduced tile data. Based on the interpolation data of a tile of interest, an encoding method selector outputs a control signal indicating which one of lossless encoding and lossy encoding should be executed for the reduced tile data. A code stream generator outputs the generated encoded data and interpolation data as encoded image data.

Abstract: This invention generates efficient encoded data to restore original image data from reduced image data. An input unit inputs block data of 2×2 pixels from original image data. A converter generates reduced image data having a size smaller than the original image data by sampling one pixel data at a preset position in the input block data. A generator generates encoded data to restore three non-sampling target pixel data in each block data so as to restore the original image data from the reduced image data generated by the resolution converter. To do this, the generator determines whether all non-sampling target pixels in a block of interest are restorable from a sampling target pixel in the block of interest or from sampling target pixels in three blocks adjacent to the block of interest, and generates and outputs three kinds of additional information based on the determination result.

Abstract: Image data is efficiently encoded using a predict coding unit and a run-length coding unit. The predict coding unit encodes a target pixel X on the basis of difference between the value of the target pixel and a predict value calculated from pixels neighboring the target pixel. The run-length coding unit starts the measuring the run when the number of colors contained in four pixels “a”, “b”, “c”, and “d” near the target pixel X is 1, and outputs encoded data of the run when the target pixel is different from an immediately preceding pixel “a”. Then, the predict coding unit starts the encoding. At this time, since the target pixel is different from the preceding pixel, the preceding pixel is excluded from references for generating the predict value. Instead of the preceding pixel, an pixel, which has been encoded, satisfying a specific condition is referred to.

Abstract: According to this invention, encoded data of a target data amount is generated by one image input operation while both lossless encoding and lossy encoding are adopted. For this purpose, a first memory stores encoded data of a shorter encode length among encoded data generated by a first encoding unit which performs lossy encoding and encoded data generated by a second encoding unit which performs lossless encoding. A second memory stores encoded data from a second encoding unit. When an encoding sequence control unit determines that the encoded data amount in the first memory has exceeded the target data amount, the encoding sequence control unit discards data in the first memory, sets a quantization parameter for a higher compression ratio for the first encoding unit, and causes the first encoding unit to execute encoding. Encoded data before the encoded data amount is determined to have exceeded the target data amount is re-encoded by a re-encoding unit.

Abstract: This invention provides a technique of easily encoding image data to generate encoded data having high image quality within a target code amount using a small memory capacity by image encoding processing of performing frequency transform and quantization of each pixel block. A frequency transform unit separates image data into low frequency band data and high frequency band data. A coefficient quantizing unit, coefficient encoder, and code amount controller operate to encode the high frequency band data within a predetermined amount. When the encoding processing of the high frequency band data has ended, the quantization parameter of the low frequency band data is set based on the generated code amount of the high frequency band data. A coefficient quantizing unit, coefficient encoder, code amount detector, and quantization parameter updating unit operate to encode the low frequency band data into codes within a low frequency band target code amount.

Abstract: An image having few colors can be losslessly encoded at a higher compression ratio. For this purpose, pixel data are input in raster order and temporarily stored in a buffer. A neighborhood matching determination unit generates first information representing whether a pixel having the same color as that of the pixel of interest exists in neighboring pixels and second information specifying whether a pixel having the same color as that of the pixel of interest exists, and if the pixel having the same color exists, specifying the neighboring pixel. A pixel matching detection unit counts the number of colors contained in the neighboring pixels and generates information representing whether the number of colors is two or less, or three or less. On the basis of the information, a code generation unit outputs one or both of encoded data from a matched-pixel position encoding unit and a prediction error encoding unit.

Abstract: An image coding apparatus for efficient coding on image data having discrete pixel values such as a CG image or a limited color image as well as a natural image where pixel value changes are mild. For this purpose, a tile dividing unit divides multi-valued image data into tiles. An occurred level count unit outputs the result of counting of the number of brightness values in the tile to a comparison unit and outputs the existing brightness values to an index table generation unit. The index table generation unit allocates continuous index values to the existing brightness values, and stores the result of allocation into an index memory table. An index conversion unit replaces the input pixel values in the tile with index values, and outputs the index values to a selector.

Abstract: This invention provides an apparatus which re-encodes encoded image data to generate encoded data at a higher compression ratio while suppressing any increase in the load of re-encoding. A decoder decodes each block stored in a storage, stores the decoding result in a buffer, and stores, in a holding unit, block information representing the location of the encoded data of each block in the storage. A discrimination unit discriminates a text area in the decoded image data. The image in the text area undergoes binarization and then character image data encoding. A fill-up unit replaces the value of a character/line art pixel in the text area with the average of non-character/line art pixel values. A re-encoder encodes the blocks after replacement. Inside the text area, a selector selects and outputs encoded data generated by the re-encoder. Outside the text area, the selector selects and outputs encoded data in the storage.

Abstract: To reduce the computation cost of rate/distortion optimization in image compression, the rate/distortion gradient of a frame of interest is classified to m categories. A category information creating unit acquires a threshold ? for a preceding frame as a predictive value ?? for the frame of interest that is to be coded, and further finely segments a category in which the predictive value ?? is included. A code amount is then calculated for each of n categories that include the predictive value ??. A code sequence forming unit selects a category having a target rate, and searches for a threshold between an upper and a lower limit value of the category. A value (S) at the end of the processing is selected as the threshold ?, and a code sequence is formed by using the threshold ?.

Abstract: An image encoding/decoding apparatus is provided, including a frequency band division unit for dividing image data into a plurality of frequency bands to generate sub-band coefficients, a sub-band coefficient interpolation unit for interpolating sub-band coefficients outside a region of a shape by using shape information representing a shape of the image data and the sub-band coefficients in the region of the shape, an encoding unit for encoding the interpolated sub-band coefficients to generate encoded data, and a shape information encoding unit for encoding the shape information to generate shape information encoded data.

Abstract: According to one embodiment, a semiconductor device includes first and second regions, a first insulating portion, and first, second, and third electrodes. The first region includes first and second partial regions, and a third partial region between the first and second partial regions. The second region includes fourth and fifth partial regions. The fourth partial region overlaps the first partial region. The fifth partial region overlaps the second partial region. The first insulating portion includes first, second, and third insulating regions. The first insulating region is provided between the second insulating region and the third partial region and between the third insulating region and the third partial region. The first electrode is electrically connected to the fourth partial region. The second electrode is away from the first electrode and is electrically connected to the fifth partial region. The third electrode is provided between the first and second electrodes.