• The Journal of the Korea Contents Association
• /
• v.8 no.9
• /
• pp.1-9
• /
• 2008

In this paper, we proposed automatic face detection and tracking which is robustness in rotation. To detect a face image in complicated background and various illuminating conditions, we used face skin color detection. we used Harris corner detector for extract facial feature points. After that, we need to track these feature points. In traditional method, Lucas-Kanade feature tracker doesn't delete useless feature points by occlusion in current scene (face rotation or out of camera). So we proposed the estimation function, which delete useless feature points. The method of delete useless feature points is estimation value at each pyramidal level. When the face was occlusion, we deleted these feature points. This can be robustness to face rotation and out of camera. In experimental results, we assess that using estimation function is better than traditional feature tracker.

• Venture DIGEST
• /
• s.56
• /
• pp.12-17
• /
• 2004

누구나 한번쯤은 연을 실에 매달고 맞바람을 맞으며 뛰어다닌 경험이 있을 것이다. 연을 날릴 때 가장 중요한 포인트는 연과 나를 연결해주는 실을 팽팽하게 유지하는 데 있다. 줄이 너무 느슨하면 연은 바람을 받지 못한다. 비단 처음 날릴 때뿐 아니라 하늘에 올랐을 때도 가끔씩 줄을 잡아당기며 긴장을 유지해줘야 한다. 다시 말해 연을 귀찮게 해야 떨어지지 않고 오랫동안 하늘에 머물게 할 수 있다는 뜻이다. 이 긴장이 바로‘스트레스’다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.211-220
• /
• 2013

This paper proposes an algorithm that easily finds an optimal solution for linear bottleneck assignment problems. It is either threshold or augmenting path algorithm that is generally used to solve the bottleneck assignment problem. This paper proposes a reverse-delete algorithm that follows 2 steps. Firstly, the algorithm deletes the maximum cost in a given matrix until it renders a single row or column. Next, the algorithm improves any solution that contains a cost exceeding the threshold value $c^*_{ij}$. Upon its application to 28 balanced assignment problems and 7 unbalanced problems, the algorithm is found to be both successful and simple.

• ALGAE
• /
• v.21 no.1
• /
• pp.133-139
• /
• 2006

Outdoor cultivation of cyanobacterium Spirulina platensis was carried out for 40 days in a batch mode. A half concentration of the SOT based on the underground water was used as culture medium. Working volume was 5.7 tons with 0.2 m depth. During cultivation, mean water temperature, DO and light intensity were all in proper conditions for the S. platensis growth. The adjustment of pH to over 10 with Na2CO3 and addition of the 1.5% natural salt were very effective to delete contaminant organisms, Chlamydomonas moewusii and Chlorella minutissima occurred one after the other in the culture. The mean productivity of the biomass based on the dry cell weight from 14 to 25 days, after the contaminants were deleted, was 7.8 g ·m–2· d–1, which was relatively high productivity in that a half concentration of the SOT was used for the culture. Underground water used in the culture minimized contaminants invasion and addition of the 1.5% natural salt was effective to delete contaminants as well as acted as mineral supplement in outdoor cultivation of S. platensis. Harvesting using the floating activity of S. platensis was effective from mass floating in day time after overnight without agitation and illumination.

• Journal of Korea Society of Industrial Information Systems
• /
• v.6 no.2
• /
• pp.7-15
• /
• 2001

In this paper, we suggest the algorithm that inserts or deletes documents into web sites without creating tag. This algorithm uses tag which links between documents to automatically inset or delete the web documents. This study extracts the texts in the ... tag of the document to put into the structure as a type of graph creating the link as a node m of sub-node. That is, in this case of configurating new link between web documents, this algorithm allows to insert or delete the node to or from the graph without creating the tag. In the case of deleting the document, it removes the broken link connecting the sub-nodes of deleted node newly to its parent node.

