bluuebunny/crossref_metadata_2025 huggingface dataset:
Traffic flow measurement system using image processing
Authors: Kudo Yasuo
Published: July 2007

This paper discusses the traffic flow measurement system (TMS) based on the idea of vehicle cluster. TMS is an experimental system which aims at the accurate real‐time measurement of the traffic flow parameters (location of vehicle, speed, congestion, location of the queue tail, etc.) which is spread in space, using the image processing technique. As image processing techniques, the line‐differentiation and the clustering based on the idea of vehicle cluster are used. By this scheme, traffic flow phenomena in the region of measurement can be measured directly. By introducing the idea of vehicle cluster, the measurement can adaptively be performed, observing the individual vehicle in low traffic and a set of vehicles in heavy traffic. As a result of the traffic flow measurement experiment using the proposed system, the following observations are made: (1) the measurement can be performed throughout the day; (2) the real‐time measurement with 200‐ms intervals can be performed; (3) the recognition rate for vehicle cluster is 97 percent or more for the range of measurement 150 m. The accuracy of vehicle speed measurement is ±13 percent (for the range of measurement 40 m); (5) the accuracy of vehicle height measurement is within ±10 percent (for the range of measurement 100 m an when the observation of individual vehicles is possible); and (6) the tail of the queue can be identified.
Partial contour processing using curvature function‐assembly of jigsaw puzzle and recognition of moving figures
Authors: Nagura Kazuhiko , Sato Kenji , Maekawa Hitoshi , Morita Tatsuya , Fujii Katsuhiko
Published: July 2007

This paper proposes a method of partial contour processing by a curvature function and an adaptive integral filter. The filter parameter is determined by the length of the zero‐crossing segment of the curvature function both to enhance the concavo‐convex parts of the contour and to eliminate the quantization noise of the raw curvature function. Partial matching of contours is performed precisely and efficiently using the filtered curvature function. Three tasks were accomplished by the abovementioned method: assembly of a jigsaw puzzle, discrimination of overlapping and rotating figures, and tracking of a moving object which overlaps the background figures.
Direct estimation of 3‐d motion parameters from image sequence and depth
Authors: Yamamoto Masanobu
Published: July 2007

The methods to estimate the three‐dimensional motion parameters of a moving object from image sequence can roughly be divided into the two‐stage estimation based on the correspondence between the successive images and the direct estimation based on the time‐difference images. By applying the direct estimation method to the 3‐D motion, not only the motion information but also the 3‐D geometrical information can theoretically be acquired. It is difficult, however, to obtain a solution with a high accuracy, due to the nonlinearity of the computation and the assumption of small variation between successive images. The simplicity of the algorithm, which is the merit of the method, is also lost. From such a viewpoint, this paper first derives the linear equation and its solution for the direct estimation of the 3‐D motion parameters from the image sequence, by utilizing the depth information which is given by some range finder. Then the condition for the uniqueness of the solution of the equation is discussed. The necessary and sufficient condition is derived in geometrical terms for the image pattern to satisfy, so that the motion can be interpreted uniquely. The proposed method is applied to the actual image sequence, verifying that the 3‐D motion parameters can be estimated with a high accuracy.
Automatic drawing reader ‐ TOSGRAPH
Authors: Tsunekawa Shou , Shimotsuji Shigeyoshi
Published: July 2007

A general‐purpose reader for circuit drawings (TOSGRAPH) has been developed. TOSGRAPH has the following features: (1) preprocessing is unified in a line segment tracking method and high speed and generality are realized by firmware control; (2) a drawing is described by a set of segments separated by feature points; (3) segments are grouped into candidate symbols by an estimation model; (4) symbols are recognized by matching with a model; (5) using hierarchical data (i.e., segment description ‐ thin line drawing ‐ original image), the feature measuring routines together with a blackboard system enhance the generality and processing speed; and (6) a flexible model is used to describe local geometric structure, connective relations and relative positional relations. A facsimile scanner is used for input and the image stored in the frame memory is processed. Experimental evaluation of symbol recognition results in a reject rate of 30/3972 (0.8%) and error rate of 22/3972 (0.6%). The processing time for the most common diagram of size A3 was approximately two minutes, confirming the pracical utility of the reader.
Automatic template selection technique for the local pattern matching method
Authors: Kashioka Seiji , Shima Yoshihiro , Ejiri Masakazu
Published: July 2007

