bluuebunny/crossref_metadata_2025_split huggingface dataset:
Proposal on infrared ray emission CT
Authors: Uchiyama Hiroki , Takezawa Takayuki , Abe Keisuke , Haku Shouken , Nakajima Masato , Yuta Shinichi 
Published: July 2007

AbstractThis paper presents a proposal for infrared ray emission computed tomography (IRECT). This is a method for visualizing the two‐dimensional physical quantum distributions (e.g., temperature, concentration) on an arbitrary transaxial layer of an object by calculating the infrared radiation intensity emitted from the object as the projection data. To verify the usefulness of this method, an experimental system with pyroelectric detector is developed for measuring flame temperature distribution and this system is applied to a Bunsen flame. The experiments yield good images of thermic intensity distribution in the cross section of the flame. In addition, the usefulness of this method in measuring temperature distribution is confirmed by comparing the results with thermocouple probe measurement.
Vulnerability of a communication network with a satellite
Authors: Hagihara Ken'Ichi , Masuzawa Toshimltsu , Tokura Nobuki , Ikeda Mitsuji 
Published: July 2007

AbstractThe vulnerability of an integrated communication network composed of a terrestrial network and a satellite network is discussed in a graph‐theoretic manner. A ground switching station (a switch board) is abstracted as a vertex, a wire and an antenna, respectively, for a communication with a satellite as an edge of a graph. As a measure of the vulnerability of a communication network we introduce anew the concept of “S‐connectivity.” Although the concept of S‐connectivity is obtained by generalizing the conventional idea of vertex‐connectivity, since it takes into consideration the difference in the reliability between a satellite as a wireless transistor and a ground station controlled by software, it appears suitable as a means to determine the vulnerability of a communication network consisting of a terrestrial network and a satellite network.This paper discusses: (1) What is the S‐connectivity when antennas that transmit to and receive from a satellite, are used on each ground station? (2) If ground stations exist which cannot communicate through the terrestrial network, at which stations should antennas be installed to enable communications with the minimum number of antennas via satellite? (3) When the number of edges of a terrestrial network is fixed, what kind of terrestrial network maximizes the S‐connectivity? (4) What are the computation times of algorithms for solving the preceding problems (1) and (2)?
A VLSI‐oriented interconnection network having self‐similarity
Authors: Tatsumi Shoji , Sakai Toshikazu 
Published: July 2007

AbstractThis paper proposes a construction method for the large‐scale multiprocessor system, which is composed of a large number of processors and memories. There can be two configurations for the large‐scale multiprocessor systems. One is the configuration composed of the switching network among processors and memories, as is seen in the case of the omega network. The other is the processor network which is the graph composed of processors, with the processor being regarded as a node. The interconnection network proposed in this paper belongs to the latter category. It is a VLSI‐oriented interconnection network, where the multiprocessor system is implemented on a silicon wafer. The method of construction is developed from the viewpoint of factual geometry, where self‐similarity is considered among figures. The basic unit of the interconnection network is the structure composed of the processor, memory and bus. The system is constructed by recursively using the basic units. To compare the proposed system with other typical VLSI‐oriented interconnection networks, such as the tree and the snowflake interconnection networks, the maximum distance between processors, the mean distance between processors and the maximum message density, which is considered as the maximum communication load for the routing and node processors, are calculated.The result verifies the effectiveness of the proposed interconnection network.
Interrupt handling in the loosely synchronized TMR system
Authors: Yoneda Tomohiro , Suzuoka Takashi , Tohma Yoshihiro 
Published: July 2007

AbstractThis paper discusses problems in the implementation of interrupt handling in the loosely synchronized Triple Modular Redundancy (TMR) system where synchronization, majority‐decision and fault diagnosis are performed by software. The method of solution for the problems also is discussed. The major problems are as follows: (1) For the interrupt coming into three processors with a certain time difference in the task progress, the consistency among the global areas of the processors must be maintained; (2) The synchronization must be maintained among processors, which do not recognize interrupts due to the interrupt‐inhibit period containing synchronization, and the processors, which recognized the interrupts; (3) When interrupts at different levels arrive at a processor, each processor must identify the interrupt with the highest priority consistently. To solve these problems, we have developed a multitask scheduler, which provides the variable representing the number of access to the global area, the flag indicating the interrupt‐inhibit area, and the variable keeping the record of the accepted levels. This scheduler also controls the interrupt process by mutually referring those variables and flags. The system is implemented in SAFE system, and the overhead in the interrupt handling was measured.
A redundancy reduction of black and white documents by an encoding system with line skip scanning
Authors: Okamoto Noriyoshi , Klkuchi Toshiyuki , Nakamura Osamu , Minami Toshi 
Published: July 2007

