bluuebunny/crossref_metadata_2025_split huggingface dataset:
Job‐Dispatching Problem in Multiprocessor System for Image Processing
Authors: Shimojo Shinji , Miyahara Hideo 
Published: November 2009

AbstractWhen a picture is to be generated in a multiprocessor system for image processing, the picture generation time can be reduced by dividing the picture into several subpictures, which are then assigned to the processors for parallel processing. In such a scheme, there exists a trade‐off relation between the parallelism of the subpicture processing and the overhead for assignment. When the number of subpictures is increased, the parallelism is enhanced, while the time of the subpicture assignment is increased. By contrast, when the number of subpictures is small, the time for the subpicture assignment is reduced, while the parallelism is decreased. This paper discusses this tradeoff relation. In other words, discussions are made of the effect of the number of processors composing the multiprocessor system for image processing and the number of subpictures to be processed by the system, on the time for picture generation and the system efficiency. First, a discrete approximate solution for the picture generation time is derived using the Markov process. Then an approximate solution by the queuing network theory is presented. Those methods are applied to actual examples to derive numerical solutions, indicating that there exists the optimum number of subpictures minimizing the picture generation time. A simulation was performed, and the result indicated that the two methods of analysis agree well, further indicating the validity of the approximations introduced in the course of the analysis.
Corner Detection and Curve Representation Using Cubic B‐Splines
Authors: Yasumoto Yoshio , Medioni Gerard 
Published: November 2009

