bluuebunny/crossref_metadata_2025_split huggingface dataset:
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

AbstractThis 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

AbstractAn 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

AbstractSince 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

AbstractThis 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

AbstractAn 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

AbstractThis 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

AbstractIt 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

AbstractThe 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

AbstractA 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.
A load balancing algorithm on multiprocessor time‐sharing systems
Authors: Member Nariyoshi Yamai , Shimojo Shinji , Members Hideo Miyahara 
Published: July 2007

AbstractTo use multiprocessor systems efficiently, several load balancing algorithms have been adopted widely. However, most of the algorithms proposed so far can be applied to FCFS systems, and only a few can be applied to time‐sharing systems in wide use today. This paper proposes a load balancing algorithm designed to reduce the average response time of processes, introducing a load measure which takes into account the distribution of the work demand of each kind of process. This algorithm can be applied to a multiprocessor system with round‐robin scheduling discipline. This algorithm also seems easy to implement on actual systems because load balancing is made by assigning new processes to the lightest loaded processor rather than migrating running processes. According to the simulation experiment, the algorithm proposed here improves the average response time compared with that of the “Join the Shortest Queue” algorithm over all situations investigated.
Automatic line‐shaped defect evaluation of solid‐state imaging device
Authors: Asano Toshio , Nonmember Seiji Hata, , Koishikawa Susumu , Nonmembers Youichi Shimizu, 
Published: July 2007

AbstractA method to evaluate quantitatively the faint line‐shaped defect existing in the imaging signal of a solid‐state imaging device has been developed. Classifying line‐shaped defects into nondirectional ones for which the direction of the line defect cannot be specified and those of vertical direction, we investigate an evaluation algorithm for each of them and evaluate them by experiments. For nondirectional line defects, noticing that the line defects resemble straight line defects, line defects are detected within an image using Hough transformation. Next, computing the length and contrast of line defects as evaluation parameters, the degree of defect was evaluated. In the computation, efficient processing was attempted by making some additions to the processing method. As a result, detection and evaluation were achieved within a practically reasonable time. Taking into consideration vertical line defects and noticing that defect evaluations by human eye are different depending on frequency ranges of lines, defects of contrast in high‐frequency range using data interpolation and contrast in low‐frequency range using smoothing process were found and then the degree of defects by these contrasts was evaluated. Using the forementioned algorithm, a system was developed for automatic evaluation of line‐shaped defects for experiment and compared with the traditional evaluation by human eye. As a result, good agreement was obtained and the line‐shaped defects of a solid‐state imaging device were evaluated automatically.
Automated classification of pneumoconiosis radiographs based on recognition of small rounded opacities
Authors: Chen Xuan , Toriwaki Jun‐Ichiro , Hasegawa Jun‐Ichi 
Published: July 2007

AbstractThis paper proposes an automated procedure for both the size classification and the density (profusion) classification of the pneumoconiosis radiograph. The procedure is as follows. The rounded opacities are enhanced using a second‐order difference linear filter with a circular weighting function which is designed based on the model for the shape and the density distribution of the pneumoconiosis rounded opacities. The candidates for the center of the rounded opacity are extracted, and the size classification is made by estimating the size of the rounded opacity. Then the density classification is made by measuring the density of the rounded opacity. Thus, the classification procedure is conceptually composed of three stages: (1) recognition of rounded opacity; (2) size classification; and (3) density classification. This paper concentrates on the size classification and the method is described. The result is shown with a discussion for the classification experiment using ILO international standard film. In the experiment, the recognition rate of approximately 72 percent was obtained for both the size and the density classifications, using only one feature parameter. This result indicates the usefulness of the proposed method, and an attempt is made to recognize directly the individual pneumoconiosis rounded opacity. Another feature of the method is that the weighting function is selected based on the enhancement effect of the filter. This point may be interesting as an example of the automatic parameter determination of the emphasis filter in the image processing.
Development and application of vehicle‐license number recognition system using real‐time image processing
Authors: Kanayama Kenji , Fujikawa Yoshimasa , Fujimoto Koichi 
Published: July 2007

AbstractThe authors have proposed a system architecture and a high‐speed method to extract characters (a four‐digit vehicle number) on a vehicle license plate for a realtime vehicle license number recognition system. This paper describes the results of field tests of a system which is based on the previous work but with some further developments. To identify characters on a vehicle license plate, a template‐matching method is used which compares the skeleton pattern of characters and its background pattern. To use the system at night, a continuous illumination with two light sources is employed. The experiments including simulations confirm the usefulness of the proposed method at night. The field tests show that about 75 percent of all passing vehicles were recognized successfully in the daytime and about 55 percent at night. The average processing time is about 150 ms, and the 98 percentile value is about 410 ms. These values are sufficient for practical measurements of a vehicle traveling time (between two points). This paper describes also a system to give traveling information to vehicle users, by employing message boards as an example of application of the proposed system.
Hierarchical shape description using skeletons and hierarchical shape discrimination by neural networks
Authors: Matsushita Hiroshi , Mori Yoshihiro , Inui Toshio 
Published: July 2007

AbstractIn the shape recognition of a nonrigid three‐dimensional (3‐D) body, there is difficulty in how to describe changes of viewpoint and shape, and how to relate it to an efficient recognition method. This paper proposes a hierarchical description based on multiple‐resolution representation using skeletons as primitives for the shape descriptions. Further, methods for hierarchical learning and discrimination using a neural network model are proposed and a simulation of a global discrimination network has been implemented. The results indicate that features are reflected well by the skeletons, and that flexible, efficient shape discrimination is possible.
A comparative study with feedforward pdp models for alphanumeric character recognition
Authors: Kato Yoshinaga , Tan Yasuo , Ejima Toshiaki 
Published: July 2007

