Abstract: Embodiments of the application provide a method for rate matching in a wireless communication network. A device obtains K information bits and a target code length M of a polar code, determines, according to a minimum value of a set of values, a mother code length N1, polar encodes the K information bits to obtain an encoded sequence of N1 bits, obtains a target sequence of M bits from the N1 bit encoded sequence, and outputs the M-bit target sequence. When the mother code length N1 is larger than the target code length M, (N1?M) bits of the encoded sequence are punctured or shortened from the N1 bit encoded sequence.

Abstract: An electronic device for decompressing compressed data includes a decoding subsystem having a symbol decoder and a second symbol resolver with a number of local symbol decoders and a symbol selector. The symbol decoder decodes a first symbol from a first code for which a symbol is available in a block of the compressed data and communicates a length of the code to the second symbol resolver. Each local symbol decoder, substantially in parallel with the decoding of the first symbol in the symbol decoder, decodes a respective symbol from a first code for which a symbol is available in a respective sub-block of the block of the compressed data. The second symbol resolver selects, as a second symbol, based on the length received from the symbol decoder, one of the respective symbols from the local symbol decoders. The decoding subsystem then provides the first and second symbols.

Abstract: The disclosure is directed to transforming signals from one signal format to another signal format. For example, the format of a digital signal can change from storing video information in 12 bits of data to storing the video information in 32 bits of data. Other storage values and combinations can also be used. Since the number of bits available to store a portion of the video information can change when changing formats, a process is needed to translate or transform the video information appropriately. A transfer function utilizing a lookup table is used for the transforming. The lookup table utilizes a variable step size segmentation scheme that decreases the amount of lookup table storage space required and also decreases the number of estimation errors, i.e., interpolation errors. Estimation errors can occur when looking up a value not stored in the lookup table, and using neighboring values that are stored to estimate the value requested.

Abstract: A decoding method, a memory controlling circuit unit, and a memory storage device are provided. The method includes: reading a first physical programming unit by using a first read voltage to obtain first data; determining whether a first ratio of a first quantity of a first bit value and a second quantity of a second bit value in the first data is greater than a threshold; when the first ratio is not greater than the threshold, performing a decoding operation according to the first data to generate first decoded data and outputting the first decoded data; and when the first ratio is greater than the threshold, not performing the decoding operation according to the first data.

Abstract: An information processing method is provided to reduce an amount of data to be monitored in an onboard system of a vehicle. In the method, detection results that indicate whether an abnormality is included in communication data on an onboard network are obtained, and a first log transmission instruction is generated to cause periodic transmission of a first log from the onboard system to a server device. The first log is a log of the communication data. A second log transmission instruction is generated to cause transmission of a second log from the onboard system to the server device in a case of the detection results indicating the abnormality is included in the communication data. The second log is a log of the communication data and includes an amount of data generated per unit time that is greater than the first log.

Abstract: An encoding/decoding technique is provided with which encoding can be performed using a small average number of bits even for a sequence of integer values including small non-zero values and having a distribution heavily biased toward small values. The present invention includes an integer encoding part 110 that, with respect to an inputted sequence of non-negative integer values x_n, n?{1, 2, . . . , N} (hereinafter referred to as an “integer sequence”), obtains a 1-bit code as a code corresponding to a run of integer values 0 of length L, a predetermined number which satisfies 2?L?2K?1, which is included in the integer sequence and obtains a (K×x_n)-bit or (K×x_n+1)-bit code as a code corresponding to a set of a run of integer values 0 of length from 0 to L?1 and one non-zero integer value x_n included in the integer sequence, where K is assumed to be an integer equal to or larger than 2.

Abstract: Intra prediction is used in state-of-the-art video coding standards such as AVC. The intra prediction modes are coded into the bitstream. Luma and chroma components could potentially have different prediction modes. For chroma components, there are 5 different modes defined in AVC: vertical, horizontal, DC, diagonal down right, and “same as luma”. Statistics show that the “same as luma” mode is frequent used, but in AVC, this mode is encoded using more bits than other modes during entropy coding, therefore the coding efficiency is decreased. Accordingly, a modified binarization/codeword assignment for chroma intra mode signaling is able to be utilized for high efficiency video coding (HEVC), the next generation video coding standard.

