• 대한전자공학회논문지TC
• /
• 제43권12호
• /
• pp.31-41
• /
• 2006

이동통신망을 통한 인터넷 접속은 제한된 대역폭 및 무선 접속 링크에서의 높은 bit 오류율로 인하여 병목현상을 야기시킨다. 이러한 병목현상에 따른 TCP 통신의 성능저하를 막기 위해 TCP 연결의 여러 파라미터를 최적화시키는 작업은 필수적이다. 본 논문에서는 모바일 컨텐츠 서버와의 통신시에 무선링크의 이용 효율을 최대화시키기 위한 최적의 TCP 세그먼트 길이에 대한 알고리즘을 제시한다. 또한 본 논문에서는 제시된 알고리즘에 대한 몇 가지의 예를 제시한다. 제시된 예에서 보듯이 TCP 세그먼트 길이는 TCP 윈도우 사이즈가 어느 임계값 이상이 되면 더 이상 변하지 않고 고정된 값을 갖음을 알 수 있다. 본 논문의 결과를 이용하면, 단순히 TCP 세그먼트 길이만을 조정하므로서, 모바일 컨텐츠 서버 접속시에, 값비싼 무선 링크의 이용 효율을 최대화시킬 수 있을 것이다.

• Transactions on Electrical and Electronic Materials
• /
• 제17권6호
• /
• pp.363-368
• /
• 2016

Rectangular shape detection plays an important role in many image recognition systems. However, it requires continued research for its improved performance. In this study, we propose a strong rectangular shape detection algorithm, which combines the canny edge and line detection algorithms based on the perpendicularity and parallelism of a rectangle. First, we use the canny edge detection algorithm in order to obtain an image edge map. We then find the edge of the contour by using the connected component and find each edge contour from the edge map by using a DP (douglas-peucker) algorithm, and convert the contour into a polyline segment by using a DP algorithm. Each of the segments is compared with each other to calculate parallelism, whether or not the segment intersects the perpendicularity intersecting corner necessary to detect the rectangular shape. Using the perpendicularity and the parallelism, the four best line segments are selected and whether a determined the rectangular shape about the combination. According to the result of the experiment, the proposed rectangular shape detection algorithm strongly showed the size, location, direction, and color of the various objects. In addition, the proposed algorithm is applied to the license plate detecting and it wants to show the strength of the results.

• 대한전자공학회논문지SP
• /
• 제48권3호
• /
• pp.99-105
• /
• 2011

본 논문에서는 수정된 segment maxima을 기반으로 한 색역 추정 방법을 제안한다. Segment maxima은 CIELab 공간을 일정한 간격으로 분할하고, 각 분할된 영역의 최외각 측정 데이터를 계산하여 색역을 추정하는 기법이다. 그러나 이 방법은 색공간의 분할 개수에 따라서 지역적인 색역 왜곡이 나타나 색역 사상시에 컬러 결점(color artifact)을 발생시킨다. 색공간 분할 개수가 적으면 높은 채도 부근에서 추정된 색역 정보가 분실되어 컬러 컨투어(color contour) 현상이 발생한다. 이와 반대로 색공간 분할 개수가 많으면 CIELab 밝기 축 부근에서 색역이 오목하게 되는 왜곡이 발생한다. 이러한 지역적인 색역 왜곡은 색역 사상시 결과 영상에 컬러 결점이 유발한다. 제안한 논문에서는 실험을 통하여 측정한 데이터 수에 따른 적절한 색공간 분할개수를 설정하여 높은 채도 부근에 색역 축소를 줄이며, 오목하게 나타나는 지역적인 색역 왜곡을 다양한 색역 분할에 따른 색역 경계 서술자(gamut boundary descriptor) 비교를 통해 이를 수정하는 방법을 제안하였다. 실험을 통해 제안한 방법이 기존의 segment maxima보다 정확한 장치의 색역을 추정할 수가 있었고, 결과 영상에서도 컬러 컨투어나 반점과 같은 컬러 결점이 줄어듬을 확인 할 수 있었다.

• 한국도로학회논문집
• /
• 제17권5호
• /
• pp.75-82
• /
• 2015

PURPOSES : In link matching using vehicular trajectory in a car navigation system, it is technically difficult to match the location of the subject vehicle with a link on an electronic map in the vehicle on a grade separation highway segment consisting of an elevated highway and atgrade highway, because of the overlap of geometric lines of the two highways. This study was initiated to propose a link matching algorithm using the characteristics of vehicular movement of the subject vehicle. METHODS : The selected test site is the highway segment between Jeong-reung IC and Gil-eum IC where the Inner Circulation Road and Jeong-reung-ro run together. To evaluate the proposed algorithm, this study collected the raw packet data of vehicles that drove on the test site. In a simulation environment, link matching was performed using an existing algorithm as well as the proposed algorithm. RESULTS: It was clearly found that the characteristics of vehicular movements are different on the two highways. CONCLUSIONS: The proposed algorithm outperformed the existing algorithm.

• International Journal of Automotive Technology
• /
• 제7권2호
• /
• pp.227-235
• /
• 2006

