• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.179-188
• /
• 2001

We analyze the property of candidate node set in the network graph, and propose an algorithm to decrease shortest path-finding computation time by using multiple dynamic-range queue(MDRQ) structure. This MDRQ structure is newly created for effective management of the candidate node set. The MDRQ algorithm is the shortest path-finding algorithm that varies range and size of queue to be used in managing candidate node set, in considering the properties that distribution of candidate node set is constant and size of candidate node set rapidly change. This algorithm belongs to label-correcting algorithm class. Nevertheless, because re-entering of candidate node can be decreased, the shortest path-finding computation time is noticeably decreased. Through the experiment, the MDRQ algorithm is same or superior to the other label-correcting algorithms in the graph which re-entering of candidate node didn’t frequently happened. Moreover the MDRQ algorithm is superior to the other label-correcting algorithms and is about 20 percent superior to the other label-setting algorithms in the graph which re-entering of candidate node frequently happened.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.468-471
• /
• 2003

The A＊ algorithm is usually used in game programming, mainly because it is fast in finding a optimal path to goal. In this paper. This algorithm was utilized for path finding, HIMM(Histogramic In-Motion Mapping) method is used in map-building. Map is updated continuously with range data sampled by PSD sensors From the map, A＊ algorithm finds a optimal path and sends subsequently the most suitable point to the Eyebot. A＊ algorithm has been tested on the Eyebot in various unknown maps of unknown and proved to work well. It could escape the local minimum, also.

• Proceedings of the KIEE Conference
• /
• 1989.11a
• /
• pp.415-420
• /
• 1989

This thesis deals with range finding using one camera and laser pointer. Range finding will be used further recognition of the image, that is, range image which allows further segmentation of the scene. In the first step, camera modeling is performed by camera calibration which executes least square fit. Least square fit uses the method of sigular value decomposition. And perspective transform of camera is obtained. Lastly range finding is performed by triangulation principle. The result of this algorithm are displayed.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.4E
• /
• pp.128-131
• /
• 2005

A new algorithm for speech signal segmentation is proposed. This algorithm is based on finding successive similar frames belonging to a segment and represents it by an average spectrum. The speech signal is a slowly time varying signal in the sense that, when examined over a sufficiently short period of time (between 10 and 100 ms), its characteristics are fairly stationary. Generally this approach is based on finding these fairly stationary periods. Advantages of the. algorithm are accurate border decision of segments and simple computation. The automatic segmentations using frame averaging show as much as $82.20\%$ coincided with manually verified segmentation of CMU ARCTIC corpus within time range 16 ms. More than $90\%$ segment boundaries are coincided within a range of 32 ms. Also it can be combined with many types of automatic segmentations (HMM based, acoustic cues or feature based etc.).

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.10
• /
• pp.59-70
• /
• 1997

Until now, considerable progress has been made in the application of range finding techanique performing direct 3-D measurement from the object. However, ther are few use of the method in the area of the application of material handing. We present a range finding vision system consisting of static and dynamic range finders to automate a reclaimer used for material handling. A static range finder detects range data of the front part of the piles of material, and a height map is obtained from the proposed image processing algorithm. The height map is used to calculate the optimal job path as features for required information for material handling function. A dynamic range finder attached on the side of the arm of the reclaimer detects the change of the local properties of the material with the handling function, which is used for avoiding collision and detecting the ending point for changing direction. the developed vision systm was applied to a 1/20 simulator and the results of test show that it is appropriate to use for automating the material handling.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.10 no.4
• /
• pp.152-159
• /
• 2007

In this paper, a new design technique on the LRF which is useful for low power laser and a CBDA(Cummulative Binary Detection Algorithm) is proposed. The LD(Laser Diode) and Si-APD(Silicon Avalanche Photo Diode) are used for saving a power. In order to prove the detection range, the Si-APD binary data are accumulated before the range computation and the range finding algorithm. A prototype of the proposed DLRF(Diode Laser Range Finder) system was made and tested. An experimental result shows that the DLRF system have the same detection range using a less power(almost 1/32) than an usual military LRF. The proposed DLRF can be applied to the Unmanned Vehicles, Robot and Future Combat System of a tiny size and a low power LRF.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.38.4-38
• /
• 2002

We propose a fast map-matching algorithm based on the length and the slope for the sequence of lines extracted from a laser range finder and a map. After finding two feature set from laser data and a map, the position and heading of the mobile robot can be determined exactly.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.16 no.5
• /
• pp.613-621
• /
• 2013

This paper presents the direction finding proximity fuze sensor using the clutter rejection method and the adaptive target detection algorithm for anti-air missiles. To remove effects by clutter and detect a target accurately, the clutter rejection method of Legendre sequence with BPSK(Bi phase Shift Keying) modulation has been proposed and the Doppler signal which has cross correlation characteristics is obtained from reflected target signals. Considering the change of the Doppler signal, the adaptive target detection algorithm has been developed and the direction finding algorithm has been fulfilled by comparing received powers from adjacent three receiving antennas. The encounter simulation test apparatus was made to collect and analyze reflected signal and test results showed that the -10 dBsm target was detected over 10 meters and the target with mesh clutter was detected and direction was distinguished definitely.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.8
• /
• pp.156-167
• /
• 1995

In this paper, we propose a 3-D range finding method for situation that stereo camera has small translational motion. Binocular stereo generally tends to produce stereo correspondence errors and needs huge amount of computation. The former drawback is because the additional constraints to regularize the correspondence problem are not always true for every scene. The latter drawback is because they use either correlation or optimization to find correct disparity. We present a method which overcomes these drawbacks by moving the stereo camera actively. The method utilized a motion parallax acquired by monocular motion stereo to restrict the search range of binocular disparity. Using only the uniqueness of disparity makes it possible to find reliable binocular disparity. Experimental results with real scene are presented to demonstrate the effectiveness of this method.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1343-1346
• /
• 1987

This paper proposes a new algorithm for finding the vertex location of triangle and rectangle. The algorithm accumulates the number of occurrences of chain codes which range from 0 to 7 and computes the location of vertices using the accumulated value. Hardware and software system were constructed using IBM-PC/AT and VAX-11/780 for the experiment.