The fingerprint verification system is widely used in mobile devices because of fingerprint's distinctive features and ease of capture. Typically, mobile devices utilize small sensors, which have limited area, to capture fingerprint. Meanwhile, conventional fingerprint feature extraction methods need detailed fingerprint information, which is unsuitable for those small sensors. This paper proposes a novel fingerprint verification method for small area sensors based on deep learning. A systematic method combines deep convolutional neural network (DCNN) in a Siamese network for feature extraction and XGBoost for fingerprint similarity training. In addition, a padding technique also introduced to avoid wraparound error problem. Experimental results show that the method achieves an improved accuracy of 66.6% and 22.6% in the FingerPassDB7 and FVC2006DB1B dataset, respectively, compared to the existing methods.

In previous machine learning based fast intra mode decision algorithms for screen content videos, feature design is a key task and it is always difficult to obtain distinguishable features. In this paper, the idea of interaction of features is introduced to fast video coding algorithm, and a fast intra mode decision algorithm based on feature cross is proposed for screen content videos. The numeric features and category features are designed based on the characteristics of screen content videos, and the adaptive factorization network (AFN) is improved and adopted to carry out feature interaction to designed features, and output distinguishable features. The experimental results show that for AI (All Intra) configuration, compared with standard VVC/H.266, the coding time is reduced by 29.64% and the BD rate is increased only by 1.65%.

In this paper, we investigate the evolution of an optical network architecture and discuss the future direction of research on optical network design and control. We review existing research on optical network design and control and present some open challenges. One of the important open challenges lies in multilayer resource optimization including IT and optical network resources. We propose an adaptive joint optimization method of IT resources and optical spectrum under time-varying traffic demand in optical networks while avoiding an increase in operation cost. We formulate the problem as mixed integer linear programming and then quantitatively evaluate the trade-off relationship between the optimality of reconfiguration and operation cost. We demonstrate that we can achieve sufficient network performance through the adaptive joint optimization while suppressing an increase in operation cost.

The fifth-generation (5G) new radio (NR) standard employs ultra-reliable and low-latency communication (URLLC) to provide real-time wireless interactive capability for the internet of things (IoT) applications. To satisfy the stringent latency and reliability demands of URLLC services, grant-free (GF) transmissions with the K-repetition transmission (K-Rep) have been introduced. However, fading fluctuations can negatively impact signal quality at the base station (BS), leading to an increase in the number of repetitions and raising concerns about interference and energy consumption for IoT user equipment (UE). To overcome these challenges, this paper proposes novel adaptive K-Rep control schemes that employ site diversity reception to enhance signal quality and reduce energy consumption. The performance evaluation demonstrates that the proposed adaptive K-Rep control schemes significantly improve communication reliability and reduce transmission energy consumption compared with the conventional K-Rep scheme, and then satisfy the URLLC requirements while reducing energy consumption.

Many nodes in Internet of Things (IoT) rely on batteries for power. Additionally, the demand for executing compute-intensive and latency-sensitive tasks is increasing for IoT nodes. In some practical scenarios, the computation tasks of WDs have the non-separable characteristic, that is, binary offloading strategies should be used. In this paper, we focus on the design of an efficient binary offloading algorithm that minimizes system energy consumption (EC) for TDMA-based wireless-powered multi-access edge computing networks, where WDs either compute tasks locally or offload them to hybrid access points (H-APs). We formulate the EC minimization problem which is a non-convex problem and decompose it into a master problem optimizing binary offloading decision and a subproblem optimizing WPT duration and task offloading transmission durations. For the master problem, a DRL based method is applied to obtain the near-optimal offloading decision. For the subproblem, we firstly consider the scenario where the nodes do not have completion time constraints and obtain the optimal analytical solution. Then we consider the scenario with the constraints. By jointly using the Golden Section Method and bisection method, the optimal solution can be obtained due to the convexity of the constraint function. Simulation results show that the proposed offloading algorithm based on DRL can achieve the near-minimal EC.

For an [n, k, d] (r, δ)-locally repairable codes ((r, δ)-LRCs), its minimum distance d satisfies the Singleton-like bound. The construction of optimal (r, δ)-LRC, attaining this Singleton-like bound, is an important research problem in recent years for thier applications in distributed storage systems. In this letter, we use Reed-Solomon codes to construct two classes of optimal (r, δ)-LRCs. The optimal LRCs are given by the evaluations of multiple polynomials of degree at most r - 1 at some points in Fq. The first class gives the [(r + δ - 1)t, rt - s, δ + s] optimal (r, δ)-LRC over Fq provided that r + δ + s - 1≤q, s≤δ, s

