• Title/Summary/Keyword: Contour

Search Result 2,767, Processing Time 0.035 seconds

A Multiple Branching Algorithm of Contour Triangulation by Cascading Double Branching Method (이중분기 확장을 통한 등치선 삼각화의 다중분기 알고리즘)

  • Choi, Young-Kyu
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.2
    • /
    • pp.123-134
    • /
    • 2000
  • This paper addresses a new triangulation method for constructing surface model from a set of wire-frame contours. The most important problem of contour triangulation is the branching problem, and we provide a new solution for the double branching problem, which occurs frequently in real data. The multiple branching problem is treated as a set of double branchings and an algorithm based on contour merging is developed. Our double branching algorithm is based on partitioning of root contour by Toussiant's polygon triangulation algorithml[14]. Our double branching algorithm produces quite natural surface model even if the branch contours are very complicate in shape. We treat the multiple branching problem as a problem of coarse section sampling in z-direction, and provide a new multiple branching algorithm which iteratively merge a pair of branch contours using imaginary interpolating contours. Our method is a natural and systematic solution for the general branching problem of contour triangulation. The result shows that our method works well even though there are many complicated branches in the object.

  • PDF

Video Segmentation using the Level Set Method (Level Set 방법을 이용한 영상분할 알고리즘)

  • 김대희;호요성
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.5
    • /
    • pp.303-311
    • /
    • 2003
  • Since the MPEG-4 visual standard enables content-based functionalities, it is necessary to extract video object from natural video sequences. Segmentation algorithms can largely be classified into automatic segmentation and user-assisted segmentation. In this paper, we propose a user-assisted VOP generation method based on the geometric active contour. Since the geometric active contour, unlike the parametric active contour, employs the level set method to evolve the curve, we can draw the initial curve independent of the shape of the object. In order to generate the edge function from a smoothed image, we propose a vector-valued diffusion process in the LUV color space. We also present a discrete 3-D diffusion model for easy implementation. By combining the curve shrinkage in the vector field space with the curve expansion in the empty vector space, we can make accurate extraction of visual objects from video sequences.

A Two-Step Vertex Selection Method for Minimizing Polygonal Approximation Error (다각형 근사 오차를 최소화하기 위한 2단계 정점 선택 기법)

  • 윤병주;이훈철;고윤호;이시웅;김성대
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.6
    • /
    • pp.114-123
    • /
    • 2003
  • The current paper proposes a new vertex selection scheme for polygon-based contour coding. To efficiently characterize the shape of an object, we incorporate the curvature information in addition to the conventional maximum distance criterion in vertex selection process. The proposed method consists of "two-step procedure." At first, contour pixels of high curvature value are selected as key vortices based on the curvature scale space (CSS), thereby dividing an overall contour into several contour-segments. Each segment is considered as an open contour whose end points are two consecutive key vortices and is processed independently. In the second step, vertices for each contour segment are selected using progressive vertex selection (PVS) method in order to obtain minimum number of vertices under the given maximum distance criterion ( $D_{max}$$^{*}$). Furthermore, the obtained vortices are adjusted using the dynamic programming (DP) technique to optimal positions in the error area sense. Experimental results are presented to compare the approximation performances of the proposed and conventional methods.imation performances of the proposed and conventional methods.

Adaptive prototype generating technique for improving performance of a p-Snake (p-Snake의 성능 향상을 위한 적응 원형 생성 기법)

  • Oh, Seung-Taek;Jun, Byung-Hwan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.4
    • /
    • pp.2757-2763
    • /
    • 2015
  • p-Snake is an energy minimizing algorithm that applies an additional prototype energy to the existing Active Contour Model and is used to extract the contour line in the area where the edge information is unclear. In this paper suggested the creation of a prototype energy field that applies a variable prototype expressed as a combination of circle and straight line primitives, and a fudge function, to improve p-Snake's contour extraction performance. The prototype was defined based on the parts codes entered and the appropriate initial contour was extracted in each primitive zones acquired from the pre-processing process. Then, the primitives variably adjusted to create the prototype and the contour probability based on the distance to the prototype was calculated through the fuzzy function to create the prototype energy field. This was applied to p-Snake to extract the contour from 100 images acquired from various small parts and compared its similarity with the prototype to find that p-Snake made with the adaptive prototype was about 4.6% more precise than the existing Snake method.

Preprocessing Algorithm of Cell Image Based on Inter-Channel Correlation for Automated Cell Segmentation (자동 세포 분할을 위한 채널 간 상관성 기반 세포 영상의 전처리 알고리즘)

  • Song, In-Hwan;Han, Chan-Hee;Lee, Si-Woong
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.5
    • /
    • pp.84-92
    • /
    • 2011
  • The automated segmentation technique of cell region in Bio Images helps biologists understand complex functions of cells. It is mightly important in that it can process the analysis of cells automatically which has been done manually before. The conventional methods for segmentation of cell and nuclei from multi-channel images consist of two steps. In the first step nuclei are extracted from DNA channel, and used as initial contour for the second step. In the second step cytoplasm are segmented from Actin channel by using Active Contour model based on intensity. However, conventional studies have some limitation that they let the cell segmentation performance fall by not considering inhomogeneous intensity problem in cell images. Therefore, the paper consider correlation between DNA and Actin channel, and then proposes the preprocessing algorithm by which the brightness of cell inside in Actin channel can be compensated homogeneously by using DNA channel information. Experiment result show that the proposed preprocessing method improves the cell segmentation performance compared to the conventional method.

