bluuebunny/crossref_metadata_2025_split huggingface dataset:
Highly accurate segment detection using hough transformation
Authors: Junji  , Ikuo  , Hideo  , Toshinori  
Published: July 2007

AbstractAlthough the Hough transformation is a powerful method to detect segments in an image, it requires not only a vast amount of memory but also a long processing time when a highly accurate detection is demanded. This paper proposes a new method of detecting segments with high accuracy using the Hough transformation without increasing the amount of memory. Unlike the conventional segment detection method in which the detection process is based on the parameter plane, this new method feeds the process back to the image plane from the parameter plane. Another feature of the method is the elimination in the parameter plane of Hough curves which are derived from pixels in the image plane constituting already detected segments. Experiments show that this method detects segments with a high accuracy from “noisy” images including many long and short segments.
A Learning method based on partial structures of explanations
Authors: Masayuki Numao,  , Masamichi  
Published: July 2007

AbstractThe learning process of macro‐operators is efficient since it is guided by given operators. By extending this method, a learning method of macro‐operators is proposed based on partial structures of explanations. Although until now macro‐operators have been used only for deductive learning that improves execution speed, the proposed method also acquires new knowledge by using hypothesis generators, i.e., it uses the explanations involving hypothesis generators to carry out induction. We demonstrate deductive and inductive aspects of our method by an example of logic circuit design and English‐Japanese translation.
A multiple‐window display
Authors: Taichi Nakamura  , Tsukasa Maejima  , Syouhei  
Published: July 2007

AbstractA hardware‐controlled multiwindow display is one multiwindow display scheme which makes high‐speed display possible. However, the locations of the windows for an overlapping display are restricted due to limits on the access speed of the window buffer which is storing the window image. In order to deal with this problem, this paper considers a system with a buffer for speed adjustment. A display device was constructed based on the proposed concept, and its performance was evaluated. As a result, for the cases of one and nine windows, 21 times and 147 times faster manipulation rates, respectively, were realized in manipulations such as window shifting, as compared with a software‐controlled window display. In order to examine the effect of window manipulation on drawing performance, the drawing time was measured for cases with window manipulation and without it. As a result, it was shown that there is no significant difference in the processing time, and it was verified that the drawing performance is not degraded by window manipulation.
Component image filing system for image synthesis
Authors: Inoue Seiki , Members Masahiro Shibata , Nonmember Eisuke Nakasu 
Published: July 2007

AbstractIt is necessary that a database systematically store and manage various kinds of images and quickly synthesize a new image using the stored images. This paper describes a new method to manage material image data which are suitable for image synthesis and the synthesized images. The method uses “component images for synthesis,” each of which is based on its meaning such as “flower” or “person.” These are stored and managed to synthesize an image. Unlike conventional methods, this method allows a stored synthesized image to be altered easily. The usefulness of the method was confirmed by an experimental system. The system can store standard TV images and high‐resolution images (for High‐Vision images and print images) which can be used for the synthesis of an image.
Mobile robot control by neural networks
Authors: Member Shigemi Nagata , Watanabe Nobuo , Nonmembers Kazuo Asakawa 
Published: July 2007

AbstractA structured hierarchical network model that enables time‐series pattern processing for robot control also is proposed. The network is divided into two types of subnetworks connected by special units called short‐term memory units. The short‐term memory unit holds its state for a certain period of time. The effectiveness of these developments was verified by applying them to the control of a mobile robot equipped with many sensors. Neurocomputers, which are based on the brain, are flexible information processors composed of a network of many interconnected neuron‐like elements (neurons or units), and are capable of advanced parallel distributed processing and learning. This paper describes first a multilayered neural network model based on the layered structure of the brain and the principle of its operation. Then a fast learning algorithm called pseudoimpedance control is proposed. The algorithm handles behavior in the learning process of the multilayered network as a second‐order forced vibration system.
An extraction method for same figure using polar features
Authors: Nagao Tomoharu , Agui Takeshi , Nakajima Masayuki 
Published: July 2007

AbstractImage recognition technology using computers has been active recently. In image recognition, it is necessary to automatically extract elements such as straight lines, circles, numerical letters, and symbols from a picture. There are many cases in which the extraction of such elements is not easy because some elements overlap. This paper describes a method for extracting individual overlapping elements from a binary image. This 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. The method uses a single key point and several feature points on the model element to be extracted. The extraction is carried out by checking if the pixels corresponding to the feature points are present, with each pixel regarded as a key point of the model. This paper describes the algorithm, 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 the successful extraction of straight lines, circles, arrows, and alphanumerics, and this confirms the usefulness of the proposed method.
A Motion Detection Method on Video Image by Using Hierarchical Pixels
Authors: Tominaga Hideyoshi , Komatsu Naohisa , Miyashita Takeshi , Member Tsuyoshi Hanamura, Associate 
Published: July 2007

