• Title/Summary/Keyword: 좌표화

Search Result 616, Processing Time 0.029 seconds

Analysis of the Radiation Pattern of a Microstrip Array Antenna on a Non-Planar Surface by using FOURIER TRANSFORM (FOURIER TRANSFORM을 이용한 비평면형 마이크로스트립 어레이 안테나의 복사패턴 해석)

  • 고광태;구연건
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.15 no.9
    • /
    • pp.785-795
    • /
    • 1990
  • For the far field radiation pattern of a microstrip array antenna which is conformed to a cylindrical surface and forms an arc array, an approximate analysis method using FOURIER TRANSFORM is presented. In this method, the conformal array antenna is projected on the effective aperture plane and assumed to be an aperiodic array with nonlinear phase tilt. The effective aperture plane includes four end-points of each arc on the cylindrical surface. When the effective aperture ratio which is normalized to the planar type is from 1.0 to 0.9, it is confirmed that this approximate method is valid. To the array on the effective aperture plane, it is assumed that the phase tilt is due to the distance between aperture plne and curvature surface. Specially, when the radius of arc is more than 5 times to its length, the FOURIER TRANSFORM METHOD could be used with only varying scale factors. The results of calculating by approximate method are good agreement with the results of COORDINATE TRANSFORM METHOD and experimentally measured value in the range of -40dB. And, the difference of half power angle is less than 5 degrees when the effective aperture ratio moer than 0.9.

  • PDF

Design and Implementation of Object Reusing Methods for Mobile Vector Map Services (모바일 벡터 지도 서비스를 위한 객체 재사용 기법의 설계 및 구현)

  • Kim, Jin-Deog;Choi, Jin-Oh
    • The KIPS Transactions:PartD
    • /
    • v.10D no.3
    • /
    • pp.359-366
    • /
    • 2003
  • Although the reuse of the cached data for scrolling the map reduces the amount of passed data between client and server, it needs the conversions of data coordinates, selective deletion of objects, cache compaction and object structuring step in the clients. The conversion is a time- intensive operation due to limited resources of mobile phones such as low computing power, small memory. Therefore, in order to control the map efficiently in the vector map service based mobile phones, it is necessary to study the methods which reuse cached objects for reducing wireless network bandwidth and overwhelming the limited resources of mobile phones as well. This paper proposes the methods of reusing pre-received spatial objects for map control in the mobile vector map service system based on client-server architecture. The experiments conducted on the Web GIS systems with real data show that the proposed method is appropriate to map services for mobile phone. We also analyze the advantages and drawbacks between the reuse of cached data and transmission of raw data respectively.

Application for en-Route mission to Decentralized Task Allocation (경로가 주어진 임무 상황에서 분산 임무할당 알고리즘의 적용 방안 연구)

  • Kim, Sung-Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.7
    • /
    • pp.156-161
    • /
    • 2020
  • In an environment that operates multiple UAVs, the use of a decentralized task allocation algorithm has more robustness from a single failure of UAV on the mission because there is no central command center. In addition, UAVs have situational awareness and redistribute tasks among themselves, which can expand the mission range. The use of multiple UAVs in a mission has increased as the agent hardware has decreased in size and cost. The decentralized mission-planning algorithm has the advantages of a larger mission range and robustness to a single failure during the mission. This paper extended the type of mission the uses CBBA, which is the most well-known decentralized task allocation algorithm, to the point mission and en-route mission. This will describe the real mission situation that has the purpose of surveillance. A Monte-Carlo simulation was conducted in the case of multiple agents in the task-rich environment, and the global rewards of each case were compared.

A Study on Buckling Behavior of Shallow Circular Arches (낮은 원호아치의 좌굴거동에 대한 연구)

  • 김연태;허택녕;오순택
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.2 no.2
    • /
    • pp.87-94
    • /
    • 1998
  • Behavioral characteristics of shallow circular arches with dynamic loading and different end conditions are analysed. Geometric nonlinearity is modelled using Lagrangian description of the motion. The finite element analysis procedure is used to solve the dynamic equation of motion, and the Newmark method is adopted in the approximation of time integration. The behavior of arches is analysed using the buckling criterion and non-dimensional time, load and shape parameters which Humphreys suggested. But a new deflection-ratio formula including the effect of horizontal displacement plus vertical displacement is presented to apply for the non-symmetric buckling problems. Through the model analysis, it's confirmed that fix-ended arches have higher buckling stability than hinge-ended arches, and arches with the same shape parameter have the same deflection ratio at the same time parameter when loaded with the same parametric load.

  • PDF

A Study of Location Correction Algorithm for Pedestrian Location Tracking in Traffic Connective Transferring System (교통 연계 환승 시스템의 보행자 위치 추적을 위한 보정 알고리즘 연구)

  • Jung, Jong-In;Lee, Sang-Sun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.8 no.2
    • /
    • pp.149-157
    • /
    • 2009
  • Tracking technologies which provide real-time and customized information through various information collecting and processing for pedestrians who use traffic connective and transferring center have been being examined. However some problems are caused due to the wide-range positioning error for some services as device installation and service place. It is also difficult to be applied to traffic linkage and transfer services because many situations can be barren. In the testbed, Gwangmyoung Station, we got some results in bad conditions such as a lot of steel construction and another communication device. Practically, conditions of the place which will be built can be worse than Gwangmyoung station. Therefore, we researched suitable Location correction algorithm as a method for accuracy to traffic connective and transferring system. And its algorithm is designed through grid coordinates, map-matching, modeling coordinates and Kalman filtering and is being implemented continuously. Also preparing for optimization of various transferring center model, we designed for simulator type algorithm what is available for deciding algorithm factor.

  • PDF