In this paper a robust image processing method with modified Otsu algorithm to recognize the road lane for a real-time controlled autonomous vehicle is presented. The main objective of a proposed method is to drive an autonomous vehicle safely irrespective of road image qualities. For the steering of real-time controlled autonomous vehicle, a detection area is predefined by lane segment, with previously obtained frame data, and the edges are detected on the basis of a lane width. For stable as well as psudo-robust autonomous driving with "good", "shady" or even "bad" road profiles, the variable threshold with modified Otsu algorithm in the image histogram, is utilized to obtain a binary image from each frame. Also Hough transform is utilized to extract the lane segment. Whether the image is "good", "shady" or "bad", always robust and reliable edges are obtained from the algorithms applied in this paper in a real-time basis. For verifying the adaptability of the proposed algorithm, a miniature vehicle with a camera is constructed and tested with various road conditions. Also, various highway road images are analyzed with proposed algorithm to prove its usefulness.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1997년도 춘계학술대회 학술발표 논문집
• /
• pp.228-233
• /
• 1997

An efficient corner matching algorithm is developed to minimize the amount of calculation. To reduce the amount of calculation, all available information from a corner detector is used to make model. This information has uncertainties due to discretization noise and geometric distortion, and this is represented by fuzzy rule base which can represent and handle the uncertainties. Form fuzzy inference procedure, a matched segment list is extracted, and resulted segment list is used to calculate the transformation between object of model and scene. To reduce the false hypotheses, a vote and re-vote method is developed. Also an auto tuning scheme of the fuzzy rule base is developed to find out the uncertainties of features from recognized results automatically. To show the effectiveness of the developed algorithm, experiments are conducted for images of real electronic components.

• 한국통신학회논문지
• /
• 제34권11B호
• /
• pp.1142-1150
• /
• 2009

본 논문은 DOCSIS (Data Over Cable Service Interface Specifications) 3.0 기반의 다중 상향 채널 케이블 네트워크에서 효과적인 채널 자원 운용을 위한 새로운 대역 할당 알고리즘을 제안한다. 제안된 알고리즘은 상향 데이터 프레임의 평균 접근 지연 시간(Access Delay)을 줄이기 위해 피기백 대역 요청 기회를 통계적으로 향상시킨다. 이는 DOCSIS 3.0 규격에서 새롭게 규정된 다중 채널로 전송되는 세그먼트 프레임들의 피기백 대역 요청 특성을 이용한다. DOCSIS 3.0 규격에서는 하나의 대역 요청에 대해 다수개의 상향 채널로 대역이 분산되어 할당될 수 있다. 각각의 채널로 분산되어 할당된 대역은 전송 시 하나의 세그먼트 프레임으로 다루어진다. 제안된 알고리즘은 다중 채널로 전송되는 세그먼트 프레임의 배치를 최적화하여 피기백 대역 요청 확률을 높이고 접근 지연 시간을 최소화한다. 제안된 알고리즘의 성능 평가는 Self-similar 트래픽 모델을 적용하여 이론적 분석 및 모의시험을 통해 이루어진다.

• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1994년도 제11회 음성통신 및 신호처리 워크샵 논문집 (SCAS 11권 1호)
• /
• pp.107-110
• /
• 1994

In this paper, we describe the features of the fundamental frequency contour of Korean read speech, and propose a new stylization method to characterize the Fø pattern of segments. Our algorithm consists of three stylization processes : the segment level, the syllable level, and the sord level. For stylization of Fø contour in the segment level , we applied least square error minimization method to determine Fø values at initial, medial, and final position in a segment. In the syllable level, we determine the stylized Fø pattern of a syllable using the mean Fø value of each word and style information for each word, syllable and segment, we reconstruct Fø contour of sentences. The simulation results show that the error is less than 10% of the actual Fø contour for each sentence. In perception test, there is little difference between the synthesized speech with the original difference between the synthesized speech with the original Fø contour and the synthesized speech with the stylized Fø contour.

• 한국멀티미디어학회논문지
• /
• 제17권6호
• /
• pp.655-670
• /
• 2014

In this paper, we propose an efficient and robust lane detection method for detecting immediate left and right lane boundaries of the lane in the roads. The proposed method are based on hyperbolic lane model and the reliable line segment clustering. The reliable line segment cluster is determined from the most probable cluster obtained from clustering line segments extracted by the efficient LSD algorithm. Experiments show that the proposed method works robustly against lanes with difficult environments such as ones with occlusions or with cast shadows in addition to ones with dashed lane marks, and that the proposed method performs better compared with other lane detection methods on an CMU/VASC lane dataset.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1994년도 Proceedings of the Korea Automatic Control Conference, 9th (KACC) ; Taejeon, Korea; 17-20 Oct. 1994
• /
• pp.302-306
• /
• 1994

This paper describes how to recognize hand written Hangeul character using the stroke order of the elementary segment. The recognition system is constructed of parts : character input part, segment disassembling part, character element extraction part and character recognition part. The character input part reads the character and performs thinning algorithm. In the segment disassembling part, the input character is disassembled into elementary segments using the direction codes and the feature parameters. In the character element extraction part, we extract the character element using the stroke order and the knowledge rule. Finally, we able to recognize the hand written Hangeul characters by assembling the character elements, in the character recognition part.