Hiroyuki SHINBO Kousuke YAMAZAKI Yoji KISHI
To achieve highly efficient spectrum usage, dynamic sharing of scarce spectrum resources has recently become the subject of intense discussion. The technologies of dynamic spectrum sharing (DSS) have already been adopted or are scheduled to be adopted in a number of countries, and Japan is no exception. The authors and organizations collaborating in the research and development project being undertaken in Japan have studied a novel DSS system positioned between the fifth-generation mobile communication system (5G system) and different incumbent radio systems. Our DSS system has three characteristics. (1) It detects dynamically unused sharable spectrums (USSs) of incumbent radio systems for the space axis by using novel propagation models and estimation of the transmitting location with radio sensor information. (2) It manages USSs for the time axis by interference calculation with propagation parameters, fair assignment and future usage of USSs. (3) It utilizes USSs for the spectrum axis by using methods that decrease interference for lower separation distances. In this paper, we present an overview and the technologies of our DSS system and its applications in Japan.
Yuya KAMATAKI Yusuke KAMEDA Yasuyo KITA Ichiro MATSUDA Susumu ITOH
This paper proposes a lossless coding method for HDR color images stored in a floating point format called Radiance RGBE. In this method, three mantissa and a common exponent parts, each of which is represented in 8-bit depth, are encoded using the block-adaptive prediction technique with some modifications considering the data structure.
Chen CHEN Maojun ZHANG Hanlin TAN Huaxin XIAO
Pedestrian detection is an essential but challenging task in computer vision, especially in crowded scenes due to heavy intra-class occlusion. In human visual system, head information can be used to locate pedestrian in a crowd because it is more stable and less likely to be occluded. Inspired by this clue, we propose a dual-task detector which detects head and human body simultaneously. Concretely, we estimate human body candidates from head regions with statistical head-body ratio. A head-body alignment map is proposed to perform relational learning between human bodies and heads based on their inherent correlation. We leverage the head information as a strict detection criterion to suppress common false positives of pedestrian detection via a novel pull-push loss. We validate the effectiveness of the proposed method on the CrowdHuman and CityPersons benchmarks. Experimental results demonstrate that the proposed method achieves impressive performance in detecting heavy-occluded pedestrians with little additional computation cost.
Chao WANG Michihiko OKUYAMA Ryo MATSUOKA Takahiro OKABE
Water detection is important for machine vision applications such as visual inspection and robot motion planning. In this paper, we propose an approach to per-pixel water detection on unknown surfaces with a hyperspectral image. Our proposed method is based on the water spectral characteristics: water is transparent for visible light but translucent/opaque for near-infrared light and therefore the apparent near-infrared spectral reflectance of a surface is smaller than the original one when water is present on it. Specifically, we use a linear combination of a small number of basis vector to approximate the spectral reflectance and estimate the original near-infrared reflectance from the visible reflectance (which does not depend on the presence or absence of water) to detect water. We conducted a number of experiments using real images and show that our method, which estimates near-infrared spectral reflectance based on the visible spectral reflectance, has better performance than existing techniques.
This paper presents an analytical model that yields the unavailability of a network function when each backup server can protect two functions and can recover one of them. Previous work describes a model to deal with the case that each function can be protected only by one server. In our model, we allow each function to be protected by multiple servers to ensure function availability. This requires us to know the feasible states of a connected component and its state transitions. By adopting the divide-and-conquer method, we enumerate the feasible states of a connected component. We then classify its state transitions. Based on the obtained feasible states and the classification of the state transitions, we enumerate the feasible states incoming to and outgoing from a general state, the transfer rates, and the conditions. With those informations, we generate multiple equations about the state transitions. Finally, by solving them, we obtain the probabilities that a connected component is in each state and calculate the unavailability of a function. Numerical results show that the average unavailability of a function is reduced by 18% and 5.7% in our two examined cases by allowing each function to be protected by multiple servers.
Jiafeng MAO Qing YU Kiyoharu AIZAWA
Well annotated dataset is crucial to the training of object detectors. However, the production of finely annotated datasets for object detection tasks is extremely labor-intensive, therefore, cloud sourcing is often used to create datasets, which leads to these datasets tending to contain incorrect annotations such as inaccurate localization bounding boxes. In this study, we highlight a problem of object detection with noisy bounding box annotations and show that these noisy annotations are harmful to the performance of deep neural networks. To solve this problem, we further propose a framework to allow the network to modify the noisy datasets by alternating refinement. The experimental results demonstrate that our proposed framework can significantly alleviate the influences of noise on model performance.
Natsuki UENO Shoichi KOYAMA Hiroshi SARUWATARI
We propose a useful formulation for ill-posed inverse problems in Hilbert spaces with nonlinear clipping effects. Ill-posed inverse problems are often formulated as optimization problems, and nonlinear clipping effects may cause nonconvexity or nondifferentiability of the objective functions in the case of commonly used regularized least squares. To overcome these difficulties, we present a tractable formulation in which the objective function is convex and differentiable with respect to optimization variables, on the basis of the Bregman divergence associated with the primitive function of the clipping function. By using this formulation in combination with the representer theorem, we need only to deal with a finite-dimensional, convex, and differentiable optimization problem, which can be solved by well-established algorithms. We also show two practical examples of inverse problems where our theory can be applied, estimation of band-limited signals and time-harmonic acoustic fields, and evaluate the validity of our theory by numerical simulations.
In this letter, we will prove that chaotic binary sequences generated by the tent map and Walsh functions are i.i.d. (independent and identically distributed) and orthogonal to each other.
Yi LU Keisuke HARA Keisuke TANAKA
Receiver selective opening (RSO) attack for public key encryption (PKE) captures a situation where one sender sends messages to multiple receivers, an adversary can corrupt a set of receivers and get their messages and secret keys. Security against RSO attack for a PKE scheme ensures confidentiality of other uncorrupted receivers' ciphertexts. Among all of the RSO security notions, simulation-based RSO security against chosen ciphertext attack (SIM-RSO-CCA security) is the strongest notion. In this paper, we explore constructions of SIM-RSO-CCA secure PKE from various computational assumptions. Toward this goal, we show that a SIM-RSO-CCA secure PKE scheme can be constructed based on an IND-CPA secure PKE scheme and a designated-verifier non-interactive zero-knowledge (DV-NIZK) argument satisfying one-time simulation soundness. Moreover, we give the first construction of DV-NIZK argument satisfying one-time simulation soundness. Consequently, through our generic construction, we obtain the first SIM-RSO-CCA secure PKE scheme under the computational Diffie-Hellman (CDH) or learning parity with noise (LPN) assumption.
Satoshi SUYAMA Tatsuki OKUYAMA Yoshihisa KISHIYAMA Satoshi NAGATA Takahiro ASAI
In sixth-generation (6G) mobile communication system, it is expected that extreme high data rate communication with a peak data rate over 100Gbps should be provided by exploiting higher frequency bands in addition to millimeter-wave bands such as 28GHz. The higher frequency bands are assumed to be millimeter wave and terahertz wave where the extreme wider bandwidth is available compared with 5G, and hence 6G needs to promote research and development to exploit so-called terahertz wave targeting the frequency from 100GHz to 300GHz. In the terahertz wave, there are fundamental issues that rectilinearity and pathloss are higher than those in the 28GHz band. In order to solve these issues, it is very important to clarify channel characteristics of the terahertz wave and establish a channel model, to advance 6G radio access technologies suitable for the terahertz wave based on the channel model, and to develop radio-frequency device technologies for such higher frequency bands. This paper introduces a direction of studies on 6G radio access technologies to explore the higher frequency bands and technical issues on the device technologies, and then basic computer simulations in 100Gbps transmission using 100GHz band clarify a potential of extreme high data rate over 100Gbps.
Yanjun LI Haibin KAN Jie PENG Chik How TAN Baixiang LIU
In this letter, we present a construction of bent functions which generalizes a work of Zhang et al. in 2016. Based on that, we obtain a cubic bent function in 10 variables and prove that, it has no affine derivative and does not belong to the completed Maiorana-McFarland class, which is opposite to all 6/8-variable cubic bent functions as they are inside the completed Maiorana-McFarland class. This is the first time a theoretical proof is given to show that the cubic bent functions in 10 variables can be outside the completed Maiorana-McFarland class. Before that, only a sporadic example with such properties was known by computer search. We also show that our function is EA-inequivalent to that sporadic one.
In this paper, we present an algorithm that counts the number of empty quadrilaterals whose corners are chosen from a given set S of n points in general position. Our algorithm can separately count the number of convex or non-convex empty quadrilaterals in O(T) time, where T denotes the number of empty triangles in S. Note that T varies from Ω(n2) and O(n3) and the expected value of T is known to be Θ(n2) when the n points in S are chosen uniformly and independently at random from a convex and bounded body in the plane. We also show how to enumerate all convex and/or non-convex empty quadrilaterals in S in time proportional to the number of reported quadrilaterals, after O(T)-time preprocessing.
Kyohei ONO Shoichiro YAMASAKI Shinichiro MIYAZAKI Tomoko K. MATSUSHIMA
Optical code-division multiple-access (CDMA) techniques provide multi-user data transmission services in optical wireless and fiber communication systems. Several signature codes, such as modified prime sequence codes (MPSCs), generalized MPSCs (GMPSCs) and modified pseudo-orthogonal M-sequence sets, have been proposed for synchronous optical CDMA systems. In this paper, a new scheme is proposed for synchronous optical CDMA to increase the number of users and, consequently, to increase the total data rate without increasing the chip rate. The proposed scheme employs a GMPSC and an extended bi-orthogonal code which is a unipolar code generated from a bipolar Walsh code. Comprehensive comparisons between the proposed scheme and several conventional schemes are shown. Moreover, bit error rate performance and energy efficiency of the proposed scheme are evaluated comparing with those of the conventional optical CDMA schemes under atmospheric propagation environment.
The extended visual cryptography scheme (EVCS) proposed by Ateniese et al. is one of variations of the visual cryptography scheme such that a secret image is recovered by superimposition of certain qualified collections of shares, where cover images are visible on respective shares. In this paper, we give a new definition of the EVCS for improving visibility of the recovered secret image as well as the cover images. We formulate the problem to construct the basis matrices of the EVCS with the minimum pixel expansion as an integer programming problem. We solve the integer programming problem for general access structures with less than or equal to five participants and show that basis matrices with a smaller pixel expansion can be obtained for certain cases. We also analyze security of the EVCS meeting the new definition from an information-theoretic viewpoint. We give a condition under which any forbidden collection of shares does not reveal any additional information on not only a secret image but also the cover images that are not visible on the other shares.
Toshiro NAKAHIRA Tomoki MURAKAMI Hirantha ABEYSEKERA Koichi ISHIHARA Motoharu SASAKI Takatsune MORIYAMA Yasushi TAKATORI
In this paper, we examine techniques for improving the throughput of unlicensed radio systems such as wireless LANs (WLANs) to take advantage of multi-radio access to mobile broadband, which will be important in 5G evolution and beyond. In WLANs, throughput is reduced due to mixed standards and the degraded quality of certain frequency channels, and thus control techniques and an architecture that provide efficient control over WLANs are needed to solve the problem. We have proposed a technique to control the terminal connection dynamically by using the multi-radio of the AP. Furthermore, we have proposed a new control architecture called WiSMA for efficient control of WLANs. Experiments show that the proposed method can solve those problems and improve the WLAN throughput.
One of the highest performing single-photon detectors in the visible and near-infrared regions is the superconducting nanostrip photon detector (SNSPD or SSPD), which usually uses NbN or NbTiN as the superconductor. Using other superconductors may significantly improve, for example, the operating temperature and count rate characteristics. This paper briefly reviews the current state of the potential, characteristics, thin film growth, and nanofabrication process of SNSPD using various superconductors.
Manabu MIKAMI Koichi SERIZAWA Kohei MOTO Hitoshi YOSHINO
Fifth generation mobile communication system (5G) mobile operators need to explore new use cases and/or applications together with vertical industries, the industries which are potential users of 5G, in order to fully exploit the new 5G capabilities in terms of its application. Vehicular communications for platooning are considered to be one of new use cases of 5G whose low-latency and ultra-reliability are required. This paper presents our field evaluations on latency and reliability performance of 5G V2V Direct communication towards application to truck platooning. The authors build a field experimental environment, for V2X communications of truck platooning, with actual large-size trucks and a prototype system employing 5G New Radio (NR) technologies, and performed some field experiments in rural areas. In this paper, we introduce the 5G NR-V2X prototype system. Its most distinctive feature is that the prototype system is equipped with V2V Direct communication radio interface (i.e., sidelink), in addition to the traditional radio interfaces between BS and UE (i.e., downlink and uplink). Then, we present the field evaluation results of radio propagation environment results and over-the-air transmission performance of latency and reliability characteristics on the V2V Direct communication of the prototype in real public express highway environment including tunnel area as well as tunnel outside area, in order to assess 5G NR-V2X system applying to truck platooning. The radio propagation and the latency performance evaluation results clarify that the latency performance is degraded due to Hybrid Automatic Repeat reQuest (HARQ) retransmission at the outside of tunnel more possibly than the inside of tunnel, since larger path loss values can be observed at the outside of tunnel than the inside of tunnel, in V2V Direct communications of truck platooning. The over-the-air latency and reliability evaluation results confirm that it is important to set an appropriate maximum number of HARQ retransmissions since there is a trade-off problem in order to realize low latency and high reliability simultaneously.
Masaki TAKANASHI Shu-ichi SATO Kentaro INDO Nozomu NISHIHARA Hiroto ICHIKAWA Hirohisa WATANABE
Predicting the malfunction timing of wind turbines is essential for maintaining the high profitability of the wind power generation business. Machine learning methods have been studied using condition monitoring system data, such as vibration data, and supervisory control and data acquisition (SCADA) data, to detect and predict anomalies in wind turbines automatically. Autoencoder-based techniques have attracted significant interest in the detection or prediction of anomalies through unsupervised learning, in which the anomaly pattern is unknown. Although autoencoder-based techniques have been proven to detect anomalies effectively using relatively stable SCADA data, they perform poorly in the case of deteriorated SCADA data. In this letter, we propose a power-curve filtering method, which is a preprocessing technique used before the application of an autoencoder-based technique, to mitigate the dirtiness of SCADA data and improve the prediction performance of wind turbine degradation. We have evaluated its performance using SCADA data obtained from a real wind-farm.
Jian-Yu PAN Kuei-Chiang LAI Yi-Ting LI Szu-Lin SU
Iterative block decision feedback equalization with hard-decision feedback (HD-IBDFE) was proposed for single-carrier transmission with frequency-domain equalization (SC-FDE). The detection performance hinges upon not only error propagation, but also the accuracy of estimating the parameters used to re-compute the equalizer coefficients at each iteration. In this paper, we use the erasure zone (EZ) to de-emphasize the feedback values when the hard decisions are not reliable. EZ use also enables a more accurate, and yet computationally more efficient, parameter estimation method than HD-IBDFE. We show that the resulting equalizer coefficients share the same mathematical form as that of the HD-IBDFE, thereby preserving the merit of not requiring matrix inverse operations in calculating the equalizer coefficients. Simulations show that, by using the EZ and the proposed parameter estimation method, a significant performance improvement over the conventional HD-IBDFE can be achieved, but with lower complexity.
Kazuo IBUKA Hikaru KAWASAKI Takeshi MATSUMURA Fumihide KOJIMA
In the 5th generation mobile communication system (5G), super high frequency (SHF) bands such as 28GHz will be used in many scenarios. In Japan, a local 5G working group has been established to apply advanced 5G technologies to private networks and is working to encourage local companies and municipalities to introduce new services for local needs. Meanwhile, the smaller size of the 28GHz band cells creates the difficulties when establishing deployment areas for homogeneous networks. In general, heterogeneous network approach with the combination of macro-cell and micro-cell have been considered practical and applied by the giant telecommunication operators. However, private network operators have difficulty in deploying both micro- and macro-cells due to the cost issue. Without the assistance of macro-cells, local spot cells with a small service area may not be able to start services while high-speed mobile users are staying in the service area. In this paper, we propose a virtual pre-connection scheme allowing fast connection to local spot cells without the assistance of macro-cells. In addition, we confirm that the proposed scheme can reduce the cell search time required when entering a local spot cell from 100 seconds or more to less than 1 second, and can reduce the loss of connection opportunities to local spot cells for high-speed mobile users.