• Title/Summary/Keyword: Redundant Coordinates

Search Result 9, Processing Time 0.026 seconds

Control of a Three-pole Hybrid Active Magnetic Bearing using Redundant Coordinates (잉여좌표계를 이용한 3-폴 하이브리드형 자기베어링 제어)

  • Park, Sang-Hyun;Lee, Chong-Won
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2007.11a
    • /
    • pp.1375-1381
    • /
    • 2007
  • In this paper, we propose a linear modeling and identical PD controller design scheme for the three-pole hybrid-type AMB recently developed in the laboratory, which consists of three permanent magnets, providing bias flux, three Hall diodes, measuring rotor displacements, and ring type permanent magnet bearing, stabilizing in axial and tilting directions. Along the three physical coordinates formed by three poles, we introduce the redundant coordinate system and three identical decoupled controllers to construct linear model. The experiments are also carried out in order to verify the effectiveness of proposed controller in stabilizing the transient and steady state response of rotor.

  • PDF

Decoupled Control of Active and Permanent Magnetic Bearing System (자기 베어링과 영구자석 베어링으로 이루어진 시스템의 비 연성 제어)

  • Park, Sang-Hyun;Lee, Chong-Won
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2008.04a
    • /
    • pp.63-70
    • /
    • 2008
  • In this paper, we propose a bearing redundant coordinates and decoupled PD controller for 5-axes active magnetic bearing system, which consists of two bearing parts such as three-pole hybrid active magnetic bearing for stabilize the radial direction and ring-type permanent magnetic bearing stabilizing in axial and tilting motion. Based on derived system equation with decoupled control scheme, we conduct the modal analysis and measure of modal controllability and observability.

  • PDF

A NUMERICAL ALGORITHM FOR KINEMATIC ANALYSIS OF THE MACPHERSON STRUT SUSPENSION SYSTEM USING POINT COORDINATES

  • Attia, Hazem Ali
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.8 no.1
    • /
    • pp.67-80
    • /
    • 2004
  • In the present paper, a numerical algorithm for the kinematic analysis of a MacPherson strut motor-vehicle suspension system is developed. The kinematic analysis is carried out in terms of the rectangular Cartesian coordinates of some defined points in the links and at the joints. The presented formulation in terms of this system of coordinates is simple and involves only elementary mathematics. The resulting constraint equations are mostly either linear or quadratic in the rectangular Cartesian coordinates. The proposed formulation eliminates the need to write redundant constraints and allows to solve a reduced system of equations which leads to better accuracy and a reduction in computing time. The algorithm is applied to solve the initial positions as well as the finite displacement, velocity and acceleration problems for the MacPherson strut motor-vehicle suspension system.

  • PDF

해석적 사진측정에 있어서 경중률을 고려한 표정해석에 관한 연구

  • 안철호;유복모;염재홍
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.1 no.2
    • /
    • pp.16-22
    • /
    • 1983
  • The method of least squares is an adequate method of adjustment in various fields of engineering where redundant observations are necessary to obtain accurate values. The Consideration of weight of each Observation can improve the accuracy if the reliabilities of observations vary. The strip coordinates were weighted as inversely proportionate to the rotations $\kappa, \varphi, \omega$ which occur in the computation of model coordinates. The resulting errors in absolute coordinates were compared with the errors unweighted case to investigate the influence of orientation elements on absolute coordinates.

  • PDF

A Combination Method of Trajectory Data using Correlated Direction of Collected GPS Data (수집한 GPS데이터의 상호방향성을 이용한 경로데이터 조합방법)

  • Koo, Kwang Min;Park, Heemin
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.8
    • /
    • pp.1636-1645
    • /
    • 2016
  • In navigation systems that use collected trajectory for routing, the number and diversity of trajectory data are crucial despite the infeasible limitation which is that all routes should be collected in person. This paper suggests an algorithm combining trajectories only by collected GPS data and generating new routes for solving this problem. Using distance between two trajectories, the algorithm estimates road intersection, in which it also predicts the correlated direction of them with geographical coordinates and makes a decision to combine them by the correlated direction. With combined and generated trajectory data, this combination way allows trajectory-based navigation to guide more and better routes. In our study, this solution has been introduced. However, the ways in which correlated direction is decided and post-process works have been revised to use the sequential pattern of triangles' area GPS information between two trajectories makes in road intersection and intersection among sets comprised of GPS points. This, as a result, reduces unnecessary combinations resulting redundant outputs and enhances the accuracy of estimating correlated direction than before.

