• Title, Summary, Keyword: 외곽선

Search Result 306, Processing Time 0.035 seconds

Korean Outline Font Editing System based on UFO Using METAFONT (메타폰트를 이용한 UFO 기반의 한글 외곽선 폰트 시스템)

  • Gwon, Gyeong-Jae;Son, Min-Ju;Jeong, Geun-Ho;Choi, Jae-Young
    • 한국어정보학회:학술대회논문집
    • /
    • /
    • pp.44-48
    • /
    • 2016
  • 오늘날 폰트를 디자인하는데 주로 사용되는 외곽선 방식은 글자의 크기를 손쉽게 변경할 수 있으나 글자의 굵기나 스타일을 변화시키려면 다시 수작업을 통해서 디자인을 변경해야 한다. 이를 보완하기 위한 프로그래머블 폰트인 메타폰트는 매개변수를 사용하여 글자의 변화가 매우 용이하다. 하지만 메타폰트는 프로그래밍 언어이므로 메타폰트에 대한 선행학습이 필요하여 폰트 디자이너에게 사용되지 않았다. 따라서 본 논문에서는 폰트 디자이너에게 익숙한 외곽선 방식에 편집기를 제공하면서 글자의 스타일에 대한 변화를 메타폰트에서 처리하여 다양한 폰트를 파생할 수 있는 한글 외곽선 폰트 시스템을 제안한다. 이를 위하여 본 시스템에서는 외곽선 방식의 폰트를 제작할 수 있도록 하는 웹 외곽선 폰트 편집기를 구현하였으며 외곽선 방식의 폰트를 메타폰트로 변환하는 UFO2mf를 구현하였다. 본 논문에서 제안하는 폰트 시스템은 기존 외곽선 방식의 스타일 변화에 대한 수고를 덜어줄 수 있을 것으로 기대한다.

  • PDF

Video object segmentation using a novel object boundary linking (새로운 객체 외곽선 연결 방법을 사용한 비디오 객체 분할)

  • Lee Ho-Suk
    • The KIPS Transactions:PartB
    • /
    • v.13B no.3
    • /
    • pp.255-274
    • /
    • 2006
  • Moving object boundary is very important for the accurate segmentation of moving object. We extract the moving object boundary from the moving object edge. But the object boundary shows broken boundaries so we develop a novel boundary linking algorithm to link the broken boundaries. The boundary linking algorithm forms a quadrant around the terminating pixel in the broken boundaries and searches for other terminating pixels to link in concentric circles clockwise within a search radius in the forward direction. The boundary linking algorithm guarantees the shortest distance linking. We register the background from the image sequence using the stationary background filtering. We construct two object masks, one object mask from the boundary linking and the other object mask from the initial moving object, and use these two complementary object masks to segment the moving objects. The main contribution of the proposed algorithms is the development of the novel object boundary linking algorithm for the accurate segmentation. We achieve the accurate segmentation of moving object, the segmentation of multiple moving objects, the segmentation of the object which has a hole within the object, the segmentation of thin objects, and the segmentation of moving objects in the complex background using the novel object boundary linking and the background automatically. We experiment the algorithms using standard MPEG-4 test video sequences and real video sequences of indoor and outdoor environments. The proposed algorithms are efficient and can process 70.20 QCIF frames per second and 19.7 CIF frames per second on the average on a Pentium-IV 3.4GHz personal computer for real-time object-based processing.

Korean Outline Font Editing System based on UFO Using METAFONT (메타폰트를 이용한 UFO 기반의 한글 외곽선 폰트 시스템)

  • Gwon, Gyeong-Jae;Son, Min-Ju;Jeong, Geun-Ho;Choi, Jae-Young
    • Annual Conference on Human and Language Technology
    • /
    • /
    • pp.44-48
    • /
    • 2016
  • 오늘날 폰트를 디자인하는데 주로 사용되는 외곽선 방식은 글자의 크기를 손쉽게 변경할 수 있으나 글자의 굵기나 스타일을 변화시키려면 다시 수작업을 통해서 디자인을 변경해야 한다. 이를 보완하기 위한 프로그래머블 폰트인 메타폰트는 매개변수를 사용하여 글자의 변화가 매우 용이하다. 하지만 메타폰트는 프로그래밍 언어이므로 메타폰트에 대한 선행학습이 필요하여 폰트 디자이너에게 사용되지 않았다. 따라서 본 논문에서는 폰트 디자이너에게 익숙한 외곽선 방식에 편집기를 제공하면서 글자의 스타일에 대한 변화를 메타폰트에서 처리하여 다양한 폰트를 파생할 수 있는 한글 외곽선 폰트 시스템을 제안한다. 이를 위하여 본 시스템에서는 외곽선 방식의 폰트를 제작할 수 있도록 하는 웹 외곽선 폰트 편집기를 구현하였으며 외곽선 방식의 폰트를 메타폰트로 변환하는 UFO2mf를 구현하였다. 본 논문에서 제안하는 폰트 시스템은 기존 외곽선 방식의 스타일 변화에 대한 수고를 덜어줄 수 있을 것으로 기대한다.

  • PDF