One of the effective means of detecting the position of the object by image processing is by local pattern matching which uses only a part of the image as the template. It is required for the implementation of this method to select a unique part of the image to be used as the template. This paper discusses the automatic selection of a template. As the first step, the causes of mismatching are discussed, and the distribution of matching error between the template and local patterns extracted from the image is analyzed. Based on the result, an evaluation function is defined which represents the uniqueness in the selection of the template. Auxiliary evaluation functions are also defined for pre‐selection and reduction of computation time. These evaluation functions are both for determining the appropriateness of the template, and can be implemented on a simple dedicated circuit with practical processing time.
A digital signature scheme based on polynomial operations
Authors: Okamoto Tatsuaki , Shiraishi Akira
Published: July 2007

The RSA scheme is considered as one of the most promising as a digital signature, i.e., the signature for document for digital information. However, the method has a problem in that the processing speed is slow. A method by high‐speed hash function is proposed as a solution to this problem, but the improvement is not remarkable for brief documents. To solve this problem, this paper proposes a new high‐speed digital signature scheme based on a congruent polynomial of lower degree. In this scheme, large prime numbers p and q are used as the secret information and n = p2q is used as the public information. A random number is used in the generation of the signature, and an equality is used in the verification. It is shown that the security of the proposed scheme is of the same order as the difficulty of the prime factorization of n. The processing speed and transfer/retained information of the proposed scheme are evaluated, indicating that the processing speed for a brief document is more than 100 times the RSA scheme, and the method requires larger secret information to be retained than in RSA scheme.
An automatic visual inspection method for a plastic surface based on image partitioning and gray‐level histograms
Authors: Shima Yoshihiro , Kashioka Seiji , Kato Kanji , Ejiri Masakazu
Published: July 2007

The outlook examination in fabrication of plastic products in the past has been performed mainly by visual inspection. The automation of the procedure is now considered to be important. This paper discusses a simple automatic detection method for defects on the surface of plastic electronic components such as integrated circuits. As the first step, optical properties of the defect such as flaw, pin‐hole and bulge on the surface of the plastic components are discussed. This indicates problems in the detection of those defects. Then the illumination method using a planar light source is discussed to obtain a stable image against surface inclination. The procedure for practical detection of defects is developed in this paper as follows. First, to separate the image of the component surface from the background, the projection distribution of the gray‐level histograms is constructed. The boundary of the component surface is extracted based on the histogram. Then the surface image is partitioned into subareas. The gray‐level histogram is constructed for each partitioned subarea. Based on the maximum and the most‐frequent value of the gray‐level histogram, the existence or nonexistence of a defect in the subarea is determined. The experiment for the defect detection was performed using typical plastic components which are determined good or no‐good. It is demonstrated that a correct defect detection can be performed for all kinds of components.
Fast reconstruction algorithm for fan‐Beam CT system
Authors: Horiba Isao , Iwata Akira , Yamagishi Nobutoshi , Suzumura Nobuo
Published: July 2007

Third generation CTs which acquire projection data using wide fan‐beam X‐rays that cover the cubic surface of the test object have two widely used tomogram reconstruction algorithms: i.e., the direct method and the arrangement method. The direct method applies fan‐like back projection directly in Cartesian coordinates. The arrangement method rearranges data to transform them into parallel fan beams. This paper proposes a new fast reconstruction algorithm in which polar coordinates are established that are spatially synchronous with the measurement geometry, reconstructed images are obtained by performing back projection in the polar coordinates and coordinate transformation is achieved from the polar coordinates to Cartesian coordinates. The features of this method are (1) computation is fast because the results of the many calculations are tabulated; (2) the remaining calculations are only product sums; and (3) it is easy to implement this method in hardware. The quality of images produced by the direct method is compared with that of the arrangement method and the present method using both computer simulation data and clinical data. The comparison shows that (1) spatial resolution of images produced by this method is better than that of the arrangement method, but almost equal to that of the direct method; and (2) the number of artifacts generated by calculations is small.
Representation and interpretation of overlapped line segments for automatic recognition of lsi cell drawings
Authors: Shimada Shigeru , Kakumoto Shigeru , Ejiri Masakazu
Published: July 2007

One of the important items in the automatic recognition of LSI cell drawings is the representation and interpretation of the overlapped part (overlap portion) composed of more than one line, different colors, or solid and dashed lines. This paper discussed first the representation of the overlap portion, and proposes a new representation method which has less ambiguity in the automatic interpretation of the overlap portion and makes the drawing easy for the designer. The algorithm is proposed which automatically interprets the overlap portion by this representation. The algorithm is composed of three parts: recognition of overlap symbol, search of the boundary of the overlap portion, and estimation of the overlapped paths. In particular, the estimation of the overlapped paths includes the rule‐type description for the major part and a heuristic method, which estimates the paths by adaptively enlarging the range of search. A program based on the proposed algorithm is combined into the cell‐drawing input device. The result of recognition for an actual cell drawing is presented.
A method for generating optimum decision tree for image retrieval
Authors: Yanagihara Yoshio , Tamura Shinichi , Tanaka Minoru
Published: July 2007

