• Journal of Information Processing Systems
• /
• v.15 no.5
• /
• pp.1068-1081
• /
• 2019

Signal complexity is one point of view to analyze the biological signal. It arises as a result of the physiological signal produced by biological systems. Signal complexity can be used as a method in extracting the feature for a biological signal to differentiate a pathological signal from a normal signal. In this research, Hjorth descriptors, one of the signal complexity measurement techniques, were measured on signal sub-band as the features for lung sounds classification. Lung sound signal was decomposed using two wavelet analyses: discrete wavelet transform (DWT) and wavelet packet decomposition (WPD). Meanwhile, multi-layer perceptron and N-fold cross-validation were used in the classification stage. Using DWT, the highest accuracy was obtained at 97.98%, while using WPD, the highest one was found at 98.99%. This result was found better than the multi-scale Hjorth descriptor as in previous studies.

• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.20-25
• /
• 2009

The maximum likelihood detection with QR decomposition and M-algorithm (QRM-MLD) has been presented as a suboptimum multiple-input multiple-output (MIMO) detection scheme which can provide almost the same performance as the optimum maximum likelihood (ML) MIMO detection scheme but with the reduced complexity. However, due to the lack of parallelism and the regularity in the decoding structure, the conventional QRM-MLD which uses the tree-structure still has very high complexity for the very large scale integration (VLSI) implementation. In this paper, we modify the tree-structure of conventional QRM-MLD into trellis-structure in order to obtain high operational parallelism and regularity and then apply the Viterbi algorithm to the QRM-MLD to ease the burden of the VLSI implementation.We show from our selected numerical examples that, by using the QRM-MLD with our proposed trellis-structure, we can reduce the complexity significantly compared to the tree-structure based QRM-MLD while the performance degradation of our proposed scheme is negligible.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1310-1319
• /
• 2016

Face detection is the first step in a wide range of face applications. However, detecting faces in the wild is still a challenging task due to the wide range of variations in pose, scale, and occlusions. Recently, many deep learning methods have been proposed for face detection. However, further improvements are required in the wild. Another important issue to be considered in the face detection is the computational complexity. Current state-of-the-art deep learning methods require a large number of patches to deal with varying scales and the arbitrary image sizes, which result in an increased computational complexity. To reduce the complexity while achieving better detection accuracy, we propose a fully convolutional network-based face detection that can take arbitrarily-sized input and produce feature maps (heat maps) corresponding to the input image size. To deal with the various face scales, a multi-scale network architecture that utilizes the facial components when learning the feature maps is proposed. On top of it, we design multi-task learning technique to improve detection performance. Extensive experiments have been conducted on the FDDB dataset. The experimental results show that the proposed method outperforms state-of-the-art methods with the accuracy of 82.33% at 517 false alarms, while improving computational efficiency significantly.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.560-565
• /
• 1986

For the control of chemical process, optimal value of the process should be known at first. And process simulation is the previous step of optimal value calculation. However it is not a simple work to analyze chemical process system. Especially for the large scale chemical process system, many difficulties such as non-linearity and complexity caused by recycle streams should be overcome. In this paper, three strategies of large scale chemical process analysis were explained and discussed with case studies.

• ETRI Journal
• /
• v.35 no.6
• /
• pp.949-959
• /
• 2013

Since the recent launch of Microsoft Xbox Kinect, research on 3D human pose estimation has attracted a lot of attention in the computer vision community. Kinect shows impressive estimation accuracy and real-time performance on massive graphics processing unit hardware. In this paper, we focus on further reducing the computation complexity of the existing state-of-the-art method to make the real-time 3D human pose estimation functionality applicable to devices with lower computing power. As a result, we propose two simple approaches to speed up the random-forest-based human pose estimation method. In the original algorithm, the random forest classifier is applied to all pixels of the segmented human depth image. We first use a multi-scale approach to reduce the number of such calculations. Second, the complexity of the random forest classification itself is decreased by the proposed cascade approach. Experiment results for real data show that our method is effective and works in real time (30 fps) without any parallelization efforts.

• Journal of International Society for Simulation Surgery
• /
• v.2 no.2
• /
• pp.64-66
• /
• 2015