Advanced Contour Tracing Algorithms based on Analysis of Tracing Conditions (추적 조건 분석에 의한 개선된 외곽선 추적 기법들)

  • Cheng, Cheol-Ho;Seo, Jong-Hoon;Han, Tack-Don
    • Proceedings of the Korean Information Science Society Conference
    • /
    • /
    • pp.431-436
    • /
    • 2006
  • 외곽선 추적 알고리즘은 영상 인식 및 표현에 있어서 물체의 기본 성질을 파악하는데 중요하다. 따라서 많은 알고리즘들이 연구되어 왔으며, 이중에는 간단한 경계선 추적자 알고리즘(SBF: Simple Boundary Follower)이다. 이외에도 수정된 간단한 경계선 추적자 알고리즘 (MSBF: Modified Simple Boundary Follower), 개선된 간단한 경계선 추적자 알고리즘(ISBF: Improved Simple Boundary Follower), 무어-네이버 추적 알고리즘(MNT: Moore-Neighbor Tracer), 방사형 탐색 알고리즘(RSA: Radial Sweep Algorithm), 그리고 Theo Pavlidis 알고리즘(TPA)이 있다. 이러한 알고리즘들은 추적 경로 특성들이 다르며 각기 장점과 제약성이 있다.외곽선 알고리즘들의 제약성은 크게 두 가지로 나눌 수 있다. 하나는 알고리즘 특성에 따라 외곽선 픽셀간 인접 형태에 따라 추적하지 못하는 경우가 존재할 수 있다는 것이다. 또 다른 하나는 외곽선 추적 알고리즘의 시작과 종료 조건에 따라서 특정 위치 픽셀들을 찾지 못하는 경우도 존재한다는 점이다. 본 논문에서는 이러한 문제점들을 중심으로 외곽선 추적 알고리즘들의 성능을 분석하였다. 또한, ISBF의 시작 조건과 TPA의 인너코너 추적을 개선하는 기법들을 제안하여 이를 해결토록 하였다. 실험 결과 제안한 기법들은 외곽선 추적 성능을 개선하는데 효과적이었다.

  • PDF

A study on the Contour Extraction of the Scanned Image (스캔 영상의 외곽선 추출에 관한 연구)

  • 황호전;윤후병안동언정성종
    • Proceedings of the IEEK Conference
    • /
    • /
    • pp.967-970
    • /
    • 1998
  • 본 논문에서는 스캔 영상의 외곽선을 추출하기 위해, 경계선 검출값들의 공간적 특성을 이용하여, 경계선 검출 값들을 계산하였다. 그리고 경계선 검출 값들의 편차 정도에 따라 임계값을 결정 한 다음 스캔 영상의 외곽선을 추출하는 방법을 제시하였다.

  • PDF

A Study on Tracking Algorithm for Moving Object Using Partial Boundary Line Information (부분 외곽선 정보를 이용한 이동물체의 추척 알고리즘)

  • Jo, Yeong-Seok;Lee, Ju-Sin
    • The KIPS Transactions:PartB
    • /
    • v.8B no.5
    • /
    • pp.539-548
    • /
    • 2001
  • In this paper, we propose that fast tracking algorithm for moving object is separated from background, using partial boundary line information. After detecting boundary line from input image, we track moving object by using the algorithm which takes boundary line information as feature of moving object. we extract moving vector on the imput image which has environmental variation, using high-performance BMA, and we extract moving object on the basis of moving vector. Next, we extract boundary line on the moving object as an initial feature-vector generating step for the moving object. Among those boundary lines, we consider a part of the boundary line in every direction as feature vector. And then, as a step for the moving object, we extract moving vector from feature vector generated under the information of the boundary line of the moving object on the previous frame, and we perform tracking moving object from the current frame. As a result, we show that the proposed algorithm using feature vector generated by each directional boundary line is simple tracking operation cost compared with the previous active contour tracking algorithm that changes processing time by boundary line size of moving object. The simulation for proposed algorithm shows that BMA operation is reduced about 39% in real image and tracking error is less than 2 pixel when the size of feature vector is [$10{\times}5$] using the information of each direction boundary line. Also the proposed algorithm just needs 200 times of search operation bout processing cost is varies by the size of boundary line on the previous algorithm.

  • PDF