For retrieval of image databases there is a method in which image retrieval is based on similarity image input. This retrieval method uses the contents (features) of the input exhibition image as the key for retrieval. However, since much calculation time is required to process the images and to extract features from them, the increase in overall retrieval time poses a problem. Thus, a method is proposed which represents the process of image searching as a decision tree and executes retrieval on the tree. This is an efficient method for reducing the retrieval time since the number of features used for classification therein is small on the average. It also has the merit of decreasing retrieval errors by deleting nodes on which there are many retrieval errors with new nodes with fewer errors. In this paper we consider decision trees for similarity image retrieval, attempt to construct an appropriate decision tree which has a shorter retrieval time and which produces fewer retrieval errors from two given inputs [(1) a set of similarity errors used for retrieval and (2) the retrieval object set of an image database] and perform classification (retrieval) experiments.
A scheduler based on the demand page‐stealing for large‐scale programs
Authors: Murakami Ken‐Ichiro , Matsumoto Takaaki , Kurata Masahiro , Nakao Masayoshi
Published: July 2007

Large‐scale programs (i.e., LSI‐DA) and simulation programs require a working set size of several Mbytes and a long execution time. When executed in parallel with interactive jobs, large‐scale jobs exert a degrading effect on the processing of interactive jobs. In addition, the turn‐around time for large‐scale jobs is degraded. It is therefore necessary to limit the amount of real memory which is made available for large‐scale jobs. However, a sound method for determining the limit has not yet been established.

This paper proposes a method for improving the turn‐around time of large‐scale jobs without affecting the processing of interactive jobs executed in parallel. Turnaround time is improved by avoiding the swapping of large‐scale jobs. Furthermore, a look‐ahead push method is employed to ensure some given mean response time for interactive jobs when the memory load suddenly increases. Another feature of the method is that the limitation on real memory is adjusted automatically, thus eliminating the need for the user to set the limit. Simulation results indicate that the adverse effect on interactive jobs is minimized and that CPU utilization by large‐scale jobs is improved by a factor of two or more in systems in which a large number of terminals are connected.
Recovering three‐dimensional structure and motion of jointed objects from orthographically projected optical flow
Authors: Shibata Tsutomu , Sugihara Kokichi , Sugie Noboru
Published: July 2007

When humans observe two‐dimensional projected images of a moving object, they can recognize its three‐dimensional structure and its motion. This paper presents a method which can recover the three‐dimensional structure from the orthogonally projected image of a jointed object. First, a method is presented for a rigid rod, when the direction of the angular velocity is spatially fixed. Then, the three‐dimensional structure and motion can be recovered by observing the positions and velocities of both ends on the image. The method is extended to the case of two moving jointed rigid rods, where the direction of the angular velocity vector of the rotational motion of one rod is spatially fixed, and that of the other rod is fixed relative to the former. The method can recover the three‐dimensional structure and motion by observing the positions and velocities of the ends and the joint. By a computer simulation, a satisfactory result was obtained.
A method for extracting three‐dimensional information using cone‐shaped beams of light
Authors: Feng Kai‐Hua , Sugihara Kokichi , Sugie Noboru
Published: July 2007

This paper proposes a method which extracts the three‐dimensional information from the single‐view image obtained by projecting a texture on the surface to be measured. In the proposed method, the texture is generated by projecting a number of cone‐shaped beams of light from point sources on the object surface. Based on the generated texture, the three‐dimensional measurement is performed. Since it is difficult to obtain explicit information on the shape of the surface from a single image, more than one light source is used. In other words, two images are obtained by a single camera by varying the location of the point source. By combining the processings of those two images, a simultaneous estimation is made on the normal vector and the three‐dimensional coordinate of each point on the image. Compared with the method by two‐eye stereo‐taxic vision, no processing is needed for determination of correspondence. Compared with the method using slit‐light, less time is required for the delta acquisition. Compared with the method utilizing texture, the extraction can be performed without a priori knowledge about textures on the surface. The extraction can be performed only by the local process of the object surface. These are the features of the method. The result of applying the proposed method to the computer‐simulated images and real image are presented, together with the discussions of the future problems.
A distortion model of handwritten characters and evaluation of its power of expression
Authors: Kondo Shozo , Attachoo Boonwat
Published: July 2007