It has become increasingly important for industries to promote digital transformation by utilizing 5G and industrial internet of things (IIoT) to improve productivity. To protect IIoT application performance (work speed, productivity, etc.), it is often necessary to satisfy quality of service (QoS) requirements precisely. For this purpose, there is an increasing need to automatically identify the root causes of radio-quality deterioration in order to take prompt measures when the QoS deteriorates. In this paper, a method for identifying the root cause of 5G radio-quality deterioration is proposed that uses machine learning. This Random Forest based method detects the root cause, such as distance attenuation, shielding, fading, or their combination, by analyzing the coefficients of a quadratic polynomial approximation in addition to the mean values of time-series data of radio quality indicators. The detection accuracy of the proposed method was evaluated in a simulation using the MATLAB 5G Toolbox. The detection accuracy of the proposed method was found to be 98.30% when any of the root causes occurs independently, and 83.13% when the multiple root causes occur simultaneously. The proposed method was compared with deep-learning methods, including bidirectional long short-term memory (bidirectional-LSTM) or one-dimensional convolutional neural network (1D-CNN), that directly analyze the time-series data of the radio quality, and the proposed method was found to be more accurate than those methods.

Direction of arrival (DOA) estimation is an antenna array signal processing technique used in, for instance, radar and sonar systems, source localization, and channel state information retrieval. As new applications and use cases appear with the development of next generation mobile communications systems, DOA estimation performance must be continually increased in order to support the nonstop growing demand for wireless technologies. In previous works, we verified that a deep neural network (DNN) trained offline is a strong candidate tool with the promise of achieving great on-grid DOA estimation performance, even compared to traditional algorithms. In this paper, we propose new techniques for further DOA estimation accuracy enhancement incorporating signal-to-noise ratio (SNR) prediction and an end-to-end DOA estimation system, which consists of three components: source number estimator, DOA angular spectrum grid estimator, and DOA detector. Here, we expand the performance of the DOA detector and angular spectrum estimator, and present a new solution for source number estimation based on DNN with very simple design. The proposed DNN system applied with said enhancement techniques has shown great estimation performance regarding the success rate metric for the case of two radio wave sources although not fully satisfactory results are obtained for the case of three sources.

This paper introduces heuristic approaches and a deep reinforcement learning approach to solve a joint virtual network function deployment and scheduling problem in a dynamic scenario. We formulate the problem as an optimization problem. Based on the mathematical description of the optimization problem, we introduce three heuristic approaches and a deep reinforcement learning approach to solve the problem. We define an objective to maximize the ratio of delay-satisfied requests while minimizing the average resource cost for a dynamic scenario. Our introduced two greedy approaches are named finish time greedy and computational resource greedy, respectively. In the finish time greedy approach, we make each request be finished as soon as possible despite its resource cost; in the computational resource greedy approach, we make each request occupy as few resources as possible despite its finish time. Our introduced simulated annealing approach generates feasible solutions randomly and converges to an approximate solution. In our learning-based approach, neural networks are trained to make decisions. We use a simulated environment to evaluate the performances of our introduced approaches. Numerical results show that the introduced deep reinforcement learning approach has the best performance in terms of benefit in our examined cases.

Recently, Global navigation satellite system (GNSS) positioning has been widely used in various applications (e.g. car navigation system, smartphone map application, autonomous driving). In GNSS positioning, coordinates are calculated from observed satellite signals. The observed signals contain various errors, so the calculated coordinates also have some errors. Double-difference is one of the widely used ideas to reduce the errors of the observed signals. Although double-difference can remove many kinds of errors from the observed signals, some errors still remain (e.g. multipath error). In this paper, we define the remaining error as “double-difference-error (DDE)” and propose a method for estimating DDE using machine learning. In addition, we attempt to improve DGNSS positioning by feeding back the estimated DDE. Previous research applying machine learning to GNSS has focused on classifying whether the signal is LOS (Line Of Sight) or NLOS (Non Line Of Sight), and there is no study that attempts to estimate the amount of error itself as far as we know. Furthermore, previous studies had the limitation that their dataset was recorded at only a few locations in the same city. This is because these studies are mainly aimed at improving the positioning accuracy of vehicles, and collecting large amounts of data using vehicles is costly. To avoid this problem, in this research, we use a huge amount of openly available stationary point data for training. Through the experiments, we confirmed that the proposed method can reduce the DGNSS positioning error. Even though the DDE estimator was trained only on stationary point data, the proposed method improved the DGNSS positioning accuracy not only with stationary point but also with mobile rover. In addition, by comparing with the previous (detect and remove) approach, we confirmed the effectiveness of the DDE feedback approach.

