Nakamura, A.,
Two-Dimensional Connected Pictures Are Not Recognizable By Finite-State Acceptors,
IS(69), 1993, pp. 55-64.
BibRef
Embrechts, H.,
Roose, D.,
Wambacq, P.,
Component Labelling On A Mimd Multiprocessor,
IU(57), 1993, pp. 155-165.
BibRef
Latecki, L.,
Topological Connectedness And 8-Connectedness In Digital Pictures,
IU(57), 1993, pp. 261-262.
BibRef
Ziavras, S.G.,
Connected Component Labelling On The Blitzen Massively Parallel Processor,
IVC(11), 1993, pp. 665-668.
BibRef
Hobby, J.D.,
Generating Automatically Tuned Bitmaps From Outlines,
J. ACM(40), 1993, pp. 48-94.
BibRef
Biswas, P.K.,
Mukherjee, J.,
Chatterji, B.N.,
Component Labeling In Pyramid Architecture,
PR(26), 1993, pp. 1099-1115.
BibRef
Bloch, I.,
Fuzzy Connectivity And Mathematical Morphology,
PRL(14), 1993, pp. 483-488.
BibRef
Jiang, X.Y.,
Bunke, H.,
An Optimal Algorithm For Extracting The Regions Of A Plane Graph,
PRL(14), 1993, pp. 553-558.
BibRef
Chiavetta, F.,
Di Gesu, V.,
Parallel Computation Of The Euler Number Via Connectivity Graph,
PRL(14), 1993, pp. 849-859.
BibRef
Nicol, C.J.,
A Systolic Architecture For Labeling The Connected Components Of Multi-Valued Images In Real Time,
CVPR(93), pp. 136-141.
BibRef
Suen, C.Y.,
Wang, P.S.P.,
Thinning Methodologies For Pattern Recognition, World Scientific,
SINGAPORE, 1993.
BibRef
Ahn, J.W.,
Kim, M.S.,
Lin, S.B.,
Approximate General Sweep Boundary Of A 2d Curved Object,
GMIP(55), 1993, pp. 98-128.
BibRef
Cheng, J.C.,
Don, H.S.,
Segmentation Of Bilevel Images Using Mathematical Morphology,
IJPRAI(6), 1992, pp. 595-628.
BibRef
Kim, M.S.,
Ahn, J.W.,
Lim, S.B.,
An Algebraic Algorithm To Compute The Exact General Sweep Boundary Of A 2d Curved Object,
IPL(47), 1993, pp. 221-229.
BibRef
Arcelli, C.,
Sanniti di Baja, G.,
Euclidean Skeleton Via Centre-Of-Maximal-Disc Extraction,
IVC(11), 1993, pp. 163-173.
BibRef
Kalles, D.,
Morris, D.T.,
A Novel Fast And Reliable Thinning Algorithm,
IVC(11), 1993, pp. 588-603.
BibRef
Chen, Y.S.,
Comments On ``A Systematic Approaach For Designing 2-Subcycle And Pseudo 1-Subcycle Parallel Thinning Algorithms'',
PR(25), 1992, pp. 1545-1546.
BibRef
Loncaric, S.,
Dhawan, A.P.,
A Morphological Signature Transform For Shape Description,
PR(26), 1993, pp. 1029-1037.
BibRef
Saha, P.K.,
Chanda, B.,
Dutta Majumder, D.,
A Single Scan Boundary Removal Thinning Algorithm For 2-D Binary Object,
PRL(14), 1993, pp. 173-179.
BibRef
Toivanen, P.J.,
Image Compression By Selecting Control Points Using Distance Function On Curved Space,
PRL(14), 1993, pp. 475-482.
BibRef
Liang, E.H.,
Wang, E.K.,
An Efficient Method For Obtaining Morphological Skeletons,
PRL(14), 1993, pp. 689-695.
BibRef
Ragnemalm, I.,
The Euclidean Distance Transform In Arbitrary Dimensions,
PRL(14), 1993, pp. 883-888.
BibRef
Krishnapuram, R.,
Chen, L.F.,
Implementation Of Parallel Thinning Algorithms Using Recurrent Neural Networks,
T-NN(4), 1993, pp. 142-147.
BibRef
Hall, R.W.,
Optimally Small Operator Supports For Fully Parallel Thinning Algorithms,
T-PAMI(15), 1993, pp. 828-833.
BibRef
Rom, H.,
Medioni, G.,
Hierarchical Decomposition And Axial Shape Description,
T-PAMI(15), 1993, pp. 973-981.
BibRef
Shih, F.Y.,
Yang, C.H.T.,
On Solving Exact Euclidean Distance Transformation With Invariance To Object Size,
CVPR(93), pp. 607-608.
BibRef
Subramanian, K.G.,
Siromoney, R.,
Dare, V.R.,
Saoudi, A.,
Basic Puzzle Grammars And Isosceles Right Triangles,
IJPRAI(6), 1992, pp. 799-816.
BibRef
Habel, A.,
Kreowski, H.J.,
Taubenberger, S.,
Collages And Patterns Generated By Hyperedge Replacement,
LOD(1), 1993, pp. 125-145.
BibRef
Rosenfeld, A.,
Siromoney, R.,
Picture Languages-A Survey,
LOD(1), 1993, pp. 229-245.
BibRef
Chronological Bibliography Of Visual Formalism, Lod 1,
279-283.
Slowinski, K.,
Picture Words With Invisible Lines,
TCS(108), 1993, pp. 357-363.
BibRef
Culik II, K.,
Dube, S.,
Affine Automata And Related Techniques For Generation Of Complex Images,
TCS(116), 1993, pp. 373-398.
BibRef
Tapia, M.,
Chinese Lattice Designs And Parametric Shape Grammars,
VC(9), 1992, pp. 47-56.
BibRef
Chapter on Rosenfeld Bibliography for 1993 continues in
F.5. Path planning .