Comparison and Evaluation on DEM Error by the Resolution of Airborne Laser Scanning Data (항공레이저 측량 자료의 해상도에 따른 DEM 오차 비교평가 연구)

  • Lee, Geun-Sang;Koh, Deuk-Koo;Chae, Hyo-Seok;Shin, Young-Ho
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.6 no.3
    • /
    • pp.33-42
    • /
    • 2003
  • As airborne laser scanning technique is developed with high vertical accuracy recently, there come many studies on DEM(digital elevation model creation, building extraction, flood risk mapping and 3D virtual city modeling. This study applied point comparative method, contour comparative method and digital map with scale 1/5,000 to calculate RMSE of DEM in according to resolution that was constructed using rawdata being acquired by airborne laser scanning. As a result, point comparative method showed lower DEM standard error than contour comparative method, it is a reason that contour comparative method was not carried out detailed grid calculation for point comparative method. Also, digital map with scale 1/5,000 showed higher DEM standard error than point comparative method and contour comparative method in below 25.4m that is average horizontal distance among contour line, and showed similar result with contour comparative method in over 25.4m.

  • PDF

East Reconstruction of 3D Human Model from Contour Lines (외곽선을 이용한 고속 3차원 인체모델 재구성)

  • Shin Byeong-Seok;Roh Sung;Jung Hoe-Sang;Chung Min Suk;Lee Yong Sook
    • Journal of Biomedical Engineering Research
    • /
    • v.25 no.6
    • /
    • pp.537-543
    • /
    • 2004
  • In order to create three-dimensional model for human body, a method that reconstructs geometric models from contour lines on cross-section images is commonly used. We can get a set of contour lines by acquiring CT or MR images and segmenting anatomical structures. Previously proposed method divides entire contour line into simply matched regions and clefts. Since long processing time is required for reconstructing cleft regions, its performance might be degraded when manipulating complex data such as cross-sections for human body. In this paper, we propose a fast reconstruction method. It generates a triangle strip with single tiling operation for simple region that does not contain branch structures. If there exist branches in contour lines, it partitions the contour line into several sub-contours by considering the number of vertices and their spatial distribution. We implemented an automatic surface reconstruction system by using our method which reconstructs three-dimensional models for anatomical structures.

Energy Minimization Model for Pattern Classification of the Movement Tracks (행동궤적의 패턴 분류를 위한 에너지 최소화 모델)

  • Kang, Jin-Sook;Kim, Jin-Sook;Cha, Eul-Young
    • The KIPS Transactions:PartB
    • /
    • v.11B no.3
    • /
    • pp.281-288
    • /
    • 2004
  • In order to extract and analyze complex features of the behavior of animals in response to external stimuli such as toxic chemicals, we implemented an adaptive computational method to characterize changes in the behavior of chironomids in response to treatment with the insecticide, diazinon. In this paper, we propose an energy minimization model to extract the features of response behavior of chironomids under toxic treatment, which is applied on the image of velocity vectors. It is based on the improved active contour model and the variations of the energy functional, which are produced by the evolving active contour. The movement tracks of individual chironomid larvae were continuously measured in 0.25 second intervals during the survey period of 4 days before and after the treatment. Velocity on each sample track at 0.25 second intervals was collected in 15-20 minute periods and was subsequently checked to effectively reveal behavioral states of the specimens tested. Active contour was formed around each collection of velocities to gradually evolve to find the optimal boundaries of velocity collections through processes of energy minimization. The active contour which is improved by T. Chan and L. Vese is used in this paper. The energy minimization model effectively revealed characteristic patterns of behavior for the treatment versus no treatment, and identified changes in behavioral states .is the time progressed.

A Development of lidar data Filtering for Contour Generation (등고선 제작을 위한 라이다 데이터의 필터링 알고리즘 개발 및 적용)

  • Wie, Gwang-Jae;Kim, Eun-Young;Kang, In-Gu;Kim, Chang-Woo
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.27 no.4
    • /
    • pp.469-476
    • /
    • 2009
  • The new laser scanning technology allows to attain 3D information faster with higher accuracy on surface ground, vegetation and buildings of the earth surface. This acquired information can be used in many areas after modifying them appropriately by users. The contour production for accurate landform is an advanced technology that can reveal the mountain area landscapes hidden by the trees in detail. However, if extremely precise LiDAR data is used in constructing the contour, massive-sized data intricates the contour diagram and could amplify the data size inefficiently. This study illustrates the algorithm producing contour that is filtered in stages for more efficient utilization using the LiDAR contour produced by the detailed landscape data. This filtering stages allow to preserve the original landscape shape and to keep the data size small. Point Filtering determines the produced contour diagram shape and could minimize data size. Thus, in this study we compared experimentally filtered contour with the current digital map(1:5,000).