• 한국가시화정보학회:학술대회논문집
• /
• 2007.11a
• /
• pp.55-58
• /
• 2007

To improve the conventional optical chromatography, the continuous particle separator, the cross-type optical chromatography, is fabricated using micro-channel and fiber optics. A laser beam irradiates into the liquid solution containing particles in the perpendicular to the liquid flow direction. The different sized polystyrene latex micro-spheres, $2.0\;{\mu}m\;{\pm}\;0.02\;{\mu}m$, $5.0\;{\mu}m\;{\pm}\;0.05\;{\mu}m$, and $10.0\;{\mu}m\;{\pm}\;0.09\;{\mu}m$ diameter, are separated in cross-type optical chromatography. The separated particles are delivered to down stream in the micro-channel maintaining the retention distance continuously. The measured retention distances for different sized particles well agree with theoretical predictions.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.10
• /
• pp.747-754
• /
• 1991

In this paper, we studies the on-line recognition of handwritten character using WLD(weighted levenshtein distance) algorithm with parallelism. The Hangeul can be separated for unit of phonemes and the alphanumeric can be separated for unit of characters. And, we studies the parallelism and the concurrency of the WLD algorithm for realization of special-purpose processor. By the simulation result for 10, 000 characters in practical sentences, the recognition rate of strokes in obtained 96.57$\%$ and the separation rate for phonemes and characteristics is obtained 95.4$\%$.

• Journal of information and communication convergence engineering
• /
• v.2 no.3
• /
• pp.161-166
• /
• 2004

Electronic Ink is a stored data in the form of the handwritten text or the script without converting it into ASCII by handwritten recognition on the pen-based computers and Personal Digital Assistants(PDA) for supporting natural and convenient data input. One of the most important issue is to search the electronic ink in order to use it. We proposed and implemented a script matching algorithm for the electronic ink. Proposed matching algorithm separated the input stroke into a set of primitive stroke using the curvature of the stroke curve. After determining the type of separated strokes, it produced a stroke feature vector. And then it calculated the distance between the stroke feature vector of input strokes and one of strokes in the database using the dynamic programming technique.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.7
• /
• pp.1294-1303
• /
• 2009

This paper presents a new numerical algorithm for fault discrimination and fault location estimation when occur to arcing ground and arcing line to line on transmission lines. The object of this paper is developed from new numerical algorithm to calculate the fault distance and simultaneously to make a distinction between transient and permanent faults. so the first of object for propose algorithm would be distinguish the permanent from the transient faults. This arcing fault discrimination algorithm is used if calculated value of arc voltage amplitude is greater than product of arc voltage gradient and the length of the arc path, which is equal or greater than the flashover length of a suspension insulator string[1-3]. Also, each algorithm is separated from short distance and long distance. This is difference to with/without capacitance between short to long distance. To test the validity of the proposed algorithms, the results of algorithm testing through various computer simulations are given. The test was simulated in EMTP/ATP simulator under a number of scenarios and calculate of algorithm was used to MATLAB.

• The KIPS Transactions:PartB
• /
• v.9B no.1
• /
• pp.129-138
• /
• 2002

In this paper, a distance measuring algorithm for motion capture using color stereo camera is proposed. The color markers attached on articulations of an actor are captured by stereo color video cameras, and color region which has the same color of the marker's color in the captured images is separated from the other colors by finding dominant wavelength of colors. Color data in RGB (red, green, blue) color space is converted into CIE (Commission Internationale del'Eclairage) color space for the purpose of calculating wavelength. The dominant wavelength is selected from histogram of the neighbor wavelengths. The motion of the character in the cyber space is controlled by a program using the distance information of the moving markers.

• Korean Journal of Optics and Photonics
• /
• v.18 no.2
• /
• pp.117-121
• /
• 2007

A fundamental problem in the in-line digital holography microscope is that the real image and virtual image and zero-order image are not separated spatially. In this paper, we have eliminated the zero-order noise by an averaging method and the twin image is divided using a geometrical set-up in an in-line digital holographic microscope. The size of the virtual image depends on the distance between the objective lens and the hologram plane and on the distance between the hologram plane and the image plane. We found that the virtual image size is smallest when the distance between the objective lens and the hologram plane is equal to the back focal length of the objective lens. We could divide the virtual image and real image by controlling the distance between the hologram plane and the objective lens.

• Journal of electromagnetic engineering and science
• /
• v.19 no.1
• /
• pp.37-41
• /
• 2019

A stack-ring configuration is proposed for designing a dual-band circularly polarized (CP) antenna. Each ring generates different resonant frequencies. A good CP performance at both resonant frequencies is achieved by adjusting the relative distance between the two rings. The two operating bands are separated with a small frequency ratio of 1.07. Measured results show that radiation patterns with good CP characteristics are obtained at the two resonant frequencies.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.10
• /
• pp.956-961
• /
• 2007

We propose a new distance measurement method and local positioning system for the autonomous mobile robots localization. The distance measurement method is able to measure long-range distances with a high accuracy by using ultrasonic sensors. The time of flight of the ultrasonic waves include various noises is calculated accurately by the proposed period detecting method. The proposed local positioning system is composed of four ultrasonic transmitters and one ultrasonic receiver. The ultrasonic transmitter and receiver are separated but they are synchronized by RF (Radio frequency) signal. The proposed system using ultrasonic waves is represented as USAT(Ultrasonic Satellite System). USAT is able to estimate the position using the least square estimation. The experimental results show that the proposed local positioning system enables to estimate the absolute position precisely.

• Journal of IKEEE
• /
• v.13 no.2
• /
• pp.220-223
• /
• 2009

A simple measurement system is built to estimate the dual-antenna diversity gain at 2.4GHz easily in open lab environment. To obtain multipath fading propagation channel, the system consists of two transmission horn that placed on opposite direction and a rotating stage mechanically changing the position of test dual-antenna with time over distance greater than one wavelength. Estimated diversity is nearly same as theoretical value such that measured diversity gain of 30mm separated is about 6dB similar to theoretical value of 5.7dB and increases monotonically with the increasing separation distance as predicted by the theory. Proposed measurement system that is simple enough to fit in a small space can evaluate the performance of various dual-antennas with a reasonable accuracy with lower 5% difference between the ten sets of measured waveform distribution and theoretical Rayleigh cumulative distribution.

• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.564-573
• /
• 2009

In this paper, we consider a wireless multiple path network in which a transmitting node would like to send a message to the receiving node with a certain probability of success. These two nodes are separated by N erasure paths, and we devise two algorithms to determine minimum redundancy and optimal symbol allocation for this setup. We discuss the case with N = 3 and then extend the case to an arbitrary number of paths. One of the algorithms minimum redundancy algorithm in exponential time is shown to be optimal in several cases, but has exponential running time. The other algorithm, minimum redundancy algorithm in polynomial time, is sub-optimal but has polynomial worstcase running time. These algorithms are based off the theory of maximum-distance separable codes. We apply the MRAET algorithm on maximum-distance separable, Luby transform, and Raptor codes and compare their performance.