• 전자공학회논문지SC
• /
• 제44권6호
• /
• pp.11-20
• /
• 2007

기존 Hough transform을 이용한 타원 검출의 수행 속도와 개수의 추정을 개선하기 위해 본 논문에서는 선분 세그먼트 기반 Randomized Hough Transform (RHT)을 제안한다. 제안하는 방법은 에지 영상을 선분 세그먼트 단위로 분할한 후 임의의 선분 세그먼트 쌍을 RHT를 이용해서 타원을 추정하여 병합여부를 판단한다. 이와 같이 선분 세그먼트 단위로 RHT를 적용하면 적은 반복수행으로 타원을 추정할 수 있으며 복잡한 에지 영상에서도 보다 정확한 타원의 개수를 추정할 수 있다. 제안된 방법의 효율성은 계산속도 및 타원검출의 정확도로 평가하였으며 다양한 입력영상에 대한 실험을 통해 입증하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2009년도 정보 및 제어 심포지움 논문집
• /
• pp.34-36
• /
• 2009

This paper proposes an effective lane detection algorithm using hugh transform and lane model. The proposed lane detection algorithm includes two major components, i.e., lane marks segmentation and an exact lane extraction using a novel postprocessing technique. The first step is to segment lane marks from background images using HSV color model. Then, a novel postprocessing is used to detect an exact lane using Hugh transform and lane models(linear and curved lane models). The postprocessing consists of three parts, i.e, thinning process, Hugh Transform and filtering process. We divide input image into three regions of interests(ROIs). Based on lane curve function(LCF), we can detect an exact lane from various extracted lane lines. The lane models(linear and curved lane mode]) are used in order to judge whether each lane segment is fit or not in each ROIs. Experimental results show that the proposed scheme is very effective in lane detection.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2351-2354
• /
• 2003

A new transform coder for arbitrarily shaped image segments is proposed. In the encoder, a block-based DCT is applied to the resulting image block after shifting pixels within the image segment to block border and padding the mean value of the pixels to empty region. For reducing the transmission bit rate, the transform coefficients located in padded region are truncated and only the remaining transform coefficients are transmitted to the decoder. In the decoder, the transform coefficients truncated in the encoder are recovered using received transform coefficients and a block-based inverse DCT is performed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권4호
• /
• pp.1095-1109
• /
• 2022

Along with the popularity of GPS system and smart cell phone, trajectories of pedestrians or vehicles are recorded at any time. The great amount of works had been carried out in order to discover traffic paradigms or other regular patterns buried in the huge trajectory dataset. The core of the mining algorithm is how to evaluate the similarity, that is, the "distance", between trajectories appropriately, then the mining results will be accordance to the reality. Euclidean distance is commonly used in the lots of existed algorithms to measure the similarity, however, the trend of trajectories is usually ignored during the measurement. In this paper, a novel segment transform distance (STD) algorithm is proposed, in which a rule system of line segment transformation is established. The similarity of two-line segments is quantified by the cost of line segment transformation. Further, an improvement of STD, named ST-DTW, is advanced with the use of the traditional method dynamic time warping algorithm (DTW), accelerating the speed of calculating STD. The experimental results show that the error rate of ST-DTW algorithm is 53.97%, which is lower than that of the LCSS algorithm. Besides, all the weights of factors could be adjusted dynamically, making the algorithm suitable for various kinds of applications.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2004년도 추계학술대회 논문집
• /
• pp.1496-1499
• /
• 2004

The paper persents an efficient method of extracting line segment in a grid map. The grid map is composed of 2-D grids that have both the occupancy and orientation probabilities based on the simplified Bayesian updating model. The probabilities and orientations of cells in the grid map are continuously updated while the robot explorers to their values. The line segments are, then, extracted from the clusters using Hough transform methods. The eng points of a line segment are evaluated from the cells in each cluster, which is simple and efficient comparing to existing methods. The proposed methods are illustrated by sets of experiments in an indoor environment.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2003년도 춘계학술대회 논문집
• /
• pp.176-180
• /
• 2003

