Ju-Young KIM Ki-Hong KIM Hee-Chul HWANG Duk-Gyoo KIM
A novel image enhancement algorithm that can efficiently detect a small target of panoramic infrared (IR) imagery is proposed. Image enhancement is the first step for detecting and recognizing a small target in the IR imagery. The essence of the proposed algorithm is to utilize the independent histogram equalization (HE) separately over two sub-images obtained by decomposing the given image through the statistical hypothesis testing (SHT). Experimental results show that the proposed algorithm has better discrimination and lower false alarm rate than the conventional algorithms.
Liyang XU Sunil KUMAR Mrinal MANDAL
In this paper, we present an MPEG-4 decoding scheme based on reversible variable length code. The scheme is purely decoder based and compliance with the standard is fully maintained. Moreover, the data recovery scheme suggested in MPEG-4 can still be used as the default scheme. Simulation results show that the proposed scheme achieves better data recovery, both in terms of PSNR and perceptual quality, from error propagation region of a corrupted video packet, as compared to existing MPEG-4 scheme.
Jun OTSUKI Hao SAN Haruo KOBAYASHI Takanori KOMURO Yoshihisa YAMADA Aiyan LIU
This paper presents a technique for reducing spurious output of balanced modulators used in transmitters and arbitrary waveform generators. Two-step upconversion is a convenient way to produce a desired single-sideband (SSB) radio-frequency (RF) signal--baseband quadrature I and Q signals (which are analog outputs of direct digital frequency synthesizers) are upconverted by mixers and local oscillators (LOs)--but mismatches between the DACs in I and Q paths cause spurious output. We propose a method of dynamically matching the I and Q paths by multiplexing two DACs between I and Q paths in a pseudo-random manner. MATLAB simulation shows that multiplexing the two DACs spreads the spurious output, caused by mismatches between the two DACs, in the frequency domain, and reduces the peak level of spurious signals.
An overview on the physics and circuit design oriented background of the advanced compact model HICUM is presented. Related topics such as the approach employed for geometry scaling and parameter extraction are briefly discussed. A model hierarchy is introduced, that addresses a variety of requirements encountered during the increasingly complicated task of designing analog and high-frequency circuits.
Recently, Yeh et al. proposed an improvement on Zhu et al.'s password based authenticated key exchange protocol based on RSA, in order to make the protocol withstand undetectable on-line password guessing attacks and also to provide explicit key authentication. The improved scheme, however, is still susceptible to off-line password guessing attacks. Accordingly, the current letter demonstrates the vulnerability of Yeh et al.'s scheme regarding off-line password guessing attacks.
Nobuyuki MASUMI Masataka NAKAMURA
In this paper, we propose a circuit configuration for the low-frequency second-order active RC BPF (band pass filter) which has stable high Q. This proposed circuit is a high Q low-frequency one with a small capacitance, which is realized by applying an output capacitance multiplier to the circuit. Then a detailed circuit analysis is performed for the proposed circuit. From the simulation results of fo and Q for various combinations of circuit element values, we can confirm that the circuit realization of a center frequency of several Hz is possible by employing chip condensers of dozens of nF. The bread-board circuit of this configuration is confirmed to have small temperature dependences of fo and Q by the experiment. It is also clarified from detailed noise analysis and noise measurement that the circuit noise is sufficiently maintained at a low level.
We have proposed a novel spatial filtering technique named "VIrtual Subcarrier Assignment (VISA)" for orthogonal frequency division multiplexing (OFDM) signals, which enables the transceiver equipped with an adaptive array antenna (AAA) to selectively receive or reject OFDM signals through coloring them with different virtual subcarrier positions in their frequency spectra. In this paper, we develop the VISA to use multiple virtual subcarrier assignment, which assigns a different combination of multiple virtual subcarrier positions in the frequency spectrum to each OFDM signal. Furthermore, we present two kinds of recursive least square (RLS)-based array weight control methods to support the VISA with multiple subcarrier puncturing in an IEEE802.11a-based system and evaluate the link-level performance in typical indoor wireless environments by computer simulations.
Recently, efficient algorithms have been proposed for finding all characteristic curves of one-port piecewise-linear resistive circuits. Using these algorithms, a middle scale one-port circuit can be represented by a piecewise-linear resistor that is neither voltage nor current controlled. In this letter, an efficient algorithm is proposed for finding all dc operating points of piecewise-linear circuits containing such neither voltage nor current controlled resistors.
Keiichi HANDA Shigeru MATSUMOTO Masashi NAKAMOTO Naoshi UCHIHIRA
Investment planning for power plants involves making a long-term plan covering various facility investments, such as the construction of a new power plant or the replacement of an old plant with a new one, under uncertain environments. In this paper, we propose an optimization method for such a planning problem. Our method is based on decision tree analysis, in which uncertain environments are described as scenarios. The maintenance of existing plants is also taken into account by introducing the option of large-scale repair in addition to replacement. In order to avoid combinatorial explosion of failure event scenarios of plants, we introduce the concept of failure risk cost which contributes to simplification of the decision tree and reduction of the calculation time.
Kazuma AIZAWA Haruhiko KAIYA Kenji KAIJIRI
We introduce a method, so called FC method, for maintaining software resources, such as source codes and design documents, in consumer electronics products. Because a consumer electronics product is frequently and rapidly revised, software components in such product are also revised in the same way. However, it is not so easy for software engineers to follow the revision of the product because requirements changes for the product, including the changes of its functionalities and its hardware components, are largely independent of the structure of current software resources. FC method lets software engineers to restructure software resources, especially design documents, stepwise so as to follow the requirements changes for the product easily. We report an application of this method in our company to validate it. From the application, we can confirm that the quality of software was improved about in twice, and that efficiency of development process was also improved over four times.
Chinchun MENG Bo-Chen TSOU Sheng-Che TSENG
A method to monitor the GaInP/GaAs HBT device structure including emitter ledge thickness is demonstrated in this paper. The base thickness and base doping density are obtained through base transit time and base sheet resistance measurements while the base transit time is measured through the cut-off frequency measurements at various bias points. A large size two-emitter HBT device is used to measure the ledge thickness. Emitter doping profile and collector doping profile are obtained by the large size HBT device through C-V measurements. An FATFET device formed by two emitters as drain and source terminals and the interconnect metal as the on-ledge Schottky gate between two emitters is used to measure the ledge thickness.
Tetsuya HIROSE Toshimasa MATSUOKA Kenji TANIGUCHI Tetsuya ASAI Yoshihito AMEMIYA
An ultralow power constant reference current circuit with low temperature dependence for micropower electronic applications is proposed in this paper. This circuit consists of a constant-current subcircuit and a bias-voltage subcircuits, and it compensates for the temperature characteristics of mobility µ, thermal voltage VT, and threshold voltage VTH in such a way that the reference current has small temperature dependence. A SPICE simulation demonstrated that reference current and total power dissipation is 97.7 nA, 1.1 µW, respectively, and the variation in the reference current can be kept very small within 4% in a temperature range from -20 to 100.
There have been many arguments that the underlying structure of natural languages is beyond the descriptive capacity of context-free languages. A well-known example is tree adjoining grammars; less common are spine grammars, linear indexed grammars, head grammars, and combinatory categorial grammars. It is known that these models of grammars have the same generative power of string languages and fall into the class of mildly context-sensitive grammars. For an automaton, it is known that the class of languages accepted by transfer pushdown automata is exactly the class of linear indexed languages. In this paper, deterministic transfer pushdown automata is introduced. We will show that the language accepted by a deterministic transfer pushdown automaton is generated by an unambiguous spine grammar. Moreover, we will show that there exists an inherently ambiguous language.
Eiji KAWAI Youki KADOBAYASHI Suguru YAMAGUCHI
Polling I/O mechanisms on the Unix platform such as select() and poll() cause high processing overhead when they are used in a heavily-loaded network server with many concurrent open sockets. Large waste of processing power incurs not only service degradation but also various troubles such as high electronic power consumption and worsened MTBF of server hosts. It is thus a serious issue especially in large-scale service providers such as an Internet data center (iDC) where a great number of heavily-loaded network servers are operated. As a solution of this problem, we propose a technique of fine-grained control on the invocation intervals of the polling I/O function. The uniqueness of this study is the utilization of POSIX real-time scheduling to enable the fine-grained execution control. Although earlier solutions such as an explicit event delivery mechanism also addressed the problem, they require major modification in the OS kernel and transition from the traditional polling I/O model to the new explicit event-notification model. On the other hand, our technique can be implemented with low cost because it just inserts a few small blocks of codes into the server program and does not require any modification in the OS kernel.
The efficiency of algorithms managing data caches has a major impact on the performance of systems that utilize client-side data caching. In these systems, two versions of data can be maintained without additional overhead by exploiting the replication of data in the server's buffer and clients' caches. In this paper, we present a new cache consistency algorithm employing versions: Two Versions-Callback Locking (2V-CBL). Our experimental results indicate that 2V-CBL provides good performance, and in particular outperforms a leading cache consistency algorithm, Asynchronous Avoidance-based Cache Consistency, when some clients run only read-only transactions.
Gentaro FUKANO Yoshihiko NAKAMURA Hotaka TAKIZAWA Shinji MIZUNO Shinji YAMAMOTO Kunio DOI Shigehiko KATSURAGAWA Tohru MATSUMOTO Yukio TATENO Takeshi IINUMA
We have proposed a recognition method for pulmonary nodules based on experimentally selected feature values (such as contrast, circularity, etc.) of pathologic candidate regions detected by our Variable N-Quoit (VNQ) filter. In this paper, we propose a new recognition method for pulmonary nodules by use of not experimentally selected feature values, but each CT value itself in a region of interest (ROI) as a feature value. The proposed method has 2 phases: learning and recognition. In the learning phase, first, the pathologic candidate regions are classified into several clusters based on a principal component score. This score is calculated from a set of CT values in the ROI that are regarded as a feature vector, and then eigen vectors and eigen values are calculated for each cluster by application of principal component analysis to the cluster. The eigen vectors (we call them "eigen-images") corresponding to the S-th largest eigen values are utilized as base vectors for subspaces of the clusters in a feature space. In the recognition phase, correlations are measured between the feature vector derived from testing data and the subspace which is spanned by the eigen-images. If the correlation with the nodule subspace is large, the pathologic candidate region is determined to be a nodule, otherwise, it is determined to be a normal organ. In the experiment, first, we decide on the optimal number of subspace dimensions. Then, we demonstrated the robustness of our algorithm by using simulated nodule images.
Kentaro NISHIMORI Nobuhiko TACHIKAWA Yasushi TAKATORI Riichi KUDO Koichi TSUNEKAWA
Recently, Multiple Input Multiple Output-Orthogonal Frequency Division Multiplexing (MIMO-OFDM) has attracted much attention as a technology achieving high-speed wireless transmission with a limited bandwidth. However, since bit loading and adaptive modulation per sub-carrier should be employed according to the transmission quality of each sub-carrier in MIMO-OFDM, it is very important to understand the frequency correlation characteristics in broadband MIMO channels. This paper investigates the frequency correlation characteristics based on the antenna configuration for actual indoor MIMO channels. The results show that the frequency correlation of the channel capacity for the array antenna configured in the horizontal plane is significantly different compared to that configured in the vertical plane. Moreover, we propose a new cluster model that considers the antenna configuration in both the horizontal and vertical planes to estimate the frequency correlation in broadband MIMO channels.
In many electromagnetic field problems, matrix equations were always deduced from using the method of moment. Among these matrix equations, some of them might require a large amount of computer memory storage which made them unrealistic to be solved on a personal computer. Virtually, these matrices might be too large to be solved efficiently. A fast algorithm based on a Toeplitz matrix solution was developed for solving a bordered Toeplitz matrix equation arising in electromagnetic problems applications. The developed matrix solution method can be applied to solve some electromagnetic problems having very large-scale matrices, which are deduced from the moment method procedure. In this paper, a study of a computationally efficient order-recursive algorithm for solving the linear electromagnetic problems [Z]I = V, where [Z] is a Toeplitz matrix, was presented. Upon the described Toeplitz matrix algorithm, this paper derives an efficient recursive algorithm for solving a bordered Toeplitz matrix with the matrix's major portion in the form of a Toeplitz matrix. This algorithm has remarkable advantages in reducing both the number of arithmetic operations and memory storage.
Hiroshi YOSHIDA Takehiko TOYODA Makoto ARAI Ryuichi FUJIMOTO Toshiya MITOMO Masato ISHII Rui ITO Tadashi ARAI Tetsuro ITAKURA Hiroshi TSURUMI
A direct conversion receiver for W-CDMA, which consumes extremely low power, is presented. The receiver consists of a low-noise amplifier (LNA) IC, a receiver IC and other passive components such as an RF-SAW (Surface Acoustic Wave) filter. The receiver IC includes a quadrature demodulator (QDEM) with a local oscillator (LO) divider, low-pass filters (LPFs) for channel selection, variable gain amplifiers (VGAs) with dynamic range of 80 dB, and a fractional-N synthesizer. The power consumption for the entire receiver chain was only 30.8 mA at supply voltage of 2.7 V.
Kyoko ARIYASU Ichiro YAMADA Hideki SUMIYOSHI Masahiro SHIBATA Nobuyuki YAGI
We have developed a visualization system for dialog text exchanged in e-learning virtual classrooms. In this system, text-based online discussions among learners are effectively visualized as discussions held in a virtual classroom in cyberspace. Discussion participants are displayed as avatars. The virtual classroom maintains the interest of learners because it incorporates professional camerawork and switching know-how based on rules derived from an analysis of 42 TV programs. The gestures of the CG avatar depend on the dialog text. A series of virtual classroom experiments confirmed that elementary and junior high school students maintained an interest in using the system.