Abstract: Data protection with meta chunks increases capacity use efficiency without verification and data copying. In one aspect, a meta chunk is a data protection unit, which combines two or more source chunks that are determined to have a reduced sets of data fragments. The meta chunk can be encoded to generate a set of coding fragments, which can be stored and utilized to recover data fragments of any of the two or more source chunks. Further, the source chunks can be linked to the meta chunk. Furthermore, the sets of coding fragments, that were previously generated by individually encoding each source chunk, can be deleted.

Abstract: Techniques for computing a memory health metric are disclosed. A system computes a memory health metric as a function of estimated entropy in a data set. The system may determine the memory health metric based on compressed and uncompressed sizes of the data set, quantities of values in the data set, and/or patterns of structural relationships within the data set. The system determines whether the memory health metric crosses a threshold value. If the memory health metric crosses the threshold value, the system presents a warning indicating that utilization of the memory is unhealthy.

Abstract: A data transmitting apparatus, a data receiving apparatus and methods thereof are provided. The data transmitting apparatus includes an encoding module, an encoding table, a first encoding parameter, a second encoding parameter and a transmitting module. The encoding module reads and encodes data content containing at least one data unit. The encoding table records a variety of information of multiple data units, and the variety of information contain a unit content, a number of times encoded and a recorded position of each of the data units. The first encoding parameter provides first information of the data unit, and the first information relate to an existing state of the unit content of the data unit in the encoding table. The second encoding parameter provides second information, and the second information relate to an amount of data units currently recorded in the encoding table. The transmitting module transmits an encoded data.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.

Abstract: Intra prediction is used in state-of-the-art video coding standards such as AVC. The intra prediction modes are coded into the bitstream. Luma and chroma components could potentially have different prediction modes. For chroma components, there are 5 different modes defined in AVC: vertical, horizontal, DC, diagonal down right, and “same as luma”. Statistics show that the “same as luma” mode is frequent used, but in AVC, this mode is encoded using more bits than other modes during entropy coding, therefore the coding efficiency is decreased. Accordingly, a modified binarization/codeword assignment for chroma intra mode signaling is able to be utilized for high efficiency video coding (HEVC), the next generation video coding standard.

Abstract: Embodiments of the application provide a method for rate matching in a wireless communication network. A device obtains K information bits and a target code length M of a polar code, determines, according to a minimum value of a set of values, a mother code length N1, polar encodes the K information bits to obtain an encoded sequence of N1 bits, obtains a target sequence of M bits from the N1 bit encoded sequence, and outputs the M-bit target sequence. When the mother code length N1 is larger than the target code length M, (N1?M) bits of the encoded sequence are punctured or shortened from the N1 bit encoded sequence.

Abstract: A method is disclosed for the decoding and encoding of a block-based video bit-stream such as MPEG2, H.264-AVC, VC1, or VP6 using a system containing one or more high speed sequential processors, a homogenous array of software configurable general purpose parallel processors, and a high speed memory system to transfer data between processors or processor sets. This disclosure includes a method for load balancing between the two sets of processors.

Abstract: According to one or more embodiments, multiple related data streams are compressed jointly, such that substantive similarities between the multiple related streams are leveraged to reduce the overall size of the resulting compressed data. Specifically, given the compressed version of a primary data stream, a secondary data stream may be highly compressed by utilizing portions of the compressed version of the primary data stream to represent similar portions of the secondary data stream. A compression application is configured to receive (either concurrently or separately) information identifying multiple related input streams. For each input stream provided to the compression application, the application outputs one output stream. The computing system writes the output streams of the compression application to storage. Embodiments allow the size of the compressed version of a secondary data stream to be greatly reduced compared to the size of the stream compressed without reference to a primary data stream.

Abstract: Disclosed are systems, methods, and non-transitory computer-readable media for a high efficiency data decoder. The high efficiency data decoder accesses an encoded data input from an input device and determines that the encoded data input does not map to any predetermined data outputs from a set of predetermined data outputs. The high efficiency data decoder selects, based on a ranking of modifications for the input device, a modification to perform on the encoded data input. The high efficiency data decoder performs the first modification on the encoded data input, yielding a modified encoded data input. If the modified encoded data input maps to a first data output from the set of predetermined data outputs, the high efficiency data decoder decodes the encoded data input into the first data output.

