• 제목/요약/키워드: Candidate Point

검색결과 306건 처리시간 0.022초

딥러닝을 이용한 핸드크림의 마찰 시계열 데이터 분류 (Deep Learning-based Approach for Classification of Tribological Time Series Data for Hand Creams)

  • 김지원;이유민;한상헌;김경택
    • 산업경영시스템학회지
    • /
    • 제44권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.

Vanishing Point Detection using Reference Objects

  • Lee, Sangdon;Pant, Sudarshan
    • 한국멀티미디어학회논문지
    • /
    • 제21권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.

MOCVD 방식으로 증착한 Cu 박막의 Electromigration 특성 (Characteristics of electromigration in Cu thin films deposited by MOCVD method)

  • 이정환;이원석;이종현;최시영
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1999년도 하계종합학술대회 논문집
    • /
    • 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.

  • PDF

방향각과 면적편차를 이용한 윤곽선의 코너점 추출 (Corner Point Detection on digital Contoours using directional Angle and Area Deviation)

  • 정광웅;이상학;김진홍;김두영
    • 한국정보처리학회논문지
    • /
    • 제5권3호
    • /
    • pp.824-832
    • /
    • 1998
  • 본 논문에서는 영상의 코너점을 추출하기 위한 방법을 제안한다. 먼저 윤곽선을 따라 경계화소의 방향각을 lookup table의 참조에 의해 구하고, 기준치 이상의 화소를 후보점으로 선정한 뒤, 면적편차를 이용하여 코너점을 추출한다. 본 방법은 실시간 처리를 위해 처리시간을 줄이는 동시에 디지털 영상을 표현하는데 있어 라운드 오프 오차에 의해 발생되는 한 화소차를 극복하는 장점을 가진다. 제안된 방법의 검증을 위해 각종 실험 패턴을 이용하여 기존의 방법과 비교분석을 하였다.

  • PDF

고속 블록 정합 움직임 추정을 위한 적응적 패턴 탐색 (Adaptive Pattern Search for Fast Block-Matching Motion Estimation)

  • 곽성근
    • 한국컴퓨터산업학회논문지
    • /
    • 제5권9호
    • /
    • pp.987-992
    • /
    • 2004
  • 비디오 시퀀스의 현재 블록의 움직임 벡터와 이전 블록의 움직임 벡터는 시간적 상관성을 갖고있다. 본 논문에서는 현재 프레임 블록의 인접 블록으로부터 예측된 움직임 정보를 구하여, 이를탐색 원점으로 하여 수정된 다이아몬드 지역 레이더 패턴으로 블록 정합을 수행하는 블록 정합움직임 추정 방식을 제안한다. 실험 결과 제안된 방식은 전역탐색을 제외한 기존의 방식들에 비해 PSNR 값에 있어서 평균적으로 0.02~0.37[dB] 개선되고 움직임 벡터 예측의 속도에 있어서 약 14~24% 이상의 높은 성능 향상을 보였다.

  • PDF

다시점 비디오 부호화를 위한 움직임 벡터들의 상관성을 이용한 움직임 추정 기법 (Motion Estimation Method Based on Correlations of Motion Vectors for Multi-view Video Coding)

  • 윤효순;김미영
    • 한국멀티미디어학회논문지
    • /
    • 제21권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.

Underlying Control Strategy of Human Leg Posture and Movement

  • Park, Shinsuk
    • Journal of Mechanical Science and Technology
    • /
    • 제18권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.

2차원 패턴의 볼록 헐 알고리즘 (A Convex Hull Algorithm for 2D Patterns)

  • 홍기천;오일석
    • 한국멀티미디어학회논문지
    • /
    • 제4권4호
    • /
    • pp.363-369
    • /
    • 2001
  • 본 논문에서는 2 차원 패턴을 위한 볼록 헐(convex hull) 알고리즘을 제안한다. 알고리즘은 크게 후보 볼록점 추출과 최종 볼록점 추출의 두 단계로 나된다. 첫 번째 단계에서는 볼록 헐의 볼록점이 될 수 없는 점들을 최대한 간단한 연산을 사용하여 제거함으로써 속도의 향상을 기한다. 두 번째 단계에서는 첫 번째 단계에서 구해진 후보 볼록점을 대상으로 최종 볼록 헐을 구한다. 이 방법은 매우 간단한 연산으로 구성되어 있기 때문에 수행 속도면에서 향상을 가져왔다. 실험 결과, 본 논문의 방법이 기존에 사용되던 두 개의 볼록 헐 알고리즘보다 2배내지 3배의 빠른 수행 속도를 보였다.

  • PDF

Fast landmark matching algorithm using moving guide-line image

  • Seo Seok-Bae;Kang Chi-Ho;Ahn Sang-Il;Choi Hae-Jin
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2004년도 Proceedings of ISRS 2004
    • /
    • 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.

  • PDF

IMPROVING REGIONAL OVERPOWER PROTECTION TRIP SET POINT VIA CHANNEL OPTIMIZATION

  • Kastanya, Doddy
    • Nuclear Engineering and Technology
    • /
    • 제44권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.