• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.12
• /
• pp.4420-4438
• /
• 2021

Image dehazing is an ill-posed problem which is far from being solved. Traditional image dehazing methods often yield mediocre effects and possess substandard processing speed, while modern deep learning methods perform best only in certain datasets. The haze removal effect when processed by said methods is unsatisfactory, meaning the generalization performance fails to meet the requirements. Concurrently, due to the limited processing speed, most dehazing algorithms cannot be employed in the industry. To alleviate said problems, a lightweight fast dehazing network based on a multiple scale-patch framework (MSP) is proposed in the present paper. Firstly, the multi-scale structure is employed as the backbone network and the multi-patch structure as the supplementary network. Dehazing through a single network causes problems, such as loss of object details and color in some image areas, the multi-patch structure was employed for MSP as an information supplement. In the algorithm image processing module, the image is segmented up and down for processed separately. Secondly, MSP generates a clear dehazing effect and significant robustness when targeting real-world homogeneous and nonhomogeneous hazy maps and different datasets. Compared with existing dehazing methods, MSP demonstrated a fast inference speed and the feasibility of real-time processing. The overall size and model parameters of the entire dehazing model are 20.75M and 6.8M, and the processing time for the single image is 0.026s. Experiments on NTIRE 2018 and NTIRE 2020 demonstrate that MSP can achieve superior performance among the state-of-the-art methods, such as PSNR, SSIM, LPIPS, and individual subjective evaluation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.435-449
• /
• 2023

The state-of-the-art video-based point cloud compression(V-PCC) has a high efficiency of compressing 3D point cloud by projecting points onto 2D images. These images are then padded and compressed by High-Efficiency Video Coding(HEVC). Pixels in padded 2D images are classified into three groups including origin pixels, padded pixels and unoccupied pixels. Origin pixels are generated from projection of 3D point cloud. Padded pixels and unoccupied pixels are generated by copying values from origin pixels during image padding. For padded pixels, they are reconstructed to 3D space during geometry reconstruction as well as origin pixels. For unoccupied pixels, they are not reconstructed. The rate distortion optimization(RDO) used in HEVC is mainly aimed at keeping the balance between video distortion and video bitrates. However, traditional RDO is unreliable for padded pixels and unoccupied pixels, which leads to significant waste of bits in geometry reconstruction. In this paper, we propose a new RDO scheme which takes 3D-Distortion into account instead of traditional video distortion for padded pixels and unoccupied pixels. Firstly, these pixels are classified based on the occupancy map. Secondly, different strategies are applied to these pixels to calculate their 3D-Distortions. Finally, the obtained 3D-Distortions replace the sum square error(SSE) during the full RDO process in intra prediction and inter prediction. The proposed method is applied to geometry frames. Experimental results show that the proposed algorithm achieves an average of 31.41% and 6.14% bitrate saving for D1 metric in Random Access setting and All Intra setting on geometry videos compared with V-PCC anchor.

• Journal of Internet Computing and Services
• /
• v.24 no.1
• /
• pp.39-47
• /
• 2023

The development of autonomous driving and Advanced Driver Assistance System (ADAS) technology has grown rapidly in recent years. As most traffic accidents occur due to human error, self-driving vehicles can drastically reduce the number of accidents and crashes that occur on the roads today. Obviously, technical advancements in autonomous driving can lead to improved public driving safety. However, due to the current limitations in technology and lack of public trust in self-driving cars (and drones), the actual use of Autonomous Vehicles (AVs) is still significantly low. According to prior studies, people's acceptance of an AV is mainly determined by trust. It is proven that people still feel much more comfortable in personalized ADAS, designed with the way people drive. Based on such needs, a new attempt for a customized ADAS considering each driver's driving style is proposed in this paper. Each driver's behavior is divided into two categories: assertive and defensive. In this paper, a novel customized ADAS algorithm with high classification accuracy is designed, which divides each driver based on their driving style. Each driver's driving data is collected and simulated using CARLA, which is an open-source autonomous driving simulator. In addition, Long Short-Term Memory (LSTM) and Gated Recurrent Unit (GRU) machine learning algorithms are used to optimize the ADAS parameters. The proposed scheme results in a high classification accuracy of time series driving data. Furthermore, among the vast amount of CARLA-based feature data extracted from the drivers, distinguishable driving features are collected selectively using Support Vector Machine (SVM) technology by comparing the amount of influence on the classification of the two categories. Therefore, by extracting distinguishable features and eliminating outliers using SVM, the classification accuracy is significantly improved. Based on this classification, the ADAS sensors can be made more sensitive for the case of assertive drivers, enabling more advanced driving safety support. The proposed technology of this paper is especially important because currently, the state-of-the-art level of autonomous driving is at level 3 (based on the SAE International driving automation standards), which requires advanced functions that can assist drivers using ADAS technology.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.8 no.3
• /
• pp.879-886
• /
• 2018

The basic search engine on Twitter shows not only tweets that contain search keywords, but also all articles written by users with nicknames containing search keywords. Since the tweets unrelated to the search keyword are exposed as search results, it is inconvenient to many users who want to search only tweets that include the keyword. To solve this inconvenience, this study improved the search function of Twitter by developing an algorithm that searches only tweets that contain search keywords. The improved functionality is implemented as a Web service using ASP.NET MVC5 and is available to many users. We used a powerful collection method in C# to retrieve the results of an object, and it was also possible to output them according to the number of 'retweets' or 'favorites'. If the number of retrieved numbers is less than a given number, we also added an exclusion filter function. Thus, sorting search results by the number of retweets or favorites, user can quickly search for opinions that are of interest to many users. It is expected that many users and data analysts will find the developed function convenient to search on Twitter.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.8 no.3
• /
• pp.563-570
• /
• 2018

