An image interpolation device for interpolating a missing pixel among a plurality of pixels arrayed in a line, wherein of the pixels aligned in the line, the pixels other than the missing pixel are mutually arrayed at a certain pitch, the pixels adjacent the missing pixel being mutually spaced apart by twice the certain pitch, the image interpolation device comprising: a data storage unit for storing data representing pixel values of the plurality of pixels other than the missing pixel; and further comprising: a filter interpolation unit for receiving data read from the data storage unit and performing a multiply-add operation by, from among the plurality of pixels arrayed in the line, multiplying the values of each of a plurality of neighboring pixels located in a neighborhood of the missing pixel by predetermined coefficients based on coefficients of a low-pass filter and adding resulting products, thereby calculating an interpolated value for the missing pixel; a limit processing unit for limiting the data output from the filter interpolation unit to within a range of pixel values of the plurality of neighboring pixels; and an interpolation data insertion unit for inserting the data output from the limit processing unit into a position corresponding to the missing pixel in the data output from the data storage unit; and wherein in the filter interpolation unit, the values of the coefficients KFs by which the pixel values of the neighboring pixels are multiplied are given by: KFs = KSs / SKS, where KSs represents the coefficients by which the pixel values of the neighboring pixels are multiplied in the low-pass filter, and SKS represents a sum of the coefficients KSs, with the coefficient corresponding to the position of the missing pixel being zero, and the coefficient KSs is given by: KSs = KS 0 × sin g × d / g × d}, where d is the distance of the neighboring pixels from the missing pixel, and g is a first prescribed constant, and KS0 is a second prescribed constant; when the reciprocal of the pixel pitch is represented by Fs, the cutoff spatial frequency is represented by Fc, and the value of the distance d from each neighboring pixel to the pixel being processed, represented as a number of pixel pitches, is represented by s, the distance d is given by d = s / Fs, the first prescribed constant g is given by g = 2n x Fc, and the second prescribed constant KS 0 is given by KS 0 = 2Fc / Fs. a data storage unit for storing data representing pixel values of the plurality of pixels other than the missing pixel; a filter interpolation unit for receiving data read from the data storage unit and performing a multiply-add operation by, from among the plurality of pixels arrayed in the line, multiplying the values of each of a plurality of neighboring pixels located in a neighborhood of the missing pixel by predetermined coefficients based on coefficients of a low-pass filter and adding resulting products, thereby calculating an interpolated value for the missing pixel; a limit processing unit for limiting the data output from the filter interpolation unit to within a range of pixel values of the plurality of neighboring pixels; and an interpolation data insertion unit for inserting the data output from the limit processing unit into a position corresponding to the missing pixel in the data output from the data storage unit; and wherein in the filter interpolation unit, the values of the coefficients KFs by which the pixel values of the neighboring pixels are multiplied are given by: KFs = KSs / SKS, where KSs represents the coefficients by which the pixel values of the neighboring pixels are multiplied in the low-pass filter, and SKS represents a sum of the coefficients KSs, with the coefficient corresponding to the position of the missing pixel being zero, and where KSs represents the coefficients by which the pixel values of the neighboring pixels are multiplied in the low-pass filter, and SKS represents a sum of the coefficients KSs, with the coefficient corresponding to the position of the missing pixel being zero, and the coefficient KSs is given by: KSs = KS 0 × sin g × d / g × d}, where d is the distance of the neighboring pixels from the missing pixel, and g is a first prescribed constant, and KS0 is a second prescribed constant; when the reciprocal of the pixel pitch is represented by Fs, the cutoff spatial frequency is represented by Fc, and the value of the distance d from each neighboring pixel to the pixel being processed, represented as a number of pixel pitches, is represented by s, where d is the distance of the neighboring pixels from the missing pixel, and g is a first prescribed constant, and KS0 is a second prescribed constant; when the reciprocal of the pixel pitch is represented by Fs, the cutoff spatial frequency is represented by Fc, and the value of the distance d from each neighboring pixel to the pixel being processed, represented as a number of pixel pitches, is represented by s, the distance d is given by d = s / Fs, the first prescribed constant g is given by g = 2n x Fc, and the second prescribed constant KS 0 is given by KS 0 = 2Fc / Fs.