A Study on the Practical Application of Image Control Point Using Stereo Image Chip (입체 영상칩을 이용한 영상기준점 활용방안에 관한 연구)

  • Kim, Hoon-Jung;Kim, Kam-Lae;Cheong, Hae-Jin;Cho, Won-Woo
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.26 no.4
    • /
    • pp.423-431
    • /
    • 2008
  • The control surveying which aims at identifying the coordinate system of satellite images with that of ground is a repeatedly performed essential process to produce digital ortho - photos and it acts as the main factor to increase the production cost of the photos by duplicated budgets and redundant works when executing the projects for acquiring basic geographical information from high density satellite images. During the experimentation, an application system was established for producing a stereo image chip by the analysis of DPPDB file structure, the stereo image chip was produced with SPOT and IKONOS images, the analysis of 3D modeling accuracy was performed to secure the required accuracy and to present the optimal number and deployment of the control points, and a 3D modeling was performed for new SPOT images and lastly, 3D ground coordinates were extracted by the observation of the same points through the overlapping with the new images. As the results of the research, it is proved that the stereo image chip can be used as the ground controls through the accuracy analysis between the coordinates of the images and the ground, close results were obtained between the coordinates by the ground survey and those by the 3D modeling using new images and the observation of the same points, positional changes were not found during observing the same points, and the research presented the methodology for improving the process of the control survey by showing the availability of the image controls on the stereo image chip instead of the ground controls.

An efficient acceleration algorithm of GPU ray tracing using CUDA (CUDA를 이용한 효과적인 GPU 광선추적 가속 알고리즘)

  • Ji, Joong-Hyun;Yun, Dong-Ho;Ko, Kwang-Hee
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.469-474
    • /
    • 2009
  • This paper proposes an real time ray tracing system using optimized kd-tree traversal environment and ray/triangle intersection algorithm. The previous kd-tree traversal algorithms search for the upper nodes in a bottom-up manner. In a such way we need to revisit the already visited parent node or use redundant memory after failing to find the intersected primitives in the leaf node. Thus ray tracing for relatively complex scenes become more difficult. The new algorithm contains stacks implemented on GPU's local memory on CUDA framework, thus elegantly eliminate the problems of previous algorithms. After traversing the node we perform the latest CPU-based ray/triangle intersection algorithm 'Plucker coordinate test', which is further accelerated in massively parallel thanks to CUDA. Plucker test can drastically reduce the computational costs since it does not use barycentric coordinates but only simple test using the relations between a ray and the triangle edges. The entire system is consist of a single ray kernel simply and implemented without introduction of complicated synchronization or ray packets. Consequently our experiment shows the new algorithm can is roughly twice as faster as the previous.

  • PDF

An Efficient Spatial Index Technique based on Flash-Memory (플래시 메모리 기반의 효율적인 공간 인덱스 기법)

  • Kim, Joung-Joon;Sim, Hee-Joung;Kang, Hong-Koo;Lee, Ki-Young;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.2
    • /
    • pp.133-142
    • /
    • 2009
  • Recently, with the advance of wireless internet and the frequent use of mobile devices, demand for LBS(Location Based Service) is increasing, and research is required on spatial indexes for the storage and maintenance of spatial data to provide efficient LBS in mobile device environments. In addition, the use of flash memory as an auxiliary storage device is increasing in order to store large spatial data in a mobile terminal with small storage space. However, the application of existing spatial indexes to flash-memory lowers index performance due to the frequent updates of nodes. To solve this problem, research is being conducted on flash-memory based spatial indexes, but the efficiency of such spatial indexes is lowered by low utilization of buffer and flash-memory space. Accordingly, in order to solve problems in existing flash-memory based spatial indexes, this paper proposed FR-Tree (Flash-Memory based R-Tree) that uses the node compression technique and the delayed write operation technique. The node compression technique of FR-Tree increased the utilization of flash-memory space by compressing MBR(Minimum Bounding Rectangle) of spatial data using relative coordinates and MBR size. And, the delayed write operation technique reduced the number of write operations in flash memory by storing spatial data in the buffer temporarily and reflecting them in flash memory at once instead of reflecting the insert, update and delete of spatial data in flash-memory for each operation. Especially, the utilization of buffer space was enhanced by preventing the redundant storage of the same spatial data in the buffer. Finally, we perform ed various performance evaluations and proved the superiority of FR-Tree to the existing spatial indexes.

  • PDF

Development of a Web-based Presentation Attitude Correction Program Centered on Analyzing Facial Features of Videos through Coordinate Calculation (좌표계산을 통해 동영상의 안면 특징점 분석을 중심으로 한 웹 기반 발표 태도 교정 프로그램 개발)

  • Kwon, Kihyeon;An, Suho;Park, Chan Jung
    • The Journal of the Korea Contents Association
    • /
    • v.22 no.2
    • /
    • pp.10-21
    • /
    • 2022
  • In order to improve formal presentation attitudes such as presentation of job interviews and presentation of project results at the company, there are few automated methods other than observation by colleagues or professors. In previous studies, it was reported that the speaker's stable speech and gaze processing affect the delivery power in the presentation. Also, there are studies that show that proper feedback on one's presentation has the effect of increasing the presenter's ability to present. In this paper, considering the positive aspects of correction, we developed a program that intelligently corrects the wrong presentation habits and attitudes of college students through facial analysis of videos and analyzed the proposed program's performance. The proposed program was developed through web-based verification of the use of redundant words and facial recognition and textualization of the presentation contents. To this end, an artificial intelligence model for classification was developed, and after extracting the video object, facial feature points were recognized based on the coordinates. Then, using 4000 facial data, the performance of the algorithm in this paper was compared and analyzed with the case of facial recognition using a Teachable Machine. Use the program to help presenters by correcting their presentation attitude.