• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.183-186
• /
• 2001

This paper for the method that automatically extracts moving object of the video image is presented. In order to extract moving object, it is that velocity vectors correspond to each frame of the video image. Using the estimated velocity vector, the position of the object are determined. the value of the coordination of the object is initialized to the seed, and in the image plane, the moving object is automatically segmented by the region growing method and tracked by the range of intensity and information about Position. As the result of an application in sequential images, it is available to extract a moving object.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.275-278
• /
• 2001

영상 분할은 임상에서의 진단과 분석 및 3차원 가시화하는데 있어 선행되어야 할 필수적인 과정이다. 본 논문에서는 심혈관계 영상의 분할을 위한 Wave-front SRG방법을 제안한다. 제안된 방법은 2차원 슬라이스 영상에서 사용자에 의한 씨앗점(seed front)을 입력으로 받아 그 이웃한 슬라이스들에 wave-front를 만들어 영역 성장법에 의해 3차원 volume을 확장시킨다. 이때 다음으로 성장할 wave-front voxel의 mean gradient 값을 사용하여 밝기값의 변화가 심한 심혈관계 영상을 분할하였으며, Wave-front voxel의 size를 계산하여 혈관분할 시 발생할 수 있는 작은 채널에서의 새나감을 방지하였다. 제안된 방법을 컴퓨터 단층촬영으로 얻은 심혈 관계 영상의 분할에 적용한 결과, 밝기값의 변화가 심한 심혈관계 영상을 성공적으로 분할했으며, 작의 채널의 새나감이 없이 분할을 수행하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.04a
• /
• pp.773-775
• /
• 2016

본 논문에서는 컴퓨터 비전 기술에서 중요하게 인식되고 있는 영상 분할 기법에 대해 분석한다. 사용자가 입력하는 표시 (seed) 정보를 이용하여 영상에서 중요한 객체를 추출하는 대표적인 알고리즘의 접근방식 및 차이점을 비교한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06c
• /
• pp.320-322
• /
• 2012

코 내부의 복잡한 기하학적 형상으로 인해 nasal airway의 분리는 많은 어려움을 겪고 있다. 본 논문은 velocimetry of nasal airflow 와 코 수술 계획을 위하여 3차원 공간에서 nasal airway를 interactive semiautomatic으로 분리하고 시각화하는 방법을 제안한다. 제안하는 방법은 ROI(Region-Of-Interest)와 multi-seed 3d region growing(MS3RG)기법을 적용하여 비강을 분리하며 볼륨렌더링 기법을 이용하여 분리된 영역을 3차원 공간에서 직관적으로 확인 할 수 있다. 또한 분리된 3차원 비강 모델은 유동흐름 실험을 위하여 3차원 프린터를 통해 실제 모형으로 제작 가능하다. 그리하여 CT dataset(512*512*175)을 가지고 매뉴얼 세그멘테이션에서 5시간 정도 걸리던 작업을 반자동 세그멘테이션 방법을 이용할 경우 최대 3분 이내에 분리 작업을 완료할 수 있으며 수치해석 실험 및 물리 실험에 이용할 수 있다.

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

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.4
• /
• pp.405-412
• /
• 2012

After the spatial discrepancy between SLI(Street-Level Imagery) and vector map is removed by their conflation, the corresponding building regions can be found based on SLI parameters. The building region correspondence, however, is not perfect even after the conflation. This paper aims to improve the correspondence of building regions by region splitting of an SLI. Regions are initialized by the seed lines, projection of building objects onto SLI scene. First, sky images are generated by filtering, segmentation, and sky region detection. Candidates for split lines are detected by edge detector, and then images are splitted into building regions by optimal split lines based on color difference and sky existence. The experiments demonstrated that the proposed region splitting method had improved the accuracy of building region correspondence from 83.3% to 89.7%. The result can be utilized effectively for enhancement of SLI services.

• Smart Media Journal
• /
• v.12 no.9
• /
• pp.28-37
• /
• 2023

The main factor affecting the decline in rice yield is damage caused by localized heavy rains or typhoons. The method of analyzing the rice lodging area is difficult to obtain objective results based on visual inspection and judgment based on field surveys visiting the affected area. it requires a lot of time and money. In this paper, we propose the method of estimation and diagnosis for rice lodging areas using a Vision Transformer-based Segformer for RGB images, which are captured by unmanned aerial vehicles. The proposed method estimates the lodging, normal, and background area using the Segformer model, and the lodging rate is diagnosed through the rice field inspection criteria in the seed industry Act. The diagnosis result can be used to find the distribution of the rice lodging areas, to show the trend of lodging, and to use the quality management of certified seed in government. The proposed method of rice lodging area estimation shows 98.33% of mean accuracy and 96.79% of mIoU.

• International Journal of CAD/CAM
• /
• v.5 no.1
• /
• pp.19-27
• /
• 2005

As three-dimensional range scanners make large point clouds a more common initial representation of real world objects, a need arises for algorithms that can efficiently process point sets. In this paper, we present a method for extracting smooth surfaces from dense point clouds. Given an unorganized set of points in space as input, our algorithm first uses principal component analysis to estimate the surface variation at each point. After defining conditions for determining the geometric compatibility of a point and a surface, we examine the points in order of increasing surface variation to find points whose neighborhoods can be closely approximated by a single surface. These neighborhoods become seed regions for region growing. The region growing step clusters points that are geometrically compatible with the approximating surface and refines the surface as the region grows to obtain the best approximation of the largest number of points. When no more points can be added to a region, the algorithm stores the extracted surface. Our algorithm works quickly with little user interaction and requires a fraction of the memory needed for a standard mesh data structure. To demonstrate its usefulness, we show results on large point clouds acquired from real-world objects.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5563-5582
• /
• 2016

Parametric min-cuts is an object proposal algorithm, which can be used for accurate image segmentation. In parametric min-cuts, foreground seeds generation plays an important role since the number and quality of foreground seeds have great effect on its efficiency and accuracy. To improve the performance of parametric min-cuts, this paper proposes a new framework for foreground seeds generation. First, to increase the odds of finding objects, saliency detection at multiple scales is used to generate a large set of diverse candidate seeds. Second, to further select good-quality seeds, a two-stage cascaded ranking classifier is used to filter and rank the candidates based on their appearance features. Experimental results show that parametric min-cuts using our seeding strategy can obtain a relative small pool of proposals with high accuracy.

• The KIPS Transactions:PartB
• /
• v.14B no.6
• /
• pp.453-460
• /
• 2007

In this paper, we present a method to extract the text lines in poorly structured documents. The text lines may have different orientations, considerably curved shapes, and there are possibly a few wide inter-word gaps in a text line. Those text lines can be found in posters, blocks of addresses, artistic documents. Our method based on the traditional perceptual grouping but we develop novel solutions to overcome the problems of insufficient seed points and vaned orientations un a single line. In this paper, we assume that text lines contained tone connected components, in which each connected components is a set of black pixels within a letter, or some touched letters. In our scheme, the connected components closer than an iteratively incremented threshold will make together a chain. Elongate chains are identified as the seed chains of lines. Then the seed chains are extended to the left and the right regarding the local orientations. The local orientations will be reevaluated at each side of the chains when it is extended. By this process, all text lines are finally constructed. The proposed method is good for extraction of the considerably curved text lines from logos and slogans in our experiment; 98% and 94% for the straight-line extraction and the curved-line extraction, respectively.