• Title/Summary/Keyword: 교점

Search Result 127, Processing Time 0.018 seconds

THE SELECTION OF ALTITUDE AND INCLINATION FOR REMOTE SENSING SATELLITES (원격탐사 위성의 고도와 궤도기울기 결정)

  • 이정숙;이병선
    • Journal of Astronomy and Space Sciences
    • /
    • v.12 no.2
    • /
    • pp.244-255
    • /
    • 1995
  • The success of a satellites mission is largely depended upon the choice of an appropriate orbit. In the case of a remote sensing satellite which observes the Earth, there exits an optimum solar elevation angle depending on the mission. Therefore a sun-synchronous orbit is suitable for a remote sensing mission. The second-order theory for secular perturbation due to non-symmetric geopotential was described. To design a sun-synchronous orbit, a constraint condition on regression of node was derived. A algorithm to determine the altitude and the inclination was introduced using this constraint condition. As practical examples, the altitudes and the inclinations of four remote sensing satellites were calculated. The ground tracks obtained by the orbit propagator were used to verify the resulting sun-synchronous orbital elements.

  • PDF

An Algorithm for Preventing Data Loss in Hand-off between Packet Networks of 3GPPx (3GPPx 패킷망간 핸드오프 시 데이터 유실 방지 알고리즘)

  • Choi Seung-Kwon;Ryu Jae-Hong;Ji Hong-IL;Hwang Byeong-Seon;Cho Young-Hwan
    • The Journal of the Korea Contents Association
    • /
    • v.5 no.3
    • /
    • pp.237-242
    • /
    • 2005
  • In this paper, a fast handoff algorithm between PDSNs in 3GPPx network for a mobile node, is proposed. It introduces a method by which handoff can be performed without reestablishing PPP connection that may occur in the process of performing handoff between PDSNs. When the PDSN recognizes the mobile node moving into its coverage area, it can quickly establish a communication channel with the mobile node based on the already received subscriber information. As a result, handoff is performed without reestablishing PPP. Accordingly, handoff between PDSNs can be performed faster, removing time needed for establishing a PPP session with a terminal and for terminating a previously set up PPP session.

  • PDF

Development of Precise Vectorizing Tools for Digitization of Cadastral Maps (지적도면 수치화를 위한 정밀 벡터라이징 도구 개발)

  • 정재준;오재홍;김용일
    • Spatial Information Research
    • /
    • v.8 no.1
    • /
    • pp.69-83
    • /
    • 2000
  • Cadastral map is the basic data that prescribe a lot number, the classification of land category, a boundary and ownerships of the parcels. Because the analogue cadastral map is not appropriate for the Parcel Based Land Information System, computerization of cadastral map is needed. When considering other automatic vectorizing softwares, we conclude that they can not satisfy the accuracy needed in cadastral map. Also screen digitizing methods demand lots of time. So we developed semi-automatic vectorizing program that realized almost capacities, such as overlay display which is needed for screen digitizing , window link, vector file generation , and so forth. As comparing screen digitizing method using AutoCAD with our developed program, we could obtain not only almost same accuracy , but also 35 minute reduction in vectorizing.

  • PDF

A Study on the Hair Line detection Using Feature Points Matching in Hair Beauty Fashion Design (헤어 뷰티 패션 디자인 선별을 위한 특징 점 정합을 이용한 헤어 라인 검출)

  • 송선희;나상동;배용근
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.5
    • /
    • pp.934-940
    • /
    • 2003
  • In this paper, hair beauty fashion design feature points detection system is proposed. A hair models and hair face is represented as a graph where the nodes are placed at facial feature points labeled by their Gabor features and the edges are describes their spatial relations. An innovative flexible feature matching is proposed to perform features correspondence between hair models and the input image. This matching hair model works like random diffusion process in the image space by employing the locally competitive and globally corporative mechanism. The system works nicely on the face images under complicated background. pose variations and distorted by accessories. We demonstrate the benefits of our approach by its implementation on the face identification system.

Development and Validation of HAUSAT-2 Nanosatellite EPS (HAUSAT-2 위성의 전력계 개발 및 검증)

  • Kim, Dong-Un;Jang, Yeong-Geun;Mun, Byeong-Yeong
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.34 no.4
    • /
    • pp.89-101
    • /
    • 2006
  • This paper addresses Electrical Power Subsystem(EPS) design and verification of HAUSAT-2 small satellite through energy balance analysis(EBA) depending on individual operation modes. GaAs solar cells are used for satellite power generation and digital peak power tracking is implemented for EPS architecture. One battery pack is consisted of 4 Li-Ion cells. Battery charge is accomplished by peak power tracker and battery charge regulator. Power conditioning assembly uses three DC-DC converters, and power distribution assembly which consists of commercial IC and MOSFET switch distributes power to subsystems and payloads. The altitude of 650km and sun-synchronous LEO with various local time ascending node(LTAN) are considered in EBA.

