Showing papers in "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences in 1994"

On Container Width and Length in Graphs, Groups,and Networks--Dedicated to Professor Paul Erdös on the occasion of his 80th birthday--

Abstract: Graph parameters such as connectivity and diameter have been studied extensively due to their intrinsic importance in graph theory, combinatorics and their relations to (and applications in) fault tolerance and transmission delay in communications networks. The advent of VLSI technology and fiber optics material science has enabled us to design massively parallel processing computer systems and fast and complicated communications networks. All these systems increase their reliability by studying (among other) the existence of two (or more) disjoint paths connecting any two nodes. This paper addresses these issues by studying the width and length of containers in graphs and networks. In particular, the notions of w-distance and w-diameter on a graph are defined and studied which generalize both concepts of connectivity and diameter. Thses notions are also considered in finite groups. Other closely related parameters will be explored in the contexts of fault tolerance and routing. Known results are surveyed and open problems are offered for further investigation. Summary Japanese Page For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE.

An object extraction method using sampled active contour model

Abstract: This paper proposes a new method of contour extraction using active contour models for the purpose of image structuring. Active Contour Models, such as snakes, are based on energy minimization, which takes a great deal of computational time. In the proposed method, the active contour models consist of sampled contour points, and each sampled contour point is guided and moves in parallel by pressure exerted perpendicularly to the contour, attraction between neighbor boundary points, and repulsion from edge. Since each contour point is independently guided by a resultant force, the proposed method has the following characteristics : noise tolerance ; parallel execution ; and low computational cost. Experimental results on real pictures show the effectiveness of this method.

Distortion-complexity and rate-distortion function

Abstract: We define the distortion-complexity of a finite length string from a finite set. Assuming that the string is produced by a stationary ergodic source, we prove the equivalence between the distortion-complexity and the rate-distortion function of this source. >