• Proceedings of the Optical Society of Korea Conference
• /
• 1991.06a
• /
• pp.181-184
• /
• 1991

본 논문에서는 off-axis 평면 기준파의 각분할(angular multiflexing) 방식과 pseudo-inverse 알고리듬에 의한 SDF 필터를 결합하여 상관기를 구성하고 상관면에서의 상관반응을 관측하여, off-axis SDF 필터가 유형분류에 유용함을 입증하고, 광상관기로의 적용가능성을 보여주고자 한다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.7
• /
• pp.106-111
• /
• 1989

A new EMG signal processing algorithm for SMUAP pattern classification is proposed. It checks the combination and regularity of ISI using a spike counter as a decision making routine, and performs SMUAP waveform alignment in frequency domain and selects spikes through FIR filtering. As a result, with the EMG signals recorded during 5 seconds at 10-50% MVC force level, the SMUAP ranged from five to nine units were classified and identification rate is greater than 55 percent using a concentric needle electrode. In the IBM PC/AT the processing time typically required 2 minutes.

• Journal of Internet Computing and Services
• /
• v.9 no.1
• /
• pp.171-177
• /
• 2008

In this paper we compared the performance of interpolation algorithms for Bayer patterned image sensors under the various illumination intensities. As the interpolation algorithms, we used bilinear color interpolation and adaptive fuzzy color interpolation and our experimentation shows that performance of interpolation algorithms depend on the lighting conditions; in low intensity of illumination, bilinear color interpolation with median filter performs best, in high intensity of illumination, adaptive fuzzy color interpolation performs best, and in between bilinear color interpolation performs best. This study suggested an interpolation scheme which applies different interpolation algorithm according to the intensity of the input image, resuting in the better image quality.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.5
• /
• pp.137-144
• /
• 1989

A new algorithm is presented which efficiently reports minimum width/space violation in a geometric mask pattern. The proposed algorithm solves a sequence of range search problems by employing a plane sweep method. The algorithm runs in O(n log n) time, where n is the number of edges in a mask pattern. Since a lower bound in time conplexity for reporting all minimum width/space violations is ${\Omega}$ (n log n), this algorithm is theoretically optimal within a constant multiplicaive factor. It requires O($n^{0.5}$) space which is very efficient in practice. Moreover, this algorithm, we believe, is easy to implement and practically fast (116.7 seconds for a rectilinear region with 250000 vertices ar VAX 8650.)

• Korean Journal of Optics and Photonics
• /
• v.2 no.2
• /
• pp.83-88
• /
• 1991

Studies on space-invariant pattern recognition have been carried out from various approaches. Pattern recognition system using SDF filter, from weighted linear summation of tranining images, has been the focus of research since its first appearence. In this thesis, off-axis pSDF spatial matched filter has been constructed by combining angular multiplexing of off-axis reference plane wave with pSDF filter made from pseudo-inverse algorithm, and transformed to phase only filter. From observation of the correlation responses in the correlation plane, it is shown that proposed off-axis pSDF spatial matched filter is available to pattern classification and can be used for optical correlator.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.32 no.10
• /
• pp.38-45
• /
• 2004

In this paper, a parallel visualization algorithm is proposed for efficient visualization of the massive data generated from large-scale parallel finite element analysis through investigating the characteristics of parallel rendering methods. The proposed parallel visualization algorithm is designed to be highly compatible with the characteristics of domain-wise computation in parallel finite element analysis by using the sort-last-sparse approach. In the proposed algorithm, the binary tree communication pattern is utilized to reduce the network communication time in image composition routine. Several benchmarking tests are carried out by using the developed in-house software, and the performance of the proposed algorithm is investigated.

• Journal of Navigation and Port Research
• /
• v.28 no.3
• /
• pp.233-238
• /
• 2004

Comer point is a very important information to a pattern recognition of image processing. And so, many researchers develope various detecting comer point algoritms. But, there are some problems to get comer points by 8 directional chain code when the degree of edge line is not integer multiplication of 45 degree. So, we propose a new algorithm which is combined with morphology and human visual conception for optimal comer points without the above defects. We get a good simulation result by this proposed algorithm Ana so, we think this algorithm is very useful to FA(factory automation} and ship's radar system to know some coastal area from its image.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.797-799
• /
• 2016

It is difficult for user to use arcade shooting games because patten of the missiles patterns are not dynamic. And users are hard to access to high level because spped of missiles is very fast. In this paper, we propose rhythm based shooting game. The game give us pleasant environment and use can play the game easily.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2C
• /
• pp.31-40
• /
• 2005

we propose an enhanced self-generation supervised algorithm that by combining an ART algorithm and the delta-bar-delta method. Form the input layer to the hidden layer, ART-1 and ART-2 are used to produce nodes, respectively. A winner-take-all method is adopted to the connection weight adaption so that a stored pattern for some pattern is updated. we test the recognition of student identification, a certificate of residence, and an identifier from container that require nodes of hidden layers in neural network. In simulation results, the proposed self-generation supervised learning algorithm reduces the possibility of local minima and improves learning speed and paralysis than conventional neural networks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.275-278
• /
• 2007

In this paper, we proposed a automatic extraction method as a preprocessing stage for extraction of basic insect footprint segments. In general, sizes and strides of footprints may be different according to type and size of an insect for recognition. Therefore we proposed an improved algorithm for extraction of basic insect footprint segments regardless of size and stride of footprint pattern. In the proposed algorithm, threshold value for clustering is determined automatically using contour shape of the graph created by accumulating distances between all the spots of footprint pattern. In the experimental results applying the proposed method, The basic footprint segments should be extracted from a whole insect footprint image using significant information in order to find out appropriate features for classification.