• 한국지형공간정보학회:학술대회논문집
• /
• 한국지형공간정보학회 2002년도 추계학술대회
• /
• pp.133-140
• /
• 2002

본 논문에서는 다양한 건물 지붕의 검출에 사용될 수 있는 선소의 그룹화 기법을 제안한다. 먼저 에지 보존 필터를 사용하여 영상에 포함된 잡음을 제거한 후에 watershed 기법을 이용하여 에지의 위치를 보존하고 영상 분할을 수행한다. 분할된 영역의 경계선에 위치한 화소들의 곡률을 계산하여 control point를 검출하고 control point 사이의 선소를 추출한다. 추출된 선소들의 방향과 길이를 고려하여 선소의 연결을 수행하고 최종적으로 화소의 그레디언트 크기를 이용하여 선소의 위치를 조정한다. 항공 영상에 제안한 방법을 적용하여 건물 지붕을 정확하게 검출할 수 있음을 보였다.

• Journal of Communications and Networks
• /
• 제9권2호
• /
• pp.198-209
• /
• 2007

This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

• 대한전자공학회논문지
• /
• 제27권12호
• /
• pp.1817-1824
• /
• 1990

This paper describes a shape matching algorithm for occluded or distorted two-dimensional objects. In our approach, the shape matchin is viewed as a segment matching problem. A shape matching algorithm, based on both the stochastic labeling technique and the hypothesis generate-test paradigm, is proposed, and a simple technique which performs the stochastic labeling process in accordance with the definition of consisten labeling assignment without requiring an iterative updating process of probability valiues is also proposed. Several simulation results show that the proposed algorithm is very effective when occlusion, scaling or change of orientation has occurred in the object.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.109-114
• /
• 1987

In this thesis, we work on the curve recognition with real time processing and the Robot tracking method on recognized curve. Image information of segment curve is supplied to computer to run to a Robot so that it is a feedback system. Image coordinate frame to world coordinate transformation represents in this paper and curve matching algorithm subscribes by two method, first transformation matching algorithm, second image coordinate matching algorithm. Also Robot running time to computer image processing time relationships finally includes.

• 스마트미디어저널
• /
• 제2권4호
• /
• pp.20-26
• /
• 2013

This paper presents an approach to Mongolian car plate recognition using artificial neural network. Our proposed method consists of two steps: detection and recognition. In detection step, we implement Flood fill algorithm. In recognition step we proceed to segment the plate for each Cyrillic character, and use an Artificial Neural Network (ANN) machine - learning algorithm to recognize the character. We have learned the theory of ANN and implemented it without using any library. A total of 150 vehicles images obtained from community entrance gates have been tested. The recognition algorithm shows an accuracy rate of 89.75%.

• 전자공학회논문지B
• /
• 제32B권9호
• /
• pp.1231-1238
• /
• 1995

In on-line character recognition, to segment input character is important. This paper proposes an internal character segmentation algorithm. The internal segmentation algorithm produces candidate words by considering possible combinations of Korean alphabets. In this process, we make use of projections of strokes onto the horizontal axis to remove ambiguities among candidate words. As a result of experiments, the internal segmentation algorithm shows better performance than external segmentation algorithm as the gap between sample characters becomes smaller.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2015년도 하계학술대회
• /
• pp.9-12
• /
• 2015

본 논문에서는 FAST(Features from Accelerated Segment Test) 특징점 검출기와 SURF 특징점 표현자(descriptor)를 수정하고 조합하여 영상의 왜곡에 강인하면서 정합을 수행할 수 있는 새로운 특징점 정합 기법을 제안한다. 스케일 공간을 생성하여 스케일 변화를 고려하고 잡음에 강인하기 위해 영상에서 특징점 후보군을 결정한다. 기존의 FAST는 에지 부분에서 특징점을 많이 검출하게 되는데 이러한 단점을 주곡률(principal curvatures)을 적용하여 개선하고자 한다. 또한 영상의 회전 변화에 강인하기 위해 SURF 특징점 표현자를 사용한다. 제안하는 정합 기법은 적은 계산량으로 기존의 특징점 정합 기법보다 우수한 성능을 나타낸다. 특별히 잡음이 존재하는 영상에서의 정합에 강인함을 보여준다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권8호
• /
• pp.3856-3872
• /
• 2018

HTTP-based adaptive streaming (HAS) has recently been widely deployed on the Internet. In the HAS system, a video content is encoded at multiple bitrates and the encoded video content is segmented into small parts of fixed durations. The HAS client requests a video segment and stores it in the playout buffer. The rate adaptation algorithm employed in HAS clients dynamically determines the video bitrate depending on the time-varying bandwidth. Many studies have shown that an efficient rate adaptation algorithm is critical to ensuring quality-of-experience in HAS systems. However, existing algorithms have problems estimating the network bandwidth because bandwidth estimation is performed on the client-side application stack. Without the help of transport layer protocols, it is difficult to achieve accurate bandwidth estimation due to the inherent segment-based transmission of the HAS. In this paper, we propose an alternative approach that utilizes the playout buffer occupancy rather than using bandwidth estimates obtained from the application layer. We start with a queueing analysis of the playout buffer. Then, we present a buffer-aware rate adaptation algorithm that is solely based on the mean buffer occupancy. Our simulation results show that compared to conventional algorithms, the proposed algorithm achieves very smooth video quality while delivering a similar average video bitrate.

• Nuclear Engineering and Technology
• /
• 제54권9호
• /
• pp.3242-3249
• /
• 2022

As Kori unit 1 is undergoing the decommissioning process, estimating the disposal amount of waste from the decommissioned nuclear reactor has become one of the challenging issues. Since the waste disposal amount estimation depends on the packing of the waste, it is highly desirable to optimize the waste packing plan. In this study, we developed an efficient scheme for packing waste component segments. The scheme consists of 1) preparing three-dimensional models of segments, 2) orienting each segment in such a way to minimize the bounding box volume, and 3) applying hybrid genetic algorithm to pack the segments in the disposal containers. When the packing solution converges in the algorithm, it comes up with the number of containers used and the placement of segments in each container. The scheme was applied to Kori-1 reactor pressure vessel. The required number of containers calculated by the developed scheme was 24 compared to 42 that was the estimation of the prior packing plan, resulting in disposal volume savings by more than 40%. The developed method is flexible for applications to various packing problems with waste segments from different cutting options and different sizes of containers.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제31권9호
• /
• pp.1161-1170
• /
• 2004

본 논문에서는 군집화 알고리즘을 사용하여 피부색 영역을 분할하는 방법을 제안한다. 기존의 군집화 알고리즘들의 대부분은 주로 구형의 군집을 검출하고, 배치형으로 수행되며, 군집의 개수를 미리정해야 한다는 문제점을 가지고 있다. 본 논문에서는 대표적인 타원형 군집화 알고리즘인 EM 알고리즘을 변형하여, 온라인으로 학습가능하며, 군집의 개수를 자동적으로 찾아낼 수 있는 EAM 알고리즘을 사용하였다. EAM 알고리즘외 유효성은 피부색 영역 분할에 대해 증명되었다. 실험결과는 군집의 개수가 미리 주어지지 않더라도, EAM 알고리즘은 주어진 영상에 대해 자동적으로 옳은 군집의 개수를 찾아냈고, EM 알고리즘과 비교하여 더 좋은 분할 결과를 보여주고 있다. 영역에 대한 조건부 확률을 이용하여 성공적인 피부색 영역의 탐지 및 분할 결과를 얻었다. 또한 사람이 포함된 영상을 분류하는 문제에도 적용하여 좋은 분류 결과를 얻었다.