• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.3
• /
• pp.98-105
• /
• 2021

The sensory stimulation of a cosmetic product has been deemed to be an ancillary aspect until a decade ago. That point of view has drastically changed on different levels in just a decade. Nowadays cosmetic formulators should unavoidably meet the needs of consumers who want sensory satisfaction, although they do not have much time for new product development. The selection of new products from candidate products largely depend on the panel of human sensory experts. As new product development cycle time decreases, the formulators wanted to find systematic tools that are required to filter candidate products into a short list. Traditional statistical analysis on most physical property tests for the products including tribology tests and rheology tests, do not give any sound foundation for filtering candidate products. In this paper, we suggest a deep learning-based analysis method to identify hand cream products by raw electric signals from tribological sliding test. We compare the result of the deep learning-based method using raw data as input with the results of several machine learning-based analysis methods using manually extracted features as input. Among them, ResNet that is a deep learning model proved to be the best method to identify hand cream used in the test. According to our search in the scientific reported papers, this is the first attempt for predicting test cosmetic product with only raw time-series friction data without any manual feature extraction. Automatic product identification capability without manually extracted features can be used to narrow down the list of the newly developed candidate products.

• Journal of Korea Multimedia Society
• /
• v.21 no.2
• /
• pp.300-309
• /
• 2018

Detection of vanishing point is a challenging task in the situations where there are several structures with straight lines. Commonly used approaches for determining vanishing points involves finding the straight lines using edge detection and Hough transform methods. This approach often fails to perform effectively when there are a lot of straight lines found. The lines not meeting at a vanishing point are considered to be noises. In such situation, finding right candidate lines for detecting vanishing points is not a simple task. This paper proposes to use reference objects for vanishing point detection. By analyzing a reference object, it identifies the contour of the object, and derives a polygon from the contour information. Then the edges of the detected polygon are used to find the vanishing points. Our experimental results show that the proposed approach can detect vanishing points with comparable accuracy to the existing edge detection based method. Our approach can also be applied effectively even to complex situations, where too many lines generated by the existing methods make it difficult to select right lines for the vanishing points.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.279-282
• /
• 1999

Acceleration in integration density and speed performance of ULSI circuits require miniaturization of CMOS and interconnections as well as higher current density capabilities for transistors. A leading candidate to substitute A1-alloy is Cu, which has lower resistivity and higher melting point. So we can expect much higher electromigration resistance. In this paper, we are going to explain the major features of EM for MOCVD Cu according to variant conditions. We compared the life time and activation energy of MOCVD Cu with those of E-beam Cu and Al in The same conditions.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.824-832
• /
• 1998

In this paper, wc proposed new method for corner point detection on digital contours using directional angle and area dcviation_ First of all, dircctional angle was detccted according to contours by lookup table, then corner point was detected using arca deviation aftcr the pixels over standard value had selected as a candidate point. This method has the advantage the rcduction of processing time for real time processing and the reduction of round-off error on digital image reprcsentation. For vcrification of the proposed method simulation results which applied on various tcst pattern were compared with existing methods.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.987-992
• /
• 2004

There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose the improved diamond search pattern using an motion vector prediction candidate search point by the predicted motion information from the same block of the previous frame. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improves as high as high as 14~24% in terms of average number of search point per motion vector estimation and improved about 0.02~0.37dB on an average except the full search(FS) algorithm.

• Journal of Korea Multimedia Society
• /
• v.21 no.10
• /
• pp.1131-1141
• /
• 2018

Motion Estimation which is used to reduce the redundant data plays an important role in video compressions. However, it requires huge computational complexity of the encoder part. And therefore many fast motion estimation methods has been developed to reduce complexity. Multi-view video is obtained by using many cameras at different positions and its complexity increases in proportion to the number of cameras. In this paper, we proposed a fast motion estimation method for multi-view video. The proposed method predicts a search start point by using correlated candidate vectors of the current block. According to the motion size of the start search point, a search start pattern of the current block is decided adaptively. The proposed method proves to be about 2 ~ 5 times faster than existing methods while maintaining similar image quality and bitrates.

• Journal of Mechanical Science and Technology
• /
• v.18 no.4
• /
• pp.649-663
• /
• 2004

While a great number of studies on human motor control have provided a wide variety of viewpoints concerning the strategy of the central nervous system (CNS) in controlling limb movement, none were able to reveal the exact methods how the movement command from CNS is mapped onto the neuromuscular activity. As a preliminary study of human-machine interface design, the characteristics of human leg motion and its underlying motor control scheme are studied through experiments and simulations in this paper. The findings in this study suggest a simple open-loop motor control scheme in leg motion. As a possible candidate, an equilibrium point control model appears consistent in recreating the experimental data in numerical simulations. Based on the general leg motion analysis, the braking motion by the driver's leg is modeled.

• Journal of Korea Multimedia Society
• /
• v.4 no.4
• /
• pp.363-369
• /
• 2001

This paper proposes a convex hull algorithm for 2D patterns. The proposed algorithm is divided ito 2steps; candidate convex point extraction and final convex point extraction. First step removes as many points as possible that cannot be convex points using simple operation. Second step computes final convex hull of 2D patterns. This method accelerates execution time, since it consists of simple operations. Experimental results show that the proposed method is faster than other 2 methods in speed.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.208-211
• /
• 2004

Landmark matching is one of an important algorithm for navigation of satellite images. This paper proposes a fast landmark matching algorithm using a MGLI (Moving Guide-Line Image). For searching the matched point between the landmark chip and a part of image, correlation matrix is used generally, but the full-sized correlation matrix has a drawback requiring plenty of time for matching point calculation. MGLI includes thick lines for fast calculation of correlation matrix. In the MGLI, width of the thick lines should be determined by satellite position changes and navigation error range. For the fast landmark matching, the MGLI provides guided line for a landmark chip we want to match, so that the proposed method should reduce candidate areas for correlation matrix calculation. This paper will show how much time is reduced in the proposed fast landmark matching algorithm compared to general ones.

• Nuclear Engineering and Technology
• /
• v.44 no.7
• /
• pp.799-806
• /
• 2012

In recent years, a new algorithm has been introduced to perform the regional overpower protection (ROP) detector layout optimization for $CANDU^{(R)}$ reactors. This algorithm is called DETPLASA. This algorithm has been shown to successfully come up with a detector layout which meets the target trip set point (TSP) value. Knowing that these ROP detectors are placed in a number of safety channels, one expects that there is an optimal placement of the candidate detectors into these channels. The objective of the present paper is to show that a slight improvement to the TSP value can be realized by optimizing the channelization of these ROP detectors. Depending on the size of the ROP system, based on numerical experiments performed in this study, the range of additional TSP improvement is from 0.16%FP (full power) to 0.56%FP.