• Title/Summary/Keyword: symmetric points

Search Result 120, Processing Time 0.025 seconds

Non-Metric Digital Camera Lens Calibration Using Ground Control Points (지상기준점을 이용한 비측량용 카메라 렌즈 캘리브레이션)

  • Won, Jae-Ho;So, Jae-Kyeong;Yun, Hee-Cheon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.2
    • /
    • pp.173-180
    • /
    • 2012
  • The most recent, 80 mega pixels digital camera appeared through the development of digital technology, and nonmetric digital cameras have been using in various field of photogrammetry. In this study, we experimented lens calibration using aerial photographs and ground control points. The aerial photographs were taken a non-metric digital camera which is CMOS(Complementary Metal Oxide Semiconductor) 21.1 mega pixels sensor and 35mm lens at a helicopter. And the ground control points were selected on the 1:1,000 plotting origin data. As a result, we calculated focal length, PPA(Principal Point of Autocollimation) and symmetric radial distortion coefficients from the lens. Also, RMSE(root mean square error) and maximum residual of the ground control points from the aerial triangulation were compared before and after calibration. And we found that the accuracy of the after calibration was improved very significantly.

ON CONJUGATE POINTS OF THE GROUP H(2, 1)

  • Jang, Chang-Rim;Park, Keun;Lee, Tae-Hoon
    • East Asian mathematical journal
    • /
    • v.22 no.2
    • /
    • pp.249-257
    • /
    • 2006
  • Let n be a 2-step nilpotent Lie algebra which has an inner product <,> and has an orthogonal decomposition $n=\delta{\oplus}\varsigma$ for its center $\delta$ and the orthogonal complement $\varsigma\;of\;\delta$. Then Each element Z of $\delta$ defines a skew symmetric linear map $J_Z:\varsigma{\rightarrow}\varsigma$ given by $=$ for all $X,\;Y{\in}\varsigma$. Let $\gamma$ be a unit speed geodesic in a 2-step nilpotent Lie group H(2, 1) with its Lie algebra n(2, 1) and let its initial velocity ${\gamma}$(0) be given by ${\gamma}(0)=Z_0+X_0{\in}\delta{\oplus}\varsigma=n(2,\;1)$ with its center component $Z_0$ nonzero. Then we showed that $\gamma(0)$ is conjugate to $\gamma(\frac{2n{\pi}}{\theta})$, where n is a nonzero intger and $-{\theta}^2$ is a nonzero eigenvalue of $J^2_{Z_0}$, along $\gamma$ if and only if either $X_0$ is an eigenvector of $J^2_{Z_0}$ or $adX_0:\varsigma{\rightarrow}\delta$ is not surjective.

  • PDF

A STUDY ON THE FITNESS OF STOCK TRAY IN KOREAN ADULTS (한국인 성인에 대한 기성 tray의 적합도에 관한 연구)

  • Song, Dae-Sung;Jin, Tai-Ho;Dong, Jin-Keun
    • The Journal of Korean Academy of Prosthodontics
    • /
    • v.27 no.2
    • /
    • pp.131-141
    • /
    • 1989
  • This study was designed to investigate the fitness of stock tray in Korean adults. 107 dental students (male: 87, female: 20) who have normal occlusion and symmetric facial fom were selected. The upper and lower stock tray (Osungtray, Osung Co., Korea) fit with dental arch were selected for taking irreversible hydrocolloid impression. The author measured the thickness of impression material about two items, that is, width and length on the flange of stock tray. Several measuring points on the dental arches and palatal area were checked with Goldman Fox prove (Hu-Friedy, U.S.A.). The obtained results were as follows: 1. The width of impression material on buccal flange of upper and lower trays were narrower than any other measuring point, but the thickness of impression material on the palatal area of upper stock tray was the widest of all measuring points. 2. The length on buccal flange of lower stock tray was shorter, but the length on tray flange of lower stock tray at lingual frenum area was longer. 3. On upper dental arch, the upper extra-large tray was used in 53% of subjects, but upper small tray was not used. 4. On lower dental arch, the large tray was used in 55% of subjects. 5. There was not adequate tray on upper dental arch in 4 subjects.

  • PDF

An Efficient Vehicle Routing Heuristic for Various and Unsymmetric Forward and Backward Vehicle Moving Speed (왕복비대칭 가변이동속도에서의 효율적 배송차량경로 탐색해법 연구)

  • Moon, Geeju;Park, Sungmee
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.36 no.3
    • /
    • pp.71-78
    • /
    • 2013
  • An efficient vehicle routing heuristic for different vehicle moving times for forward and backward between two points is studied in this research. Symmetric distance or moving times are assumed to move back and forth between two points in general, but it is not true in reality. Also, various moving speeds along time zones are considered such as the moving time differences between rush hours or not busy daytimes. To solve this type of extremely complicated combinatorial optimization problems, delivery zones are specified and delivery orders are determined for promising results on the first stage. Then delivery orders in each zone are determined to be connected with other zones for a tentative complete delivery route. Improvement steps are followed to get an effective delivery route for unsymmetric-time-varing vehicle moving speed problems. Performance evaluations are done to show the effectiveness of the suggested heuristic using computer programs specially designed and developed using C++.

