Name
Abstract | ||
|---|---|---|
This paper presents a procedure for matching shapes belonging to a sequence of time-varying images. Each shape boundary is first decomposed into convex segments and then a correspondence between boundary segments of two contiguous shapes is obtained by means of a tree search. Details of the decomposition and association algorithms are included. An example illustrates the procedure. |
Year | DOI | Venue |
|---|---|---|
1985 | 10.1016/0734-189X(85)90127-6 | Computer Vision, Graphics, and Image Processing |
Field | DocType | Volume |
Computer vision,Pattern recognition,Segmentation,Contiguity (probability theory),Algorithm,Image processing,Regular polygon,Artificial intelligence,Mathematics | Journal | 29 |
Issue | ISSN | Citations |
3 | 0734-189X | 9 |
PageRank | References | Authors |
4.35 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. F. Costabile | 1 | 386 | 36.14 |
| C. Guerra | 2 | 9 | 4.35 |
| G.G. Pieroni | 3 | 11 | 4.74 |