In this paper, we apply two methods in machine learning, dropout and semi-supervised learning, to a recently proposed method called CSQ-SDL which uses deep neural networks for evaluating shift quality from time-series measurement data. When developing a new Automatic Transmission (AT), calibration takes place where many parameters of the AT are adjusted to realize pleasant driving experience in all situations that occur on all roads around the world. Calibration requires an expert to visually assess the shift quality from the time-series measurement data of the experiments each time the parameters are changed, which is iterative and time-consuming. The CSQ-SDL was developed to shorten time consumed by the visual assessment, and its effectiveness depends on acquiring a sufficient number of data points. In practice, however, data amounts are often insufficient. The methods proposed here can handle such cases. For the cases wherein only a small number of labeled data points is available, we propose a method that uses dropout. For those cases wherein the number of labeled data points is small but the number of unlabeled data is sufficient, we propose a method that uses semi-supervised learning. Experiments show that while the former gives moderate improvement, the latter offers a significant performance improvement.

Person authentication using biometric information has recently become popular among researchers. User management based on biometrics is more reliable than that using conventional methods. To secure private information, it is necessary to build continuous authentication-based user management systems. Brain waves are suitable biometric modalities for continuous authentication. This study is based on biometric authentication using brain waves evoked by invisible visual stimuli. Invisible visual stimulation is considered over visual stimulation to overcome the obstacles faced by a user when using a system. Invisible stimuli are confirmed by changing the intensity of the image and presenting high-speed stimulation. To ensure invisibility, stimuli of different intensities were tested, and the stimuli with an intensity of 5% was confirmed to be invisible. To improve the verification performance, a continuous wavelet transform was introduced over the Fourier transform because it extracts both time and frequency information from the brain wave. The scalogram obtained by the wavelet transform was used as an individual feature and for synchronizing the template and test data. Furthermore, to improve the synchronization performance, the waveband was split based on the power distribution of the scalogram. A performance evaluation using 20 subjects showed an equal error rate of 3.8%.

This paper presents a deep network based on unrolling the diffusion process with the morphological Laplacian. The diffusion process is an iterative algorithm that can solve the diffusion equation and represents time evolution with Laplacian. The diffusion process is applied to smoothing of images and has been extended with non-linear operators for various image processing tasks. In this study, we introduce the morphological Laplacian to the basic diffusion process and unwrap to deep networks. The morphological filters are non-linear operators with parameters that are referred to as structuring elements. The discrete Laplacian can be approximated with the morphological filters without multiplications. Owing to the non-linearity of the morphological filter with trainable structuring elements, the training uses error back propagation and the network of the morphology can be adapted to specific image processing applications. We introduce two extensions of the morphological Laplacian for deep networks. Since the morphological filters are realized with addition, max, and min, the error caused by the limited bit-length is not amplified. Consequently, the morphological parts of the network are implemented in unsigned 8-bit integer with single instruction multiple data set (SIMD) to achieve fast computation on small devices. We applied the proposed network to image completion and Gaussian denoising. The results and computational time are compared with other denoising algorithm and deep networks.

Canonical decomposition for bipartite graphs, which was introduced by Fouquet, Giakoumakis, and Vanherpe (1999), is a decomposition scheme for bipartite graphs associated with modular decomposition. Weak-bisplit graphs are bipartite graphs totally decomposable (i.e., reducible to single vertices) by canonical decomposition. Canonical decomposition comprises series, parallel, and K+S decomposition. This paper studies a decomposition scheme comprising only parallel and K+S decomposition. We show that bipartite graphs totally decomposable by this decomposition are precisely P6-free chordal bipartite graphs. This characterization indicates that P6-free chordal bipartite graphs can be recognized in linear time using the recognition algorithm for weak-bisplit graphs presented by Giakoumakis and Vanherpe (2003).

With the gradually increase of the application of new energy in microgrids, Electric Spring (ES), as a new type of distributed compensation power electronic device has been widely studied. The Generalized Electric Spring (G-ES) is an improved topology, and the space limitation problem in the traditional topology is solved. Because of the mode of G-ES use in the power grid, a reasonable solution to the voltage loss of the critical section feeder is needed. In this paper, the voltage balance equation based on the feedforward compensation coefficient is established, and a two cascade control strategy based on the equation is studied. The first stage of the two cascade control strategy is to use communication means to realize the allocation of feedforward compensation coefficients, and the second stage is to use the coefficients to realize feedforward fixed angle control. Simulation analysis shows that the proposed control strategy does not affect the control accuracy of the critical load (CL), and effectively improves the operational range of the G-ES.