A Study on Effective Moving Object Segmentation and Fast Tracking Algorithm (효율적인 이동물체 분할과 고속 추적 알고리즘에 관한 연구)

  • Jo, Yeong-Seok;Lee, Ju-Sin
    • The KIPS Transactions:PartB
    • /
    • v.9B no.3
    • /
    • pp.359-368
    • /
    • 2002
  • In this paper, we propose effective boundary line extraction algorithm for moving objects by matching error image and moving vectors, and fast tracking algorithm for moving object by partial boundary lines. We extracted boundary line for moving object by generating seeds with probability distribution function based on Watershed algorithm, and by extracting boundary line for moving objects through extending seeds, and then by using moving vectors. We processed tracking algorithm for moving object by using a part of boundary lines as features. We set up a part of every-direction boundary line for moving object as the initial feature vectors for moving objects. Then, we tracked moving object within current frames by using feature vector for the previous frames. As the result of the simulation for tracking moving object on the real images, we found that tracking processing of the proposed algorithm was simple due to tracking boundary line only for moving object as a feature, in contrast to the traditional tracking algorithm for active contour line that have varying processing cost with the length of boundary line. The operations was reduced about 39% as contrasted with the full search BMA. Tracking error was less than 4 pixel when the feature vector was $(15\times{5)}$ through the information of every-direction boundary line. The proposed algorithm just needed 200 times of search operation.

Edge Restoration in Blurred Image using 1/4 Selective Filter (1/4 선택 필터를 이용한 번짐 영상의 외곽선 복원)

  • Jeong, Woo-Jin;Lee, Jong-Min;Kim, Chaeyoung;Moon, Young-Shik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.1
    • /
    • pp.103-110
    • /
    • 2015
  • In this paper, we propose a deblurring method using 1/4 selective filter. Deblurring methods require a lot of processing time for deblurring. In order to enhance execution speed, we propose a novel 1/4 selective filter. The proposed 1/4 selective filter restores major edge, but it distorts minor edge and texture. To solve this problem, we apply 1/4 selective filter to restore major edge and DOG(Difference of Gaussian) filter to restore minor edge and texture. Experimental results show that the proposed method removes the blur effectively.

Moving Object Segmentation using Space-oriented Object Boundary Linking and Background Registration (공간기반 객체 외곽선 연결과 배경 저장을 사용한 움직이는 객체 분할)

  • Lee Ho Suk
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.2
    • /
    • pp.128-139
    • /
    • 2005
  • Moving object boundary is very important for moving object segmentation. But the moving object boundary shows broken boundary We invent a novel space-oriented boundary linking algorithm to link the broken boundary The boundary linking algorithm forms a quadrant around the terminating pixel in the broken boundary and searches forward other terminating pixel to link within a radius. The boundary linking algorithm guarantees shortest distance linking. We also register the background from image sequence. We construct two object masks, one from the result of boundary linking and the other from the registered background, and use these two complementary object masks together for moving object segmentation. We also suppress the moving cast shadow using Roberts gradient operator. The major advantages of the proposed algorithms are more accurate moving object segmentation and the segmentation of the object which has holes in its region using these two object masks. We experiment the algorithms using the standard MPEG-4 test sequences and real video sequence. The proposed algorithms are very efficient and can process QCIF image more than 48 fps and CIF image more than 19 fps using a 2.0GHz Pentium-4 computer.

Determination of Physical Footprints of Buildings with Consideration Terrain Surface LiDAR Data (지표면 라이다 데이터를 고려한 건물 외곽선 결정)

  • Yoo, Eun Jin;Lee, Dong-Cheon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.34 no.5
    • /
    • pp.503-514
    • /
    • 2016
  • Delineation of accurate object boundaries is crucial to provide reliable spatial information products such as digital topographic maps, building models, and spatial database. In LiDAR(Light Detection and Ranging) data, real boundaries of the buildings exist somewhere between outer-most points on the roofs and the closest points to the buildings among points on the ground. In most cases, areas of the building footprints represented by LiDAR points are smaller than actual size of the buildings because LiDAR points are located inside of the physical boundaries. Therefore, building boundaries determined by points on the roofs do not coincide with the actual footprints. This paper aims to estimate accurate boundaries that are close to the physical boundaries using airborne LiDAR data. The accurate boundaries are determined from the non-gridded original LiDAR data using initial boundaries extracted from the gridded data. The similar method implemented in this paper is also found in demarcation of the maritime boundary between two territories. The proposed method consists of determining initial boundaries with segmented LiDAR data, estimating accurate boundaries, and accuracy evaluation. In addition, extremely low density data was also utilized for verifying robustness of the method. Both simulation and real LiDAR data were used to demonstrate feasibility of the method. The results show that the proposed method is effective even though further refinement and improvement process could be required.