This paper discusses a distortion model for handwritten characters and its ability of representation. The following three assumptions are made in constructing the distortion model: (1) a standard figure is pre‐set in correspondence to each character category; (2) the handwriting process is a sequential system with the standard figure as the input and the figure with distortion as the output; (3) the whole distortion is a combination of the deterministic and the stochastic distortions. The distortion model for the handwritten characters is constructed under the above assumptions. The feedback by the visual system during the handwriting process is regarded as a resorting force which affects a control on the stochastic distortion. The standard figure is considered as a combination of several elements, and the elements are estimated for each individual from handwritten character data. The distorted figure which is generated from the estimated standard figure, is considered to represent the handwritten character of the individual. Finally, the distance between figures is defined, and using it as the measure, the representation ability of the proposed distortion model is evaluated, indicating the usefulness of the model.
Load scheduling schemes using inter—PE network
Authors: Hiraki Kei , Sekiguchi Satoshi , Shimada Toshio
Published: July 2007

The load distribution among processing elements (PE) in the parallel computer system is one of the major factors affecting the performance of the entire system. This paper discusses the dynamic distribution scheme which distributes the load at the execution of the task. The major factor, which affects the performance in the dynamic load distribution scheme, is the information concerning the loading situation of each PE and the data transfer for distributing the load. This paper proposes a dynamic load distribution scheme, which reduces these overheads considerably by utilizing the network. The idea can be applied to both the circuit‐switching network and the packet‐switching network. Especially, the scheme based on the packet‐switching network is one of the load distribution schemes suited to the instruction‐level data‐driven computer, using the packet as the major communication means among PE's. Based on the proposal of the scheme, the performance of the system is evaluated for a typical configuration example for the parallel processing program. It is verified as a result that the proposed system operates very closely to the ideal dynamic load distribution system.
Analysis of memory fan effect by paired association
Authors: Hirai Yuzo , Hiwatashi Kenji , Kikuchi Tomoko , Kamijo Ken‐Ichi
Published: July 2007

Three kinds of psychological experiments were performed by a paired‐association paradigm in order to investigate the properties of human memory. The experiments are based on the fan effect where a longer time is required for retrieval with the increase of the number of items associated with an item. In the first experiment, the association pair of meaningless items is used as the object of memory and the retrieval time is measured for the cued recall and recognition tasks. It is seen that while the fan effect is produced in the recognition task, it is not produced in the cued call recall task. In the second experiment, the seman‐tically related association pair (noun‐verb and noun‐noun) is used and the retrieval time is measured in the same way as in experiment 1. As a result it is seen that the fan effect is produced in both recognition and cued recall tasks. The obtained results seem to suggest that a difference exists in the memory structure for the meaningless and semantically related items. It is also suggested that there is a difference in the memory strategy based on the meanings. In the third experiment, the association pair is used where a verb and a noun are associated with the same noun. As a result of the cued recall task, it is shown that the verb is easier to be recalled than the noun. This will be accounted for by assuming that a kind of case structure exists in the memory.
Analysis of list structures generated by lisp functions
Authors: Ohta Yoshikatsu , Yoshida Yuuji , Fukumura Teruo
Published: July 2007

The occurrence of garbage cells generated by pure‐lisp like programs is formalized. First, we define some classes of LISP functions which characterize the properties of list structures generated by them. Then using these classes, we formalize the occurrence of garbage cells. We also present some results of analysis for pure‐lisp interpreter programs written in LISP.
Error‐secure and error‐propagating concepts for strongly fault‐secure systems
Authors: Nanya Takashi , Kawamura Toshiaki
Published: July 2007

The self‐checking system refers in general to a class of logical systems with an ability to detect a fault during operation. Especially, the self‐checking system with the property that it never produces a code word in a fault, continuing the correct code word output until a noncode word is produced as the output, is called strongly fault‐secure system (SFS). Numerous studies have been made on the SFS systems and the realization of the totally self‐checking (TSC) system, which is a special case of the SFS system. Various kinds of functional circuits (combinational and sequential circuits as subcircuits) and detecting circuits have been discussed. However, there has been little discussion on the condition to be satisfied by the subsystem in order that the system composed of subsystems satisfies the SFS condition. This paper proposes two new concepts concerning the errors produced in the interface between subsystems: the error‐secure and the error‐propagating properties. Using these concepts, the condition to be satisfied by the interface in the SFS system is presented. The proposed concepts are useful in the SFS design of a complex system composed of a large number of subsystems, such as microprocessors.
Description and verification of protocol by temporal logic
Authors: Koshida Ichiro , Saito Tadao , Inose Hiroshi
Published: July 2007

