• Title/Summary/Keyword: Boundary extraction

Search Result 306, Processing Time 0.031 seconds

A Study on Tracking a Moving Object using Photogrammetric Techniques - Focused on a Soccer Field Model - (사진측랑기법을 이용한 이동객체 추적에 관한 연구 - 축구장 모형을 중심으로 -)

  • Bae Sang-Keun;Kim Byung-Guk;Jung Jae-Seung
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.24 no.2
    • /
    • pp.217-226
    • /
    • 2006
  • Extraction and tracking objects are fundamental and important steps of the digital image processing and computer vision. Many algorithms about extracting and tracking objects have been developed. In this research, a method is suggested for tracking a moving object using a pair of CCD cameras and calculating the coordinate of the moving object. A 1/100 miniature of soccer field was made to apply the developed algorithms. After candidates were selected from the acquired images using the RGB value of a moving object (soccer ball), the object was extracted using its size (MBR size) among the candidates. And then, image coordinates of a moving object are obtained. The real-time position of a moving object is tracked in the boundary of the expected motion, which is determined by centering the moving object. The 3D position of a moving object can be obtained by conducting the relative orientation, absolute orientation, and space intersection of a pair of the CCD camera image.

Extraction of Brain Boundary and Direct Volume Rendering of MRI Human Head Data (MR머리 영상의 뇌 경계선 추출 및 디렉트 볼륨 렌더링)

  • Song, Ju-Whan;Gwun, Ou-Bong;Lee, Kun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.6
    • /
    • pp.705-716
    • /
    • 2002
  • This paper proposes a method which visualizes MRI head data in 3 dimensions with direct volume rendering. Though surface rendering is usually used for MRI data visualization, it has some limits of displaying little speckles because it loses the information of the speckles in the surfaces while acquiring the information. Direct volume rendering has ability of displaying little speckles, but it doesn't treat MRI data because of the data features of MRI. In this paper, we try to visualize MRI head data in 3 dimensions as follows. First, we separate the brain region from the head region of MRI head data, next increase the pixel level of the brain region, then combine the brain region with the increased pixel level and the head region without brain region, last visualizes the combined MRI head data with direct volume rendering. We segment the brain region from head region based on histogram threshold, morphology operations and snakes algorithm. The proposed segmentation method shows 91~95% similarity with a hand segmentation. The method rather clearly visualizes the organs of the head in 3 dimensions.

3D Model Retrieval Using Geometric Information (기하학 정보를 이용한 3차원 모델 검색)

  • Lee Kee-Ho;Kim Nac-Woo;Kim Tae-Yong;Choi Jong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.10C
    • /
    • pp.1007-1016
    • /
    • 2005
  • This paper presents a feature extraction method for shape based retrieval of 3D models. Since the feature descriptor of 3D model should be invariant to translation, rotation and scaling, it is necessary to preprocess the 3D models to represent them in a canonical coordinate system. We use the PCA(Principal Component Analysis) method to preprocess the 3D models. Also, we apply that to make a MBR(Minimum Boundary Rectangle) and a circumsphere. The proposed algorithm is as follows. We generate a circumsphere around 3D models, where radius equals 1(r=1) and locate each model in the center of the circumsphere. We produce the concentric spheres with a different radius($r_i=i/n,\;i=1,2,{\ldots},n$). After looking for meshes intersected with the concentric spheres, we compute the curvature of the meshes. We use these curvatures as the model descriptor. Experimental results numerically show the performance improvement of proposed algorithm from min. 0.1 to max. 0.6 in comparison with conventional methods by ANMRR, although our method uses .relatively small bins. This paper uses $R{^*}-tree$ as the indexing.

Design of MMIC SPST Switches Using GaAs MESFETs (GaAs MESFET을 이용한 MMIC SPST 스위치 설계)

  • 이명규;윤경식;형창희;김해천;박철순
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.4C
    • /
    • pp.371-379
    • /
    • 2002
  • In this paper, the MMIC SPST switches operating from DC to 3GHz were designed and implemented. Prior to the design of switches, the small and large-signal switch models were needed to predict switch performance accurately. The newly proposed small-signal switch model parameters were extracted from measured S-parameters using optimization technique with estimated initial values and boundary limits. In the extraction of large-signal switch model parameters, the current source was modeled by fitting empirical equations to measured DC data and the charge model was derived from extracted channel capacitances from measured S-parameters varying the drain-source voltage. To design basic series-shunt SPST switches and isolation-improved SPST switches, we applied this model to commercial microwave circuit simulator. The improved SPST switches exhibited 0.302dB insertion loss, 35.762dB isolation, 1.249 input VSWR, 1.254 output VSWR, and about 15.7dBm PldB with 0/-3V control voltages at 3GHz.

Detection of Gradual Scene Boundaries with Linear and Circular Moving Borders (선형 및 원형의 이동경계선을 가지는 점진적 장면경계 추출)

  • Jang, Seok-Woo;Cho, Sung-Youn
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.4
    • /
    • pp.41-49
    • /
    • 2012
  • This paper proposes a detection method of wipes including horizontal wipes with linear moving borders, such as horizontal or vertical wipes, Barn Doors, and Iris Rounds with circular moving borders. The suggested method first obtains a difference image between two adjacent frames, and extracts lines and circles by applying Hough transformation to the extracted difference image. Then, we detect wipe transitions by employing an evaluation function that analyzes the number of moving trajectories of lines or circles, their moving direction and magnitude. To evaluate the performance of the suggested algorithm, experimental results show that the proposed method can effectively detect wipe transitions with linear and circular moving borders rather than some existing methods.