AbstractA new method is considered which integrates the READ scheme and the line skip scanning scheme, and nonreversible coding, which provides as good image quality as reversible coding. A binary document image was used. Its basic idea consists of decomposing the object image into small regions and examining the reconstructability of the image for each small region.It is expected that a high compression ratio will be achieved by changing the scanning density based on the results. Now, the change of scanning density is accomplished by line skip scanning and skipped line ranges from 1‐3. Also, the reconstructability of the image is determined by the strength of correlation which is examined by the relative distance distribution among the scan lines corresponding to the number of each skip line. As a result of experiments on ten kinds of test charts including the CCITT test chart, the compression ratio is 1:5.05 to 1:54.3. Therefore, in comparison with the READ scheme, about 59.7 percent of the compression ratio is improved. Also, it has been shown that 99 percent of all transmitted pixels is reconstructed exactly in terms of reconstruction accuracy.
A method for recognition of words spoken in noisy environment
Authors: Kamei Hiroyuki , Kawarada Hiroshi 
Published: July 2007

AbstractA method for recognizing words spoken in a noisy environment is proposed . A 23‐channel filter bank is used to analyze noisy speec h. The output of each channel is transformed into a pulse trai n. From the autocorrelation functions of these pulse trains, the pitch period of speech is detected and the spectrum is estimated at each fram e. Word recognition is carried out by DP‐matching algorithm using the distance measure weighted by the correlation coefficien t. The results of experiments where white noise, traffic noise, and an engine sound were used as additional noises show the effectiveness of this system.
Morphological analysis of neurons by computer
Authors: Yokoyama Kiyoko , Ishii Naohiro , Suzumura Nobuo 
Published: July 2007

AbstractOne of the most important problems in biology is the morphological classification of cells as well as analysis of the relation between the morphology and function of the cell. Such analysis requires the extraction of feature parameters from cell images and classification based on their correlations. This paper seeks to design an image database whereby a number of cell images is stored in a computer for calculation of feature parameters and for the retrieval and automatic classification of images. A new algorithm for image processing is developed for acquisition of cell images. A procedure is developed to store cell images for calculation of feature parameters and automatic classification. In the past, attempts have been made to describe single cell images in accurate detail (e.g., by three‐dimensional reconstruction of the cell image). However, those methods are not suited to the design of an image database in which a large number of cell images must be handled. From such a viewpoint, a method for morphological classification and feature analysis is developed whereby a cell image is represented by fewer feature parameters, making it possible to handle a large number of cell images. The method for acquisition of cell images, their storage and processing for feature extraction is systematically developed, arriving at a classification method based on those feature parameters. Factor analysis is applied to analyze the correlations among the feature parameters.
Extraction of roads from topological maps using a parallel extraction algorithm
Authors: Miyatake Takafumi 
Published: July 2007

AbstractOne of the most important techniques in drawing recognition and understanding is to extract the effective components from a complex image according to the purpose of analysis. This paper considers the map which is the most complex among images, and describes an automatic method to extract roads. In general, roads are represented in the map by parallel lines. Consequently, the extraction of roads from a map is formulated as a problem of extracting parallel lines. A method is proposed which directly extracts parallel lines from the image and describes the parallel lines by the spacing and the path of the central line. Two technical problems are contained in this approach. One is the parallel‐line extraction, which extracts parallel‐line areas (inside the parallel lines) from the image, and the other is the line vectorization, which determines the coordinates for the path line of the extracted area. For the latter, numerous proposals have been made such as line‐image thinning and line tracing, and the problem is almost solved. From such a viewpoint, this paper discusses primarily the former, i.e., the parallel‐line extraction. One of the difficult problems in the extraction of parallel lines from the image is the processing of the area where parallel lines intersect. A generalized expansion‐contraction of the image is proposed to solve this problem. The proposed method is applied to a map issued by the National Geographical Institute, and is verified as effective as a method of road extraction.
Matrix representation of programs within an intelligent link
Authors: Miyajima Jun , Endo Noboru , Nakamura Tadao , Shigei Yoshiharu 
Published: July 2007