AbstractIt is not easy to extract significant information from image data concerning the motion and the structure of an object, but this technique is indispensable to the future development of video coding and recognition of a moving object. The block matching method [1] is employed widely as a motion detection method in the motion‐compensated interframe coding. However, it has a problem in that the motion is estimated by the prediction error power minimization condition, which may lead to an instability in accurate motion detection. This paper proposes a new block matching method that has the following features: the motion is estimated and detected by stepwise switching from larger block size to smaller block size; by this scheme, the motion detection accuracy and the spatial resolution can be improved, and the processing complexity can also be reduced without degrading the detection accuracy.
Design of a recognition dictionary using artificially distorted characters
Authors: Ishii Kenichiro 
Published: July 2007

AbstractOne of the serious problems in developing an optical character reader (OCR) is designing a dictionary of handprinted characters which requires a tremendous amount of character data for training. This paper considers training by artificially distorted characters instead of handprinted ones in the design of a dictionary. The feasibility and the usefulness of the scheme are examined. In the experiment, 26 alphabetical characters are employed. The characteristic loci proposed by Glucksman are used as the features, and the nearest‐neighbor method is used in the classification. The recognition result of test data indicated that the dictionary designed by artificially distorted characters has almost the same performance as the dictionary designed by handprinted characters. The correct recognition rates are 98.6 percent for the former and 98.9 percent for the latter. By the training where a part of the handprinted characters are replaced by the artificially distorted characters, a performance exceeding that of the training using only handprinted characters is realized, with the correct recognition rate of 99.2 percent. Thus, it is verified that the proposed method is a useful substitute to the method by collecting handprinted characters. It is shown also that by observing the distorted characters in the feature space, the stability of the features against distortion can be evaluated.
Precise Visual Inspection of LSI Wafer Patterns by Local Perturbation Pattern Matching Algorithm
Authors: Matsuyama Yukio , Iwata Hisafumi , Kubota Hitoshi , Nonmembers Yasuo Nakagawa, 
Published: July 2007

AbstractA new defect detection algorithm that compares grayscale images of actual patterns and an automatic visual inspection system implementing this algorithm have been developed. The objective is to detect defects reliably down to 0.3 μm in LSI photoresist patterns on a silicon wafer. To detect defects reliably while remaining uninfluenced by tiny differences between two images of satisfactory patterns, the images are matched in local windows by perturbing one image in the x‐y plane and in the brightness direction against the other image. The resulting unmatched regions are recognized as defects. One unique feature of the algorithm is its utilization of polarity changes in the subtracted images during the perturbation for deleting tiny differences between two images. All processing can be done in real time by local, one‐pass operators. The developed automatic visual inspection system has achieved a 100 percent detection rate for defects down to 0.3 μm.
An algorithm for determining shape descriptors based on video‐rate one‐pass image processing techniques
Authors: Yoda Haruo 
Published: July 2007

AbstractThis paper proposes a hardware‐oriented method of computation for determining the shape descriptors of individual figures and which processes in real‐time at the video rate the input signal obtained by raster scanning. The method consists in the following techniques: (1) The connectivity of the figure on a raster is represented by a sequence of attribute symbols; (2) the attribute symbol sequence of an arbitrary raster is generated automatically; (3) the descriptors of the figure are calculated cumulatively by referring to the attribute symbol sequence. By the proposed method, an accurate and complete representation is obtained for any complex figure with intricate placements.
Performance Evaluation of the Clustered Multiprocessor System
Authors: Takaki Yasushi , Horiguchi Susumu , Kawazoe Yoshiyuki , Shigei Yoshiharu 
Published: July 2007

AbstractA multiprocessor system with bus connections has a throughput which may be reduced significantly due to the bus conflict. One approach to ease this conflict is to group processors into a few clusters. This paper presents a clustered multiprocessor prototype called “MUGEN” and the systems software implemented. Its performance also is disusssed. As for the systems software, ext‐C and para‐C languages are introduced that are developed to express parallelism explicitly. Also, the par‐C preprocessor (P3C) that translates a standard C program into a parallel program written in para‐C is introduced. Finally, the Livermore loop results are presented to measure the performance.
Evaluation of pointing efficiency influenced by the difference of bit‐map resolution
Authors: Nishinaka Yoshiyuki , Tsujino Yoshihiro , Tokura Nobuki 
Published: July 2007

