• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.109-113
• /
• 2007

The COMS provides the LRIT/HRIT services to users. The COMS LRIT/HRIT broadcast service should satisfy the 15 minutes timeliness requirement. The requirement is important and critical enough to impact overall performance of the LHGS. HRIT image data is acquired from INRSM output receiving but LRIT image data is generated by sub-sampling HRIT image data in the LHGS. Specially, since LRIT is acquired from sub-sampled HRIT image data, LRIT processing spent more time. Besides, some of data loss for LRIT occurs since LRIT is compressed by lossy JPEG. Therefore, algorithm with the fastest processing speed and simplicity to be implemented should be selected to satisfy the requirement. Investigated sub-sampling algorithm for the LHGS were nearest neighbour algorithm, bilinear algorithm and bicubic algorithm. Nearest neighbour algorithm is selected for COMS LHGS considering the speed, simplicity and anti-aliasing corresponding to the guideline of user (KMA: Korea Meteorological Administration) to maintain the most cloud itself information in a view of meteorology. But the nearest neighbour algorithm is known as the worst performance. Therefore, it is studied in this paper that the selection of nearest neighbour algorithm for the LHGS is reasonable. First of all, characteristic of 3 sub-sampling algorithms is studied and compared. Then, several sub-sampling algorithm were applied to MTSAT-1R image data corresponding to COMS HRIT. Also, resized image was acquired from sub-sampled image with the identical sub-sampling algorithms applied to sub-sampling from HRIT to LRIT. And the difference between original image and resized image is compared. Besides, PSNR and MSE are calculated for each algorithm. This paper shows that it is appropriate to select nearest neighbour algorithm for COMS LHGS since sub-sampled image by nearest neighbour algorithm is little difference with that of other algorithms in quality performance from PSNR.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.237-245
• /
• 2001

