In order to identify tea varieties quickly, efficiently and nondestructively, an adaptive improved possibilistic c‐means (AIPCM) clustering with the fuzzy Mahalanobis distancewas proposed to classify the Fourier transform infrared reflectance (FTIR) spectra of tea samples.Three varieties of tea samples were scanned andFTIR spectra were acquired for 96 tea samples of different geographical originsby using the FTIR‐7600 infrared spectrometer. Multiple scatter correction (MSC) was employed to eliminate light scattering of FTIR spectral data. After that, principal component analysis (PCA) and linear discriminant analysis (LDA) were applied to reduce the dimensionality of FTIR spectra and extract the discriminant information, respectively. Thenthe data were clustered byseveral fuzzy clusteringalgorithms. AIPCM had the highest clustering accuracyand its accuracy achieved up to 98.5%. The experimental results showed that FTIR spectroscopy coupled with AIPCM clustering was superior in classification of tea varieties.

Due to the difference of raw materials and brewing technology, the quality and flavours of vinegar are different. Different kinds of vinegar have different functions and effects. Therefore, it is important to classify the vinegar varieties correctly. This work presented a new fuzzy feature extraction algorithm, called fuzzy Foley–Sammon transformation (FFST), and designed the electronic nose (E-nose) system for classifying vinegar varieties successfully. Principal component analysis (PCA) and standard normal variate (SNV) were used as the data preprocessing algorithms for the E-nose system. FFST, Foley–Sammon transformation (FST) and linear discriminant analysis (LDA) were used to extract discriminant information from E-nose data, respectively. Then, K nearest neighbor (KNN) served as a classifier for the classification of vinegar varieties. The highest identification accuracy rate was 96.92% by using the FFST and KNN. Therefore, the E-nose system combined with the FFST was an effective method to identify Chinese vinegar varieties and this method has wide application prospects.

In practice, a high-dynamic vibration sensor is often plagued by the problem of drift, which is caused by thermal effects. Conversely, low-drift sensors typically have a limited sample rate range. This paper presents a system combining different types of sensors to address general drift problems that occur in measurements for high-dynamic vibration signals. In this paper, the hardware structure and algorithms for fusing high-dynamic and low-drift sensors are described. The algorithms include a drift state estimation and a Kalman filter based on a linear prediction model. Key issues such as the dimension of the drift state vector, the order of the linear prediction model, are analyzed in the design of algorithm. The performance of the algorithm is illustrated by a simulation example and experiments. The simulation and experimental results show that the drift can be removed while the high-dynamic measuring ability is retained. A high-dynamic vibration measuring system with the frequency range starting from 0 Hz is achieved. Meanwhile, measurement noise was improved 9.3 dB through using the linear-prediction-based Kalman filter.

Complex variational mode decomposition (CVMD) has been proposed to extend the original variational mode decomposition (VMD) algorithm to analyze complex-valued data. Conventionally, CVMD divides complex-valued data into positive and negative frequency components using bandpass filters, which leads to difficulties in decomposing signals with the low-frequency trend. Moreover, both decomposition number parameters of positive and negative frequency components are required as prior knowledge in CVMD, which is difficult to satisfy in practice. This paper proposes a modified complex variational mode decomposition (MCVMD) method. First, the complex-valued data are upsampled through zero padding in the frequency domain. Second, the negative frequency component of upsampled data are shifted to be positive. Properties of analytical signals are used to get the real-valued data for standard variational mode decomposition and the complex-valued decomposition results after frequency shifting back. Compared with the conventional method, the MCVMD method gives a better decomposition of the low-frequency signal and requires less prior knowledge about the decomposition number. The equivalent filter bank structure is illustrated to analyze the behavior of MCVMD, and the MCVMD bi-directional Hilbert spectrum is provided to give the time–frequency representation. The effectiveness of the proposed algorithm is verified by both synthetic and real-world complex-valued signals.