• Proceedings of the KSME Conference
• /
• 2004.04a
• /
• pp.1023-1028
• /
• 2004

A micro-pressure wave is generated by the high-speed train which enters a tunnel, and it causes explosive noise and vibration at the exit. It is known that train speed, train-tunnel area ratio, nose slenderness and nose shape mainly influence on generating micro-pressure wave. So it is required to minimize it by searching optimal values of such train shape factors and tunnel condition. In this study, response surface model, one of approximation models, is used to perform optimization effectively and analyze sensitivity of design variables. Owen's randomized orthogonal array and D-optimal Design are used to construct response surface model. In order to increase accuracy of model, stepwise regression is selected. Finally SQP(Sequential Quadratic Programming) optimization algorithm is used to minimize the maximum micro-pressure wave by using built approximation model.

• The Journal of Korea Robotics Society
• /
• v.16 no.4
• /
• pp.291-298
• /
• 2021

In this study, we present a multi-sensor module for snake robot searching survivors in a narrow space. To this end, we integrated five sensor systems by considering the opinions of the first responders: a gas sensor to detect CO₂ gases from the exhalation of survivors, a CMOS camera to provide the image of survivors, an IR camera to see in the dark & smoky environment, two microphones to detect the voice of survivors, and an IMU to recognize the approximate location and direction of the robot and survivors. Furthermore, we integrated a speaker into the sensor module system to provide a communication channel between the first responders and survivors. To integrated all these mechatronics systems in a small, compact snake head, we optimized the positions of the sensors and designed a stacked structure for the whole system. We also developed a user-friendly GUI to show the information from the proposed sensor systems visually. Experimental results verified the searching function of the proposed sensor module system.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2843-2845
• /
• 2000

A lane detection based on a road model or feature all need correct acquirement of information on the lane in a image, It is inefficient to implement a lane detection algorithm through the full range of a image when being applied to a real road in real time because of the calculating time. This paper defines two searching range of detecting lane in a road, First is searching mode that is searching the lane without any prior information of a road, Second is recognition mode, which is able to reduce the size and change the position of a searching range by predicting the position of a lane through the acquired information in a previous frame. It is allow to extract accurately and efficiently the edge candidates points of a lane as not conducting an unnecessary searching. By means of removing the perspective effect of the edge candidate points which are acquired by using the inverse perspective transformation, we transform the edge candidate information in the Image Coordinate System(ICS) into the plane-view image in the World Coordinate System(WCS). We define linear approximation filter and remove the fault edge candidate points by using it This paper aims to approximate more correctly the lane of an actual road by applying the least-mean square method with the fault-removed edge information for curve fitting.

• Journal of Korea Multimedia Society
• /
• v.18 no.11
• /
• pp.1289-1301
• /
• 2015

Pedestrian detection (PD) is an essential task in various applications and sliding window-based methods utilizing HOG (Histogram of Oriented Gradients) or HOG-like descriptors have been shown to be very effective for accurate PD. However, due to exhaustive search across images, PD methods based on sliding window usually require heavy computational time. In this paper, we propose a real-time PD method for embedded visual surveillance with fixed backgrounds. The proposed PD method employs HOG descriptors as many PD methods does, but utilizes selective search so that it can save processing time significantly. The proposed selective search is guided by restricting searching to candidate regions extracted from Adaptive Gaussian Mixture Model (AGMM)-based background subtraction technique. Moreover, approximate computation of HOG descriptor and implementation in fixed-point arithmetic mode contributes to reduction of processing time further. Possible accuracy degradation due to approximate computation is compensated by applying an appropriate one among three offline trained SVM classifiers according to sizes of candidate regions. The experimental results show that the proposed PD method significantly improves processing speed without noticeable accuracy degradation compared to the original HOG-based PD and HOG with cascade SVM so that it is a suitable real-time PD implementation for embedded surveillance systems.

• Journal of Korea Multimedia Society
• /
• v.6 no.3
• /
• pp.462-468
• /
• 2003

In a speech coding system using excitation source of voiced and unvoiced, it would be involved a distortion of speech quality in case coexist with a voiced and an unvoiced consonants in a frame. So, I propose TSIUVC(Transition Segment Including Unvoiced Consonant) searching and extraction method in order to uncoexistent with a voiced and unvoiced consonants in a frame. This paper present a new method of TSIUVC approximate-synthesis by using Least Mean Square and frequency band division. As a result, this method obtain a high quality approximation-synthesis waveforms within TSIUVC by using frequency information of 0.547KHz below and 2.813KHz above. The important thing is that the maximum error signal can be made with low distortion approximation-synthesis waveform within TSIUVC. This method has the capability of being applied to a new speech coding of Voiced/Silence/TSIUVC, speech analysis and speech synthesis.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.9
• /
• pp.833-839
• /
• 2004