When a new communication protocol is formulated, some method for protocol description and verification must be employed to describe and verify that protocol. This paper proposes a protocol description method based on McDermott's temporal logic. The features/characteristics of this method include: (1) The ability to describe “event” and “changes of fact” as they occur; (2) Its temporal logic is suitable for description of continuous time element as well as timeout; and (3) Its temporal logic is effective in protocol verification. A canonical form for protocol description is introduced that enables the translation of any logical inference expression into the standard form. The effectiveness of the proposed method is demonstrated by performing the description and verification of Stenning's protocol.
A new video‐thresholding method for recognition of low‐quality stamped alphanumerals
Authors: Nakano Tomoaki , Ozeki Osamu , Yamamoto Shin
Published: July 2007

With the widespread use of factory automation, there has been an increasing demand for the recognition of stamped characters. The stamped characters are sometimes of high‐quality, and sometimes of low‐quality, due to the variation of hollow depth and shape. This paper discusses the thresholding method for the recognition of such low‐quality stamped characters. The proposed method determines the optimum threshold characteristic for each stamped character, by which the thresholding for each character is performed. The recognition experiment was performed using 120 samples of stamped characters O, D and 8 of low quality. Ninety‐four samples were recognized correctly by the traditional fixed‐thresholding method, while all 120 samples were recognized correctly by the proposed optimum thresholding method. The recognition rate was examined for 2000 samples composed of sixteen alphanumerals. The correct recognition rate was 99.8 percent, indicating that the proposed method is effective. The stamped character recognition system has been developed for the cylindrical machine part, which can recognize 3 digits of sixteen alphanumerals in 0.95 s.
Intelligent problem‐solving system based on model building method
Authors: Ohsuga Setsuo
Published: July 2007

This paper discusses the conceptual design of a knowledge processing system. First, by means of knowledge processing technology, a new relationship is established between man and computers, and it becomes possible to adopt a new problem‐solving style. The paper discusses also the need to analyze the types of problems man has to solve, the manner of problem solving, and the limit to the capability of knowledge processing to design an effective computer‐aided problem‐solving system. It is concluded that the new problem‐solving system must be a knowledge processing system founded on the model‐based method. Then the requirements for the knowledge processing system and, in particular, for the knowledge representation language, are discussed. Finally, an example is used to show that a system satisfying these requirements is possible.

Here, the importance of the model building concept is stressed for establishing the new problem‐solving style and the declarative langauge including data structure for realizing the knowledge processing system that can aid the process. In general, the real problems are very complex, and it is impossible to solve them by a simple procedure. However, we have to approach the solution through a trial‐and‐error process. The knowledge processing system must be able to aid man in this process very naturally and without any restrictions on man's capability.
Special parallel processor for lu decomposition of a large‐scale sparse matrix
Authors: Asai Hideki , Asai Mitsuo , Tanaka Mamoru
Published: July 2007

The analysis of a nonlinear network is reduced to the solution of a system of equations at each step of Newton's method. In the solution by the direct method, the highspeed realization of the LU decomposition of an large‐scale sparse matrix has become important with the development of the integrated technology. In the past, the applications of the array processor and the supercomputer have been considered. However, the array processor cannot utilize the sparsity of the matrix, resulting in an impractical system with too many processor cells. The efficiency of the vectorization is a problem in the super‐computer, when it is used for the Gauss elimination only for the nonzero elements in the matrix. This paper proposes a dedicated processor for LU decomposition of a large‐scale sparse matrix, which can utilize the sparsity of the matrix and can be realized with a practical number of processors. The processor is composed of q local units, corresponding to the nonzero elements in each row of the coefficient matrix, and those units operate in parallel. In the processing of a sparse matrix, the matching of the label is required in the Gauss elimination. It is realized with a high speed by the data‐shift operation by the inter‐register transfer. Furthermore, a processor with a hierarchical memory structure is proposed which can cope with the case where the number p of nonzero elements in a row exceeds q.
Polytonic fault‐free combinational circuits for alternate‐data‐retry
Authors: Naito Sachio , Fujinawa Osamu
Published: July 2007

The alternate‐data‐retry (ADR) is a scheme which performs the retry using the 1′s complement of the input data, when an error is detected at the output, etc., of the logic circuit. By applying the scheme to the data‐bus and memory unit where the data are processed without modification, all single stuck‐at‐faults can be masked without considerably increasing the hardware complexity. ADR is also known to be useful for the circuit realizing the self‐dual function, such as adder, even though the data are modified. In the circuit realizing the self‐dual function, however, there may be produced a fault which is not masked by ADR, if the circuit contains a gate with two or more fan‐outs. This paper clarifies the necessary and sufficient condition for such a fault to exist. Based on the result, a circuit construction is proposed in which all single stuck‐at‐faults in the circuit can be masked by ADR, when any logical function is realized as a combinational circuit. By extending the method, a construction of the combinational circuit is shown, in which the double stuck‐at‐fault can also be masked, by employing four different inputs.
A quantization method of line drawings using directional‐difference codes with adaptive line segments
Authors: Ishii Ikuo
Published: July 2007