AbstractThis paper discusses the alphanumeric character recognition using two kinds of PDF (parallel distributed processing) models. The models considered are the FPM (fuzzy partition model) of a new type with multiple input/output units, and the conventional BP (back‐propagation) model. Two BP algorithms with different error evaluation functions are applied to those models, and the number of trainings and the recognition rate in the multifont recognition are compared.As a result of experiment, it is shown that FPM with Kullback divergence evaluation can realize a more accurate recognition with fever number of trainings, compared to the conventional BP model. The reason for the reduction of the number of trainings is discussed when the mutual inhibition in FPM unit as well as the Kullback divergence as the error evaluation function are employed.
Probability risk transmission matrix as a decision tool for assessing methods of transmission interruption of Wuchereria bancrofti infection
Authors: DAS P. K. , VANAMAIL P. 
Published: June 2007

SUMMARYLymphatic filariasis continues to cause severe morbidity and economic loss. The World Health Assembly (WHA) has passed a resolution to eliminate this disease by 2020. The major thrust of the elimination strategy is interrupting transmission by anti-parasitic treatment of entire communities. However, both vector density and community microfilaria load (CMFL) influence the intensity of transmission. Therefore, using a logistic regression approach a relationship has been established between the Risk of Infection Index (RII), vector density and CMFL. The present analysis indicates that there is no risk of transmission as long as the CMFL is maintained below 5 microfilaria (mf)/60 mm3 and the vector density per man-hour (MHD) is <25. However, transmission may continue when vector density is >25 and CMFL is <5 mf/60 mm3. In situations where CMFL is very high, parasitic control by mass administration may be cost effective in interrupting transmission. But at lower level of CMFL (<4 mf) and higher level of vector density it might be more cost effective to use vector control methods. A RII value <0·2 is considered to be the threshold for confirming interruption of transmission. Thus, the relationship has been depicted in the form of a probability matrix, which could be used for selecting an appropriate control strategy.
Gendered Transformations: Beauty, Love, and Sexuality in Qajar Iran
Authors: Najmabadi Afsaneh 
Published: July 2007

Qajar Iran (1785-1925) began with notions of beauty that were largely gender-undifferentiated; that is, beautiful men and women were depicted with very similar facial and bodily features. Sometimes the only way one can tell who is male or female is through style of headgear. Other times it remains very difficult to tell if we are looking at a man or a woman.In written sources, the same adjectives, such as moon-faced (māh ṭalᶜat), rose-faced (gul rukhsar), cypress-statured sarv qāmat or sarv qad), ruby lips (laᶜl lab), bow-eyebrows (kamān abrū), or alternatively crescent eyebrows (hilāl abrū), black-scented hair (mushgīn mū), narrow-waist (miyān bārīk or kamar bārīk), narcissus-eyed (nargīs chashm), etc., are used to describe male and female beauty.
Piecing together the peace dividend: Managing change in communities dependent on defence expenditure
Authors: Roe William 
Published: July 2007

Summary To date governments have been slow to appreciate that, as well as a peace dividend, arms reduction will bring social and economic hardship to communities which have relied upon defence expenditure for employment. Conversion of military bases, let alone restructuring of defence industries, cannot be left to market forces to achieve; government intervention is required to ensure the successful adjustment of communities. During the Cold War, the dominance of the “military-industrial complex” spread the notion that disarmament would threaten not only security, but jobs. Current geopolitical changes present an opportunity to challenge this argument. Local employment initiatives are essential to prevent defence cuts from causing unemployment.
SETTING UP A HOSPITAL‐BASED DEPENDENCY RESOURCE UNIT
Authors: Dowd Toni 
Published: July 2007

AbstractThis paper commences with a brief historical review of addiction intervention in the New England Region of New South Wales. The concept and role of a hospital‐based assessment unit and the philosophical premises underlying its functioning are discussed briefly. The implementation of a pilot service at the Armidale and New England Hospital is outlined and some of the dilemmas encountered in consolidating the service are highlighted. Some future issues are examined.
LIAISON NURSING IN A HOSPITAL‐BASED DRUGS AND ALCOHOL SERVICE UNIT
Authors: Goodin Bill 
Published: July 2007

AbstractThis paper describes the role and function of the Liaison Nurse as a specialist nurse in Drugs and Alcohol in a major teaching hospital setting. It argues that the Liaison Nurse can stimulate change by supporting and facilitating the role of the general nurse as an early detection and intervention agent in a patient population with alcohol and other drug related disorders.
THE STATE OF HOSPITAL INTERVENTION IN QUEENSLAND WITH RESPECT TO ALCOHOL AND DRUG PROBLEMS
Authors: Bolton M. 
Published: July 2007

AbstractThe philosophy of the Queensland Alcohol and Drug Dependence Services with respect to the development of treatment services is to promote and catalyze the establishment of such services by other health personnel and agencies — in particular by hospitals. This is necessary for logistic reasons as well as to ‘legitimize’ the treatment of substance abuse in general health and medical circles.The present situation is outlined and different models of hospital intervention in different regions of Queensland are presented. The future of the treatment of substance abuse lies in increased commitment by traditional health and medical services, such as hospitals, to the alleviation of these problems.