AbstractThe authors have proposed several pointing methods (a combination of pointing device and the controlling software), aiming at the improvement of the user interface using the pointing device. Experiments have been made to evaluate the effect of those techniques on the pointing efficiency, such as the time for pointing, the work area and the ratio of unsuccessful pointing. This paper assumes the high‐resolution display, which will be developed in the future, together with the progress in the computer performance. The pointing by a mouse is considered, and the effect of the screen resolution on the pointing efficiency is examined. As a result, it is seen in the case of the high‐resolution display that the nonlinear technique, where the cursor moves as a nonlinear function of the speed of the mouse, is useful in reducing the working area on the desk and the time required for pointing.
Trademark: Multimedia image database system with intelligent human interface
Authors: Kato Toshikazu , Fujimura Koreaki , Nonmember Hiroyuki Shimogaki, 
Published: July 2007

AbstractAn experimental multimedia database system TRADEMARK is being developed. This system includes image processing facilities as the primitive data operations. It provides (a) automatic image data registration and automatic indexing by abstracted image representation, (b) similarity retrieval from actual visual examples, and (c) multimedia document formatting of retrieved data. Similarity retrieval in this system also permits handwritten and rough sketches as visual examples. Its ability in similarity operations is also evaluated experimentally. The design principle proposed here is based on a hyperobject‐oriented model which has the following features: (i) knowledge base‐like representation of object world, (ii) extensive architecture by deduction of logic database, and (iii) AI‐oriented human interface.
A model of visual motion perception for movements on a background
Authors: Yoshida Chiaki , Watanabe Akira 
Published: July 2007

AbstractThis paper proposes a new model for the human visual motion perception mechanism. The model can detect in a pertinent way the direction of motion of the object, even if the object moves in a background with a complex luminance distribution. When the object has such a background, the information concerning the object motion inevitably contains the disturbances due to the luminance distribution of the background. In the model for the motion perception mechanism up to now, however, this point has not been considered at all. This paper takes the view that the perception of the motion with such a background is essential in understanding the motion perception mechanism. Psychophysical experiments are presented to provide an insight into the motion perception mechanism for movement with a background.
The result of the experiment suggests that there exist two processing stages in the motion perception. The first stage is to fix the position of the moving object at a particular position in the visual field, and the second stage is to detect the movement of that position. Using a spatio‐temporal filter simulating the receptive field, a model composed of two such stages is constructed. A computer simulation is conducted to examine the validity of the method, and a result agreeing well with the human psychophysical characteristic is obtained.
Three‐dimensional tomographic image reconstruction from cone beam projections by single scanning method
Authors: Kudo Hiroyuki , Saito Tsuneo 
Published: July 2007

AbstractThe single‐scanning method has been proposed as a data acquisition method for reconstructing the three‐dimensional CT image, where a confronting pair of the cone beam X‐ray source and the planar detector are rotated on a circle surrounding the object. This paper discusses the problem of reconstructing the three‐dimensional image from the cone beam projection obtained by such a method. The traditional method of image reconstruction for this method is an approximation based on the two‐dimensional CT image reconstruction, and has a problem in that the quality of the reconstructed image is deteriorated when the circle on which the X‐ray source is moved has a small radius. First, a method is presented by which the problem of image reconstruction by the cone beam projection is reduced to the reconstruction problem by the three‐dimensional Radon transform. It is shown that the information required for the image reconstruction by the inverse three‐dimensional Radon transform cannot be obtained completely by the single‐scanning method. Then the image reconstruction by the two‐dimensional incomplete Radon transform is extended to the three‐dimensional case, and then applied to the image reconstruction by the cone beam projection. By this method, a mathematical strict image reconstruction can be achieved even by the single‐scanning method. The forementioned problem in the traditional method is now solved.
A method for threshold selection using minimum filtering
Authors: Toriu Takashi , Iwase Hiromichi , Gotoh Toshiyuki 
Published: July 2007

AbstractAs a binarization threshold selection method to utilize fully edge information, a method has been proposed to select the threshold so that the edge and boundary are as close to each other as possible. In such a method, the binarization actually is performed for various threshold values, and the degree of coincidence is calculated. Consequently, a very large processing time is required. The degree of coincidence is defined as the ratio between the number of boundary points in the edge region to the total number of boundary points in the image.The authors have devised a method which can determine with a high speed the number of boundary points for each threshold without actually performing the binarization. In this method, the result of applying shrink filtering after binarization is the same as that of applying the binarization with the same threshold after applying the minimum filtering.By utilizing this property, it is shown that the difference of the cumulative histograms between the original image and the result of processing by the minimum filter is the same as the number of boundary points for the threshold. Furthermore, the following property is shown by extending the method. The degree of coincidence between the edge and the boundary is defined as a two‐variable function of the threshold of edge detection and the threshold of binarization. Then it is shown that the degree of coincidence between the two can be calculated for any threshold without actually detecting the edges and boundaries.By utilizing this property, not only the threshold for binarization of the original image but also the threshold for the differentiated image to detect the edge can be determined simultaneously in an optimal way without necessitating a large amount of computation.
An on‐line error‐detectable high‐speed array divider
Authors: Takagi Naofumi , Yajima Shuzo 
Published: July 2007

