bluuebunny/crossref_metadata_2025_split huggingface dataset:
Adaptive mesh generation for surface reconstruction—parallel hierarchical triangulation without cracks
Authors: Tanaka Hiromi T. , Kishino Fumio 
Published: July 2007

AbstractThis paper describes a method of precisely and effectively visualizing a complex 3‐dimensionally curved surface from a set of range data by using meshes (parallel hierarchical triangulation) which are adaptive to the degree of its complexity. The method can reconstruct the curved surface without cracks by approximating its intrinsic shape and discontinuity with a polygon. The algorithm used can be processed by fact parallel local calculations with an upper limit in time and space.This paper proposes a parallel recursive algorithm for generating an adaptive mesh using a 3D‐curvature based on the intrinsic shape of an object, and another parallel recursive algorithm to avoid the formation of a crack which occurs between two subdivisions. Experimental results applied to range images of human faces are shown. The proposed method can be applied to general images (e.g., gray‐level image and color images) other than range images so that the compression or reconstruction of an image can be carried out by adaptively using its geometrical features (e.g., the pixel value, its first‐order differential, and second order differential).
Motion artifacts in the X‐ray CT image of a revolving point object
Authors: Sakamoto Takashi , Sato Shunsuke 
Published: July 2007

AbstractTo obtain the cross section of an object by using an X‐ray CT scanner, many projections of the object with various angles are required. This also takes time for scanning. If the object moves during this period, the projections would be disturbed causing motion artifact in the CT image. Understanding of their characteristics in relation to the movements of the objects will be useful for analyzing CT images and will supply new knowledge to medical diagnosis.This paper investigates a reconstructed image of a point object which revolves around the center of a scanning area. The results show that the reconstructed image of the point object forms an epicycloid or hypocycloid (a curve on a plane) and this reduces with time. The same type of artifact is simulated by a computer, and this justifies the analysis.
Modeling of natural terrain based on fractal geometry
Authors: Arakawa Kenichi , Krotkov Eric 
Published: July 2007

AbstractThis paper proposes a method of modeling a natural terrain based on fractal geometry which can be applied to problems such as route planning for outdoor exploration by autonomous mobile robots. The method uses elevation data of a terrain which are derived from range data obtained by a scanning‐laser range‐finder at irregular positions. The method handles a problem of reconstruction of 3‐dimensional data with an arbitrary resolution and uncertainty.Assuming that the terrain is fractal shape, the method solves the following modeling problems: (a) estimation of terrain roughness based on fractal Brownian function model; (b) reconstruction of the terrain surface adaptive to the roughness (using interpolation of elevation data with Maximum A Posteriori (MAP) estimation); and (c) estimation of uncertainty distribution of the elevation map of terrain using the Monte Carlo method. The solution of each problem is given. The usefulness of the method is confirmed by simulations and experiments using observational data.
A generalized algorithm for Japanese morphological analysis and a comparative evaluation of some heuristics
Authors: Hisamitsu Toru , Nitta Yoshihiko 
Published: July 2007

AbstractIn ordinary written Japanese, words are not separated by spaces. Therefore morphological analysis involves segmenting and tagging sentences. Since each sentence has a huge number of possible tagged segmentations, various criteria have been proposed for making plausible decisions. However, there are still no unified frameworks that incorporate various heuristics, and there has been no comparative evaluation of commonly used heuristics. This paper presents a clear framework to describe various heuristics, and an N‐best algorithm for extracting optimal solutions. The time complexity of this algorithm isO(nNlog2(1 +N)), wherenis the sentence length. The advantage of the N‐best algorithm over the standard beam search algorithm is also discussed. This paper also presents a comparative evaluation of three major heuristics, and proposes a precise and portable rule‐based heuristic. Estimation was done using the aforementioned algorithm and six criteria. The newly proposed heuristic is based upon the Extended Least Bunsetsu (Phrase) Number method.
Character recognition by the moments using associated legendre functions
Authors: Kawabe Hidekazu 
Published: July 2007

AbstractAn important problem in image recognition is extracting rotation in invariant features. Currently, a powerful technique based on Zernike moments is applied when the moments are used to address this problem. In this paper, we use associated Legendre functions of the first kind to derive moments and attempt to extract rotation invariant features based on them. These new moments are complex data as are Zernike moments and their basis functions are orthogonal functions. The images reconstructed from these moments demonstrated high quality than when using Zernike moments. Furthermore, evaluation functions suited to these moments are designed and image recognition tests are performed by several computer simulations. The results demonstrate the strong recognition ability for images degraded by noise or distortion, as well as illustrate features like recognition in regions of low degrees.
A concurrent learning algorithm of forward and inverse models using feedback error learning in the early stage
Authors: Yamaguchi Satoshi , Okazaki Nozomu , Itakura Hidekiyo 
Published: July 2007