AbstractThis paper presents an outline of a prototype intelligent link system proposed to combine “data transmission” and “data processing” and its software system. The generative program and its processing scheme are reported in detail. The intelligent link is n pairs of a general‐purpose pipeline processing system. It is an n‐stage one‐dimensional line of segments which consists of a transmission line and a processor. Each segment processes received data by the programs which tag along with its data. In order to decrease the system processing time and the processor idle time, fewer bits are employed to represent a program for the information transmission. Here we use a transition matrix method to describe transition of the operations in a program. First, we introduce the matrix properties and discuss applications of the matrix representation for generative programs. Secondly, we study how fewer bits can be used to represent a matrix and, as a result, find that less than 70% of the bits required to represent a matrix directly suffices in the proposed method.
Structural analysis of line patterns using distance transformation (DTLP)
Authors: Suzuki Hidetomo , Toriwaki Jun‐Ichiro , Shin‐Yashiki Hitoshi 
Published: July 2007

AbstractThis paper discusses the structural analysis algorithm for line patterns, based on the distance transformation of a line pattern by iterative local parallel processing. Although parallel processors have been applied recently to image processing, the processing of line patterns in the past was based primarily on the transformation of the object pattern into the list structure or symbol strings. Few studies have been made on the parallel processing algorithm for a line pattern. From such a viewpoint, this paper presents parallel‐type algorithms for loop counting, loop extraction and arc decomposition, among the procedures for processing line patterns. Properties of these algorithms also are discussed. The method proposed here is based on the distance transformation (Min. type) for line patterns we developed, and can be performed by iterative local parallel processing, in the same way as the distance transformation itself.
Basics of algorithms for processing three‐dimensional digitized pictures
Authors: Toriwaki Jun‐ichiro , Yokoi Shigeki 
Published: July 2007

AbstractThis paper presents basic concepts and fundamental algorithms for processing three‐dimensional digitized images (3D images). A 3D image is a pictorial datum obtained by measuring physical quantities distributed at every point in 3D space and arranging the measurements on a 3D array. First, we present several basic concepts concerning geometrical properties of 3D images, which include connectivity, the connected component, the Euler number, and deletability. Then we explain outlines of basic algorithms derived by using the forementioned concepts based on research results by the authors' group. Procedures referred to here are as follows: calculation of the Euler number, deletability test of 1‐voxels, shrinking, thinning, and border following. Finally, we add 51 references which may aid more detailed research; these references also will supplement the brief explanations and small number of procedures we are limited to in this article.
Pattern Data representation and management in image database systems
Authors: Sakauchi Masao , Ohsawa Yutaka 
Published: July 2007

AbstractData representation and management in the image database system are discussed. It is pointed out first that both efficiency of representation (amount of data) and the efficiency of processing and retrieval are important in the representation and management of data. From this viewpoint, various kinds of image and graphics representations are discussed, arriving at the viewpoint of “management of M‐dimensional data in N‐dimensional space.” The point data (0 in N data) and the N‐dimensional image data (N in N data) are considered. Various kinds of data structures such as KD tree, KDB tree, 2N partition tree and linear tree, are discussed and analyzed from the viewpoint of the preceding two characteristics. Especially, a tree‐type data structure (called BD tree) is proposed where the N‐dimensional rectangular region is used as the partition key. The structure and the performance are discussed indicating that the performance is better than in other structures. Examples of applications of the proposed data structure in the image database are discussed, as well as the possibilities of future applications.
Interval matching method of stereo‐image using dynamic programming
Authors: Ohta Yuichi , Masai Yasuyuki , Ikeda Katsuo 
Published: July 2007

AbstractIn the search for correspondence in the stereo vision, a general method is to use dynamic programming and search the correspondence for a pair of left and right scanning lines. In this case, the edge is often used as the unit for the matching, but the method has a problem in the processing of occlusion and noise. To solve this problem, this paper proposes a method in which the interval between two edges is considered as the unit of matching. Three components are proposed as the cost evaluation in the interval matching, which are compared by using synthesized images. As a result, it is seen that the evaluation based on the variance of pixel intensities in the intervals is stronger against noise than the method based on the intensity difference of the intervals, which has been considered as the general method for the evaluation of similarity. The interval matching, using the cost function based on the variance, is applied to the stereo aerial photograph of an urban area, verifying its usefulness.
Data Abstraction Technique for Relational Database Query Processing
Authors: Ohtani Takumi , Baba Takanobu , Inagawa Masayuki , Iwasaki Takao , Okuda Kenzo , Yamazaki Katsuhirc 
Published: July 2007

