In this paper, we investigated the overfitting characteristics of nonlinear equalizers based on an artificial neural network (ANN) and the Volterra series transfer function (VSTF), which were designed to compensate for optical nonlinear waveform distortion in optical fiber communication systems. Linear waveform distortion caused by, e.g., chromatic dispersion (CD) is commonly compensated by linear equalizers using digital signal processing (DSP) in digital coherent receivers. However, mitigation of nonlinear waveform distortion is considered to be one of the next important issues. An ANN-based nonlinear equalizer is one possible candidate for solving this problem. However, the risk of overfitting of ANNs is one obstacle in using the technology in practical applications. We evaluated and compared the overfitting of ANN- and conventional VSTF-based nonlinear equalizers used to compensate for optical nonlinear distortion. The equalizers were trained on repeated random bit sequences (RRBSs), while varying the length of the bit sequences. When the number of hidden-layer units of the ANN was as large as 100 or 1000, the overfitting characteristics were comparable to those of the VSTF. However, when the number of hidden-layer units was 10, which is usually enough to compensate for optical nonlinear distortion, the overfitting was weaker than that of the VSTF. Furthermore, we confirmed that even commonly used finite impulse response (FIR) filters showed overfitting to the RRBS when the length of the RRBS was equal to or shorter than the length of the tapped delay line of the filters. Conversely, when the RRBS used for the training was sufficiently longer than the tapped delay line, the overfitting could be suppressed, even when using an ANN-based nonlinear equalizer with 10 hidden-layer units.

The high-precision indoor positioning technology has gradually become one of the research hotspots in indoor mobile robots. Relax and Recover (RAR) is an indoor positioning algorithm using distance observations. The algorithm restores the robot's trajectory through curve fitting and does not require time synchronization of observations. The positioning can be successful with few observations. However, the algorithm has the disadvantages of poor resistance to gross errors and cannot be used for real-time positioning. In this paper, while retaining the advantages of the original algorithm, the RAR algorithm is improved with the adaptive Kalman filter (AKF) based on the innovation sequence to improve the anti-gross error performance of the original algorithm. The improved algorithm can be used for real-time navigation and positioning. The experimental validation found that the improved algorithm has a significant improvement in accuracy when compared to the original RAR. When comparing to the extended Kalman filter (EKF), the accuracy is also increased by 12.5%, which can be used for high-precision positioning of indoor mobile robots.

Currently, unmanned aerial vehicles (UAV) have been widely used in many applications, such as in transportation logistics, public safety, or even in non-terrestrial networks (NTN). In all these scenarios, it is an important issue to model channel behavior between the UAV and the user equipment (UE) on the ground. Among these channel features, a critical parameter that dominates channel behavior is the probability of the line-of-sight (LOS), since the statistical property of the channel fading can be either Ricean or Rayleigh, depending on the existence of LOS. Besides, with knowledge of LOS probability, operators can design approaches or schemes to maximum system performance, such as the serving coverage, received signal to noise ratio (SNR), or the bit error rate (BER) with the limited transmitted power. However, the LOS UAV channel is likely difficult to acquire or derive, as it depends on the deployment scenario, such as an urban or rural area. In this paper, we generated four different scenarios defined by the ITU via the ray tracing simulator. Then, we used the spatial geometric relation and the curve fitting approach to derive the analytic models to predict the probability of the UAV LOS channels for different scenarios. Results show that our proposed relationships yield better prediction results than the methods in the literature. Besides, an example of establishing UAV self-awareness ability for the deployed environment via using proposed models is also provided in this paper.