This paper proposes a highly efficient coding method suited to the storage and transmission of complicated line drawings such as topographical map. Instead of using the method based on the fixed‐length segment such as Freeman's chain code, the segment length is made variable according to the state of the curve. The high efficiency is realized by further adding the directional‐difference code. In the method employing variable‐length segment, there is a danger that the approximate error is increased with the length of the segment. Consequently, a scheme is employed in which the permissible error is specified, and the coding is performed within the error limit. To simplify the encoding procedure, several quantization templates are prepared with different segment lengths, and the approximating segment is selected by taking the template according to the state of the curve. Avoiding the increase of coding complexity by adding the template discrimination code, the template to be used is selected based on the code sequence generated in the past. By this scheme, although depending on the complexity of the line drawing, the coding complexity can be reduced by 25 to 40 percent considering only the effect of variable segment length.
Ultrasonic nonlinear parameter CT using nonlinear interaction of sound waves
Authors: Nakagawa Yoshikatsu , Nakagawa Masao , Yoneyama Masahide , Kikuchi Makoto
Published: July 2007

This paper proposes a new ultrasonic CT using the nonlinear interaction between two ultrasonic waves. Two finite‐amplitude waves with different frequencies are radiated along the same axis in the same direction as the primary waves. The secondary wave produced at the difference frequency is measured as the projection data to reconstruct the distribution of the nonlinear parameter within the object. Also reconstructed is the distribution of the attenuation coefficient from the projection data of the primary wave. Since soft tissues exhibit remarkable differences in both nonlinear parameter and attenuation coefficient, this method, which yields two kinds of distribution images of characteristic parameters in parallel, will turn out to be an effective means of information acquisition from the biological object. This paper describes the principle of the proposed ultrasonic CT, and presents the result of a fundamental basic experiment using agar gel phantom as the object. Experimental results indicate the validity of the proposed method.
One‐dimensional bounded cellular acceptor with rotated inputs
Authors: Taniguchi Hiroshi , Inoue Katsushi , Takanami Itsuo
Published: July 2007

The authors previously introduced a two‐dimensional automaton with the following structure. The input two‐dimensional tape is rotated clockwise by 90, 180 and 270 degrees. For each position, the input is scanned by a one‐dimensional serial‐parallel array acceptor, and the acceptance or rejection is determined by combining the result of scanning by intersection ( ) or union ( ). The accepting power of the automaton was discussed. This paper introduces anew the following two‐dimensional automaton. It scans the rotated input by the one‐dimensional bounded cellular acceptor, and the acceptance or rejection is determined by interaction or union. The accepting power of the automaton is discussed with the following results: (1) in any form, the accepting power is properly higher in the scanning by the nondeterministic machine than in the scanning by the deterministic machine; (2) in any form, the accepting power in the scanning by the deterministic machine becomes higher as the number of rotating inputs is increased.
A VLSI architecture for pipeline fft processor
Authors: Takahashi Yukio , Sekine Satoshi
Published: July 2007

This paper considers the fast‐Fourier transform (FFT) which processes a large amount of data, such as image. As a structure for the one‐dimensional FFT processor, aiming at eliminating some restrictions in VLSI design, the constant‐geometry type FFT algorithm and the bit‐serial pipeline floating‐point arithmetic are discussed. The major results are as follows. (1) Using the constant‐geometry algorithm, the memory elements to perform the rearrangement characteristic to FFT can be realized by a uniform structure and uniform control scheme throughout the stages. The memory element for N‐point FFT can be constructed as a simple and regular structure using 2 of N/2‐stage shift‐registers. (2) The multiplication cell with code extender, the serial structure of normalization circuit and the shifter, and the parallel operation covering a longer length than the input word length are employed. By those schemes, the pipeline operation of floatingpoint arithmetic is realized without a guard bit. By this scheme, the restriction in VLSI using the butterfly elements can be reduced drastically. (3) As an additional effect of the regular structure of the memory element, the automatic defecttolerant operation is made possible, using the effective k‐out‐of‐n redundant structure and the self‐testing. By this scheme, the restriction for the VLSI chip‐area can be reduced when the number of sampling points is increased. (4) The one‐dimensional FFT processor can be realized as a modular structure, which is a cascade connection of two kinds of VLSI, i. e., butterfly element and the memory elements.
Determining object attitude and position for bin‐picking tasks guided by an interpretation tree derived from a geometrical modeler
Authors: Ikeuchi Katsushi , Koshikawa Kazutada
Published: July 2007