Texture Analysis Algorithm and its Application to Leather Automatic Classification Inspection System (텍스처 분석 알고리즘과 피혁 자동 선별 시스템에의 응용)

  • 김명재;이명수;권장우;김광섭;길경석
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.10a
    • /
    • pp.363-366
    • /
    • 2001
  • The present process of grading leather quality by the rare eyes is not reliable. Because inconsistency of grading due to eyes strain for long time can cause incorrect result of grading. Therefore it is necessary to automate the process of grading quality of leather based on objective standard for it. In this paper, leather automatic classification system consists of the process obtaining the information of leather and the process grading the quality of leather from the information. Leather is graded by its information such as texture density, types and distribution of defects. This paper proposes the algorithm which sorts out leather information like texture density and defects from the gray-level images obtained by digital camera. The density information is sorted out by the distribution value of Fourier spectrum which comes out after original image is converted to the image in frequency domain. And the defect information is obtained by the statistics of pixels which is relevant to Window using searching Window after sort out boundary lines from preprocessed images. The information for entire leather is used as standard of grading leather quality, and the proposed algorithm is practically applied to machine vision system.

  • PDF

Real-Time Foreground Segmentation and Background Substitution for Protecting Privacy on Visual Communication (화상 통신에서의 사생활 보호를 위한 실시간 전경 분리 및 배경 대체)

  • Bae, Gun-Tae;Kwak, Soo-Yeong;Byun, Hye-Ran
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.5C
    • /
    • pp.505-513
    • /
    • 2009
  • This paper proposes a real-time foreground segmentation and background substitution method for protecting the privacy on visual communication. Previous works on this topic have some problems with the color and shape of foreground and the capture device such as stereo camera. we provide a solution which can segment the foreground in real-time using fixed mono camera. For improving the performance of a foreground extraction, we propose the Temporal Foreground Probability Model (TFPM) by modeling temporal information of a video. Also we provide an boundary processing method for natural and smooth synthesizing that using alpha matte and simple post-processing method.

Lane Detection Algorithm using Morphology and Color Information (형태학과 색상 정보를 이용한 차선 인식 알고리즘)

  • Bae, Chan-Su;Lee, Jong-Hwa;Cho, Sang-Bock
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.48 no.6
    • /
    • pp.15-24
    • /
    • 2011
  • As increase awareness of intelligent vehicle systems, many kinds of lane detection algorithm have been proposed. General boundary extraction method can bring good result in detection of lane on the road. But a shadow on the road, or other boundaries, such as horizontal lines can be detected. The method using morphological operations was used to extract information about Lane. By applying HSV color model for color information of lane, the candidate of the lane can be extracted. In this paper, the lane detection region was set by Hough transformation using the candidate of the lane. By extracting lane markings on the lane detection region, lane detection method can bring good result.

AUTOMATIC DETECTION AND EXTRACTION ALGORITHM OF INTER-GRANULAR BRIGHT POINTS

  • Feng, Song;Ji, Kai-Fan;Deng, Hui;Wang, Feng;Fu, Xiao-Dong
    • Journal of The Korean Astronomical Society
    • /
    • v.45 no.6
    • /
    • pp.167-173
    • /
    • 2012
  • Inter-granular Bright Points (igBPs) are small-scale objects in the Solar photosphere which can be seen within dark inter-granular lanes. We present a new algorithm to automatically detect and extract igBPs. Laplacian and Morphological Dilation (LMD) technique is employed by the algorithm. It involves three basic processing steps: (1) obtaining candidate "seed" regions by Laplacian; (2) determining the boundary and size of igBPs by morphological dilation; (3) discarding brighter granules by a probability criterion. For validating our algorithm, we used the observed samples of the Dutch Open Telescope (DOT), collected on April 12, 2007. They contain 180 high-resolution images, and each has a $85{\times}68\;arcsec^2$ field of view (FOV). Two important results are obtained: first, the identified rate of igBPs reaches 95% and is higher than previous results; second, the diameter distribution is $220{\pm}25km$, which is fully consistent with previously published data. We conclude that the presented algorithm can detect and extract igBPs automatically and effectively.

Use Case Diagram Extraction Technique from Requirements Specification (요구사항 기술서로부터 유스케이스 다이어그램의 추출기법)

  • Yu, Cheol-Jung;Jeong, So-Yeong
    • The KIPS Transactions:PartD
    • /
    • v.9D no.4
    • /
    • pp.639-650
    • /
    • 2002
  • We have to carry out systematic, definite requirements analysis for the successful development of software. The UML gives the ways to grasp user or customer requirements and decide the boundary of business systems from the use case modeling. This paper presents how to extract use case diagram from the requirements specification systematically by applying the standardized rules as a part of the study for use case modeling. We modify requirements specification by applying $R_{RS}$ (Rules for Requirements Specification) and extract actor, use case, relationship by applying $R_{A}$(Rules for Actors), $R_{U}$(Rules for Use Cases) and $R_{R}$(Rules for Relationships) to the modified requirements specification separately and then become to make out use case diagram in the end. By applying the rules presented in this paper to the requirements specification for personnel management, we can reduce the existing difficulties of extracting use case diagram based on the narrative descriptions without any standardized rules.rules.