This paper proposes a method that minimizes the consumed energy by searching the optimal locations of the mass centers of links composing of a biped robot using Real-Coded Genetic Algorithm. Generally, in order to utilize optimization algorithms, the system model and design variables must be defined. Firstly, the proposed model is a 6-DOF biped robot composed of seven links, since many of the essential characteristics of the human walking motion can be captured with a seven-link planar biped walking in the saggital plane. Next, Fourth order polynomials are used for basis functions to approximate the walking gait. The coefficients of the fourth order polynomials are defined as design variables. In order to use the method generating the optimal gait trajectory by searching the locations of mass centers of links, three variables are added to the total number of design variables. Real-Coded GA is used for optimization algorithm by reason of many advantages. Simulations and the comparison of three methods to generate gait trajectories including the GCIPM were performed. They show that the proposed method can decrease the consumed energy remarkably and be applied during the design phase of a robot actually.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.455-462
• /
• 2006

Recently, the filtering approach using vector approximation such as VA-file[1] or LPC-file[2] have been proposed to support similarity search in high dimensional data space. This approach filters out many irrelevant vectors by calculating the approximate distance from a query vector using the compact approximations of vectors in database. Accordingly, the total elapsed time for similarity search is reduced because the disk I/O time is eliminated by reading the compact approximations instead of original vectors. However, the search time of the VA-file or LPC-file is not much lessened compared to the brute-force search because it requires a lot of computations for calculating the approximate distance. This paper proposes a new bitmap index structure in order to minimize the calculating time. To improve the calculating speed, a specific value of an object is saved in a bit pattern that shows a spatial position of the feature vector on a data space, and the calculation for a distance between objects is performed by the XOR bit calculation that is much faster than the real vector calculation. According to the experiment, the method that this paper suggests has shortened the total searching time to the extent of about one fourth of the sequential searching time, and to the utmost two times of the existing methods by shortening the great deal of calculating time, although this method has a longer data reading time compared to the existing vector approximation based approach. Consequently, it can be confirmed that we can improve even more the searching performance by shortening the calculating time for filtering of the existing vector approximation methods when the database speed is fast enough.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.763-767
• /
• 2008

In a speech coding system using excitation source of voiced and unvoiced, it would be involved a distortion of speech qualify in case coexist with a voiced and an unvoiced consonants in a frame. So, We proposed TS(Transition Segment) including unvoiced consonant searching and extraction method in order to uncoexistent with a voiced and unvoiced consonants in a frame. This research present a new method of TS approximate-synthesis by using Least Mean Square and frequency band division. As a result, this method obtain a high quality approximation-synthesis waveforms within TS by using frequency information of 0.547kHz below and 2.813kHz above. The important thing is that the maximum error signal can be made with low distortion approximation-synthesis waveform within TS. This method has the capability of being applied to a new speech coding of Voiced/Silence/TS, speech analysis and speech synthesis.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.2
• /
• pp.413-418
• /
• 2009

In a speech coding system using excitation source of voiced and unvoiced, it would be involved a distortion of speech qualify in case coexist with a voiced and an unvoiced consonants in a frame. So, We proposed TS(Transition Segment) including unvoiced consonant searching and extraction method in order to uncoexistent with a voiced and unvoiced consonants in a frame. This research present a new method of TS approximate-synthesis by using Least Mean Square and frequency band division. As a result, this method obtain a high qualify approximation-synthesis waveforms within TS by using frequency information of 0.547kHz below and 2.813kHz above. The important thing is that the maximum error signal can be made with low distortion approximation-synthesis waveform within TS. This method has the capability of being applied to a new speech coding of Voiced/Silence/TS, speech analysis and speech synthesis.

• Journal of Digital Contents Society
• /
• v.18 no.4
• /
• pp.739-745
• /
• 2017

This paper presents and discusses an implementation of the GPU shifted sorting method to find approximate k nearest neighbors which executes within "warp", the minimum execution unit in GPU parallel architecture. Also, this paper presents the comparison results with other two common nearest neighbor searching methods, GPU-based kd-tree and ANN (Approximate Nearest Neighbor) library. The proposed implementation focuses on the cases when k is small, i.e. 2, 4, 8, and 16, which are handled efficiently within warp to consider it is very common for applications to handle small k's. Also, this paper discusses optimization ways to implementation by improving memory management in a loop for the CUB open library and adopting CUDA commands which are supported by GPU hardware. The proposed implementation shows more than 16-fold speed-up against GPU-based other methods in the tests, implying that the improvement would become higher for more larger input data.