Abstract: A picture prediction method includes: determining two pixel samples in a current picture block, and determining a candidate motion information unit set corresponding to each of the two pixel samples; determining a merged motion information unit set i including two motion information units; and predicting a pixel value of the current picture block by using an affine motion model and the merged motion information unit set i.

Abstract: Provided is, for example, an arithmetic coding device capable of coding, at high speed, a symbol sequence including a context symbol and a bypass symbol. The arithmetic coding device updates an occurrence probability of a context symbol for a symbol sequence including the context symbol and a bypass symbol; updates a numerical range for the symbol sequence based on the updated occurrence probability; updates the updated numerical range based on a predetermined probability, the numerical range being a basis of an arithmetic code, the numerical range being updated in accordance with the occurrence probability of the context symbol and the predetermined probability for the bypass symbol; and generates an arithmetic code of the symbol sequence based on the updated numerical range in accordance with a procedure of generating the arithmetic code.

Abstract: One embodiment provides a method comprising receiving a plurality of encoded and compressed data blocks, decoding the data blocks, and decompressing the data blocks utilizing a plurality of processor sets. Each processor set is assigned a data block to decompress. The processor sets decompress in parallel to exploit inter-block parallelism. Each processor set comprises one or more processors that collaborate in decompressing an assigned data block to exploit intra-block parallelism. The method further comprises generating a final uncompressed output sequence based on uncompressed data blocks resulting from the decompressing.

Abstract: Techniques for duplicating deduplicated data include identifying a connection between a source deduplicated data storage and a target deduplicated data storage. A location of a block of data is determined that is located on the source deduplicated data storage for copying to the target deduplicated data storage. A first reference on the target deduplicated data storage is created to the location of the block of data on the source deduplicated data storage. A second reference is created on the source deduplicated data storage to the location of the block of data on the source deduplicated data storage.

Abstract: Methods of encoding and decoding data in which some data symbols are entropy coded and some data symbols are bypass coded. The encoder separates the coded symbols into an entropy coded stream and a bypass coded stream. The streams are packaged in a data unit that has a payload structured to contain one of the streams in forward order and the other stream in reverse order, with the reverse order stream aligned with the end of the data unit. In this manner, at the decoder, the decoder may begin decoding the forward order stream from its beginning and may also begin decoding the reverse order stream from its beginning at the end of the data unit by extracting symbols in reverse order. The data unit does not need to signal the length of the streams. The decoder determines the length of the data unit from explicit or implicit signaling.

Abstract: A transmitting system includes a variable-length packet multiplexing apparatus and a transmission slotting apparatus. The variable-length packet multiplexing apparatus generates a variable-length packet. The transmission slotting apparatus stores the variable-length packet in slots forming transmission main signals. The transmission slotting apparatus includes a capacity calculator, an extractor, a remainder calculator, a selector, and a slot information multiplexer. The capacity calculator calculates a data capacity of the transmission main signals for one frame. The extractor extracts a byte number of the variable-length packet. The remainder calculator calculates a remaining capacity of the transmission main signals. The selector stores a predetermined data sequence in a region left in the slots, and outputs the slots storing the data sequence. The slot information multiplexer multiplexes slot information and the slots output by the selector.

Abstract: An image capturing apparatus including a pixel region in which a plurality of pixels are arranged in a matrix, an A/D converter configured to convert a plurality of signals output from the plurality of pixels into a plurality of corresponding digital data, and a signal processing unit configured to generate an error-correcting code for the plurality of digital data, wherein, in the generating the error-correcting code, the signal processing unit performs grouping the plurality of digital data output from the A/D converter into a plurality of groups, and wherein the signal processing unit performs the grouping so that, in each of the plurality of groups, a total data length of the digital data forming corresponding one of the plurality of groups is not shorter than a length of the error-correcting code.

Abstract: A signal from a sensor and an image signal are received, and a position of a signal source is estimated based on the signal from the sensor. Information on a situation expression is extracted based on the signal from the sensor. The situation expression expresses a situation outside a capture range related to the image signal. A display position of the situation expression on a captured image by the image signal is determined using a positional relation between the position of the signal source and the capture range. A size of the situation expression on the captured image is determined depending on a distance between a position of the signal source and a capturing position where the image signal is captured. The situation expression with the determined size is superimposed onto the captured image in accordance with the display position; the captured image superimposed with the situation expression is output.

