• Journal of information and communication convergence engineering
• /
• 제6권4호
• /
• pp.444-447
• /
• 2008

In this paper, we proposed the recognition system of car license plates to mitigate traffic problems. The processing sequence of the proposed algorithm is as follows. At first, a license plate segment is extracted from an acquired car image using morphological features and color information, and noises are eliminated from the extracted license plate segment using line scan algorithm and Grassfire algorithm, and then individual codes are extracted from the license plate segment using edge tracking algorithm. Finally the extracted individual codes are recognized by an FCM algorithm. In order to evaluate performance of segment extraction and code recognition of the proposed method, we used 100 car images for experiment. In the results, we could verify the proposed method is more effective and recognition performance is improved in comparison with conventional car license plate recognition methods.

• 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.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 1999년도 Proceedings of International Symposium on Remote Sensing
• /
• pp.177-181
• /
• 1999

This paper presents an algorithm for building detection from aerial image using segment measure function and line relation. In the detection algorithm proposed, edge detection, linear approximation and line linking are used and then line measure function is applied to each line segment in order to improve the accuracy of linear approximation. Parallelisms, orthogonalities are applied to the extracted liner segments to extract building. The algorithm was applied to aerial image and the buildings were accurately detected.

• Journal of Information Processing Systems
• /
• 제16권2호
• /
• pp.406-420
• /
• 2020

In order to make up the deficiencies of the existing research results which cannot effectively deal with the nearest neighbor query based on the line segments in obstacle space, the k nearest neighbor query method of line segment in obstacle space is proposed and the STA_OLkNN algorithm under the circumstance of static obstacle data set is put forward. The query process is divided into two stages, including the filtering process and refining process. In the filtration process, according to the properties of the line segment Voronoi diagram, the corresponding pruning rules are proposed and the filtering algorithm is presented. In the refining process, according to the relationship of the position between the line segments, the corresponding distance expression method is put forward and the final result is obtained by comparing the distance. Theoretical research and experimental results show that the proposed algorithm can effectively deal with the problem of k nearest neighbor query of the line segment in the obstacle environment.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2008년도 International Symposium on Remote Sensing
• /
• pp.126-129
• /
• 2008

In this paper, we proposed a method extracting an object from background of the satellite image. The image segmentation techniques have been widely studied for the technology to segment image and to synthesis segment object with other images. Proposed algorithm is to perform the edge detection of a selected object using genetic algorithm. We segment region of object based on detection edge using watershed algorithm. We separated background and object in indefinite region using gradual region merge from segment object. And, we make GUI for the application of the proposed algorithm to various tests. To demonstrate the effectiveness of the proposed method, several analysis on the satellite images are performed.

• 한국정보통신학회논문지
• /
• 제15권10호
• /
• pp.2223-2230
• /
• 2011

심전도는 심근허혈, 부정맥, 심근경색과 같은 심장질환의 진단에 이용된다. 특히 심근허혈은 ST 세그먼트의 형태 변화가 나타나는데, 이러한 변화는 일시적으로 나타나며 특별한 증상을 동반하지 않는다. 따라서 지속적인 모니터링을 통해서 ST의 일시적인 변화를 검출하는 것이 매우 중요하다. 이에 본 연구에서는 심근허혈 진단을 위한 ST세그먼트 형태 분류 알고리즘을 제안한다. 이는 전처리 과정과 적응가변형 문턱치를 통해 R파와 각 특징점을 검출 한 후 S와 T파사이의 굴곡점으로부터 특정한 기울기 정보를 추출하여 ST의 기울기 기준점과 비교함으로써, 검출된 ST를 6가지 형태로 분류하는 방법이다. 개발된 알고리즘은 심전도로부터 ST 레벨 변화 구간을 검출하고, 검출된 구간에 대해서도 ST의 형태를 분류함으로써 심전도 레벨 변화뿐만 아니라 형태에 대한 정보도 제공한다. 제안한 알고리즘의 심근허혈 패턴 진단 성능을 평가하기 위해서 European ST 데이터베이스를 사용하였다. 성능 평가 결과 가장 높은 분류성공률은 99.4%이며, 낮은 성공률은 68.48%를 나타내었다.

• Journal of applied mathematics & informatics
• /
• 제7권2호
• /
• pp.629-640
• /
• 2000

this paper present an efficient line-drawing algorithm that reduces the amount of space required, Because of its efficiency , this line-drawing algorithm is faster than the Bresenham algorithm or the recursive bisection method. this efficiency was achieved through a new data structure; namely , the modified segment tree (MST). Using the modified segment tree and the distribution rule suggested in this paper, we dra lines without generating the recursive calls used in [3] and without creating the binary operation used in [4]. we also show that line accuracy improves in proportion to the display resolution . In practice, we can significantly improve the algorithm's performance with respect to time and space, This improvement offer an increase in speed, specially with lines at or near horizontal, diagonal. or vertical ; that is, this algorithm requires the time complexity of (n) and the space complexity O(2k+1), where n is the number of pixels and k is a level of the modified segment tree.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.241-241
• /
• 2000

In this Paper, we present a new efficient algorithm that can segment an object in the image. There are many algorithms for segmentation and many studies for criteria or threshold value. But, if the environment or brightness is changed, their would not be suitable. Accordingly, we apply a clustering algorithm for adopting and compensating environmental factors. And applying labeling method, we try arranging segment by the similarity that calculated with the fuzzy algorithm. we also present simulations for searching an object and show that the algorithm is somewhat more efficient than the other algorithm.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.129-131
• /
• 2004

Elliptic Curve Cryptography (ECC) coprocessors support massive scalar multiplications of a point. We research the design for multi-segment multipliers in fixed-size ECC coprocessors using the multi-segment Karatsuba algorithm on GF($2^m$). ECC coprocessors of the proposed multiplier is verified on the SoC-design verification kit which embeds ALTERA EXCALIBUR FPGAs. As a result of our experiment, the multi-segment Karatsuba multiplier, which has more efficient performance about twice times than the traditional multi-segment multiplier, can be implemented as adding few H/W resources. Therefore the multi-segment Karatsuba multiplier which satisfies performance for the cryptographic algorithm, is adequate for a low cost embedded system, and is implemented in the minimum area.

• 한국컴퓨터정보학회논문지
• /
• 제11권4호
• /
• pp.283-289
• /
• 2006

현재 영상분할은 사용자가 원하는 영상을 분할하고, 분할된 객체에 다른 영상을 합성하는 기술에 대해 많은 연구가 진행되어왔다. 본 논문에서는 점진적 영역병합과 유전자 알고리즘을 이용하여 새로운 반자동 영상 분할방법을 제안하였다. 제안된 알고리즘은 사용자가 원하는 객체를 선정한 후, 유전자 알고리즘을 이용해 객체의 경계를 검색한다. 검색된 경계를 기반으로 분수령 알고리즘을 이용하여 사용자가 원하는 객체의 영역을 분할하였다. 분할된 객체에서 불명확한 영역들을 점진적 영역 병합으로 배경과 객체를 분리하였다. 그리고, 알고리즘 개발을 효과적으로 수행하기 위해 GUI기반의 인터페이스를 만들어 사용자가 원하는 값을 적용할 수 있게 하였다. 실험에서는 제한된 방법의 우수성 입증을 위하여 다양한 영상을 분석하였다.