AbstractThis paper proposes a concurrent learning algorithm for forward and inverse modeling. The algorithm is consisted of two phases. In the first phase, a feedback controller is used. The forward model is trained using the output values of the controller as the input values to the system and the inverse model is trained by the feedback error learning. In the second phase, the forward model and the inverse model are trained at the same time. By the simulation experiments in a two‐link manipulator, it is confirmed that our algorithm can converge faster than the ones already proposed.
An analysis of user‐consultant dialogues and its application to dialogue processing in a dialogue‐based consultant system
Authors: Kumamoto Tadahiko , Ito Akira 
Published: July 2007

AbstractThe authors are developing a dialogue‐based consultant system that helps a computer user perform his task on a computer through spoken dialogues. We collected dialogue data from dialogue experiments in which a human consultant, instead of the consultant system under development, provided support to novice computer users. In this paper, we analyze the dialogue data, and propose a dialogue processing method suited to the consultant system based on the results of the analysis. This method can manage a user‐computer system dialogue, the structure of which is a complex of dialogue patterns, and can guide a user to achieve his task goals by controlling system utterances.
Hierarchical variable‐block‐size motion detection with a constant average block size per frame
Authors: Kanamaru Toshifumi , Ogawa Yoshihiko , Shirakawa Tomoaki , Kitajima Hideo 
Published: July 2007

AbstractThis paper proposes a new motion detection method for image‐sequence processing. It consists of hierarchical variable‐block‐size motion detection with a constant average block size. It makes use of hierarchical images to detect motion vectors. The block size is decided by termination of motion search in a hierarchy level with a small matching error. The termination threshold is decided by the detection result in the highest hierarchy level. It can be set up according to a desired average block size per frame. Efficacy of the proposed method is confirmed by simulations on video coding.
Design and implementation of load‐balancing mechanism at command level on UNIX
Authors: Yamai Nariyoshi , Wakabayashi Susumu , Shimojo Shinji , Miyahara Hideo 
Published: July 2007

AbstractThis paper proposes a design and implementation of a new load‐balancing mechanism at the command level on UNIX operating systems. In this mechanism, only the command interpreter bash is modified to have a new command executed on the lightest‐loaded computer, and efficient load balancing is made without modifying the UNIX kernel or application program.In the author's implementation, load is measured by statistics information server rstatd on each computer when a new command arrives, and the new command is assigned to the lightest‐loaded computer among the local host and the computers that respond faster than it. Using this method, loads can be balanced even when there is no idle computer, and the system can be made fault‐tolerant in the case where some machines are down. This mechanism also has network transparency, such as file location transparency and preservation of command execution environment, by using REX for remote execution, which is provided on many UNIX systems as one of the RPC (remote procedure call) services.
Performance characteristics of analog metal‐oxide semiconductor type neuroprocessor
Authors: Inoue Yoshihide , Taguchi Hideo , Kuroda Eizo 
Published: July 2007

AbstractTechnological requirements for excellent parallel distributed processing capability of central nervous system has increased recently. This has led to the development of neurosimulators, e.g., neurocomputers and neurochips integrated from artificial neuron combinations. However, in developing the neurosimulators, there is no established theory as to how to establish each individual artificial neuron activity function. In the development of a theory, artificial neuron combinations were trial‐produced using analog MOS devices. The characteristics of the Analog MOS artificial neurons are as follows:

They consist of equivalent electronic circuits for synapses on the dendrites, cell bodies, and axons, assuming the electrical properties of each section of the bioneuron produces a unique processing pattern.
They exhibit the same electrical performance (absolute refractory period, temporal and spatial weightings of the post synaptic potential, and pulse generation at the axon base) as the bioneurons.
The synaptic equivalent circuits are connected with learning systems to enable plastic input‐output characteristics by changing pulse transmission efficiency according to the input pulse frequencies. In the final research stage, the possibility of fundamental operations, such as filtering and phase shifting in the pulse frequency domain using a neuroprocessor comprising several analog MOS artificial neurons with different pulse transmission efficiencies was investigated.
WAKASHI/C: A storage system for multimedia database
Authors: Bai Guangyi , Amano Hirofumi , Makinouchi Akifumi 
Published: July 2007

AbstractWAKASHI/C (centralized server version) is a sub‐system at the base level of the “Shusse Uo” project. It provided the C programmer with the basic functions to manipulate the distributed shared persistent data and the distributed shared volatile data. In WAKASHI/C, the virtual memory scheme and the distributed shared memory scheme are combined to realize the distributed shared persistent heap and the distributed and shared volatile heap, for the efficient handling of multimedia data.This paper discusses the realization of WAKASHI/C corresponding to the distributed computing environment. To evaluate the performance for the manipulation of the multimedia database, the extended object operation benchmark is proposed, and the execution performance of WAKASHI/C is evaluated.
Characteristics measurement for three‐dimensional surfaces based on multiple filtering
Authors: Iwasaki Keisuke , Kishino Fumio 
Published: July 2007