Abstract: A system and method, including determining, by a processor, a data type for each column of a database table; determining, by the processor and based on the determined data type for each column of the database table, an indication of a size of the database table; calculating, by the processor and based on the determined indication of the size of the database table, a start nbit size for a nbit compression process to be used on the database table; specifying, by the processor, the calculated start nbit size for the nbit compression process; and compressing the database table by executing the nbit data compression process using the specified start nbit size.

Abstract: An encoder obtains an uncompressed video bitstream that includes syntax elements that are to be coded using multi-symbol alphabets such that at least one syntax element of the syntax elements that are to be coded determines a magnitude token level that is at least partially represented by a head part. For each of the at least one syntax element, the encoder encodes the head part using multi-symbol alphabets to include a magnitude token level and end-of-block (EOB) information. The encoder transmits to a decoder an encoded bitstream that includes syntax elements coded with the multi-symbol alphabets.

Abstract: An embodiment of a semiconductor package apparatus may include technology to load compressed symbols in a data stream into a first content accessible memory, break a serial dependency of the compressed symbols in the compressed data stream, and decode more than one symbol per clock. Other embodiments are disclosed and claimed.

Abstract: Using Unary alphabet to express a cyber message, the identities of the message bits can be used to carry a companion message. The P (prime) message, and the C (companion) message can be related or unrelated. The C message may be used to authenticate, or to invalidate the P message and its writer. While the P message may be in the open, the C message may be limited to key-holding readers. The C message may be modified by successive readers while leaving the P message unchanged. A wide range of applications is available on account of the simple idea of writing the primary message via bit-count (ignoring bit identities), leaving the identity assignments to carry the companion message. Alice and Bob may exchange a large number of primary messages, where for most of them the companion message says: “ignore the primary message”.

Abstract: An encoder for encoding K information bits into a code word of length N? on the basis of a polar code of length N is provided, wherein N is a power of 2 and greater than or equal to N?. The encoder comprises a memory storing a plurality of bit indices, which comprise a set of N frozen bit indices associated with the polar code of length N, a set of N/2 puncturing bit indices and/or a set of N/2 shortening bit indices and a processor configured to retrieve at least a subset of the plurality of bit indices from the memory, to encode the K information bits using the polar code of length N for obtaining encoded data of length N and to reduce the number of bits of the encoded data to the length N? for obtaining the code word of length N?.

Abstract: A method of reducing transmission power for an encoded data stream includes the steps of receiving an incoming data stream having equal probability for a plurality of incoming data bits, assigning a symbol scheme to the received data bits of the incoming data stream according to probabilities of occurrence of individual ones of the received data bits, and transmitting an outgoing data stream according to the assigned symbol scheme having a second average transmit power, different than the first average transmit power, for a plurality of outgoing symbols.

Abstract: In various embodiments, a computer-implemented method enabling and maintaining authentication of a sender-receiver pair for a communication system by applying changes to the parameters of OCTS is disclosed. In one embodiment, a computer-implemented method comprises receiving, by a processor, a digital bit stream and transforming, by the processor, the digital bit stream to an encoded digital bit stream. The encoded digital bit stream comprises at least one of a gateway channel, a composite channel, or a data channel, and any combination thereof. The computer-implemented method further comprises providing, by the processor, the encoded digital bit stream to a transmission system for transmission and establishing, by the processor, authentication of the sender-receiver pair where pre-coordinated, pre-distributed information may be changed and communicated to limit the transmission to an intended sender-receiver pair.

Abstract: A data encoding system includes a non-transitory memory, a processor, a digital-to-analog converter (DAC) and a transmitter. The non-transitory memory stores a predetermined file size threshold. The processor is in operable communication with the memory, and is configured to receive data. The processor detects a file size associated with the data. When the file size is below the predetermined file size threshold, the processor compresses the data using a variable length codeword (VLC) encoder. When the file size is not below the predetermined file size threshold, the processor compresses the data, using a hash table algorithm. The DAC is configured to receive a digital representation of the compressed data from the processor and convert the digital representation of the compressed data into an analog representation of the compressed data. The transmitter is coupled to the DAC and configured to transmit the analog representation of the compressed data.

