Mr. Hitoshi Nishiguchi Profile

Hitoshi Nishiguchi

at Mie Univ

SPIE Involvement:

Author

Publications (2)

Proceedings Article | 19 January 2009 Paper

A study on SSD calculation between input image and subpixel-translated template images and its applications to a subpixel image matching problem

Hitoshi Nishiguchi, Yoshihiko Nomura

Proceedings Volume 7252, 72520R (2009) https://doi.org/10.1117/12.805637

KEYWORDS: Error analysis, Image registration, Image processing, Algorithm development, Machine vision, Computer vision technology, Super resolution, Medical imaging, Detection and tracking algorithms, Imaging systems

Read Abstract +

Proceedings Article | 10 September 2007 Paper

High accuracy 2D sub-pixel matching method skillfully managing error characteristics

Hitoshi Nishiguchi, Yoshihiko Nomura, Ryota Sakamoto, Tokuhiro Sugiura

Proceedings Volume 6764, 67640K (2007) https://doi.org/10.1117/12.730602

KEYWORDS: Error analysis, Image registration, Image processing, Machine vision, Computer vision technology, Algorithm development, Image restoration, Data acquisition, Composites, Feature extraction

Read Abstract +

In computer vision, many algorithms have been developed for image registration based on image pattern matching. However, there might be no universal method for all applications because of their advantages and disadvantages. Therefore, we have to select the best method suited for each task. A representative sub-pixel registration method uses one dimensional parabola fitting over the similarity measurements at three positions. The parabola fitting method could be applied to two dimensional, assuming that horizontal and vertical displacements are independent. Although this method has been widely used because of their simplicity and practical usability, large errors are involved. To avoid these errors depending on the spatial structure of image pattern, "two-dimensional simultaneous sub-pixel estimation" was proposed. However, it needs conditional branching control procedures such as scan field expansion and exception. The conditional branching control procedures make estimation instable and disturb the speed of processing. Therefore, the authors employ a paraboloid fitting: by using the least square method, a paraboloid is fitted with the image similarity values at nine points and the best matching point is obtained with sub-pixel order. It is robust against the image pattern and enables speed-up, but it still has error margin. The authors analyzed the error characteristics of the sub-pixel estimation using the paraboloid fitting. The error can be characterized by "a bias; a systematic error" and "dispersion; a random error." It was found that the magnitude of each error was different according to the sub-pixel values of the best matching positions. In this paper, based on the analysis, the authors proposed a novel accurate algorithm for 2D subpixel matching. The method does not need any iteration processes and any exception processes on runtime. Therefore, it is easy to implement the method on software and hardware. Experimental results demonstrated the advantage of the proposed algorithm.

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Keywords/Phrases

Search In:

Publication Years