A method is presented in which the position and the attitude of the object can be determined by interpreting the depth map, needle map, and the edge map, following the interpretation tree. Before a matching is tried, the interpretation tree is derived based on the attitude group. The attitude group classifies the attitudes based on the labels of the observable regions. The branch in the interpretation tree is determined based on the dependence of the label on the set of regions. At each stage, the most favorable feature is utilized for the matching at the branch. The matching feature for each attitude group is employed in the precise determination of the attitude in the attitude group. This information is also registered in the interpretation tree. The input information for matching is the edge map obtained by differentiating the density map, the needle map obtained by the density‐difference stereo, and the depth map obtained by the two pairs of density‐difference stereo. The matching is made following the interpretation tree and using the most favorable feature at each stage. The description of the determined position, attitude and the background is stored in the world of geometrical model. Using the stored description, the safe‐grip attitude of the gripper is determined.
Attenuation correction method for single‐photon emission ct without any additional data collection
Authors: Kusaba Ritsu , Nakajima Masato , Ogawa Koichi , Yuta Shin'Ichi , Morozumi Tatsuru
Published: July 2007

This paper considers the single‐photon emission CT (SPECT) for the object containing a large spatial variation of g‐ray absorption distribution, and proposes a new correction method for the effect of attenuation. In the past correction of the image degradation by attenuation in the SPECT source distribution image, it is necessary to have an a priori knowledge about the attenuation distribution within the object. However, it should be noted that the emission data measured on the opposite side are not the same when the object has attenuation. By utilizing this property, it seems possible to acquire both the source distribution and the attenuation distribution from the measured emission data. The proposed method is based on this idea, and while estimating in parallel the source distribution and the attenuation distribution from the emission data, makes a correction of the source distribution using the attenuation distribution. A practical and clinical application of the method is expected. As a result of numerical simulation, it was verified that the proposed method is effective even when the emission data contain a noise of the level usually observed in a clinical situation.
Generation of a closed curve with fourier representation
Authors: Fukushima Shigehiro , Namikawa Kazuhiko
Published: July 2007

An arbitrary closed curve on a plane can be represented as a Fourier series. Curves may be useful particularly for the experimental study on description and recognition of closed curves, provided that the arc length is used as the parameter for their parametric representation. This paper introduces by formal discussion a method to generate a closed curve with Fourier representation which passes through a sequence of points or their neighborhood, in the sequence order, given such a point sequence. In particular, a simple method is introduced which uses the Fourier transform and interpolating filters for a case in which the sequence comprises a relatively small number of points and in which the distances between successive points are not uniform. In addition, a conversion is described by which the arc length becomes the parameter. Fourier representation of a closed curve has often been applied to pattern recognition of images and figures. As a result, Fourier coefficients have been calculated based on the discrete Fourier transform of the coordinate sequence comprising the grid points or of their interpolated points. However, the mathematical meaning of the Fourier transform method has not been clarified. The formal discussion in this paper also clarifies this meaning.
Simulation of load‐current‐controlled gaas logic circuits
Authors: Akamatsu Norio
Published: July 2007

Since the mobility of the hole is low in GaAs, P‐channel MESFET is of low speed. This makes it difficult to utilize the feature of the complementary logic circuit. Consequently, a direct‐coupled logic circuit is usually constructed using N‐channel MESFET. On the other hand, using the load‐current‐controlled logic circuit proposed in this paper, the speed and the power consumption can be improved compared with the directcoupled logic circuit. In other words, by limiting the load current according to the input state, the current counteracting the transition of the logic state can be decreased drastically. This speeds up the logic transition, thereby increasing the logic swing and reducing the power consumption.

In this paper, the whole‐region model of the field‐effect transistor is introduced, and the logic swing of the GaAs ring‐oscillator is determined using Poincaré's mapping. Then the transient response of the load‐current‐controlled logic circuit is determined by simulation, leading to high speed and low power consumption.
Binocular stereograph based on structure of edgelines
Authors: Tatsumi Eiichi , Izumi Masao , Fukunaga Kunio , Kasai Tamotsu
Published: July 2007

This paper describes a method of extraction information of the position of an object three‐dimensionally via a stereograph. In stereography which is a general method of obtaining three‐dimensional information from two‐dimensional images, it is difficult to find a corresponding point of an object in multiple images photographed from different positions. In most cases, this is based on the local characteristic of edges which are features of an image, hence the results are not consistent. This paper proposes a method in which the correspondence between the pair images is found by comparing the structures of feature‐regions represented by the relationships to the adjacent edgelines (e.g., parallelism or crossing). The usefulness of the method was confirmed by applying it to an indoor scene.
A rule‐based model for visual geometrical illusions
Authors: Seki Kazunori , Sugie Noboru , Sugihara Kokichi
Published: July 2007