Automated essay grading has been proposed for over thirty years. Only recently have practical implementations been constructed and tested. This paper investigated the role of the nearest-neighbour algorithm within the information retrieval as a way of grading the essay automatically called Automated Essay Grading System. It intended to offer teachers an individualized assistance in grading the student\`s essay. The system involved several processes, which are the indexing, the structuring of the model answer and the grade processing. The indexing process comprised the document indexing and query processing which are mainly used for representing the documents and the query. Structuring the model answer is actually preparing the marking scheme and the grade processing is the process of assessing the essay. To test the effectiveness of the developed algorithms, the algorithms are tested against the History text in Malay. The result showed that th information retrieval and the nearest-neighbour algorithm are practical combination that offer acceptable performance for grading the essay.

• Proceedings of the KIEE Conference
• /
• 2001.11a
• /
• pp.290-291
• /
• 2001

흡착입자간의 상호작용이 존재하는 경우 특히 최근접상호작용(nearest neighbour interaction)만이 고려된 경우의 흡착등온식(adsorption isotherm)을 구한다. 분배함수의 계산에는 Kramers와 Wannier에 의한 행열식 방법이 유용하게 사용된다.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.3
• /
• pp.37-43
• /
• 2014

In this paper, we propose a robust lip detection algorithm using color clustering. At first, we adopt AdaBoost algorithm to extract facial region and convert facial region into Lab color space. Because a and b components in Lab color space are known as that they could well express lip color and its complementary color, we use a and b component as the features for color clustering. The nearest neighbour clustering algorithm is applied to separate the skin region from the facial region and K-Means color clustering is applied to extract lip-candidate region. Then geometric characteristics are used to extract final lip region. The proposed algorithm can detect lip region robustly which has been shown by experimental results.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.682-685
• /
• 2004

This paper investigated a method for classifying emotional states by using pulse wave signal. It focused on finding effective features for emotional state classification. The emptional states considered here consisted of interest and neutral. Classification experiments utilized 65 and 60 samples of interest and neutral states respectively. We have investigated 19 features derived from pulse wave signals by using both time domain and frequency domain analysis methods with 2 classifiers of minimum distance (normalized Euclidean distanece) and ${\kappa}$-Nearest Neighbour. The Leave-one-out cross validation was used as an evaluation mehtod. Based on experimental results, the most efficient features were a combination of 4 features consisting of (i) the mean of the first differences of the smoothed pulse rate time series signal, (ii) the mean of absolute values of the second differences of thel normalized interbeat intervals, (iii) the root mean square successive difference, and (iv) the power in high frequency range in normalized unit, which provided 80.8% average accuracy with ${\kappa}$-Nearest Neighbour classifier.

• Korean System Dynamics Review
• /
• v.5 no.2
• /
• pp.175-197
• /
• 2004

The research studies the classic beer game simulation model from a new perspective. It does so by providing each agent with two ordering policies, and creating a set of rules that allow an agent to change its policy. Such a change is triggered based on an agent's confidence in their own performance, and on the relative confidence of their nearest neighbour. The overall effect is that policy diffusion can occur, where, under certain circumstances, an agent will mimic the behaviour of its neighbour, if it believes that its neighbour is performing better. The motivation behind this research is to provide an experimental base upon which the decision making strategies of business agent can be studied.

• Korean Journal of Ecology and Environment
• /
• v.36 no.1 s.102
• /
• pp.9-20
• /
• 2003

Response-species of zooplankton on precipitation and temperature were investigat-ed in the tributaries of Han River from May to November, 2002. Total 42 species(Rotifer twenty three species, Cladocera ten species, Copepoda eight species and Protozoa one species) were collected in the target location. The highest abundance and the number of species were observed in May. Due to the summer precipitation the abundance of Rotifer and Cladocera were largely decreased in August. Dominant species of Rotifer appeared Brachionus urceolaris, Euclanis dilatata, Lecane Inua, Brachionus quadridentatus and Brachionus calyciflorus in May, Monostyla bulla and Conochilus unicornis in August and Brachionus quadridentatus, Euclanis dilatata and Lecane Iuna in November. Also, the dominant species of Cladocera were Moina weismanni, Simocephalus vetulus, Scapholebris aucrgnafa, Chydorus sphaericus in May, Chydorus sphaericus, Scapholebris mucronata in August, Chydorus sphaericus and Alona rectangular in November. Nearest neighbour clustering was implemented for classification of zooplankton abundance indifferent month of survey locations. The patterning of May and November appeared similar but August was different.

• ETRI Journal
• /
• v.42 no.1
• /
• pp.78-89
• /
• 2020

Human activity recognition (HAR) has become effective as a computer vision tool for video surveillance systems. In this paper, a novel biometric system that can detect human activities in 3D space is proposed. In order to implement HAR, joint angles obtained using an RGB-depth sensor are used as features. Because HAR is operated in the time domain, angle information is stored using the sliding kernel method. Haar-wavelet transform (HWT) is applied to preserve the information of the features before reducing the data dimension. Dimension reduction using an averaging algorithm is also applied to decrease the computational cost, which provides faster performance while maintaining high accuracy. Before the classification, a proposed thresholding method with inverse HWT is conducted to extract the final feature set. Finally, the K-nearest neighbor (k-NN) algorithm is used to recognize the activity with respect to the given data. The method compares favorably with the results using other machine learning algorithms.

• Journal of the Korean Magnetics Society
• /
• v.5 no.5
• /
• pp.543-547
• /
• 1995

A set of $Fe_{1-x}Ni_{x}$ (x=0.10, 0.25, 0.30, 0.35, 0.50, 0.60, 0.75, 0.85) fine particles prepared by the gas evaporation technique was studied by $M\"{o}ssbauer$, XRD and other techniques. The XRD and $M\"{o}ssbauer$ patterns of the sample with x=0.10 ($Fe_{90}Ni_{10}$) were found to be exceptionally different, showing an austenite phase stability when the particles are quenched. This phase stability is quite different from that of the corresponding bulk alloy. Using binomial distrbution fits of the $M\"{o}ssbauer$ spectra of the particles in terms of nearest and next nearest neighbour configurations around the Fe atoms, an analysis of this phase stability is given. The changes in the relative intensities of the resulting magnetic sextets are used to determine the increase in martensite following the austenite-martensite transformation process. The stable austenite can, therefore, be determined. This stability may be related to the oxide surface layer and the small number of atoms of these fine particles.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.768-772
• /
• 2005

TSP(Traveling Salesman Problem) has been a nagging NP-complete problem to test almost every algorithmic idea in combinatorial optimization in vain. The main bottleneck is how to get the integer results {0,1} and to avoid sub-tours. We suggest simple and practical method in two steps. Firstly for every node, an initial Hamiltonian cycle us produced on the nearest neighbour concept. The node with nearest distance is to be inserted to form a increased feasible cycle. Secondly we improve the initial solution by exchanging 2 cuts of the grand tours. We got practical results within 1 from the optimum in 30 minutes for up to 200 nodes problems. TSP of real world type might be tackled practically in our formulation.