Non-Terrestrial-Network (NTN) can provide seamless and ubiquitous connectivity of massive devices. Thus, the feeder links between satellites and gateways need to provide essentially high data transmission rates. In this paper, we focus on a typical high-capacity scenario, i.e., LEO-IoT, to find an optimal satellite selection schema to maximize the capacity of feeder links. The proposed schema is able to obtain the optimal mapping among all the satellites and gateways. By comparing with maximum service time algorithm, the proposed schema can construct a more balanced and reasonable connection pattern to improve the efficiency of the gateways. Such an advantage will become more significant as the number of satellites increases.

Radar-based sensing and concealed weapon detection technologies have been attracting attention as a measure to enhance security screening in public facilities and various venues. For these applications, the security check must be performed without impeding the flow of people, with minimum human effort, and in a non-contact manner. We developed technologies for a high-throughput walk-through security screening called Invisible Sensing (IVS) and implemented them in a prototype system. The IVS system consists of dual planar radar panels facing each other and carries out an inspection based on a multi-region screening approach as a person walks between the panels. Our imaging technology constructs a high-quality radar image that compensates for motion blur caused by a person's walk. Our detection technology takes multi-view projected images across the multiple regions as input to enable real-time whole-body screening. The IVS system runs its functions by pipeline processing to achieve real-time screening operation. This paper presents our IVS system along with these key technologies and demonstrates its empirical performance.

Indoor free space optical (FSO) communication technology that provides high-speed connectivity to edge users is expected to be introduced in the near future mobile communication system, where the silicon photonics solid-state beam scanning device is a promising tool because of its low cost, long-term reliability, and other beneficial properties. However, the current two-dimensional beam scanning devices using grating coupler arrays have difficulty in increasing the transmission capacity because of bandwidth regulation. To solve the problem, we have introduced a broadband surface optical coupler, “elephant coupler,” which has great potential for combining wavelength and spatial division multiplexing technologies into the beam scanning device, as an alternative to grating couplers. The prototype port-selective silicon beam scanning device fabricated using a 300 mm CMOS pilot line achieved broadband optical beam emission with a 1 dB-loss bandwidth of 40 nm and demonstrated beam scanning using an imaging lens. The device has also exhibited free-space signal transmission of non-return-to-zero on-off-keying signals at 10 Gbps over a wide wavelength range of 60 nm. In this paper, we present an overview of the developed beam scanning device. Furthermore, the theoretical design guidelines for indoor mobile FSO communication are discussed.

We assess how well the recently created MRI reconstruction technique, Multi-Resolution Convolutional Neural Network (MRCNN), performs in the core medical vision field (classification). The primary goal of MRCNN is to identify the best k-space undersampling patterns to accelerate the MRI. In this study, we use the Figshare brain tumor dataset for MRI classification with 3064 T1-weighted contrast-enhanced MRI (CE-MRI) over three categories: meningioma, glioma, and pituitary tumors. We apply MRCNN to the dataset, which is a method to reconstruct high-quality images from under-sampled k-space signals. Next, we employ the pre-trained VGG16 model, which is a Deep Neural Network (DNN) based image classifier to the MRCNN restored MRIs to classify the brain tumors. Our experiments showed that in the case of MRCNN restored data, the proposed brain tumor classifier achieved 92.79% classification accuracy for a 10% sampling rate, which is slightly higher than that of SRCNN, MoDL, and Zero-filling methods have 91.89%, 91.89%, and 90.98% respectively. Note that our classifier was trained using the dataset consisting of the images with full sampling and their labels, which can be regarded as a model of the usual human diagnostician. Hence our results would suggest MRCNN is useful for human diagnosis. In conclusion, MRCNN significantly enhances the accuracy of the brain tumor classification system based on the tumor location using under-sampled k-space signals.

Driver fatigue detection has become crucial in vehicle safety technology. Achieving high accuracy and real-time performance in detecting driver fatigue is paramount. In this paper, we propose a novel driver fatigue detection algorithm based on dynamic tracking of Facial Eyes and Yawning using YOLOv7, named FEY-YOLOv7. The Coordinate Attention module is inserted into YOLOv7 to enhance its dynamic tracking accuracy by focusing on coordinate information. Additionally, a small target detection head is incorporated into the network architecture to promote the feature extraction ability of small facial targets such as eyes and mouth. In terms of compution, the YOLOv7 network architecture is significantly simplified to achieve high detection speed. Using the proposed PERYAWN algorithm, driver status is labeled and detected by four classes: open_eye, closed_eye, open_mouth, and closed_mouth. Furthermore, the Guided Image Filtering algorithm is employed to enhance image details. The proposed FEY-YOLOv7 is trained and validated on RGB-infrared datasets. The results show that FEY-YOLOv7 has achieved mAP of 0.983 and FPS of 101. This indicates that FEY-YOLOv7 is superior to state-of-the-art methods in accuracy and speed, providing an effective and practical solution for image-based driver fatigue detection.