A Minimum Degree Ordering Algorithm using the Lower and Upper Bounds of Degrees

  • Park, Chan-Kyoo;Doh, Seungyong;Park, Soondal;Kim, Woo-Je
    • Management Science and Financial Engineering
    • /
    • v.8 no.1
    • /
    • pp.1-19
    • /
    • 2002
  • Ordering is used to reduce the amount of fill-ins in the Cholesky factor of a symmetric positive definite matrix. One of the most efficient ordering methods is the minimum degree ordering algorithm(MDO). In this paper, we provide a few techniques that improve the performance of MDO implemented with the clique storage scheme. First, the absorption of nodes in the cliques is developed which reduces the number of cliques and the amount of storage space required for MDO. Second, we present a modified minimum degree ordering algorithm of which the number of degree updates can be reduced by introducing the lower bounds of degrees. Third, using both the lower and upper bounds of degrees, we develop an approximate minimum degree ordering algorithm. Experimental results show that the proposed algorithm is competitive with the minimum degree ordering algorithm that uses quotient graphs from the points of the ordering time and the nonzeros in the Cholesky factor.

A primal-dual log barrier algorithm of interior point methods for linear programming (선형계획을 위한 내부점법의 원문제-쌍대문제 로그장벽법)

  • 정호원
    • Korean Management Science Review
    • /
    • v.11 no.3
    • /
    • pp.1-11
    • /
    • 1994
  • Recent advances in linear programming solution methodology have focused on interior point methods. This powerful new class of methods achieves significant reductions in computer time for large linear programs and solves problems significantly larger than previously possible. These methods can be examined from points of Fiacco and McCormick's barrier method, Lagrangian duality, Newton's method, and others. This study presents a primal-dual log barrier algorithm of interior point methods for linear programming. The primal-dual log barrier method is currently the most efficient and successful variant of interior point methods. This paper also addresses a Cholesky factorization method of symmetric positive definite matrices arising in interior point methods. A special structure of the matrices, called supernode, is exploited to use computational techniques such as direct addressing and loop-unrolling. Two dense matrix handling techniques are also presented to handle dense columns of the original matrix A. The two techniques may minimize storage requirement for factor matrix L and a smaller number of arithmetic operations in the matrix L computation.

  • PDF

Study on Precison Assembly Macchanism Using Joint Compliances (관절 콤플라이언스를 활용한 정밀 조립형 메카니즘에 관한 연구)

  • 김동구;김희국;이병주
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1994.04a
    • /
    • pp.395-400
    • /
    • 1994
  • Most of Commercial Remote Center Compliance(RCC) devices have been designed using deformable structures. In this work, we propose another type of assembly devices which generate the compliance effects by attaching the compliances (or spring) at the joints of the given mechainsm. The compliance models are derived for a serial-type, parallel-type, and hybrid-type mechanisms, respectively. In particular, a planar three-degree of freedom parallel structure is shown to have RCC points at the center of the workspace for its symmetric configuratings.

  • PDF

Flow Visualization of Turbulent Flow around a Sphere (구(球) 주위 난류유동의 정량적 가시화)

  • Jang, Young-Il;Lee, Sang-Joon
    • 한국가시화정보학회:학술대회논문집
    • /
    • 2005.12a
    • /
    • pp.50-53
    • /
    • 2005
  • The turbulent flow around a sphere was investigated in a streamwise meridian plane using two experimental techniques: smoke-wire flow visualization in wind tunnel at Re=5,300 and PIV measurements in a circulating water channel at Re=7,400. The smoke-wire visualization shows flow separation points near an azimuthal angle of $90^{\circ}$, recirculating flow, transition from laminar to turbulent shear layer, evolving vortex roll-up and fully turbulent eddies in the sphere wake. In addition, the mean flow pattern extracted by particle tracing method in water tunnel at Re= 14,500 reveals two distinct comparable toroidal(not closed) vortices in the recirculation region. The mean velocity field measured using a PIV technique demonstrates the detailed wake configuration of close symmetric recirculation and near-wake configuration with two toroidal vortices, reversed velocity zone and vorticity contours.

  • PDF

On the Geometric Equivalence of Asymmetric Factorial Designs

  • Park, Dong-Kwon;Park, Eun-Hye
    • Communications for Statistical Applications and Methods
    • /
    • v.13 no.3
    • /
    • pp.777-786
    • /
    • 2006
  • Two factorial designs with quantitative factors are called geometrically equivalent if the design matrix of one can be transformed into the design matrix of the other by row and column permutations, and reversal of symbol order in one or more columns. Clark and Dean (2001) gave a sufficient and necessary condition (which we call the 'gCD condition') for two symmetric factorial designs with quantitative factors to be geometrically equivalent. This condition is based on the absolute value of the Euclidean(or Hamming) distance between pairs of design points. In this paper we extend the gCD condition to asymmetric designs. In addition, a modified algorithm is applied for checking the equivalence of two designs.

Visualization of Turbulent Flow around a Sphere (구 주위 난류유동에 관한 가시화 연구)

  • Jang, Young-Il;Lee, Sang-Joon
    • 유체기계공업학회:학술대회논문집
    • /
    • 2006.08a
    • /
    • pp.401-402
    • /
    • 2006
  • The turbulent flow around a sphere was investigated using two experimental techniques: smoke-wire flow visualization in wind tunnel at Re=5300, 11000 and PIV measurements in a circulating water channel. The smoke-wire visualization shows flow separation points near an azimuthal angle of $90^{\circ}$, recirculating flow, transition from laminar to turbulent shear layer, evolving vortex roll-up and fully turbulent eddies in the sphere wake. The mean velocity field measured using a PIV technique in x-y center plane demonstrates the detailed near-wake structure such as nearly symmetric recirculation region, two toroidal vortices, laminar separation, transition and turbulent eddies. The PIV measurements of turbulent wake in y-z planes show that a recirculating vortex pair dominates the near-wake region.

  • PDF