This paper proposes a framework for automatically annotating the keypoints of a human body in images for learning 2D pose estimation models. Ground-truth annotations for supervised learning are difficult and cumbersome in most machine vision tasks. While considerable contributions in the community provide us a huge number of pose-annotated images, all of them mainly focus on people wearing common clothes, which are relatively easy to annotate the body keypoints. This paper, on the other hand, focuses on annotating people wearing loose-fitting clothes (e.g., Japanese Kimono) that occlude many body keypoints. In order to automatically and correctly annotate these people, we divert the 3D coordinates of the keypoints observed without loose-fitting clothes, which can be captured by a motion capture system (MoCap). These 3D keypoints are projected to an image where the body pose under loose-fitting clothes is similar to the one captured by the MoCap. Pose similarity between bodies with and without loose-fitting clothes is evaluated with 3D geometric configurations of MoCap markers that are visible even with loose-fitting clothes (e.g., markers on the head, wrists, and ankles). Experimental results validate the effectiveness of our proposed framework for human pose estimation.

The extraction of micro-motion parameters is deeply influenced by the precision of estimation on translational motion parameters. Based on the periodicity of micro-motion, the quadratic polynomial fitting is carried out among range delays to align envelope. The micro-motion component of phase information is eliminated by conjugate multiplication after which the translational motion parameters are estimated. Then the translational motion is precisely compensated through the third order polynomial fitting. Results of simulation demonstrate that the algorithm put forward here can realize the precise compensation for translational motion parameters even under an environment with low signal noise ratio (SNR).

Pulse Pairs (PPs) generated by Distance Measure Equipment (DME) cause severe interference on L-band Digital Aeronautical Communication System type 1 (L-DACS1) which is based on Orthogonal Frequency Division Multiplexing (OFDM). In this paper, a novel and practical PP mitigation approach is proposed. Different from previous work, it adopts only time domain methods to mitigate interference, so it will not affect the subsequent signal processing in frequency domain. At the receiver side, the proposed approach can precisely reconstruct the deformed PPs (DPPs) which are often overlapped and have various parameters. Firstly, a filter bank and a correlation scheme are jointly used to detect non-overlapped DPPs, also a weighted average scheme is used to automatically measure the waveform of DPP. Secondly, based on the measured waveform, sparse estimation is used to estimate the precise positions of DPPs. Finally, the parameters of each DPP are estimated by a non-linear estimator. The key point of this step is, a piecewise linear model is used to approximate the non-linear carrier frequency of each DPP. Numerical simulations show that comparing with existing work, the proposed approach is more robust, closer to interference free environment and its Bit Error Rate is reduced by about 10dB.

Random forest regressor has recently been proposed as a local landmark estimator in the face alignment problem. It has been shown that random forest regressor can achieve accurate, fast, and robust performance when coupled with a global face-shape regularizer. In this paper, we extend this approach and propose a new Local Forest Classification and Regression (LFCR) framework in order to handle face images with large yaw angles. Specifically, the LFCR has an additional classification step prior to the regression step. Our experiment results show that this additional classification step is useful in rejecting outliers prior to the regression step, thus improving the face alignment results. We also analyze each system component through detailed experiments. In addition to the selection of feature descriptors and several important tuning parameters of the random forest regressor, we examine different initialization and shape regularization processes. We compare our best outcomes to the state-of-the-art system and show that our method outperforms other parametric shape-fitting approaches.

This paper shows accuracy of using azimuth-variable path-loss fitting in white-space (WS) boundary-estimation. We perform experiments to evaluate this method, and demonstrate that the required number of sensors can be significantly reduced. We have proposed a WS boundary-estimation framework that utilizes sensors to not only obtain spectrum sensing data, but also to estimate the boundaries of the incumbent radio system (IRS) coverage. The framework utilizes the transmitter position information and pathloss fitting. The pathloss fitting describes the IRS coverage by approximating the well-known pathloss prediction formula from the received signal power data, which is measured using sensors, and sensor-transmitter separation distances. To enhance its accuracy, we have further proposed a pathloss-fitting method that employs azimuth variables to reflect the azimuth dependency of the IRS coverage, including the antenna directivity of the transmitter and propagation characteristics.

