论文信息 - Jigsaw puzzle matching using a boundary-centered polar encoding

Jigsaw puzzle matching using a boundary-centered polar encoding

Abstract A shape representation suitable for efficient matching (fitting together) of parts of boundaries of two-dimensional objects is described. This representation, which uses polar coordinate systems centered around curvature maxima and minima, is applied to the problem of fitting together curved jigsaw puzzle pieces. A program implementing these techniques is described.

Norman I. Badler | Gerald M. Radack | N. Badler | G. Radack

[1] Azriel Rosenfeld,et al. An Improved Method of Angle Detection on Digital Curves , 1975, IEEE Transactions on Computers.

[2] Herbert Freeman,et al. Shape description via the use of critical points , 1978, Pattern Recognit..

[3] Herbert Freeman,et al. Computer Processing of Line-Drawing Images , 1974, CSUR.

[4] Kiyoshi Maruyama. Study of visual shape perception , 1972 .

[5] Azriel Rosenfeld,et al. Angle Detection on Digital Curves , 1973, IEEE Transactions on Computers.

[6] Theodosios Pavlidis,et al. A review of algorithms for shape analysis , 1978 .

[7] Ming-Kuei Hu,et al. Visual pattern recognition by moment invariants , 1962, IRE Trans. Inf. Theory.

[8] Herbert Freeman,et al. On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

[9] John S. McDonald,et al. On the Measurement of Curvature in a Quantized Environment , 1975, IEEE Transactions on Computers.

[10] Franz L. Alt,et al. Digital Pattern Recognition by Moments , 1962, JACM.

[11] H. Freeman,et al. Apictorial Jigsaw Puzzles: The Computer Solution of a Problem in Pattern Recognition , 1964, IEEE Trans. Electron. Comput..