AbstractA new algorithm for digital representation of a curve is developed using B‐spline functions. This algorithm is applicable to both corner detection and curve representation. When used in conjunction with the previously developed subpixel precision edge detection algorithm, it provides an effective tool for interesting point detection, stereo matching, and motion parameter extraction. Beside corners, portions of a curve with significant change in curvature are detected as significant points (SCP's); B‐spline fitting through these points provides an efficient representation of the curve. The algorithm renders accurate corner detection and curve representation while compressing the data.
Feature Extraction and Classification of Cell Morphology in Response to the Cell Cycle
Authors: Tomura Motohisa , Kumaki Yoshinari , Minamitani Haruyuki , Nonmember Tsutomu Horikoshi, 
Published: November 2009

AbstractThe cancer cell exhibits a cyclic change in its morphology, and the discussion of the cyclic change in cell morphology is very important in cytology, considering the relation between the cell growth and the distribution of the protein granules. At present, this kind of analysis is made by human observation through a microscope. This paper describes a method which recognizes the cyclic morphological changes of the cancer cell by image processing. First, various feature parameters of the nucleus and the cytoplasm are calculated by computerized image processing. In the extraction of the cell image from the original image, the binarization rather than ternarization is applied separately to the nucleus and the cytoplasm. Based on the calculated feature parameters, three decision criteria are set based on the discriminant analysis to recognize the cell morphology. As a result of experiment, the recognition rate of 93.9 percent was achieved for the training data, indicating that the cell morphology can be recognized by a computer.
Self‐Organization of Recognition Cell Groups in Nerve Fields
Authors: Ikeda Nobuhiko , Torioka Toyoshi 
Published: November 2009

AbstractThis paper proposes a basic model for the self‐organization of the recognition cell group in the nerve field. The model is composed of nerve cell layers with mutual lateral inhibition. Also described is the condition for the self‐organization of the recognition cell groups for the n‐dimensional input and, based on that condition, the properties of the model are discussed. Then the behavior of the model is verified through computer simulation. As a result, the following observations are made. When a certain condition is satisfied, recognition cells are formed in a group. These cells respond only to the particular set of input patterns. By varying the training parameters, the recognition cell group is formed depending on the similarity between input patterns. For highly similar patterns, the recognition cell groups are formed in nearby locations in the nerve field. The recognition cell group is formed according to the frequency of the input pattern and its norm.
Network Performance of the Prodigy Parallel AI Machine
Authors: Suzuoka Takashi , Tanabe Noboru , Nakamura Sadao , Fujita Sumikazu , Oyanagi Shigeru 
Published: November 2009

AbstractThis paper analyzes the network performance of the Prodigy parallel AI machine, which is currently being developed. This machine is a multiprocessor system focusing on knowledge information processing problems with fine‐grain parallelism, and thus it is adequate for solving the problems whose structures can be treated as networks. A base‐m n‐cube network is proposed as an appropriate interconnection network for these problems and the proposed network is employed for the Prodigy interconnection network. It deals with the suitability of the base‐m n‐cube network to the Prodigy machine and the possibility of making a large system in addition to network performance through comparisons with binary n‐cube and mesh networks, where the performance figures are measured by simulation. The results of the comparison show that the base‐m n‐cube network is better than others for the Prodigy machine.
Analysis of a Road Image as Seen from a Vehicle
Authors: Zen Heitou , Sakurai Katsumi , Kobayashi Tetsuya , Ozawa Shinji 
Published: November 2009

AbstractThis paper proposes a method to record three‐dimensional (3‐D) geometry of a road from a single‐eye image. Although generally it is impossible to obtain a 3‐D information from a single image of a road edge, this becomes possible by adding information of the road from its design conditions. This paper describes a method to calculate the model parameters from the edge of a traffic lane in an image of a road, after presenting a 3‐D model of a road based on its design conditions. In the proposed model it is assumed that the shapes of the center line of a road seen in horizontal and vertical planes consist of alternative straight lines and curves. The 3‐D shape of a road using this assumption can be classified into four categories. First, the parameters for a pair of parallel straight lines connected to an adjacent curve are calculated. Then the parameters of the curve connected to the straight lines are calculated. A model having such synthesized road edges was computer‐simulated, giving the maximum relative error of the parameters of 12 percent. Images of road edges photographed from a vehicle on an actual road were processed manually for comparison, giving a maximum relative error of 21 percent with reference to the design data of the road.
Aliasing Probabilities and Weight Distributions of Several Codes
Authors: Iwasaki Kazuhiko , Nishimukai Tadahiko 
Published: November 2009

AbstractSignature testing is proposed for integrated circuit testing. One of the problems in signature testing is that not all the errors contained in the test response from the tested circuit can be detected (aliasing error). In this paper, the following results are shown: (1) utilizing the property of the maximum distance separable code, the aliasing probability of the multiple‐input signature register (MISR) is formulated. It is shown that the aliasing error probability of the MISR does not depend on the selected polynomial. In addition, it is shown that there is no fluctuation as is observed in the case of single‐input linear feedback shift registers (LFSR); (2) the aliasing error of the multiplexed MISR based on the primitive polynomials is analyzed using the weight distribution of the Reed‐Solomon codes. It is also shown that there is no fluctuation as is observed in single‐input LFRS; (3) the aliasing probability for single‐input LFSR is analyzed using a computer program. It is verified that the aliasing probability of single‐input LFSRs has different properties depending on the selected primitive polynomial. The fluctuation in the aliasing probability is observed.
A Note on Image Registration Based on Geometric Correspondence between Two Levels of Extended Pyramid Structure
Authors: Sone Mitsuo , Sakauchi Masao , Onoe Morio 
Published: November 2009

AbstractThe approach based on the pyramid structure of an image is used widely in image re‐registration. However, in the traditional pyramid structure, 2×2 pixels are placed in correspondence to a pixel in the immediate upper level, which deprives the flexibility of the image size compression. Hence, this paper presents an extended pyramid structure where m × n pixels are placed in correspondence to a pixel in the immediate upper level. Restricting the correspondence between levels to be geometric, not the similarity correspondence, the upper‐left candidate position and the best upper‐left position are defined for the template image at each level, and the range of search at each level is discussed. Then the image in each level is defined. A method is presented wherein the proposed method is applied to the registration of images.
Finding a Feasible Schedule on a Tree‐Connected Processor System
Authors: Kawaguchi Tsuyoshi , Kyan Seiki , Onaga Kenji 
Published: November 2009

AbstractA tree‐connected processor system (TPS) is a system in which m processors are connected in the form of an in‐tree or out‐tree. Each job arriving at a TPS flows on a directed path, from a processor specified for the job to the root (or on a directed path from the root to a processor specified for the job), and is processed by processors lying on the directed path. This paper discusses the feasibility decision problem on a TPS. It is a problem to decide whether or not each job can be processed within its deadline from its arrival time, and to find a schedule if the processing is feasible which realizes the processing. As a result for general TPS's, it is shown that the problem can be solved in O(mn log n) time for jobs with unit processing times, where m is the number of processors and n is the number of jobs. Especially, an algorithm proposed for TPS with an in‐tree structure is on‐line and can be used even when the information concerning jobs is obtained only at their arrivals.
A Design Method of Network Operating Systems Based on the Concept of an Object
Authors: Takahashi Kaoru , Ohta Yoshiyuki , Shiratori Norio , Noguchi Shoichi 
Published: November 2009

AbstractThis paper aims at an improvement of the software productivity of the system and proposes a software design method for network Os. In this paper the network Os is defined as a system composed of the following two functions:(1) The function constructed on the existing OS, realizing a uniform access to the distributed resources; and (2) the interface between the forementioned function and In the proposed design, (called network Os kernel) is composed as a set of objects existing in the problem domain related to the network Os. As a result of the design, the actual structure of the system and the actual objects are reflected directly on the software design which improves the understanding and the maintenance of the system.The interface between the network Os kernel and the existing Os is introduced to achieve the portability of network Os kernels. It is expected that by applying the design method based on the forementioned principle, the software productivity of the network Os will be improved. As an application example of the proposed design method, an LAN‐oriented network Os was designed and implemented experimentally.
A Coding Method of Multicolored Images Using Dynamic Pattern Generator
Authors: Ishii Ikuo , Kagaya Yoshimi , Yamato Junji , Makino Hideo 
Published: November 2009

AbstractThe mosaic method and geometric method have been used for coding the multicolored image. This paper proposes a dynamic pattern generation method aiming at a more faithful image representation. In the proposed method, the color boundary is extracted from the original picture. The result is divided into smaller blocks, and the pattern code is generated for each block.A different set of patterns is defined according to the joining state of the color boundary to the adjacent already‐encoded blocks. By this scheme, a variety of patterns can be generated by a limited coding complexity. When patterns with high occurrence frequencies are encoded by 4 bit and those with low frequencies by 8 bit, approximately 9500 kinds of patterns can be provided. Approximately 90 percent of the actually appearing patterns belong to the patterns encoded by 4 bit, and the coding efficiency is improved.The color of the region surrounded by the color boundaries should be specified only for the case where the color cannot be determined from the joining relation from the adjacent blocks. Consequently, the color specification data occupies only 10 percent of the total code. Since a large number of patterns can be prepared, an image faithful to the original picture can be restored.
An Algorithm Using Modular Arithmetic for the Subset Sum Problem
Authors: Tachibana Toshiro , Nakano Hideo , Nakanishi Yoshiro , Nakao Mitsuru 
Published: November 2009

AbstractIn this paper, an algorithm is developed for the subset sum problem in connection with public key cryptosystems. It is known that the subset sum problem based on a super‐increasing sequence of numbers can be solved simply and in a polynomial time. It is known also that the subset sum problem based on general sequences of numbers is NP‐hard, and the difficulty of the problem varies especially depending on the density.Thus, this paper proposes an algorithm using modular arithmetic for the subset sum problem based on general sequences of numbers. The basic idea of this algorithm is that “the largest number in a sequence of numbers A= (a1, …, an) is transformed to a super‐increasing number by modular arithmetic.” The advantages of the algorithm are investigated by experiment, and it is shown that by the properties of problems used, this algorithm is an effective method for the subset sum problem based on general sequences of numbers, especially “the case where the density is close to 1,” where the existing method is weak.
Point Source Illumination Stereo for Objects with Uniform Reflectance
Authors: Iwahori Yuji , Kamei Hiroyuki , Yamaguchi Sholchiro 
Published: November 2009

AbstractIn an earlier report, a point source stereo method was proposed which determines the distance from the viewpoint to the surface element as well as the inclination of the element surface for the completely diffusive surface based on five density images obtained by a point source illumination. The present paper proposes a new method along the line which can determine accurately the distance distribution for the measurement in the general environment from the illumination equation with the intensity resolution of some 8 bits. A diffusive surface is considered which may contain any inclination but has a uniform reflectance over the entire surface. The distance distribution is determined by the following two procedures.In procedure 1, the common reflectance is determined by selecting the surface element with the maximum luminance in each image and combining the data.In procedure 2, the uniform reflectance is used as the constraint, and the distance distribution is determined for each surface element.The proposed method is called the solution by combined maximum luminance surface elements. An algorithm (three‐source stereo method) was developed for the case of the continuous surface, where t h e distance distribution can be determined using only three images. An experiment was made for the proposed method using an 8‐bit quantized image for a diffusive object. As a result, it is shown that both five‐source and three‐source methods can determine accurately the distance distribution with accuracy within 1 percent from the quantized intensity image data, for the measurement in the general environment.
A Simple Algorithm for Finding a Maximum Clique and Its Worst‐Case Time Complexity
Authors: Shindo Miklo , Tomita Etsuji 
Published: November 2009

AbstractThis paper proposes a new algorithm MAXCLIQUE which finds a maximum clique in an undirected graph with n vertices, and shows that its worst‐case time complexity is O(2n/2.863). For the dual problem of finding a maximum independent set of vertices, Tarjan et al. already have proposed an algorithm of worst‐case time complexity O(2n/3) [2]. However, by comparison, our algorithm is remarkably simpler, and it was confirmed that it runs faster when two algorithms were used for several random graphs and their average running times were measured.
A Highly Parallel Processor CAP
Authors: Ishii Mitsuo , Ikesaka Morio , Ishihata Hiroaki 
Published: November 2009

AbstractThe aim of this study is to apply the unprecedented high‐speed computing made possible by parallel processing to a wide range of problems such as computer graphics. A highly parallel cellular array processor, the CAP‐256 has been developed in which 256 high‐performance processors, called cells, are connected together. The CAP‐256 includes a function by which a generated image is displayed in real‐time, as well as a function to construct various kinds of [inter‐processor] communication networks (topologies). A VLSI chip has been developed which integrates the communication and synchronization functions required for parallel processing, as well as the I/O function for the image. Using this VLSI chip, the cell was implemented in a compact form, and a small‐sized high‐performance parallel computer was implemented.To operate the cell, software called the cell OS (operating system) was developed. The software environment which has been implemented makes it possible to easily develop and efficiently execute application programs based on message communication. An image was generated using parallel ray‐tracing which has three to four times higher performance than that of the general‐purpose FACOM M‐380 mainframe computer. The authors are also attempting to develop applications for CAD problems such as automatic wiring as well as scientific calculations. The versatility of the CAR‐256 has been verified.
Reconstruction Algorithm for Cone‐Beam X‐Ray CT Using Inverse Filtering
Authors: Matsuo Hiroshi , Iwata Aklra , Suzumura Nobuo , Horiba Isao 
Published: November 2009

AbstractThis paper proposes a reconstruction method for the 3‐D distributional image of the absorption coefficient of the object. In the method, a cone‐beam X‐ray source and a 2‐D detector array are placed in confronting positions on the opposite sides of the object. By rotating them 360 deg., the projection data are acquired, and then the inverse filtering is applied. This is a reconstruction problem from an incomplete projection data.In this paper, the compound image is constructed by backprojecting the projection image directly along the locus of projection. The inverse filtering is applied to the result to determine the 3‐D distribution image of the absorption coefficient of the object. In the defined geometrical system for the measurement, the inverse filtering cannot essentially be applied since the impulse response is space variant. Consequently, a nonuniform sampling coordinate system is defined to make the impulse response space invariant.The inverse filter function is derived from the Hankel function by utilizing the symmetry of the impulse response in regard to the axis of rotation. Furthermore, to stabilize the inverse filtering, a window function is employed which considers the space‐dependence of the incompleteness of the projection image in the frequency domain. Finally, the usefulness of the proposed reconstruction method is verified by a computer simulation.
A HIGH‐Speed LAN Model Using an Information‐Updating Algorithm
Authors: Saitoh Akinori , Tsushi Takeshi , Tsujino Yoshihiro , Tokura Nobuki 
Published: November 2009

AbstractLocal area networks (LANs) such as Ethernet provide cheap, high‐speed communications. Here we present a new high‐speed local area network model in which the LAN is configured with node‐processors which halt and/or recover asynchronously. We also propose an algorithm for dealing with the problem of information‐updating with a proof of the correctness of the algorithm.
Universal Fault‐Tolerant Hypercube Architecture without a Switching Mechanism
Authors: Ishikawa Tsutomu 
Published: November 2009

AbstractThis paper proposes a new universal fault‐tolerant hypercube architecture. This architecture is obtained by constructing a basic fault‐tolerant hypercube and expanding it using the product of graphs. The basic cube is constructed by partitioning all processing elements (PEs) into subsets with weak connectivity using the Hamming distance between PE numbers and by connecting all PEs in each subset to a spare PE through buses. This architecture can maintain the original network topology and size without the addition of any switching hardware and can be applied to any size hypercube. Moreover, because the number of spare PE ports is equal to or fewer than the number of original PE ports, the same kind of PE can be used for both original PEs and spares.
A Method of Extracting Similar Figures Using Polar Features
Authors: Nagao Tomoharu , Agui Takeshi , Nakajima Masayuki 
Published: November 2009

AbstractRecently, there has been active research on image recognition technology using computers. It is necessary for image recognition to extract some elements automatically, such as straight lines, circles, numerical letters and symbols from a picture. There are many cases where the extraction of such elements is not easy because some overlap others. This paper describes a method of extracting overlapped elements separately from a binary picture.The method can extract an element which has a constant shape with arbitrary size or rotation angle, or with both an arbitrary size and an arbitrary angle. Also, it uses both a single key point and several feature points on the model of a figure to be processed. The extraction is carried out by checking if there are several pixels corresponding to the feature points, when each pixel is regarded as a key point of the model.This paper describes the algorithm of the method, a method of extracting some important straight lines and circles in the picture using the algorithm, and experimental applications of the method to mechanical drawings. The results of the experiments demonstrate a successful extraction of straight lines, circles, arrows, and numerical letters, and this confirms the usefulness of the proposed method.