AbstractThis paper proposes a schema conversion approach for relational database query processing. The approach not only maintains high data independence by encapsulating the data and its physical structures for a query with the procedures that manipulate them, but also aims to achieve high‐speed processing by dedicating the procedures to individual functions. This approach is experimentally compared with the interpretive and compilation methods in terms of data independence, performance and the procedure program size. The following conclusions are drawn from the experiments.(1) Although the effect of the change in physical structure is greater than that of the interpretive approach in regard to data independence, only a limited number of parts are affected and they are easily reorganized by each dedicated procedure. (2) The performance is extremely close to that of the compilation approach regardless of the kind of computer and programming language. Furthermore, the overhead for calling the procedures can be further reduced with the use of microprograms and hardware. (3) Although the number of specialized procedures increases, this is compensated by the relatively small program size of each procedure.
Robot vision based on three‐dimensional model
Authors: Shirai Yoshiaki 
Published: July 2007

AbstractIt is desirable for flexible robot vision to have three‐dimensional models have no constraints are imposed on the scene. This paper proposes the use of geometric models generated during the CAD process to save model building efforts. Also, a hierarchical matching method to avoid search efforts for all possible attitudes of each model is proposed. Examples are described for three cases: 1) only a few surface normals are available; 2) all visible surface normals are available; and 3) range data are available. In all cases, efficient and flexible object recognition is realized by hierarchical matching based on three‐dimensional models.
representation of road environment understanding for a mobile robot by picture interpretation language PILS
Authors: Mori Hideo , Fudaba Izumi , Yokoyama Hiroaki 
Published: July 2007

AbstractThe picture interpretation language PILS·V‐1, which was already publicized, can handle essentially only the silhouette image, since the object and the background are separated in the pre‐processing. The system cannot handle a complex gray‐level image such as an outdoor scene. From such a viewpoint, PILS was improved as follows. The gray‐level image is partitioned into subregions based on the differential image in the pre‐processing. Each region is represented by global parameters such as the coordinate of the center, area, height, width and color. In the recognition stage, the object is recognized from the background, using the a priori knowledge of the object concerning the global parameters. This paper first discusses the representation of the gray‐level color image. Then using the outdoor road environment recognition by moving robot as an example, the programming in PILS for the object recognition algorithm based on the a priori knowledge is described. The result of computer processing is also shown.
SCOPE: Solid and colored object projection environment
Authors: Uchiki Tetsuya , Tokoro Mario 
Published: July 2007

AbstractSCOPE (Solid and Colored Object Projection Environment) is an architecture which displays and manipulates free‐form objects. In SCOPE, an object of any form is stored in PEARY, a three‐dimensional picture element (voxel) array. Thus a solid object can be represented with colors and volume, independently of the object modeling.In this paper, we describe the SCOPE architecture, the algorithm, and its evaluation by a simulator. This algorithm produces solid images using visible object searches from some viewpoint. An implementation of a fast SCOPE architecture using a parallel processor is also shown.
Availability of redundancy of projection data applied to reduce the noise sensitivity of reconstructed images
Authors: Kumazawa Itsuo , Iijima Taizo 
Published: July 2007

AbstractPreviously, in the processing of CT projection data, it was assumed that the measured values are independent at each point. Here it is shown that the actual data have a dependent property, which is called the redundancy of the projection data. It is shown that the redundancy is effective for the reduction of the noise sensitivity of the reconstruction formula. This paper evaluates the effect qualitatively and experimentally in comparison with the convolution method, which is the mainstream of the present reconstruction procedure. The reconstruction formula (formula II), which was derived in a previous paper to reduce the noise sensitivity utilizing the redundancy, is compared with the convolution method. The analytical comparison with the mean‐square error as the evaluation measure, as well as the visual comparison of the actually reconstructed examples, are performed.
Signal processing on a parallel pipeline‐structured data‐flow computer system
Authors: Oba Nobuyuki , Nakamura Tadao , Shigei Yoshiharu 
Published: July 2007

AbstractThere are still many problems left before the data‐flow computer can be realized, for example, execution control based on the data‐flow principle, system architecture and load distribution. This paper proposes a method for improving the speed of execution control, which distributes the matching process by using more than one execution control unit. The proposed units are connected in cascade with more than one operational unit. The structure is called PP. By operating the PP structure in a pipelined scheme, the execution control and operational processing with higher‐speed can be realized. It is also shown that a more efficient load distribution can be achieved by the parallel pipeline structure, composed of the omeganetwork connecting more than one PP. Then the digital signal processing is considered as an example of the processing in the data flow computer. By applying the stream notion to the time‐series data, the concurrent parallel pipeline property is utilized, realizing a high‐speed processing.