AbstractMatching a 3‐D shape to a model in a database is one of the main issues in 3‐D computer vision, along with indexing 3‐D objects for the teleconferencing with realistic sensations. Concerning this issue, one of the keys for reducing the error and computational cost in the matching step is to carry out robust characteristics measurement of the 3‐D shape. This paper proposes a new multiple spatial filtering based characteristics measurement technique for 3‐D surfaces, and presents experiments based on qualitative and quantitative analyses comparing characteristics obtained by the technique and conventional differential geometric characteristics.This method uses the trajectories of a point on a surface caused by viewpoint invariant filtering. By using a set of low‐pass filters with multiple radii, the shape of the trajectory reflects some shape information around the point on the surface, from coarse to fine, while eliminating noise.Basic concepts, the characteristics measurement technique, and experimental results will be shown.
PARTY: A numerical calculation method for a dynamically deformable cloth model
Authors: Sakaguchi Yoshiyuki , Minoh Michihiko , Ikeda Katsuo 
Published: July 2007

AbstractA physically based environment of Artificial RealiTY for dress simulation (PARTY) which shows fully dressed humans in various environments is described. In PARTY, a dynamically deformable cloth model of a dress plays the central role. This paper proposes a new dynamically deformable cloth model that can handle actual nonlinear kinetic properties of cloth measured by mechanical experiments, and also propose a numerical method appropriate for PARTY. The numerical results of the Drape Test are compared with the shape of real cloth in experiments.
Characteristics of rotatory second order difference filter for computer aided diagnosis of medical images
Authors: Shimizu Akinobu , Toriwaki Jun‐Ichiro , Hasegawa Jun‐Ichi 
Published: July 2007

AbstractThis paper studies the performance of three kinds of rotatory second‐order difference filters by theoretical evaluation. The filters calculate, respectively, the minimum, the maximum, and the mean values of their outputs in several directions and have been used for enhancement of shadows in medical images. In this paper, the distribution functions of outputs of three filters are calculated on a model image, and the performance is evaluated. Moreover, applications to real medical images are presented to confirm the obtained results.
Tracking the context in man‐machine communication
Authors: Nishimura Toshikazu , Hirose Shoichi , Minoh Michihiko , Ikeda Katsuo 
Published: July 2007

AbstractA method of tracking the context in man‐machine communication is proposed. The “tracking the context” is defined as locating the place of context switching and dividing the user's command sequence into chunks, each of which corresponds to one work. For tracking the context, “a syntactic‐context” is introduced. A syntactic‐context is a working set of words in the command lines a user enters. To locate the place of the syntactic‐context switching, word‐kind ratio and window contribution are defined. It is shown that the hit rate of command prediction is improved by using these indicators, which shows the effectiveness of the proposed method.
Multimodal dialogue system MultiksDial
Authors: Kamio Hiroyuki , Matsuura Hiroshi , Nitta Tsuneo , Masai Yasuyuki 
Published: July 2007

AbstractThis paper describes the multimodal dialogue system MultiksDial, which focuses on the speech input/output. In this system, the speech recognition unit and the touch panel are used as the means of input, and the Text‐To‐Speech (TTS) synthesizer and the display are used as the means of output. In other words, the features of the system are that both the input and the output are multimodal. As the auxiliary means of input, a photoelectric sensor is used to realize a smooth dialogue by monitoring the behavior of the user and by guiding the operation. An information guide system is implemented on MultiksDial, and the operability of the user interface is evaluated.The following characteristics of the speech input are demonstrated as the result of the comparison experiment of the input mode. The direct indication by the speech input can execute the operation faster than the touch input, where the stepwise indication is required. Another point is that the beginner can execute? smooth dialogue by guiding the operation by the synthesized speech. By those results, it is verified that the multimodal implementation of the dialogue channel is useful in realizing an efficient dialogue between the user and the system.
Recovery of an SHGC shape and pose from shading and contour based on weak lambertian assumption
Authors: Nakamura Takayuki , Asada Minoru , Shirai Yoshiaki 
Published: July 2007