Anomaly detection has several practical applications in different areas, including intrusion detection, image processing, and behavior analysis among others. Several approaches have been developed for this task such as detection by classification, nearest neighbor approach, and clustering. This paper proposes alternative clustering algorithms for the task of anomaly detection. By employing a weighted kernel extension of the least squares fitting of linear manifolds, we develop fuzzy clustering algorithms for kernel manifolds. Experimental results show that the proposed algorithms achieve promising performances compared to hard clustering techniques.

Ultra-wide band (UWB) radar has a great advantage for range resolution, and is suitable for 3-dimensional (3-D) imaging sensor, such as for rescue robots or surveillance systems, where an accurate 3-dimensional measurement, impervious to optical environments, is indispensable. However, in indoor sensing situations, an available aperture size is severely limited by obstacles such as collapsed furniture or rubles. Thus, an estimated region of target image often becomes too small to identify whether it is a human body or other object. To address this issue, we previously proposed the image expansion method based on the ellipse extrapolation, where the fitting space is converted from real space to data space defined by range points to enhance the extrapolation accuracy. Although this method achieves an accurate image expansion for some cases, by exploiting the feature of the efficient imaging method as range points migration (RPM), there are still many cases, where it cannot maintain sufficient extrapolation accuracy because it only employs the single scattered component for imaging. For more accurate extrapolation, this paper extends the above image expansion method by exploiting double-scattered signals between the target and the wall in an indoor environment. The results from numerical simulation validate that the proposed method significantly expands the extrapolated region for multiple elliptical objects, compared with that obtained using only single scattered signal.

We propose a parameterized multisurface fitting method for multi-frame super-resolution (SR) processing. A parameter assumed for the unknown high-resolution (HR) pixel is used for multisurface fitting. Each surface fitted at each low-resolution (LR) pixel is an expression of the parameter. Final SR result is obtained by fusing the sampling values from these surfaces in the maximum a posteriori fashion. Experimental results demonstrate the superiority of the proposed method.

A numerical model of multi-layered organic light emitting diode (OLED) is presented in this paper. The current density-voltage (J-V) model for OLED was performed by using the injection-limited current and bulk-limited current. The mobility equation was based on the field dependent model, so called “Poole-Frenkel mobility model.” The accuracy of this simulation was represented by comparing to the experimental results with a variable of EML thickness of multi-layered OLED device. There are two hetero-junction models which should be dealt with in the simulation. The Langevin recombination rate of electron and hole is also calculated through the device simulation.

Ultra-wideband (UWB) pulse radars have a definite advantage in high-range resolution imaging, and are suitable for short-range measurements, particularly at disaster sites or security scenes where optical sensors are rarely suitable because of dust or strong backlighting. Although we have already proposed an accurate imaging algorithm called Range Points Migration (RPM), its reconstructible area is too small to identify the shape of an object if it is far from the radar and the size of the aperture is inadequate. To resolve this problem, this paper proposes a novel image expansion method based on ellipse extrapolation; it enhances extrapolation accuracy by deriving direct estimates of the observed range points distributed in the data space. Numerical validation shows that the proposed method accurately extrapolates part of the target boundary, even if an extremely small region of the target boundary is obtained by RPM.

This paper addresses stereo matching under scenarios of smooth region and obviously slant plane. We explore the flexible handling of color disparity, spatial relation and the reliability of matching pixels in support windows. Building upon these key ingredients, a robust stereo matching algorithm using local plane fitting by Confidence-based Support Window (CSW) is presented. For each CSW, only these pixels with high confidence are employed to estimate optimal disparity plane. Considering that RANSAC has shown to be robust in suppressing the disturbance resulting from outliers, we employ it to solve local plane fitting problem. Compared with the state of the art local methods in the computer vision community, our approach achieves the better performance and time efficiency on the Middlebury benchmark.