Abstract: Intra prediction is used in state-of-the-art video coding standards such as AVC. The intra prediction modes are coded into the bitstream. Luma and chroma components could potentially have different prediction modes. For chroma components, there are 5 different modes defined in AVC: vertical, horizontal, DC, diagonal down right, and “same as luma”. Statistics show that the “same as luma” mode is frequent used, but in AVC, this mode is encoded using more bits than other modes during entropy coding, therefore the coding efficiency is decreased. Accordingly, a modified binarization/codeword assignment for chroma intra mode signaling is able to be utilized for high efficiency video coding (HEVC), the next generation video coding standard.

Abstract: The present disclosure generally relates to an encoding scheme, and more specifically to a stable encoding scheme that is both variable-length and order-preserving. The present disclosure further describes a decoding scheme to decode and encoding generated by the encoding scheme. The encoding scheme may be parameterized by a single parameter k which remains constant across encoding and corresponding decoding operations. The output encodings generated by the encoding scheme are variable-length while maintaining order.

Abstract: A systematic polar encoder with data checks includes a data mapper receiving input data containing information to be polar coded for transmission and generating modified data, and a nonsystematic polar encoder implementing a transform matrix encoding the modified data to produce a codeword x such that, for some sub-sequence of coordinates S, xS=d. For nonsystematic encoding, a transform input u includes first and second parts for words independent of the data, the second part for an inverse puncture word, a third part carrying the modified data, and a non-null part carrying a check word derived from the modified data. A transform output includes a punctured part for a puncture word, a part carrying the data, and a part serving as redundant symbols, with the codeword x related to the transform output by x=zQ where Q is the complement of the punctured part P.

Abstract: A memory device includes a timing circuit configured to: receive an input signal, wherein the input signal is one signal within a group of input signals (e.g., multiple bits or nibbles) that are communicated according to a sequence with each of the input signals individually in serial to parallel operations, and generate a grouped latching timing signal based on the received input signal, wherein the timing signal corresponds to nibbles of the data.

Abstract: A method for performing polar encoding includes the steps of, if a length of a codeword is greater than 2x and smaller than 2x+1, determining whether encoding is performed by a polar encoder of size 2x or a polar encoder of size 2x+1 according to whether or not a length of the codeword is smaller than a prescribed value, and if the length of the codeword is smaller than the prescribed value, performing encoding by the polar encoder of the size 2x.

Abstract: Techniques facilitating synchronization of processing engines for parallel deep learning are provided. In one example, a first processing component associated with a processor and processing components can: generate first output data based on input data associated with a machine learning process, wherein the processing components are communicatively coupled with an assignment component via a network; transmit the first output data to a second processing component of the processing components, wherein the first processing component and the second processing component comprise a first group of the processing components and the first group of the processing components is determined by the assignment component based on a first defined criterion; receive communication data generated by the second processing component; and generate second output data based on the communication data, wherein the second output data is an updated version of the first output data stored in the memory of the first processing component.

Abstract: An encoding method and apparatus is described. In an encoding method, when a first target sub-block in a target block is obtained, a hash operation is first performed on the first target sub-block. Then, a first hash table is queried for a corresponding hash value according to an operation result, and a corresponding location in a reference block is found according to the hash value obtained by means of query, that is, first reference data is found. The first piece of target data in the first target sub-block is matched with the first reference data, and second target data in the target block is matched with second reference data in the reference block. In this way, an approximate location is predetermined, so that a range in which matching needs to be performed is narrowed, a data compression time is reduced, and data compression efficiency is improved.

Abstract: A method and apparatus for sample adaptive offset without sign coding. The method includes selecting an edge offset type for at least a portion of an image, classifying at least one pixel of at least the portion of the image into edge shape category, calculating an offset of the pixel, determining the offset is larger or smaller than a predetermined threshold, changing a sign of the offset based on the threshold determination; and performing entropy coding accounting for the sign of the offset and the value of the offset.

Abstract: Aspects of the disclosure provide a method for accelerating a decoding process. The method includes receiving first bit reliability values (BRVs) of a first codeword corresponding to a first bit sequence of an information block, receiving second BRVs of a second codeword corresponding to a second bit sequence of the information block, aggregating respective first BRVs and second BRVs into an aggregated. BRV for each static code bit of the second codeword, and decoding the second codeword to recover the second bit sequence of the information block using the aggregated BRVs of each static code bit of the second codeword.

Abstract: Decoder techniques in accordance with embodiment of the present technology include partially decoding a compressed file on a serial based processing unit to find offsets of each of a plurality of entropy data blocks. The compressed file and offset for each of the plurality of entropy encoded data blocks are transferred to a parallel based processing unit. Thereafter, the compressed file is at least partially decoded on the parallel based processing unit using the offset for each of the plurality of entropy encoded data blocks.

