Parallel Image Analysis: Theory and Applications, Volume 1
This volume deals with the following topics: 2-D, 3-D automata and grammars, parallel architecture for image processing, parallel digital geometry algorithms, data allocation strategies for parallel image processing algorithms, complexity analysis of parallel image operators. The contributions are written by leading experts in the fields of models, algorithms and architectures for parallel image processing.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Facilitating HighPerformance Image Analysis on Reduced Hypercube RH
TimeOptimal Digital Geometry Algorithms on Meshes with Multiple
A TimeOptimal MultipleQuery NearestNeighbor Algorithm on Meshes
A Linear Algorithm for Segmentation of Digital Curves
Some Notes on Parallel Coordination Grammars
Basic Puzzle Languages
Cooperating Systems of ThreeWay TwoDimensional Finite Automata
The Effect of Inkdots for TwoDimensional Automata
Thinning and Tracking
3-d image accepting adjacent alternating Turing machines array attachment set automaton binary image binary tree boundary of q C-grammar candidate points cell columns component configuration connected contains convex hull Corollary cosimple decomposition defined Definition deletion denote digital geometry distance transform edge elements finite automata Gong's hereditarily simple homotopy equivalence hypercube image analysis image processing implementation inkdot input tape integer iteration Lemma Let q LRS1 mapping mesh with multiple minimal non-simple set multiple broadcasting neighbors node non-cosimple non-empty nondeterministic nondeterministic finite automata parallel computers parallel coordinate parallel thinning algorithms pixels pixels or voxels preserves topology problem processor Proof Proposition regular hypercube result RH's SB's segment sentential form sequence sequential set of 1's set of q simple 1's skeleton solution sub-domains sub-iteration subset surface graph symbol T-attachment Takanami Theorem 4.1 three-way time-optimal Turing machines two-dimensional upper leaning point Vn X Vn voxels WN(p