AbstractThis paper discusses the quantitative method for recovering the pose and shape of the straight homogeneous generalized cylinder (SHGC), based on the quantitative constraint assuming the weak uniform random reflection (weak Lambertian assumption). The weak Lambertian assumption is a generalization of the strictly complete random reflection model (strict Lambertian model). No knowledge of the light source or the surface reflection coefficient is required in the proposed method. As a first step, the position of the axis of SHGC is determined on the image. Then, the weak Lambertian assumption is applied to the intensity distribution along the parallel (latitude) which corresponds to the extrema of the sweeping function on SHGC to recover its pose. Then, the weak Lambertian assumption is also applied to the intensity distributions along other parallels to recover the position of the axis of SHGC in the three‐dimensional space. To demonstrate the effectiveness of the proposed method, an experiment is shown for the synthesized image and the real image.
Multiscale structure from multiviews by ▽2G filtered three‐dimensional voting
Authors: Mori Takeaki Y. , Suzuki Satoshi , Horikoshi Tsutomu , Yasuno Takayuki 
Published: July 2007

AbstractA hierarchical matching is the most efficient way to recognize a 3‐D object. In most conventional methods of 3‐D object recognition, a hierarchical structure is formed after the detailed 3D structure of an object has been extracted by dividing it coarsely. This approach is very inefficient, since it is difficult to obtain a detailed 3D structure initially in addition to a large amount of computation time.This paper proposes a method which extracts a multiscale 3D structure directly from coarse to fine. In this method, a space containing an object is divided into coarse voxels, and a “3D voting” is applied. This voting adds a certain value to a voxel through which a back‐projected line connects the center of the camera lens and a feature point on an image. A voxel having a high value is regarded as a region containing a 3D feature point, and this is extracted. Extraction of a hierarchical structure is carried out by repeating the dividing process from coarse voxels to fine voxels so that the operation becomes efficient.This paper also analyzes the effects of the deviation of a feature point in an image and the deviation of the camera center on the 3D voting. The paper shows also that an application of a ▽2G filter to the voxel space (after 3D voting) is effective in suppressing the errors due to the deviations. The method has been confirmed successfully by processing six complex test images.
Automatic vehicle image extraction based on spatio‐temporal image analysis
Authors: Nakanishi Tadashi , Shio Akio , Ishii Ken‐Ichiro 
Published: July 2007

AbstractThis paper proposes an automatic method of extracting the image of a vehicle moving along a straight road from a sequential video image. The method has been designed to be independent of the type of vehicle and the background, and to obtain an image with minimum defective areas. The image of the vehicle is extracted by analyzing a locus in a spatio‐temporal image seen through a slit in a fixed video camera, by updating the background image and superimposing a time‐series of the background difference image. The method can extract a full image of various types of vehicles in an arbitrary background with minimum defects, and can separate the images of two vehicles when one crosses in front of the other. The method has been tested successfully with actual traffic (including traffic starting from a traffic light). The results show that the method is practical for smoothly flowing traffic. The method has also been tested successfully for identifying vehicle types.
Human‐robot interface with attention
Authors: Imai Michita , Anzai Yuichiro , Hiraki Kazuo 
Published: July 2007

AbstractThis paper describes the utterance generation system Linta‐II, which was developed aiming at the realization of the flexible human‐robot interface. Linta‐II is implemented on an autonomous mobile robot. Based on the information from the sensor installed on the robot, the utterance can be generated according to the situation.In Linta‐II, the sensor information is acquired effectively using the attention mechanism. The attention mechanism is constructed as a set of entities executing simple symbol processings. It realizes two kinds of attentions, i.e., the involuntary and voluntary attentions. The involuntary attention has the function of paying immediate attention to the external event. The voluntary attention is activated by other modules such as the action control unit, and executes the top‐down processing.Linta‐II utilizes those two kinds of attention mechanisms, and can generate the utterance according to the situation, even if the rule to determine the sensor information to be referred to cannot completely be described. This paper demonstrates the effectiveness of the attention mechanism by presenting several examples of utterances by Linta‐II.
Improved extendible hashing with high concurrency
Authors: Hirano Yasuhiro , Satoh Tetsuji , Miura Fumiaki 
Published: July 2007

AbstractWe propose an improved extendible hashing scheme and a bucket multi‐versioning scheme that achieve a higher concurrency. In our improved extendible hashing, the global depth and directory entries are asynchronously modified to reduce lock conflicts on the directory. Furthermore, bucket multi‐versioning enables read‐only access to a bucket which is being split. Simulation studies show that these two methods provide an increase in speed in proportion to the number of processors and that they enable concurrent insertions and retrievals to be performed without either affecting the other.
Precise verification of seal impressions
Authors: Shibayama Jun'Ichi , Maeda Akira 
Published: July 2007

AbstractA method is proposed to verify seal impressions automatically. It has the following characteristics, and its effects are proved: (1) efficiency to judge genuine seals, even if the seals are degraded to certain extent, as in blur, scratchy or spotty impressions; (2) safety to reject false seals rigorously. The authors precise verification method uses small block information of seal conditions to cope with the above contradictory characteristics. Also, seal impression models are proposed to evaluate the trade‐off by simulation. Parameters in the method are tuned using the models, and by experiments it is proved that the method has both efficiency and safety.