Abstract: Technologies for performing speculative decompression include a managed node to decode a variable size code at a present position in compressed data with a deterministic decoder and concurrently perform speculative decodes over a range of subsequent positions in the compressed data, determine the position of the next code, determine whether the position of the next code is within the range, and output, in response to a determination that the position of the next code is within the range, a symbol associated with the deterministically decoded code and another symbol associated with a speculatively decoded code at the position of the next code.

Abstract: A processor includes a plurality of packed data registers. The processor also includes a decode unit to decode a packed variable length code point length determination instruction. The instruction is to indicate a first source packed data that is to have a plurality of packed variable length code points that are each to represent a character. The instruction is also to indicate a destination storage location. The processor also has an execution unit coupled with the decode unit and the packed data registers. The execution unit, in response to the instruction, is to store a result packed data in the indicated destination storage location. The result packed data is to have a length for each of the plurality of the packed variable length code points. Other processors, methods, systems, and instructions are also disclosed.

Abstract: The present technology relates to an encoder and an encoding method, a decoder and a decoding method, and a program by which encoding efficiency is able to be improved by constraining an appearance probability of a predetermined quantization value of an encoding target to 0 when encoding with a combination of Huffman encoding and multidimensional encoding is performed.

Abstract: In one embodiment of the present invention, a convolution engine configures a parallel processing pipeline to perform multi-convolution operations. More specifically, the convolution engine configures the parallel processing pipeline to independently generate and process individual image tiles. In operation, for each image tile, the pipeline calculates source locations included in an input image batch based on one or more start addresses and one or more offsets. Subsequently, the pipeline copies data from the source locations to the image tile. The pipeline then performs matrix multiplication operations between the image tile and a filter tile to generate a contribution of the image tile to an output matrix. To optimize the amount of memory used, the pipeline creates each image tile in shared memory as needed. Further, to optimize the throughput of the matrix multiplication operations, the values of the offsets are precomputed by a convolution preprocessor.

Abstract: A compression algorithm based on Huffman coding is disclosed that is adapted to be readily implemented using VLSI design. A data file may be processed to replace duplicate data with a copy commands including an offset and length, such as according to the LV algorithm. A Huffman code may then be generated for parts of the file. The Huffman code may be generated according to a novel method that generates Huffman code lengths for literals in a data file without first sorting the literal statistics. The Huffman code lengths may be constrained to be no longer than a maximum length and the Huffman code may be modified to provide an acceptable overflow probability and be in canonical order. Literals, offsets, and lengths may be separately encoded. The different values for these data sets may be assigned to a limited number of bins for purpose of generating usage statistics used for generating Huffman codes.

Abstract: A first terminal device shares a first interface with a second terminal device. If the first terminal device obtains a notification message to trigger generation of a second interface, the first terminal device first determines whether the second interface belongs to a preset sharing-forbidden interface. If the second interface belongs to the preset sharing-forbidden interface, the first terminal device shares only the first interface with the second terminal device, or suspends interface sharing with the second terminal device.

Abstract: Methods and apparatus are disclosed to identify media using hash keys. An example disclosed method includes generating a hash key based on first samples of media. In the disclosed example method, the first samples corresponds to a portion of the media sampled in a buffer of a computing device. The example method also includes applying a blurring function to the hash key to generate a blurred hash key. The example method also includes generating first confirmation data based on second samples of the media. The example method also includes storing the blurred hash key in association with the first confirmation data and first reference data in a memory separate from the buffer of the sampled media. In the example methods, the reference data identifies the portion of the media.

Abstract: An image processing apparatus includes: a first cost calculating section configured to calculate similarity degrees between a first pixel in a first image and plural second pixels located in a horizontal-direction first range in a second image, and extract a second pixel with a highest similarity degree; a second cost calculating section configured to calculate a similarity degree between plural third pixels in a vertical-direction second range including the extracted second pixel and the first pixel and extract a third pixel with a highest similarity degree; an amount-of-difference buffer recording difference between a vertical-position of the extracted third pixel and the first pixel as an amount of difference; and a second position setting section configured to determine positions of the second pixels for which a similarity degree to the first pixel for which a disparity is calculated next is calculated.