Tatsuya SAKANUSHI Jie HU Kou YAMADA
The simple repetitive control system proposed by Yamada et al. is a type of servomechanism for periodic reference inputs. This system follows a periodic reference input with a small steady-state error, even if there is periodic disturbance or uncertainty in the plant. In addition, simple repetitive control systems ensure that transfer functions from the periodic reference input to the output and from the disturbance to the output have finite numbers of poles. Yamada et al. clarified the parameterization of all stabilizing simple repetitive controllers. Recently, Yamada et al. proposed the parameterization of all stabilizing two-degrees-of-freedom (TDOF) simple repetitive controllers that can specify the input-output characteristic and the disturbance attenuation characteristic separately. However, when using the method of Yamada et al., it is complex to specify the low-pass filter in the internal model for the periodic reference input that specifies the frequency characteristics. This paper extends the results of Yamada et al. and proposes the parameterization of all stabilizing TDOF simple repetitive controllers with specified frequency characteristics in which the low-pass filter can be specified beforehand.
Dai-Kyung HYUN Dae-Jin JUNG Hae-Yeoun LEE Heung-Kyu LEE
In this paper, we propose a novel camera identification method based on photo-response non-uniformity (PRNU), which performs well even with rotated videos. One of the disadvantages of the PRNU-based camera identification methods is that they are very sensitive to de-synchronization. If a video under investigation is slightly rotated, the identification process without synchronization fails. The proposed method solves this kind of out-of-sync problem, by achieving rotation-tolerance using Optimal Tradeoff Circular Harmonic Function (OTCHF) correlation filter. The experimental results show that the proposed method identifies source device with high accuracy from rotated videos.
Tomohiko MIMURA Koji YAMAMOTO Masahiro MORIKURA Ayako IWATA Akihiko NISHIO
In this paper, we introduce the concept of a multi-operator mobile relay node (RN) for cellular networks on buses or trains. The installation of RNs improves spectral efficiency because an antenna with a higher gain than that of user equipment (UE) can be installed in an RN. However, installing different RNs for different operators is not efficient because of the large amount of space needed to install multiple RNs in a bus. Thus, sharing one RN among multiple operators is a more practical approach. When we use a multi-operator mobile RN, the required amount of resource for each operator varies independently as the RN moves. Consequently, we propose a system of shared-spectrum allocation among operators for RN-UEs communication. Shared bandwidth can be allocated to operators according to link quality in order to achieve effective utilization of radio resources. However, to introduce shared-spectrum allocation, fairness among the operators and the total efficiency of the system should be taken into consideration. Using computer simulations, we evaluate shared-spectrum allocation based on the Nash bargaining solution (NBS). The results, in terms of both fairness and efficiency, indicate that total throughput can be improved by approximately 20% compared with the situation where multiple operators install different RNs individually.
In this paper, we consider a multi-cell cognitive radio network (CRN), which overlays a multi-cell primary network. To manage the coexistence, a primary-willingness based coexistent architecture and a novel intra-cell spectrum overlay and inter-cell spectrum underlay sharing method are proposed. In the system, primary base stations will broadcast pilot signals and interference margins to assist the CRN for interference channel evaluation and power control. Subject to the interference margins imposed by the primary network, we define a utility (payoff) function that can represent the secondary system performance while taking into account the co-channel interference among secondary cells. A distributed resource allocation scheme is devised to guarantee the primary performance, and at the same time, maximize the secondary utility without any cooperation among cognitive base stations (CBS). Quality of Service among users is also considered by the scheme such that the instantaneous data rate for each secondary user is larger than a given minimum rate. The resource allocation problem can be decomposed into two subproblems: subchannel allocation and distributed power allocation game (DPAG). We prove that there exists a Nash equilibrium in the DPAG and the equilibrium is unique. Moreover, the DPAG is also Pareto optimal in some constrained environments, that is, no CBS can further improve its performance without impairing others. The proposed algorithm turns out to converge to an equilibrium within a small number of iterations.
Kohei HANADA Koji YAMAMOTO Masahiro MORIKURA Koichi ISHIHARA Riichi KUDO
As the demand for high-throughput communications in wireless LANs (WLAN) increases, the need for expanding channel bandwidth also increases. However, the use of wider band channels results in a decrease in the number of available channels because the total available bandwidth for WLAN is limited. Therefore, if multiple access points (APs) are in proximity and the cells overlap, it is difficult for each AP to use an orthogonal channel and competition increases between APs using the same channel. Coordination of APs is one promising approach; however, it is impractical to control all APs in WLAN systems. To cope with this problem, we proposed to analyze throughput performances of a multibandwidth channel selection by the coordinating APs at Nash equilibria, which can be considered as operating points for independent channel selection by APs. To clarify the effect of coordinating APs, we assume a simple scenario where the cells of three or more APs overlap, and each AP can select multibandwidth channels to maximize their own throughput. Through game-theoretic analysis, we find that the coordinated APs are able to select channels more effectively than if each AP independently selects channels. Consequently, the total throughput of the coordinated APs at Nash equilibria is significantly improved.
Ryunosuke SOUMA Shouhei KIDERA Tetsuo KIRIMOTO
Ultra-wideband (UWB) pulse radar has high range resolution and permeability in a dielectric medium, and has great potential for the non-destructive inspection or early-stage detection of breast cancer. As an accurate and high-resolution imaging method for targets embedded in a dielectric medium, extended range points migration (RPM) has been developed. Although this method offers an accurate internal target image in a homogeneous media, it assumes the permittivity of the dielectric medium is given, which is not practical for general applications. Although there are various permittivity estimation methods, they have essential problems that are not suitable for clear, dielectric boundaries like walls, or is not applicable to an unknown and arbitrary shape of dielectric medium. To overcome the above drawbacks, we newly propose a permittivity estimation method suitable for various shapes of dielectric media with a clear boundary, where the dielectric boundary points and their normal vectors are accurately determined by the original RPM method. In addition, our method iteratively compensates for the scattered waveform deformation using a finite-difference time domain (FDTD) method to enhance the accuracy of the permittivity estimation. Results from a numerical simulation demonstrate that our method achieves accurate permittivity estimation even for a dielectric medium of wavelength size.
Xun SHAO Go HASEGAWA Yoshiaki TANIGUCHI Hirotaka NAKANO
The Internet is composed of many distinct networks, operated by independent Internet Service Providers (ISPs). The traffic and economic relationships of ISPs are mainly decided by their routing policies. However, in today's Internet, overlay routing, which changes traffic routing at the application layer, is rapidly increasing and this challenges the validity of ISPs' existing agreements. We study here the economic implications of overlay routing for ISPs, using an ISP interconnection business model based on a simple network. We then study the overlay traffic patterns in the network under various conditions. Combining the business model and traffic patterns, we study the ISPs' cost reductions with Bill-and-Keep peering and paid peering. We also discuss the ISPs' incentive to upgrade the network under each peering strategy.
Tomohiro KAWAMURA Takafumi KANAZAWA Toshimitsu USHIO
Evolutionary stability has been discussed as a fundamental issue in single-criterion games. We extend evolutionarily and neutrally stable strategies to multicriteria games. Keeping in mind the fact that a payoff is given by a vector in multicriteria games, we provide several concepts which are coincident in single-criterion games based on partial vector orders of payoff vectors. We also investigate the hierarchical structure of our proposed evolutionarily and neutrally stable strategies. Shapley had introduced concepts such as strong and weak equilibria. We discuss the relationship between these equilibria and our proposed evolutionary stability.
Lin-bo LUO Jun CHEN Sang-woo AN Chang-shuai WANG Jong-joo PARK Ying-chun LI Jong-wha CHONG
In lowlight conditions, images taken by phone cameras usually have too much noise, while images taken using a flash have a high signal-noise ratio (SNR) and look unnatural. This paper proposes a novel imaging method using flash/no-flash image pairs. Through transferring the natural tone of the former to the latter, the resulting image has a high SNR and maintains a natural appearance. For realtime implementation, we use two preview images, which are taken with and without flash, to estimate the transformation function in advance. Then we use this function to adjust the tone of the image captured with flash in real time. Thus, the method does not require a frame memory and it is suitable for cell phone cameras.
Ran LI Zong-Liang GAN Zi-Guan CUI Xiu-Chang ZHU
Novel joint motion-compensated interpolation using eight-neighbor block motion vectors (8J-MCI) is presented. The proposed method uses bi-directional motion estimation (BME) to obtain the motion vector field of the interpolated frame and adopts motion vectors of the interpolated block and its 8-neighbor blocks to jointly predict the target block. Since the smoothness of the motion vector filed makes the motion vectors of 8-neighbor blocks quite close to the true motion vector of the interpolated block, the proposed algorithm has the better fault-tolerancy than traditional ones. Experiments show that the proposed algorithm outperforms the motion-aligned auto-regressive algorithm (MAAR, one of the state-of-the-art frame rate up-conversion (FRUC) schemes) in terms of the average PSNR for the test image sequence and offers better subjective visual quality.
Tatsuya KON Takashi OBI Hideaki TASHIMA Nagaaki OHYAMA
Parametric images can help investigate disease mechanisms and vital functions. To estimate parametric images, it is necessary to obtain the tissue time activity curves (tTACs), which express temporal changes of tracer activity in human tissue. In general, the tTACs are calculated from each voxel's value of the time sequential PET images estimated from dynamic PET data. Recently, spatio-temporal PET reconstruction methods have been proposed in order to take into account the temporal correlation within each tTAC. Such spatio-temporal algorithms are generally quite computationally intensive. On the other hand, typical algorithms such as the preconditioned conjugate gradient (PCG) method still does not provide good accuracy in estimation. To overcome these problems, we propose a new spatio-temporal reconstruction method based on the dynamic row-action maximum-likelihood algorithm (DRAMA). As the original algorithm does, the proposed method takes into account the noise propagation, but it achieves much faster convergence. Performance of the method is evaluated with digital phantom simulations and it is shown that the proposed method requires only a few reconstruction processes, thereby remarkably reducing the computational cost required to estimate the tTACs. The results also show that the tTACs and parametric images from the proposed method have better accuracy.
Toshihiko YAMASAKI Tomoaki MATSUNAMI Tuhan CHEN
This paper presents a technique that analyzes pedestrians' attributes such as gender and bag-possession status from surveillance video. One of the technically challenging issues is that we use only top-view camera images to protect privacy. The shape features over the frames are extracted by bag-of-features (BoF) using histogram of oriented gradients (HoG) vectors. In order to enhance the classification accuracy, a two-staged classification framework is presented. Multiple classifiers are trained by changing the parameters in the first stage. The outputs from the first stage is further trained and classified in the second stage classifier. The experiments using 60-minute video captured at Haneda Airport, Japan, show that the accuracies for the gender classification and the bag-possession classification were 95.8% and 97.2%, respectively, which is a significant improvement from our previous work.
Chuzo IWAMOTO Yuta MUKAI Yuichi SUMIDA Kenichi MORITA
We study the computational complexity of the following two-player game. The instance is a graph G = (V,E), an initial vertex s ∈ V, and a target set T ⊆ V. A “cat” is initially placed on s. Player 1 chooses a vertex in the graph and removes it and its incident edges from the graph. Player 2 moves the cat from the current vertex to one of the adjacent vertices. Players 1 and 2 alternate removing a vertex and moving the cat, respectively. The game continues until either the cat reaches a vertex of T or the cat cannot be moved. Player 1 wins if and only if the cat cannot be moved before it reaches a vertex of T. It is shown that deciding whether player 1 has a forced win on the game on G is PSPACE-complete.
Liru LU Hiroshi HARADA Ryuhei FUNADA Chin-Sean SUM
The Start-frame-delimiter (SFD) is crucial in packet-based communications system since it indicates the end of preamble and the start of a frame. In 802.15 smart utility network system, the function of SFD is extended. Two different SFDs are used for achieving frame synchronization and at the same time, to differentiate coded and uncoded packets. This paper proposes a systematic method for the selection of SFD pair for FSK based systems. The design method is adopted by 802.15.4g Task Group with the backward compatibility to IEEE 802.15.4d systems taken into account. Four selection criteria are specified and discussed to determine the pair of sequences providing least packet error detection rate with the consideration of eliminating the adjacent channel image signal commonly occurred in the low IF receiver. The probability of false alarm and miss detection is analyzed to verify the effectiveness of the proposed selection method. The simulation results confirm that error frame detection rate of 1e-3 can be achieved with selected SFD sequences. The proposed method for selection of SFD pairs ensures a robust packet header and thus better payload protection. The SFD design approach is applicable to other packet-based wireless communication FSK systems with the support of more than one SFD sequence.
Bo GU Kyoko YAMORI Sugang XU Yoshiaki TANAKA
Recent studies have shown that the traffic load is often distributed unevenly among the access points. Such load imbalance results in an ineffective bandwidth utilization. The load imbalance and the consequent ineffective bandwidth utilization could be alleviated via intelligently selecting user-AP associations. In this paper, the diversity in users' utilities is sufficiently taken into account, and a Stackelberg leader-follower game is formulated to obtain the optimal user-AP association. The effectiveness of the proposed algorithm on improving the degree of load balance is evaluated via simulations. Simulation results show that the performance of the proposed algorithm is superior to or at least comparable with the best existing algorithms.
Xianglei XING Sidan DU Hua JIANG
We extend the Nonparametric Discriminant Analysis (NDA) algorithm to a semi-supervised dimensionality reduction technique, called Semi-supervised Nonparametric Discriminant Analysis (SNDA). SNDA preserves the inherent advantages of NDA, that is, relaxing the Gaussian assumption required for the traditional LDA-based methods. SNDA takes advantage of both the discriminating power provided by the NDA method and the locality-preserving power provided by the manifold learning. Specifically, the labeled data points are used to maximize the separability between different classes and both the labeled and unlabeled data points are used to build a graph incorporating neighborhood information of the data set. Experiments on synthetic as well as real datasets demonstrate the effectiveness of the proposed approach.
Xun SHAO Go HASEGAWA Yoshiaki TANIGUCHI Hirotaka NAKANO
Multihoming is widely used by Internet service providers (ISPs) to obtain improved performance and reliability when connecting to the Internet. Recently, the use of overlay routing for network application traffic is rapidly increasing. As a source of both routing oscillation and cost increases, overlay routing is known to bring challenges to ISPs. In this paper, we study the interaction between overlay routing and a multihomed ISP's routing strategy with a Nash game model, and propose a routing strategy for the multihomed ISP to alleviate the negative impact of overlay traffic. We prove that with the proposed routing strategy, the network routing game can always converge to a stable state, and the ISP can reduce costs to a relatively low level. From numerical simulations, we show the efficiency and convergence resulting from the proposed routing strategy. We also discuss the conditions under which the multihomed ISP can realize minimum cost by the proposed strategy.
Shasha ZHAO Qi ZHU Guangwei ZHU Hongbo ZHU
The dynamic competition between two bounded rational mobile virtual network operators (MVNOs) in a duopoly spectrum market is investigated. A two stage game is employed to model the interaction of the MVNOs and the quality of service of the secondary users is taken into account. The evolutionary game theory is introduced to model the dynamic strategy selections of MVNOs. Using replicated dynamics, the proposed evolutionary game algorithm can converge to a unique evolutionary stable strategy. Simulation results verify that the proposed algorithm can make the MVNOs adaptively adjust the strategies to approximate optimal solution.
Senya POLIKOVSKY Yoshinari KAMEDA Yuichi OHTA
Facial micro-expressions are fast and subtle facial motions that are considered as one of the most useful external signs for detecting hidden emotional changes in a person. However, they are not easy to detect and measure as they appear only for a short time, with small muscle contraction in the facial areas where salient features are not available. We propose a new computer vision method for detecting and measuring timing characteristics of facial micro-expressions. The core of this method is based on a descriptor that combines pre-processing masks, histograms and concatenation of spatial-temporal gradient vectors. Presented 3D gradient histogram descriptor is able to detect and measure the timing characteristics of the fast and subtle changes of the facial skin surface. This method is specifically designed for analysis of videos recorded using a hi-speed 200 fps camera. Final classification of micro expressions is done by using a k-mean classifier and a voting procedure. The Facial Action Coding System was utilized to annotate the appearance and dynamics of the expressions in our new hi-speed micro-expressions video database. The efficiency of the proposed approach was validated using our new hi-speed video database.
Hideki KAWAGUCHI Kazunori MAEDA Shohei KODATE Yoshihiro ITO
Streak cameras are now widely used for measurements of ultra short phenomena, such as those in semi conductor luminescence and plasma gaseous discharge. To further improve the temporal resolution and carry out higher-dimensional measurements, it is necessary to understand the electron beam behavior in detail. Thus, numerical simulations play an important role in the analysis of the streak camera. The authors have been working on the development of a numerical simulation code that uses the finite difference method (FDM) for electric field analysis, the Runge-Kutta (R-K) method for charged particle motion determination, and the particle-in-cell (PIC) method for charge density calculation. However, the use of the PIC method leads to inaccuracy in the charge density calculation in cases of high-density electron beams. To improve the accuracy of the conventional analysis of the streak camera, we perform the boundary element (BE) analysis of the streak camera.