This paper proposes an efficient dissolved gas analysis(DGA) and classification method of an oil-filled transformer using machine learning algorithms to solve problems inherent in IEC 60599. In IEC 60599, a certain diagnosis criteria do not exist, and duplication area is existed. Thus, it is difficult to make a decision without any experts since the IEC 60599 standard can not support analysis and classification of gas date of a power transformer in that criteria. To address these issue. we propose a dissolved gas analysis(DGA) and classification method using a machine learning algorithm. We evaluate the performance of the proposed method using support vector machines with dissolved gas dataset extracted from a power transformer in the real industry. To validate the performance of the proposed method, we compares the proposed method with the IEC 60599 standard. Experimental results show that the proposed method outperforms the IEC 60599 in the classification accuracy.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.6 no.6
• /
• pp.469-477
• /
• 2016

This study develops an approach to assign numbers of facilities (rectangular shape) in a given plant and compares the test results by proposed approach with those by approaches in the literature. An improvement approach is proposed to minimize material handling cost given initial layout. Like popular heuristic approaches, the developed heuristic approach employs interchange routine to improve material handling cost in current layout. Horizontal interchange and vertical interchange procedures are applied to obtain better solution. Also, it is possible to rotate facility layout when the sizes of both facilities are same. However, the proposed approach generates good solutions without shape distortion. That means the shape of facilities remains rectangle in the final solution. In addition, the improve approach can find global optimal solution from local optimal solution by applying Tabu search technique. Based on 25 test problems in the literature, we obtained better solutions than other facility layout approaches in the literature when there are many facilities.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.2
• /
• pp.311-319
• /
• 2017

Recently invasion of privacy problem in medical information have been issued following the interest in secondary use of large medical information. These large medical information is very useful information that can be used in various fields such as disease research and prevention. However, due to the privacy laws such as Privacy Act and Medical Law, these informations including patients or health professionals' personal information are difficult to utilize secondary. Accordingly, various methods such as k-anonymity, l-diversity and differential-privacy that can be utilized while protecting privacy have been developed and utilized in this field. In this paper, we study differential privacy processing procedure, one of various methods, and find out about the differential privacy problem using Laplace noise. Finally, we propose a new method using the Shamir's secret sharing method and symemetric key encryption algorithm such as AES for this problem.

• The Journal of the Acoustical Society of Korea
• /
• v.27 no.5
• /
• pp.256-261
• /
• 2008

In this paper, we propose a novel approach to improve the performance of minima controlled recursive averaging (MCRA) which is based on the conditional maximum a posteriori criterion. A crucial component of a practical speech enhancement system is the estimation of the noise power spectrum. One state-of-the-art approach is the minima controlled recursive averaging (MCRA) technique. The noise estimate in the MCRA technique is obtained by averaging past spectral power values based on a smoothing parameter that is adjusted by the signal presence probability in frequency subbands. We improve the MCRA using the speech presence probability which is the a posteriori probability conditioned on both the current observation the speech presence or absence of the previous frame. With the performance criteria of the ITU-T P.862 perceptual evaluation of speech quality (PESQ) and subjective evaluation of speech quality, we show that the proposed algorithm yields better results compared to the conventional MCRA-based scheme.

• Journal of the Korean Society for Railway
• /
• v.19 no.6
• /
• pp.833-843
• /
• 2016

Recently, in the field of rail freight transportation, the number of trains dedicated for shippers has been increasing. These dedicated trains, which run on the basis of a contract with shippers, had been restricted to the transportation of containers, or so called block trains. Nowadays, such commodities have extended to cement, hard coal, etc. Most full freight cars are transported by dedicated trains. But, for empty car distribution, the efficiency still remains questionable because the distribution plan is manually developed by dispatchers. In this study, we investigated distribution models delineated in the KTOCS system which was developed by KORAIL as well as mathematical models considered in the state-of-the-art. The models are based on optimization models, especially the network flow model. Here we suggest a new optimization model with a framework of the column generation approach. The master problem can be formulated into a transportation problem with additional constraints. The master problem is improved by adding a new edge between the supply node and the demand node; this edge can be found using a simple shorted path in the time-space network. Finally, we applied our algorithm to the Korean freight train network and were able to find the total number of empty car kilometers decreased.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.6 s.312
• /
• pp.34-42
• /
• 2006

As art analytic method to uncover interesting patterns hidden under a large volume of data, data mining research has been actively done so far in various fields. However, current state-of-the-arts in data mining research have several challenging problems such as being too ad-hoc. The existing techniques are mostly the ones designed for individual problems, so there is no unifying theory applicable for more general data mining problems. In this paper, we address the problem of classification, which is one of significant data mining tasks. Specifically, our objective is to evaluate radial basis function (RBF) model for classification tasks and investigate its usefulness. For evaluation, we analyze the popular Monk's problems which are well-known datasets in data mining research. First, we develop RBF models by using the representational capacity based learning algorithm, and then perform a comparative assessment of the results with other models generated by the existing techniques. Through a variety of experiments, it is empirically shown that the RBF model has not only the superior performance on the Monk's problems but also its modeling process can be controlled in a systematic way, so the RBF model with RC-based algorithm might be a good candidate to handle the current ad-hoc problem.