• 제어로봇시스템학회논문지
• /
• 제22권12호
• /
• pp.1046-1052
• /
• 2016

For the safe driving of autonomous vehicles, accurate position estimation is required. Generally, position error must be less than 1m because of lane keeping. However, GPS positioning error is more than 1m. Therefore, we must correct this error and a map matching algorithm is generally used. Especially, road marking intensity map have been used in many studies. In previous work, 3D LIDAR with many vertical layers was used to generate a local intensity map. Because it can be obtained sufficient longitudinal information for map matching. However, it is expensive and sufficient road marking information cannot be obtained in rush hour situations. In this paper, we propose a localization algorithm using an accumulated intensity local map. An accumulated intensity local map can be generated with sufficient longitudinal information using 3D LIDAR with a few vertical layers. Using this algorithm, we can also obtain sufficient intensity information in rush hour situations. Thus, it is possible to increase the reliability of the map matching and get accurate position estimation result. In the experimental result, the lateral RMS position error is about 0.12m and the longitudinal RMS error is about 0.19m.

• 정보처리학회논문지B
• /
• 제9B권2호
• /
• pp.245-254
• /
• 2002

머신비전을 이용한 IC 패키지 마킹검사 시스템은 입력영상으로부터 검사할 요소들의 위치를 식별하고, 추출된 요소들을 학습된 표준 패턴과 비교하여 마킹의 불량 여부를 판단한다. 본 논문에서는 검사 대상 IC 패키지의 위치 판별, 마킹문자 추출, 핀원딤플 검출과 같은 일련의 작업들에 적합한 적응적 다단계 이진화 방법과 마킹문자의 국소적인 오류검출은 물론 잡영에 강건한 정합단위의 동적 선택 방법을 제안한다. 제안하는 이진화 방법은 이진화 대상 영역과 명도 값의 범위를 제한하여 Otsu의 이진화 알고리즘을 적용함으로써 특정 응용에 적응적인 이진화가 가능하다. 정합단위의 동적 선택 방법은 문자추출 및 배치분석에 대한 결과에 따라 정합단위를 선택한다. 그러므로 문자추출 및 배치분석 과정에서 발생하는 예기치 못한 부적절한 상황에서도 가능한 범위내에서 최소의 정합단위를 선택할 수 있다. 제안된 방법을 구현하여 8종의 IC 패키지, 총 280개의 영상에 대하여 실험한 결과, IC 패키지와 핀원딤플의 검출율은 100%였으며, 마킹상태에 대한 판정은 98.8%의 정확도를 나타내어 제안된 방법이 효과적임을 확인할 수 있었다.

• Journal of applied mathematics & informatics
• /
• 제6권2호
• /
• pp.379-392
• /
• 1999

The problem of the state-minimization for the nonde-terministic finite Rabin-Scott's automata is considered. A new algo-rithm for this problem is obtained. The obtained algorithm has the exponential effectiveness like the earlier-known algorithms for this problem. But each of previous algo-rithms amounts to the search of minimum generative system for local reaction of equal automaton of canonical form and unlike them we use in this paper two special function marking states of the given automaton.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2002년도 춘계종합학술대회
• /
• pp.147-151
• /
• 2002

차별 서비스(Differentiated Service : DS) 네트워크 환경에서 각기 다른 QoS요구를 갖는 흐름들간의 공평성 보장이 주요 이슈중 하나이다. 이는 자원 할당과 트래픽 제어 방식에 따라 종단간에 지원되는 흐름들 간의 서비스 품질 및 백본망의 이용 효율이 크게 달리 질 수 있기 때문이다. 이에 본 논문에서는 링크의 이용효율 제고 및 대역폭의 공평성 향상을 위해 기존에 제안된 Time Sliding Window(TSW) 마킹 알고리즘의 변형인 Time Sliding Two Window Three Color(TS2W3C) 마킹 알고리즘을 제안하고 ns-2 시뮬레이션을 통하여 기존의 알고리즘과 성능을 비교 평가한다.

• 한국인터넷방송통신학회논문지
• /
• 제11권4호
• /
• pp.195-201
• /
• 2011

