VLSI curve detector

Abstract Line and curve detection find very important applications in image processing and pattern recognition. It is a key operation for line-like images and patterns. This paper presents a new VLSI architecture for implementing curve detection which has simpler control and interconnection structures and provides the capability to handle the backtracking in linear time. Firstly, we will propose a new curve detection algorithm which can be implemented by using the proposed VLSI architecture with extensive pipelining and parallel computation capabilities. The VLSI architecture proposed will find a curve of length n according to a certain figure of merit function in ( n + min( M , N )) time units, where M × N is the number of pixels in the input picture and n is the length of the curve to be detected. It can then perform the backtracking procedure and determine the coordinates of the nodes along the detected curve in N + [log 2 M ] + n time units. It will need O ( N × M × n ) time units, if using a uniprocessor. The algorithm partition problem is discussed. Verification of the proposed architecture is given. The important aspect of the curve detection algorithm-backtracking procedure is also studied in detail.

[1]  King-Sun Fu,et al.  Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture , 1986, Pattern Recognit..

[2]  Dana H. Ballard,et al.  Computer Vision , 1982 .

[3]  T. Pavlidis.  Algorithms for Graphics and Image Processing , 1981, Springer Berlin Heidelberg.

[4]  King-Sun Fu,et al.  Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  King-Sun Fu,et al.  VLSI architecture for dynamic time-warp recognition of handwritten symbols , 1986, IEEE Trans. Acoust. Speech Signal Process..

[6]  Concettina Guerra.  A VLSI Algorithm for the Optimal Detection of a Curve , 1986, J. Parallel Distributed Comput..

[7]  H. T. Kung.  Why systolic architectures? , 1982, Computer.

[8]  King-Sun Fu,et al.  Algorithm partition for a fixed-size VLSI architecture using space-time domain expansion , 1985, 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH).

[9]  H. D. Cheng,et al.  VLSI architectures for string matching and pattern matching , 1987, Pattern Recognit..

[10]  Kevin Q. Brown.  Dynamic programming in computer science , 1979 .

[11]  Charles R. Dyer,et al.  Curve Detection in VLSI , 1984 .

[12]  Arnold L. Rosenberg,et al.  Three-Dimensional VLSI: a case study , 1983, JACM.

[13]  King-Sun Fu,et al.  VLSI Arrays for Minimum-Distance Classifications , 1984 .

[14]  Raymond J. Offen.  VLSI image processing , 1986 .

[15]  Ugo Montanari,et al.  On the optimal detection of curves in noisy pictures , 1971, CACM.

[16]  Wei-Chung Lin,et al.  Space-Time Domain Expansion Approach to VLSI and Its Application to Hierarchical Scene Matching , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.