• Nuclear Engineering and Technology
• /
• v.53 no.4
• /
• pp.1146-1156
• /
• 2021

Single-unit probabilistic safety assessment (SUPSA) has complex Boolean logic equations for accident sequences. Multi-unit probabilistic safety assessment (MUPSA) model is developed by revising and combining SUPSA models in order to reflect plant state combinations (PSCs). These PSCs represent combinations of core damage and non-core damage states of nuclear power plants (NPPs). Since all these Boolean logic equations have complemented gates (not gates), it is not easy to generate exact Boolean solutions. Delete-term approximation method (DTAM) has been widely applied for generating approximate minimal cut sets (MCSs) from the complex Boolean logic equations with complemented gates. By applying DTAM, approximate conditional core damage probability (CCDP) has been calculated in SUPSA and MUPSA. It was found that CCDP calculated by DTAM was overestimated when complemented gates have non-rare events. Especially, the CCDP overestimation drastically increases if seismic SUPSA or MUPSA has complemented gates with many non-rare events. The objective of this study is to suggest a new quantification method named probability subtraction method (PSM) that replaces DTAM. The PSM calculates accurate CCDP even when SUPSA or MUPSA has complemented gates with many non-rare events. In this paper, the PSM is explained, and the accuracy of the PSM is validated by its applications to a few MUPSAs.

• Nuclear Engineering and Technology
• /
• v.54 no.8
• /
• pp.2933-2940
• /
• 2022

Approximations such as the delete-term approximation, rare event approximation, and minimal cutset upper bound (MCUB) need to be prudently applied for the quantification of a seismic probabilistic safety assessment (PSA) model. Important characteristics of seismic PSA models indicate that preserving the success branches in a primary seismic event tree is necessary. Based on the authors' experience in modeling and quantifying plant-level seismic PSA models, the effects of applying negate-down to the success branches in primary seismic event trees on the quantification results are summarized along with the following three insights gained: (1) there are two competing effects on the MCUB-based quantification results: one tending to increase and the other tending to decrease; (2) the binary decision diagram does not always provide exact quantification results; and (3) it is identified when the exact results will be obtained, and which combination provides more conservative results compared to the others. Complicated interactions occur in Boolean variable manipulation, approximation, and the quantification of a seismic PSA model. The insights presented herein can assist PSA analysts to better understand the important theoretical principles associated with the quantification of seismic PSA models.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.455-461
• /
• 2009

프로그래밍 코드에서 쿼리문(INSERT, UPDATE,DELETE)을 작성할 때 주로 문자열을 조합해서 쿼리문을 작성하게 되는데, 이 방법은 일정한 체계가 없고, 또 테이블의 컬럼들이 많아지게 되면 코드 작성과 관리가 굉장히 불편한 직업들이 된다. Dynamic Query Class는 이러한 작업들을 효율적이고 생상성 있게 하기 위한 쿼리문 작성 클래스이다. 이 문서는 이 클래스들의 활용과 정의에 대해서 다룬다.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.3
• /
• pp.579-590
• /
• 2003

When we analyze incomplete data, i.e., data with missing values, we need treatment for the missing values. A common way to deal with this problem is to delete the cases with missing values. Various other methods have been developed. Among them are EM algorithm and regression algorithm which can estimate missing values and impute the missing elements with the estimated values. In this paper, we introduce multiple imputation software SOLAS which generates multiple data sets and imputes with them.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.5
• /
• pp.671-682
• /
• 1995

In this paper, we propose a multimedia query language MQL which defines and manipulates multimedia data as integration of monomedia data in time and space. The MQL is designed for a multimedia data model, called the object-relationship model, and based on the multimedia object calculus which formally describes operations on multimedia data. The SQL- like syntax for class definition and object manipulation, such as retrieval, insert, update, and delete, is defined. We show how the MQL can represent the user queries using composite temporal-spatial class structures and various relationships, such as equivalence and sequence.