주파수 자원을 효율적으로 이용하기 위한 기술인 인지무선통신(CR : Cognitive radio) 기술은 주파수 자원난을 해결하기 위하여 연구되고 있다. CR은 1차 사용자에 할당된 주파수를 2차 사용자가 이용할 수 있도록 한다. 그러나 무선채널에서는 페이딩과 음영지역의 영향으로 스펙트럼 센싱에 있어서 절충안이 필요해진다. 또한, 다양한 CR 시스템을 검출하고 구분하기 위해서 새로운 센싱 알고리즘이 필요하다. 그러므로 본 논문에서는 워터마킹 기술을 이용한 스펙트럼 센싱 알고리즘을 제안하여, Kasami-sequence와 M-sequence를 워터마킹 시퀀스로 이용했을 경우의 검출 성능을 비교한다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제4권2호
• /
• pp.142-148
• /
• 2004

In this paper, we propose the color fuzzy decision algorithm to face segmentation in a color image. Our algorithm can segment without the user's interaction by fuzzy decision marking. And it removes small parts such as a noise using wavelet morphology in the image obtained by applying the fuzzy decision algorithm. Also, it merges and chooses the face region in each quantization image through rough sets. This video object division algorithm is shown to be superior to a conventional algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.474-479
• /
• 2004

This paper describes a feedback-based congestion control algorithm to improve TCP performance over wireless network. In this paper, we adjust the packet marking probability at the router for Max-Min fair sharing of the bandwidth and full utilization of the link. Using the successive ECN (Explicit Congestion Notification), the proposed algorithm regulates the window size to avoid the congestion and sees the packet loss only due to the wireless link error. Based on the asymptotic analysis, it is shown that the proposed algorithm guarantees the QoS of the wireless TCP. The effectiveness of the proposed algorithm is demonstrated by simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권11호
• /
• pp.1946-1958
• /
• 2011

Wireless Sensor Network (WSN) is made up of a number of sensor nodes and base stations. Traffic flow in WSN appears self-similar due to its data delivery process, and this impacts queue length greatly and makes queuing delay worse. Active queue management can be designed to improve QoS performance for WSN. In this paper, we propose self-similar traffic rate estimating algorithm named Power-Law Moving Averaging (PLMA) to regulate packet marking probability. This algorithm improves the availability of the rate estimation algorithm under the self-similar traffic condition. Then, we propose an adaptive Proportional Integral algorithm (SSPI) based on the estimation of the Self-Similar traffic rate by PLMA. Simulation results show that SSPI can achieve lower queue length jitter and smaller setting time than PI.

• 대한기계학회논문집
• /
• 제19권8호
• /
• pp.1854-1868
• /
• 1995

An effective nesting algorithm has been proposed to allocate the arbitrary shapes on one or several raw sheets by applying the well-known simulated annealing algorithm as the optimization technique. In this approach, both the shapes to be allocated and the raw sheets are represented as the grid-based models. This algorithm can accommodate every possible situations encountered in cutting apparel parts from the raw leather sheets. In other words, the usage of the internal hole of a shape for other small shapes, handling of the irregular boundaries and the interior defects of the raw sheets, and the simultaneous allocation on more than one raw sheets have been tackled on successfully in this study. Several computational experiments are presented to verify the robustness of the proposed algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1431-1434
• /
• 2005

In the steel production line, the molten metal of a furnace is transformed into billet and then moves to the heating furnace of the hot rolling mill. This paper describes about the development of recognition system for the characters, which was marked at the billet material by use template-marking plate and hand written method, in the steel plant. For the recognition of template-marked characters, we propose PSVM algorithm. And for the recognition of hand written character, we propose combination methods of CCD algorithm and PSVM algorithm. The PSVM algorithm need some more time than the conventional KLT or SVM algorithm. The CCD algorithm makes shorter classification time than the PSVM algorithm and good for the classification of closed curve characters from Arabic numerals. For the confirmation of algorithm, we have compared our algorithm with conventional methods such as KLT classifier and one-to-one SVM. The recognition rate of experimented billet characters shows that the proposing PSVM algorithm is 97 % for the template-marked characters and combinational algorithm of CCD & PSVM is 95.5 % for the hand written characters. The experimental results show that our proposing method has higher recognition rate than that of the conventional methods for the template-marked characters and hand written characters. By using our algorithm, we have installed real time character recognition system at the billet processing line of the steel-iron plant.