LA-ICP-MS U-Pb Zircon Age of the Hongjesa Granite in the Northeast Yeongnam Massif (영남육괴 북동부 홍제사 화강암의 LA-ICP-MS U-Pb 저콘 연대)

  • Lee, Ho-Sun;Park, Kye-Hun;Song, Yong-Sun;Kim, Nam-Hoon;Yuji, Orihashi
    • The Journal of the Petrological Society of Korea
    • /
    • v.19 no.1
    • /
    • pp.103-108
    • /
    • 2010
  • U-Pb zircon age for the Hongjesa granite, in the northeast Yeongnam massif, was determined using LA-ICP-MS. We obtained upper intercept age of $2013^{+30}/_{-24}(2{\sigma})$ Ma, indicating Paleoproterozoic granitic magmatism together with the Buncheon and Pyeonghae granite gneisses of the region.

Estimating illuminant color using the light locus for camera and highlight on the image (카메라의 조명궤적과 광휘점을 이용한 조명색 추정)

  • Park, Du-Sik;Kim, Chang-Yeong;Seo, Yang-Seock
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.10
    • /
    • pp.94-102
    • /
    • 1999
  • In this paper, an algorithm for estimating the scene-illuminant color directly from an image is proposed. To determine the scene-illuminant color in the image. the intersection point between the light locus of camera (CCD) reponses and an approximated lines for the cluster of pixels in a highlight area on chromaticity coordinates is used. By using the predetermined characteristics of the used camera for some illuminants, this algorithm allows us to obtain more accurate estimation of the scene-illuminatnt color from a captured image than that the previous methods provide.

  • PDF

A Planar Curve Intersection Algorithm : The Mix-and-Match of Curve Characterization, Subdivision , Approximation, Implicitization, and Newton iteration (평면 곡선의 교점 계산에 있어 곡선 특성화, 분할, 근사, 음함수화 및 뉴턴 방법을 이용한 Mix-and-Mntch알고리즘)

  • 김덕수;이순웅;유중형;조영송
    • Korean Journal of Computational Design and Engineering
    • /
    • v.3 no.3
    • /
    • pp.183-191
    • /
    • 1998
  • There are many available algorithms based on the different approaches to solve the intersection problems between two curves. Among them, the implicitization method is frequently used since it computes precise solutions fast and is robust in lower degrees. However, once the degrees of curves to be intersected are higher than cubics, its computation time increases rapidly and the numerical stability gets worse. From this observation, it is natural to transform the original problem into a set of easier ones. Therefore, curves are subdivided appropriately depending on their geometric behavior and approximated by a set of rational quadratic Bezier cures. Then, the implicitization method is applied to compute the intersections between approximated ones. Since the solutions of the implicitization method are intersections between approximated curves, a numerical process such as Newton-Raphson iteration should be employed to find true intersection points. As the seeds of numerical process are close to a true solution through the mix-and-match process, the experimental results illustrates that the proposed algorithm is superior to other algorithms.

  • PDF

Image segmentation Using Hybrid Level Set (하이브리드 레벨 셋을 이용한 이미지 분할)

  • Joo Ki-See;Kim Eun-Seok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.7
    • /
    • pp.1453-1463
    • /
    • 2004
  • The conventional image segmentation method using level set has been disadvantage since level set function in the gradient-based model evolves depending on the local profile of the edge. In this paper, a new model is introduced by hybridizing level set formulation and complementary smooth function in order to smooth the driving force. We consider an alternative way of getting the complementary function(CF) which is much easier to simulate and makes sense for most cases having no triple junctions. The rule of thumb is that CF must be computed such that the difference between their average and the original CF function should be able to introduce a reliable driving force for the evolution of the level set function. This proposed hybrid method tries to minimize drawbacks the conventional level set method.

A Flexible Feature Matching for Automatic face and Facial feature Points Detection (얼굴과 얼굴 특징점 자동 검출을 위한 탄력적 특징 정합)

  • 박호식;손형경;정연길;배철수
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.05a
    • /
    • pp.608-612
    • /
    • 2002
  • An automatic face and facial feature points(FFPs) detection system is proposed. A face is represented as a graph where the nodes are placed at facial feature points(FFPs) labeled by their Gabor features md the edges are describes their spatial relations. An innovative flexible feature matching is proposed to perform features correspondence between models and the input image. This matching model works likes random diffusion process in the image spare by employing the locally competitive and globally corporative mechanism. The system works nicely on the face images under complicated background, pose variations and distorted by facial accessories. We demonstrate the benefits of our approach by its implementation on the fare identification system.

  • PDF