AbstractThis paper proposes an on‐line error‐detectable high‐speed array divider. The divider is based on the high‐speed division algorithm using the redundant binary representation. It can execute an n‐bit division in a computation time proportional to n, has a regular cellular array structure suited to LSI implementation, with the hardware complexity proportional to n2, and a feature that any error caused by a single cell fault can be detected during the normal operation. By utilizing the locality of the computation in the divider, the on‐line error detection is realized based on the check by the residue code for the dividend, divisor, quotient and the remainder, as well as some other additional checks.
Interpolation algorithm for unequally spaced image data with image quality correction capability
Authors: Seto Yoichi , Komura Fuminobu , Tsuboi Akira , Hamano Nobuo 
Published: July 2007

AbstractAn image interpolation algorithm considering the sensor aperture characteristics of unequally spaced image data is presented.Recently, it has become possible to gather images by a high spatial resolution sensor on a satellite. Precision image processing is required to correct images which have blurs and geometric distortions due to the sensor characteristics.To realize precision image processing, we propose an unequally spaced interpolation filter with image quality correction capability. It consists in a restoration filter, and equally and unequally spaced interpolation filters.Image quality improves by about 15 percent in unequally spaced regions, and interpolation accuracy of less than 0.5 in gray levels is obtained. This is shown by evaluation experiments using thematic mapper sensor‐type simulation data.
A new neuron model “cone” with fast convergence rate and its application to pattern recognition
Authors: Fukumi Minoru , Omatu Sigeru , Teranishi Masaru 
Published: July 2007

AbstractThis paper proposes a new neuron model “analog coupled neuron (a‐CONE)” with two sigmoid functions which is applied to parity and pattern recognition problems to show its ability. Also, a digital‐CONE (d‐CONE) capable of providing a digital output is proposed and it is trained by using a back propagation (BP)‐type algorithm. Moreover, it is shown that its speed of convergence in learning was faster than that of the standard BP. The a‐CONE presented here has two kinds of sigmoid functions f1 and f2 mapping an input into an output. The function f1 provides an output response of the neuron while the derivative in learning is given by both f1′ and f2′, where f1′ refers to the derivative of f1 with respect to weighted sum of input signals. This allows a fast convergence rate to be obtained in learning. From simulation results, it is shown that the a‐CONE has a rapid convergence rate in learning compared with the conventional BP and the learning algorithm of d‐CONE networks, and produces a noise‐tolerant mapping in the pattern recognition.
Software reliability growth model for testing‐domain
Authors: Ohtera Hiroshi , Yamada Shigeru , Narihisa Hiroyuki 
Published: July 2007

AbstractTo evaluate the reliability of software quantitatively, a test is executed at the final stage of software development. Then errors existing in the software are corrected. In the testing phase, the functions and modules actually tested in the software are related closely to the quantity and quality of the imposed test case, and increase with the progress of the testing.In this paper, the set of functions and modules affected by the test in the software is called testing‐domain. A software reliability growth model is discussed, where the increase/expansion of the testing‐domain is assumed to be related to the error detection of the software errors. A result is shown where the model is applied to the actual software error data. A comparison is made from the viewpoint of matching with other software reliability growth models.
Distributed collection of message exchange sequences in each process for efficient recovery from protocol errors
Authors: Kakuda Yoshiaki , Wakahara Yasushi 
Published: July 2007

AbstractIn the fault‐tolerance design of the communication system, one of the important techniques is the protocol error recovery which recovers the normal state from the abnormal state due to the protocol errors generated in the operation of the communication software. The protocol error recovery technique proposed up to now has the following problems: (1) messages are lost in the recovery process; and (2) a long recovery time is required from the error generation to the normal state.This paper proposes a new method to solve those problems and which can realize an accurate and efficient error recovery. More precisely, the condition is derived for avoiding the message loss in the recovery process; and based on the condition, a new protocol error recovery process is formulated. Then another method is proposed in which each process collects the message exchange sequences executed by other processes, together with the ordinary message exchange. A principle of protocol error recovery based on the proposed collection method is shown, indicating that the forementioned problems can be solved.