Identifying the statistical independence of random variables is one of the important tasks in statistical data analysis. In this paper, we propose a novel non-parametric independence test based on a least-squares density ratio estimator. Our method, called least-squares independence test (LSIT), is distribution-free, and thus it is more flexible than parametric approaches. Furthermore, it is equipped with a model selection procedure based on cross-validation. This is a significant advantage over existing non-parametric approaches which often require manual parameter tuning. The usefulness of the proposed method is shown through numerical experiments.

We present an alternative approach to what we call the "standard optimization", which minimizes a cost function by searching a parameter space. Instead, our approach "projects" in the joint observation space onto the manifold defined by the "consistency constraint", which demands that any minimal subset of observations produce the same result. This approach avoids many difficulties encountered in the standard optimization. As typical examples, we apply it to line fitting and multiview triangulation. The latter produces a new algorithm far more efficient than existing methods. We also discuss the optimality of our approach.

This paper presents a pilot-aided channel estimation method which is particularly suitable for mobile WiMAX 802.16e Downlink Partial Usage of Subchannel mode. Based on this mode, several commonly used channel estimation methods are studied and the method of least squares line fitting is proposed. As data of users are distributed onto permuted clusters of subcarriers in the transmitted OFDMA symbol, the proposed channel estimation method utilizes these advantages to provide better performance than conventional approaches while offering remarkably low complexity in practical implementation. Simulation results with different ITU-channels for mobile environments show that depending on situations, enhancement of 5 dB or more in term of SNR can be achieved.

The aim of this work is to develop an efficient medical image segmentation technique by fitting a nonlinear shape model with pre-segmented images. In this technique, the kernel principle component analysis (KPCA) is used to capture the shape variations and to build the nonlinear shape model. The pre-segmentation is carried out by classifying the image pixels according to the high level texture features extracted using the over-complete wavelet packet decomposition. Additionally, the model fitting is completed using the particle swarm optimization technique (PSO) to adapt the model parameters. The proposed technique is fully automated, is talented to deal with complex shape variations, can efficiently optimize the model to fit the new cases, and is robust to noise and occlusion. In this paper, we demonstrate the proposed technique by implementing it to the liver segmentation from computed tomography (CT) scans and the obtained results are very hopeful.

Point Pattern Matching (PPM) is an essential problem in many image analysis and computer vision tasks. This paper presents a two-stage algorithm for PPM problem using ellipse fitting and dual Hilbert scans. In the first matching stage, transformation parameters are coarsely estimated by using four node points of ellipses which are fitted by Weighted Least Square Fitting (WLSF). Then, Hilbert scans are used in two aspects of the second matching stage: it is applied to the similarity measure and it is also used for search space reduction. The similarity measure named Hilbert Scanning Distance (HSD) can be computed fast by converting the 2-D coordinates of 2-D points into 1-D space information using Hilbert scan. On the other hand, the N-D search space can be converted to a 1-D search space sequence by N-D Hilbert Scan and an efficient search strategy is proposed on the 1-D search space sequence. In the experiments, we use both simulated point set data and real fingerprint images to evaluate the performance of our algorithm, and our algorithm gives satisfying results both in accuracy and efficiency.

In this study, we propose a simple, yet general and powerful framework for constructing accurate affine invariant regions. In our framework, a method for extracting reliable seed points is first proposed. Then, regions which are invariant to most common affine transformations can be extracted from seed points by two new methods the Path Growing (PG) or the Thresholding Seeded Growing Region (TSGR). After that, an improved ellipse fitting method based on the Direct Least Square Fitting (DLSF) is used to fit the irregularly-shaped contours from the PG or the TSGR to obtain ellipse regions as the final invariant regions. In the experiments, our framework is first evaluated by the criterions of Mikolajczyk's evaluation framework [1], and then by near-duplicate detection problem [2]. Our framework shows its superiorities to the other detectors for different transformed images under Mikolajczyk's evaluation framework and the one with TSGR also gives satisfying results in the application to near-duplicate detection problem.