Yuki NANJO Masaaki SHIRASE Takuya KUSAKA Yasuyuki NOGAMI
To be suitable in practice, pairings are typically carried out by two steps, which consist of the Miller loop and final exponentiation. To improve the final exponentiation step of a pairing on the BLS family of pairing-friendly elliptic curves with embedding degree 15, the authors provide a new representation of the exponent. The proposal can achieve a more reduction of the calculation cost of the final exponentiation than the previous method by Fouotsa et al.
Osamu KAGAYA Yasuo MORIMOTO Takeshi MOTEGI Minoru INOMATA
This paper proposes a transparent glass quartz antenna for 5G-millimeter-wave-connected vehicles and clarifies the characteristics of signal reception when the glass antennas are placed on the windows of a vehicle traveling in an urban environment. Synthetic fused quartz is a material particularly suited for millimeter-wave devices owing to its excellent low transmission loss. Realizing synthetic fused quartz devices requires accurate micromachining technology specialized for the material coupled with the material technology. This paper presents a transparent antenna comprising a thin mesh pattern on a quartz substrate for installation on a vehicle window. A comparison of distributed transparent antennas and an omnidirectional antenna shows that the relative received power of the distributed antenna system is higher than that of the omnidirectional antenna. In addition, results show that the power received is similar when using vertically and horizontally polarized antennas. The design is verified in a field test using transparent antennas on the windows of a real vehicle.
Daisaku MUKAIYAMA Masayoshi YAMAMOTO
Aluminum Electrolytic Capacitors are widely used as the smoothing capacitors in power converter circuits. Recently, there are a lot of studies to detect the residual life of the smoothing Aluminum Electrolytic Capacitors from the information of the operational circuit, such as the ripple voltage and the ripple current of the smoothing capacitor. To develop this kind of technology, more precise impedance models of Aluminum Electrolytic Capacitors become desired. In the case of the low-temperature operation of the power converters, e.g., photovoltaic inverters, the impedance of the smoothing Aluminum Electrolytic Capacitor is the key to avoid the switching element failure due to the switching surge. In this paper, we introduce the impedance calculation model of Aluminum Electrolytic Capacitors, which provides accurate impedance values in wide temperature and frequency ranges.
In this study, we investigate fundamental trade-off among identification, secrecy, template, and privacy-leakage rates in biometric identification system. Ignatenko and Willems (2015) studied this system assuming that the channel in the enrollment process of the system is noiseless and they did not consider the template rate. In the enrollment process, however, it is highly considered that noise occurs when bio-data is scanned. In this paper, we impose a noisy channel in the enrollment process and characterize the capacity region of the rate tuples. The capacity region is proved by a novel technique via two auxiliary random variables, which has never been seen in previous studies. As special cases, the obtained result shows that the characterization reduces to the one given by Ignatenko and Willems (2015) where the enrollment channel is noiseless and there is no constraint on the template rate, and it also coincides with the result derived by Günlü and Kramer (2018) where there is only one individual.
Junichi TOMIDA Atsushi FUJIOKA Akira NAGAI Koutarou SUZUKI
This paper proposes an id-eCK secure identity-based authenticated key exchange (ID-AKE) scheme, where the id-eCK security implies that a scheme resists against leakage of all combinations of master, static, and ephemeral secret keys except ones trivially break the security. Most existing id-eCK secure ID-AKE schemes require two symmetric pairing operations or a greater number of asymmetric pairing, which is faster than symmetric one, operations to establish a session key. However, our scheme is realized with a single asymmetric pairing operation for each party, and this is an advantage in efficiency. The proposed scheme is based on the ID-AKE scheme by McCullagh and Barreto, which is vulnerable to an active attack. To achieve id-eCK security, we apply the HMQV construction and the NAXOS technique to the McCullagh-Barreto scheme. The id-eCK security is proved under the external Diffie-Hellman for target group assumption and the q-gap-bilinear collision attack assumption.
In high range resolution radar systems, the detection of range-spread target under correlated non-Gaussian clutter faces many problems. In this paper, a novel detector employing an autoregressive (AR) model is proposed to improve the detection performance. The algorithm is elaborately designed and analyzed considering the clutter characteristics. Numerical simulations and measurement data verify the effectiveness and advantages of the proposed detector for the range-spread target in spatially correlated non-Gaussian clutter.
In this paper, we propose a model of a diversity receiver which uses an antenna whose antenna pattern can periodically change. We also propose a minimum mean square error (MMSE) based interference cancellation method of the receiver which, in principle, can suffer from the interference in neighboring frequency bands. Since the antenna pattern changes according to the sum of sinusoidal waveforms with different frequencies, the received signals are received at the carrier frequency and the frequencies shifted from the carrier frequency by the frequency of the sinusoidal waveforms. The proposed diversity scheme combines the components in the frequency domain to maximize the signal-to-noise power ratio (SNR) and to maximize the diversity gain. We confirm that the bit error rate (BER) of the proposed receiver can be improved by increase in the number of arrival paths resulting in obtaining path diversity gain. We also confirm that the proposed MMSE based interference canceller works well when interference signals exist and achieves better BER performances than the conventional diversity receiver with maximum ratio combining.
Masaaki FUJIYOSHI Ruifeng LI Hitoshi KIYA
This paper proposes an encryption-then-compression (EtC) system-friendly data hiding scheme for images, where an EtC system compresses images after they are encrypted. The EtC system divides an image into non-overlapping blocks and applies four block-based processes independently and randomly to the image for visual encryption of the image. The proposed scheme hides data to a plain, i.e., unencrypted image and the scheme can take hidden data out from the image encrypted by the EtC system. Furthermore, the scheme serves reversible data hiding, so it can perfectly recover the unmarked image from the marked image whereas the scheme once distorts unmarked image for hiding data to the image. The proposed scheme copes with the three of four processes in the EtC system, namely, block permutation, rotation/flipping of blocks, and inverting brightness in blocks, whereas the conventional schemes for the system do not cope with the last one. In addition, these conventional schemes have to identify the encrypted image so that image-dependent side information can be used to extract embedded data and to restore the unmarked image, but the proposed scheme does not need such identification. Moreover, whereas the data hiding process must know the block size of encryption in conventional schemes, the proposed scheme needs no prior knowledge of the block size for encryption. Experimental results show the effectiveness of the proposed scheme.
Masateru TSUNODA Akito MONDEN Kenichi MATSUMOTO Sawako OHIWA Tomoki OSHINO
Software maintenance is an important activity in the software lifecycle. Software maintenance does not only mean removing faults found after software release. Software needs extensions or modifications of its functions owing to changes in the business environment and software maintenance also refers to them. To help users and service suppliers benchmark work efficiency for software maintenance, and to clarify the relationships between software quality, work efficiency, and unit cost of staff, we used a dataset that includes 134 data points collected by the Economic Research Association in 2012, and analyzed the factors that affected the work efficiency of software maintenance. In the analysis, using a multiple regression model, we clarified the relationships between work efficiency and programming language and productivity factors. To analyze the influence to the quality, relationships of fault ratio was analyzed using correlation coefficients. The programming language and productivity factors affect work efficiency. Higher work efficiency and higher unit cost of staff do not affect the quality of software maintenance.
To enhance the user's privacy in electronic ID, anonymous credential systems have been researched. In the anonymous credential system, a trusted issuing organization first issues a certificate certifying the user's attributes to a user. Then, in addition to the possession of the certificate, the user can anonymously prove only the necessary attributes. Previously, an anonymous credential system was proposed, where CNF (Conjunctive Normal Form) formulas on attributes can be proved. The advantage is that the attribute proof in the authentication has the constant size for the number of attributes that the user owns and the size of the proved formula. Thus, various expressive logical relations on attributes can be efficiently verified. However, the previous system has a limitation: The proved CNF formulas cannot include any negation. Therefore, in this paper, we propose an anonymous credential system with constant-size attribute proofs such that the user can prove CNF formulas with negations. For the proposed system, we extend the previous accumulator for the limited CNF formulas to verify CNF formulas with negations.
Xina CHENG Ziken LI Songlin DU Takeshi IKENAGA
The spike height of volleyball players is important in volleyball analysis as the quantitative criteria to evaluation players' motions, which not only provides rich information to audiences in live broadcast of sports events but also makes contribution to evaluate and improve the performance of players in strategy analysis and players training. In the volleyball game scene, the high similarity between hands, the deformation and the occlusion are three main problems that influence the acquisition performance of spike height. To solve these problems, this paper proposes a body part connection, categorization and occlusion based observation model and a temporal position based correction method. Firstly, skin pixel filter based connection detection solves the problem of high similarity between hands by judging whether a hand is connected to the spike player. Secondly, the body part categorization based observation uses the probability distribution map of hand to determine the category of each body part to solve the deformation problem. Thirdly, the occlusion part detection based observation eliminates the influence of the views with occluded body part by detecting the occluded views with a trained classifier of body part. At last, the temporal position based result correction combines the estimated results, which refers the historical positions, and the posterior result to obtain an optimal result by degree of confidence. The experiments are based on the videos of final and semi-final games of 2014 Japan Inter High School Men's Volleyball in Tokyo Metropolitan Gymnasium, which includes 196 spike sequences of 4 teams. The experiment results of proposed methods are that: 93.37% of test sequences can be successfully detected the spike height, and in which the average error of spike height is 5.96cm.
Hayato YAMAKI Hiroaki NISHI Shinobu MIWA Hiroki HONDA
We propose a technique to reduce compulsory misses of packet processing cache (PPC), which largely affects both throughput and energy of core routers. Rather than prefetching data, our technique called response prediction cache (RPC) speculatively stores predicted data in PPC without additional access to the low-throughput and power-consuming memory (i.e., TCAM). RPC predicts the data related to a response flow at the arrival of the corresponding request flow, based on the request-response model of internet communications. Our experimental results with 11 real-network traces show that RPC can reduce the PPC miss rate by 13.4% in upstream and 47.6% in downstream on average when we suppose three-layer PPC. Moreover, we extend RPC to adaptive RPC (A-RPC) that selects the use of RPC in each direction within a core router for further improvement in PPC misses. Finally, we show that A-RPC can achieve 1.38x table-lookup throughput with 74% energy consumption per packet, when compared to conventional PPC.
Expectation propagation (EP) decoding is proposed for sparse superposition coding in orthogonal frequency division multiplexing (OFDM) systems. When a randomized discrete Fourier transform (DFT) dictionary matrix is used, the EP decoding has the same complexity as approximate message-passing (AMP) decoding, which is a low-complexity and powerful decoding algorithm for the additive white Gaussian noise (AWGN) channel. Numerical simulations show that the EP decoding achieves comparable performance to AMP decoding for the AWGN channel. For OFDM systems, on the other hand, the EP decoding is much superior to the AMP decoding while the AMP decoding has an error-floor in high signal-to-noise ratio regime.
Yoshiaki UEDA Seiichi KOJIMA Noriaki SUETAKE
In this letter, we propose a color quantization method based on saliency. In the proposed method, the salient colors are selected as representative colors preferentially by using saliency as weights. Through experiments, we verify the effectiveness of the proposed method.
Farzin MATIN Yoosoo JEONG Hanhoon PARK
Multiscale retinex is one of the most popular image enhancement methods. However, its control parameters, such as Gaussian kernel sizes, gain, and offset, should be tuned carefully according to the image contents. In this letter, we propose a new method that optimizes the parameters using practical swarm optimization and multi-objective function. The method iteratively verifies the visual quality (i.e. brightness, contrast, and colorfulness) of the enhanced image using a multi-objective function while subtly adjusting the parameters. Experimental results shows that the proposed method achieves better image quality qualitatively and quantitatively compared with other image enhancement methods.
Qingyuan LIU Qi ZHANG Xiangjun XIN Ran GAO Qinghua TIAN Feng TIAN
This paper investigates the resource allocation problem for the downlink of non-orthogonal multiple access (NOMA) networks. A novel resource allocation method is proposed to deal with the problem of maximizing the system capacity while taking into account user fairness. Since the optimization problem is nonconvex and intractable, we adopt the idea of step-by-step optimization, decomposing it into user pairing, subchannel and power allocation subproblems. First, all users are paired according to their different channel gains. Then, the subchannel allocation is executed by the proposed subchannel selection algorithm (SSA) based on channel priority. Once the subchannel allocation is fixed, to further improve the system capacity, the subchannel power allocation is implemented by the successive convex approximation (SCA) approach where the nonconvex optimization problem is transformed into the approximated convex optimization problem in each iteration. To ensure user fairness, the upper and lower bounds of the power allocation coefficients are derived and combined by introducing the tuning coefficients. The power allocation coefficients are dynamically adjustable by adjusting the tuning coefficients, thus the diversified quality of service (QoS) requirements can be satisfied. Finally, simulation results demonstrate the superiority of the proposed method over the existing methods in terms of system performance, furthermore, a good tradeoff between the system capacity and user fairness can be achieved.
Ying JI Yu WANG Jien KATO Kensaku MORI
With the rapid development of multimedia, violent video can be easily accessed in games, movies, websites, and so on. Identifying violent videos and rating violence extent is of great importance to media filtering and children protection. Many previous studies only address the problems of violence scene detection and violent action recognition, yet violence rating problem is still not solved. In this paper, we present a novel video-level rating prediction method to estimate violence extent automatically. It has two main characteristics: (1) a two-stream network is fine-tuned to construct effective representations of violent videos; (2) a violence rating prediction machine is designed to learn the strength relationship among different videos. Furthermore, we present a novel violent video dataset with a total of 1,930 human-involved violent videos designed for violence rating analysis. Each video is annotated with 6 fine-grained objective attributes, which are considered to be closely related to violence extent. The ground-truth of violence rating is given by pairwise comparison method. The dataset is evaluated in both stability and convergence. Experiment results on this dataset demonstrate the effectiveness of our method compared with the state-of-art classification methods.
In this paper, we propose L0 norm optimization in a scrambled sparse representation domain and its application to an Encryption-then-Compression (EtC) system. We design a random unitary transform that conserves L0 norm isometry. The resulting encryption method provides a practical orthogonal matching pursuit (OMP) algorithm that allows computation in the encrypted domain. We prove that the proposed method theoretically has exactly the same estimation performance as the nonencrypted variant of the OMP algorithm. In addition, we demonstrate the security strength of the proposed secure sparse representation when applied to the EtC system. Even if the dictionary information is leaked, the proposed scheme protects the privacy information of observed signals.
Yubo LIU Yangting LAI Jianyong CHEN Lingyu LIANG Qiaoming DENG
Computer aided design (CAD) technology is widely used for architectural design, but current CAD tools still require high-level design specifications from human. It would be significant to construct an intelligent CAD system allowing automatic architectural layout parsing (AutoALP), which generates candidate designs or predicts architectural attributes without much user intervention. To tackle these problems, many learning-based methods were proposed, and benchmark dataset become one of the essential elements for the data-driven AutoALP. This paper proposes a new dataset called SCUT-AutoALP for multi-paradigm applications. It contains two subsets: 1) Subset-I is for floor plan design containing 300 residential floor plan images with layout, boundary and attribute labels; 2) Subset-II is for urban plan design containing 302 campus plan images with layout, boundary and attribute labels. We analyzed the samples and labels statistically, and evaluated SCUT-AutoALP for different layout parsing tasks of floor plan/urban plan based on conditional generative adversarial networks (cGAN) models. The results verify the effectiveness and indicate the potential applications of SCUT-AutoALP. The dataset is available at https://github.com/designfuturelab702/SCUT-AutoALP-Database-Release.
Shigeru KOZONO Yuya TASHIRO Yuuki KANEMIYO Hiroaki NAKABAYASHI
In a multiple-user MIMO system in which numerous users simultaneously communicate in a cell, the channel matrix properties depend on the parameters of the individual users in such a way that they can be modeled as points randomly moving within the cell. Although these properties can be simulated by computer, they need to be expressed analytically to develop MIMO systems with diversity. Given a small area with an equivalent multi-path, we assume that a user u is at a certain “user point” $P^u(lambda _p^u,xi _p^u)$ in a cell, or (radius $lambda _p^u$ from origin, angle $xi _p^u)$ and that the user moves with movement $M^u(f_{max}^u, xi_v^u)$ around that point, or (Doppler frequency $f_{max}^u$, direction $xi_v^u$). The MU-MIMO channel model consists of a multipath environment, user parameters, and antenna configuration. A general formula of the correlation $ ho_{i - j,i' - j'}^{u - u'} (bm)$ between the channel matrix elements of users u and u' and one for given multipath conditions are derived. As a feature of the MU-MIMO channel, the movement factor $F^{u - u'}(gamma^u,xi_n ,xi_v^u)$, which means a fall coefficient of the spatial correlation calculated from only the user points of u and u', is also derived. As the difference in speed or direction between u and u' increases, $F^{u - u'}(gamma^u,xi_n ,xi_v^u)$ becomes smaller. Consequently, even if the path is LOS, $ ho_{i - j,i' - j'}^{u - u'} (bm)$ becomes low enough owing to the movement factor, even though the correlation in the single-user MIMO channel is high. If the parameters of u and u' are the same, the factor equals 1, and the channels correspond to the users' own channels and work like SU-MIMO channel. These analytical findings are verified by computer simulation.