Color Gamut Mapping and Dithering for Ink-Jet Color Printing (잉크젯 칼라 프린팅을 위한 색역 사상과 디더링)

  • Lee, Chae-Soo;Kim, Kyeong-Man;Lee, Cheol-Hee;Ha, Yeong-Ho
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.6
    • /
    • pp.137-146
    • /
    • 1998
  • Recently many devices print electronic images in a variety of ways. The reproduced color, however, is different from the original color because of the difference of hardware characteristics. To maintain device independent color, gamut mapping method is proposed. The proposed color gamut mapping uses nonlinear intensity mapping and clipping for saturation mapping on HSI color space. In the dithering operation, expanded nonlinear ordered dithering and modified error diffusion are proposed. The proposed ordered dithering uses expanded nonlinear quantization which considers overlapping phenomena of neighbored printing dots. In the modified error diffusion, quantization errors to be diffused are adjusted to improve both image blur and color change produced in the error diffusion. So, the printed image is similar to the image of monitor. Our results indicate that proposed algorithm can produce high quality image in the low bit color devices.

  • PDF

Detection of Moving Objects using Depth Frame Data of 3D Sensor (3D센서의 Depth frame 데이터를 이용한 이동물체 감지)

  • Lee, Seong-Ho;Han, Kyong-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.5
    • /
    • pp.243-248
    • /
    • 2014
  • This study presents an investigation into the ways to detect the areas of object movement with Kinect's Depth Frame, which is capable of receiving 3D information regardless of external light sources. Applied to remove noises along the boundaries of objects among the depth information received from sensors were the blurring technique for the x and y coordinates of pixels and the frequency filter for the z coordinate. In addition, a clustering filter was applied according to the changing amounts of adjacent pixels to extract the areas of moving objects. It was also designed to detect fast movements above the standard according to filter settings, being applicable to mobile robots. Detected movements can be applied to security systems when being delivered to distant places via a network and can also be expanded to large-scale data through concerned information.

Three-Dimensional Digital Subtraction Angiography (디지털 혈관 조영술 영상의 3차원적 해석)

  • 이승지;김희찬
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.20 no.1
    • /
    • pp.63-71
    • /
    • 1983
  • A dye-edge tracking algorithm was used to determine the corresponding points in the two images(anterior-posterior and lateral) of the digital subtraction biplane angiography. This correspondence was used to reconstruct three dimensional images of cerebral artery in a dog experiment. The method was tested by comparing the measured image of oblique view with the computed reconstructed image. For the present study, we have developed three new algorithms. The first algorithm is to determine the corresponding dye-edge points using the fact the dye density at the moving edge avows the same changing pattern in the two projection views. This moving pattern of dye-edge density is computed using a matching method of cross-correlation for the two sequential frames' dye density. The second algorithm is for simplified perspective transformation, and the third one is to identify the specific corresponding points on the small vessels. The present method can be applied to compute the blood velocity using the dye-edge displacement and the three- dimensional distance data.

  • PDF

Face Recognition by Fiducial Points Based Gabor and LBP Features (특징점기반 Gabor 및 LBP 피쳐를 이용한 얼굴 인식)

  • Kim, Jin-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.1
    • /
    • pp.1-8
    • /
    • 2013
  • The accuracy of a real facial recognition system can be varied according to the accuracy of the eye detection algorithm when we design and implement a semi-automatic facial recognition algorithm depending on the eye position of a database. In this paper, a fully automatic facial recognition algorithm is proposed such that Gabor and LBP features are extracted from fiducial points of a face graph which was created by using fiducial points based on the eyes, nose, mouth and border lines of a face, fitted on the face image. In this algorithm, the recognition performance could be increased because a face graph can be fitted on a face image automatically and fiducial points based LPB features are implemented with the basic Gabor features. The simulation results show that the proposed algorithm can be used in real-time recognition for more than 1,000 faces and produce good recognition performance for each data set.

Model-Based Three-dimensional Multiview Object Implementation by OpenGL (OpenGL을 이용한 모델 기반 3차원 다시점 객체 구현)

  • Oh, Won-Sik;Kim, Dong-Uk;Kim, Hwa-Sung;Yoo, Ji-Sang
    • Journal of Broadcast Engineering
    • /
    • v.13 no.3
    • /
    • pp.299-309
    • /
    • 2008
  • In this paper, we propose an algorithm for object generation from model-based 3-dimensional multi-viewpoint images using OpenGL rendering. In the first step, we preprocess a depth map image in order to get a three-dimensional coordinate which is sampled as a vertex information on OpenGL and has a z-value as depth information. Next, the Delaunay Triangulation algorithm is used to construct a polygon for texture-mapping using the vertex information. Finally, by mapping a texture image on the constructed polygon, we generate a viewpoint-adaptive object by calculating 3-dimensional coordinates on OpenGL.