The paper presents an efficient method of extracting line segment in a local map of a robot's surroundings. The local map is composed of 2-D grids that have both the occupancy and orientation probabilities using sonar sensors. To find the shape of an object in a local map from orientation information, the orientations are clustered into several groups according to their values. The line segment is , then, extracted from the clusters based on Hough transform. The proposed technique is illustrated by experiments in an indoor environment.

• 한국멀티미디어학회논문지
• /
• 제11권11호
• /
• pp.1615-1623
• /
• 2008

이 논문에서는 곤충 발자국의 패턴을 찾아 개체를 인식하기 위해서, 개선된 SOM 알고리즘과 ART2 알고리즘을 사용하여 인식의 기본 영역을 추출한다. 또한 Trace 변환을 이용하여 발자국의 인식에 필요한 특징을 추출하고 개체를 판단하는 기법을 제안한다. 제안한 기법에서는 모폴로지 기법을 이용하여 region을 먼저 찾고, 개선된 SOM과 ART2 알고리즘을 이용하여 곤충의 크기와 종류에 관계없이 세그먼트를 추출한다. 그리고 곤충 발자국과 같이 다양한 변형이 존재하는 패턴에 적합한 특징값을 찾기 위해서 Trace 변환을 이용하고, 함수의 조합으로 재구성된 Triple 특징값을 이용하여 곤충별로 고유한 패턴을 찾아 인식 실험을 수행한다. 곤충 발자국에서 명확한 발자국과 그렇지 못한 발자국을 자동으로 결정하는 것이 매우 어렵다. 따라서 이와 같이 불확실한 대상을 제외시키지 않고 가능성의 대상으로 판단하고 분류하기 위해서 퍼지 가중치 평균을 이용하여 인식을 수행한다. 제안한 방법에 의한 곤충 발자국의 영역 추출과 인식 실험을 실시하고 그 결과를 제시하였다.

• 한국통신학회논문지
• /
• 제22권8호
• /
• pp.1715-1721
• /
• 1997

Wavelet transform is not applicable to arbitrarily-shaped region (or object) in images, due to the nature of its global decomposition. In this paper, the arbitrarily-shaped wavelet transform(ASWT) is proposed in order to solve this problem and its properties are investigated. Computation complexity of the ASWT is also examined and it is shown that the ASWT requires significantly fewer computations than conventional wavelet transform, since the ASWT processes only the object region in the original image. Experimental resutls show that any arbitrarily-shaped image segment can be decomposed using the ASWT and perfectly reconstructed using the inverse ASWT.

• 디지털융복합연구
• /
• 제14권10호
• /
• pp.271-276
• /
• 2016

본 논문에서는 조명 및 Pose 등의 다양한 환경변화에 강인한 얼굴 및 눈 검출 알고리즘을 제안한다. 일반적으로 눈 검출은 얼굴검출과 동시에 수행되며 조명 및 Pose의 변화에 따라 검출 성능에 영향을 준다. 본 논문에서는 Modified Census Transform 알고리즘 사용하여 환경변화에 강인한 얼굴검출을 수행한다. 눈은 얼굴영역의 중요한 특징으로 주변의 조명 변화 및 안경 등의 다양한 요인으로 검출 성능의 저하 요인이 된다. 이러한 문제점의 해결을 위하여 Gabor transformation과 Feature from Accelerated Segment Test 알고리즘 기반의 눈 검출 알고리즘을 제안한다. 제안된 얼굴검출 알고리즘은 27.4ms의 검출속도와 98.4%의 검출율을 보이며, 눈 검출 알고리즘의 경우 36.3ms의 검출속도와 96.4%의 검출율을 보이는 것을 확인하였다.

• 전자공학회논문지D
• /
• 제34D권11호
• /
• pp.64-69
• /
• 1997

We have shown that the Hough transform filter can be easily obtained by repeatedly recording one line segment pattern holographically by use of rotational multiplexing. With this filter, one can get resutls of the hough transform in the time of light propagation. To demonstrate our method experimentally, the hough transform filter for 18 different rottion angles was recorded, and experimental transform results were compared with simulated ones for a few input patterns. By introducing a compensation process for the non-uniformity of both the input plane wav eand the diffraction efficiency of each hologram. It is possible to get more precise transform results.