Purpose : In this paper we proposed cascade feature filter and projection method for rapid human face recognition for the large-scale high-dimensional face database. Materials and Methods : The relevant features are selected from the large feature set using Fast Correlation-Based Filter method. After feature selection, project them into discriminant using Principal Component Analysis or Linear Discriminant Analysis. Their cascade method reduces the time-complexity without significant degradation of the performance. Results : In our experiments, the ORL database and the extended Yale face database b were used for evaluation. On the ORL database, the processing time was approximately 30-times faster than typical approach with recognition rate 94.22% and on the extended Yale face database b, the processing time was approximately 300-times faster than typical approach with recognition rate 98.74 %. Conclusion : The recognition rate and time-complexity of the proposed method is suitable for real-time face recognition system on the large-scale high-dimensional face database.

• ETRI Journal
• /
• v.45 no.4
• /
• pp.557-569
• /
• 2023

Traditional deterministic channel modeling is accurate in prediction, but due to its complexity, improving computational efficiency remains a challenge. In an alternative approach, we investigated a multilayer artificial neural network (ANN) to predict large-scale and small-scale channel characteristics in metro tunnels. Simulated high-precision training datasets were obtained by combining measurement campaign with a ray tracing (RT) method in a metro tunnel. Performance on the training data was used to determine the number of hidden layers and neurons of the multilayer ANN. The proposed multilayer ANN performed efficiently (10 s for training; 0.19 ms for prediction), and accurately, with better approximation of the RT data than the single-layer ANN. The root mean square errors (RMSE) of path loss (2.82 dB), root mean square delay spread (0.61 ns), azimuth angle spread (3.06°), and elevation angle spread (1.22°) were impressive. These results demonstrate the superior computing efficiency and model complexity of ANNs.

• ETRI Journal
• /
• v.46 no.3
• /
• pp.392-403
• /
• 2024

Even though generalized frequency division multiplexing is an alternative waveform method expected to replace the orthogonal frequency division multiplexing in the future, its implementation must alleviate channel effects. Least-squares (LS), a low-complexity channel estimation technique, could be improved by using the discrete Fourier transform (DFT) without increasing complexity. Unlike the usage of the LS method, the DFT-based method requires the receiver to know the channel impulse response (CIR) length, which is unknown. This study introduces a simple, yet effective, CIR length estimator by utilizing LS estimation. As the cyclic prefix (CP) length is commonly set to be longer than the CIR length, it is possible to search through the first samples if CP is larger than a threshold set using the remaining samples. An adaptive scale is also designed to lower the error probability of the estimation, and a simple signal-to-interference-noise ratio estimation is also proposed by utilizing a sparse preamble to support the use of the scale. A software simulation is used to show the ability of the proposed system to estimate the CIR length. Due to shorter CIR length of rural area, the performance is slightly poorer compared to urban environment. Nevertheless, satisfactory performance is shown for both environments.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.287-290
• /
• 2000

In this paper we have presented approach to automatic the direction feature vectors detection, which detects the ridge line directly in gray scale images. In spite of a greater conceptual complexity, we have shown that our technique has less computational complexity than the complexity of the techniques which require binarization and thinning. Afterwards a various direction feature vectors is changed four direction feature vectors. In this paper used matching method is four direction feature vectors based matching. This four direction feature vectors consist feature patterns in fingerprint images. This feature patterns were used for identification of individuals inputed multilayer Neural Networks(NN) which has capability of excellent pattern identification.

• Anxiety and mood
• /
• v.18 no.2
• /
• pp.72-79
• /
• 2022

Objective : Any traumatic event can be a risk factor, for subsequent mental disorder. However, childhood trauma, especially in interpersonal nature, is associated with later development of complex symptom patterns. This study examined the role of dissociation as a mediator between childhood trauma and symptom complexity. Methods : A pooled data of 369 psychiatric outpatients at a university-affiliated hospital was analyzed for descriptive statistics, group differences, and bivariate correlation analysis to verify a structural model. The questionnaires included the Symptom Checklist-90-Revised, the Trauma History Screen, the Dissociative Experiences Scale-Taxon, the Beck Depression Inventory, the Beck Anxiety Inventory, and the Abbreviated PTSD checklist. Results : When other trauma variables were controlled, childhood interpersonal trauma had significant correlation with symptom complexity (r=0.155, p=0.003). Among the paths analyzed, that of childhood interpersonal trauma and dissociation showed the greatest impact on symptom complexity (b=9.34, t=5.75, p<0.001). Based on the significance of the indirect impact, the results suggest a complete mediation impact of dissociation on symptom complexity. Conclusion : This study validated that childhood interpersonal trauma impacts symptom complexity, through the sequential mediating impact of dissociation. Thus, clinicians should understand childhood interpersonal trauma, dissociation, and symptom patterns in a complex and interacting mode, and develop effective pertinent treatment strategies.