An illusion is not simply a visionproduced error, but a phenomenon produced in the normal visual sensation. To clarify the visual perception process, various studies have been made concerning illusions, especially the geometrical illusion. This paper presents a model of the illusion process using figure transformation rules, and discusses the illusion using the model. The figure transformation rules used in this paper are as follows:

The acute angle is perceived to be larger, and the obtuse angle is perceived to be smaller.

The segment forming an acute angle is perceived to be shorter, and the segment forming an obtuse angle is perceived to be longer.

When two segments intersect, the segment is perceived to be longer if the point of intersection is close to the mid‐point and the angle is close to the right angle.

The vertex shifts along the line of bisection of the angle at the vertex, in the direction corresponding to the larger peception of the acute angle and smaller perception of the obtuse angle.

Applying these rules to typical figures of geometrical illusion, results corresponding to human illusion were obtained, indicating the validity of the transformation rules.
Trial‐and‐error method for automated test data generation and its evaluation
Authors: Inamura Hiroshi , Nakano Hideo , Nakanishi Yoshiro
Published: July 2007

This paper discusses the trial‐and‐error method for automatic generation of test data. First, the performance of a simple trial‐and‐error method is discussed and an idea of improvement is shown. Then an improved trial‐and‐error method is proposed. In this method, the dynamic determination of the range of the random variable for the linear path predicate is considered. The problem is linearized in the trial‐and‐error process for the path predicate containing nonlinear conditional expressions, and then the order of determination of the variables is also considered. The dynamical determination of the order of the variable is considered for the path predicate containing the ambiguous array reference. Finally, the method is evaluated by an experiment.
Generalized context‐free grammars and multiple context‐free grammars
Authors: Kasami Tadao , Seki Hiroyuki , Fujii Mamoru
Published: July 2007

It is shown that the class of languages generated by generalized context‐free grammars (gcfg's) introduced by Pollard is exactly the class of recursively enumerable sets. Next, a subclass of gcfg's called multiple context‐free grammars (mcfg's) is introduced and it is shown that the class of languages generated by mcfg's properly contains the class of context‐free languages and is properly contained in the class of context‐sensitive languages. In mcfg's, it is possible to account for structures involving discontinuous constituents in a particularly simple manner. Such concepts as phrase structure and derivation tree in context‐free grammars (cfg's) can be extended naturally in mcfg's. Furthermore, the class of languages generated by mcfg's enjoys the formal language‐theoretic closure properties that the class of context‐free languages does.
Pseudo line‐image coding and drawing method based on fractal theory
Authors: Sato Masakazu , Tominaga Hideyoshi
Published: July 2007

The fractal theory proposed by Mandelbrot is applied primarily to computer graphics and related problems as a means to generate a pseudo‐natural image. In contrast to those problems dealing with natural images, it is possible to apply the fractal theory as a means to approximate actual natural images. This paper considers such natural line‐images as a coastline and the contour of a mountain, and presents a method to generate an image with apparently high resolution by applying the fractal theory based on a small amount of information. A feature of this method is the use of an algorithm called squig to generate the fractal curve, which is also proposed by Mandelbrot. The method recursively partitions the original image and generates the fractal curve by determining the internal path. It has several advantages such as the property that self‐intersection is not produced in principle. In this paper, the properties of the squig are described first. Then the proposed algorithm is applied to the line‐image composed of a coastline, and the result is presented. As a result of experiment, it is seen that the data for the chain code is compressed to some 1/10, resulting in a visually natural image.
A study on a data compression method for multivalued images through bit‐plane decomposition technique
Authors: Kamata Seiichiro , Members Eiji Kawaguchi
Published: July 2007

A bit‐plane decomposition method of multivalued images has the advantage in an interactive image retrieving system whereby users obtain a quick overview of an entire picture and a detailed local configuration simultaneously. The simplicity and feasibility of this method have attracted many researchers to produce numerous works in this field. Yet no one has been quite successful in reducing data amounts very effectively. The reason is that they tried to preserve all image information without paying much attention to the relative importance of each local information to the entire image. This paper proposes a data reduction strategy which incorporates a part of the property of human vision systems. Fine and exact data of a region where discontinuous points are very dense are neglected and abolished. On the other hand, all information about a region where discontinuous points are sparse is preserved. First, the properties of black‐and‐white (B/W) boundary points on image bit‐planes are studied and a new data compression method is presented. The highlight of this method is the computation of a measure for the density of the discontinuous points. Then an alternative measure is shown which is based on an image complexity of B/W pictures, and is less complicated to compute. It provides a data compression strategy which can be followed on coded data of the image. The experimental study supported this new idea, namely, most of the edge parts were enhanced and nonedge areas were noise‐cleaned, and a good data compression was obtained.