• Title/Summary/Keyword: Adjustment Computation

Search Result 59, Processing Time 0.027 seconds

Efficient mesh-based realistic computer-generated hologram synthesis with polygon resolution adjustment

  • Yeom, Han-Ju;Cheon, Sanghoon;Choi, Kyunghee;Park, Joongki
    • ETRI Journal
    • /
    • v.44 no.1
    • /
    • pp.85-93
    • /
    • 2022
  • We propose an efficient method for synthesizing mesh-based realistic computer-generated hologram (CGH). In a previous nonanalytic mesh-based CGH synthesis, the angular spectrum of the two-dimensional (2D) plane is calculated using the fast Fourier transform (FFT) with the same size as the resolution of the final hologram. Because FFT increases the computation time as the size of the input matrix increases, the previous method has a problem: The higher the resolution of the hologram, the greater the computational load, thereby delaying synthesis time. In this study, when calculating the angular spectrum of the 2D plane in mesh-based CGH synthesis, we propose a method to calculate the angular spectrum by defining the 2D plane with an arbitrary size smaller than the resolution of the final hologram. The resolution adjustment method reduces the computation time and can be applied to occlusion culling and texturing for the realistic effect of mesh-based CGH. We describe the principle, error analysis, application of realistic effect, and experimental results of the proposed method.

A Sequential AT Algorithm based on Combined Adjustment (결합 조정에 기반한 연속 항공삼각측량 알고리즘)

  • Choi, Kyoung-Ah;Lee, Im-Pyeong
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.27 no.6
    • /
    • pp.669-678
    • /
    • 2009
  • Real-time image georeferencing technologies are required to generate spatial information promptly from the image sequences acquired by a multi-sensor system. We thus derive a sequential adjustment algorithm based on the combined adjustment model. By adopting the sequential adjustment model, we develop a sequential AT(Aerial Triangulation) algorithm to georeference image sequences in real-time. The proposed algorithm enables to perform AT rapidly with the minimum computation at the current stage by using the results computed at the previous stage whenever a new image is added. Experiments with simulated data were conducted to verify the effectiveness of the proposed algorithm. The results of the experiments show that the georeferencing of each image took very short time and its accuracy was determined within ${\pm}4cm$ on the ground control points comparing to the results of the existing simultaneous AT.

Baseline Analysis for $3^{rd}$ order GPS Network Adjustment (국가기준점 망조정을 위한 GPS 3등기준점 기선해석)

  • Lee, Young-Jin;Jeong, Kwang-Ho;Kwon, Chan-O;Song, Jun-Ho;Cho, Jun-Rae;Nam, Gi-Beom
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2007.04a
    • /
    • pp.3-6
    • /
    • 2007
  • The GPS baseline processing and the network adjustment was required a preliminary classification and check for effective work because the observation data of GPS $3^{rd}$ order control points are enormous attain to about 12,000 points. Particularly, in baseline processing and network adjustment a inaccuracy GPS antenna heights and point names yield a gross error or a S/W computation error. For the baseline processing of observation data, the related all materials were collected and were required a final check. The factor occurring a error, in GPS the baseline processing, were inspected variously after a checking observation data. Also, baseline processing method of GPS $3^{rd}$ order control points were commented and the analysis carry out a results with a experiment. The ellipsoidal distance and height of duplication baseline was compared between adjoin campaign areas for a accuracy analysis of baseline processing. According to the result, the mean is about 1cm for horizontal direction and about 2cm for vertical direction.

  • PDF

An Introduction of General Least Squares on the Cadastral Survey Computation (지적측량계산에 일반최소제곱법의 도입 (도근측량방법 중 도선법 기준))

  • Song, Won-Ho;Cha, Deuk-Ki;Kim, Su-Jeong
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2010.04a
    • /
    • pp.349-353
    • /
    • 2010
  • The existing calculation methods of the cadastral traverse survey was established in 1910s and are mostly outdated. The quality of these methods are not adequate to satisfy today's surveyor's needs that use a simple calculation method to distribute the error values. Thus, the main objective of this research is to find a methodology for appropriate calculation methods of the cadastral traverse survey that uses the general least square adjustment method with weight. Consequently, least square adjustment method has a better result than the previous one.

  • PDF

A Comparison Study on Total Least Squares and Least Squares (토털최소제곱법과 최소제곱법의 비교연구)

  • 이임평;최윤수;권재현
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2003.10a
    • /
    • pp.15-19
    • /
    • 2003
  • The Total Least Squares (TLS) method is introduced in comparison with the conventional Least Squares (LS) method. The principles and mathematical models for both methods are summarized and the comparison results from their applications to a simple geometric example, fitting a straight line to a set of 2D points are presented. As conceptually reasoned, the results clearly indicate that LS is more susceptible of producing wrong parameters with worse precision rather than TLS. For many applications in surveying, can adjustment computation and parameter estimation based on TLS provide better results.

  • PDF

Reduction of Spectral Distortion in PAN-sharpening Using Spectral Adjustment and Anisotropic Diffusion (분광 조정과 비등방성 확산에 의한 PAN-Sharpened 영상의 분광 왜곡 완화)

  • Lee, Sanghoon
    • Korean Journal of Remote Sensing
    • /
    • v.31 no.6
    • /
    • pp.571-582
    • /
    • 2015
  • This paper proposes a scheme to reduce spectral distortion in PAN-sharpening which produces a MultiSpectral image (MS) with the higher resolution of PANchromatic image (PAN). The spectral distortion results from reconstructing spatial details of PAN image in the MS image. The proposed method employs Spectral Adjustment and Anisotropic Diffusion to make a reduction of the distortion. The spectral adjustment makes the PAN-sharpened image agree with the original MS image, but causes block distortion because the spectral response of a pixel in the lower resolution is assumed to be equal to the average response of the pixels belonging to the corresponding area in the higher resolution at a same wavelength. The block distortion is corrected by the anisotropic diffusion which uses a conduct coefficient estimating from a local computation of PAN image. It results in yielding a PAN-sharpened image with the spatial structure of PAN image. GSA is one of PAN-sharpening techniques which are efficient in computation as well as good in quantitative quality evaluation. This study suggests the GSA as a preliminary PAN-sharpening method. Two data sets were used in the experiment to evaluate the proposed scheme. One is a Dubaisat-2 image of $1024{\times}1024$ observed at Los Angeles area, USA on February, 2014, the other is an IKONOS of $2048{\times}2048$ observed at Anyang, Korea on March, 2002. The experimental results show that the proposed scheme yields the PAN-sharpened images which have much less spectral distortion and better quantitative quality evaluation.

Analysis of Performance for Entropy-Based ISAR Autofocus Technique (엔트로피 기반의 ISAR 자동 초점 기법에 대한 성능 분석)

  • Bae, Jun-Woo;Kim, Kyung-Tae;Lee, Jin-Ho;Im, Jeong-Heom
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.17 no.12 s.115
    • /
    • pp.1249-1258
    • /
    • 2006
  • Two-dimensional(2-D) radar images, namely, ISAR images from a maneuvering target include unwanted phase errors due to the target's motion. These phase errors make ISAR images to be blurred. The ISAR autofocus technique is required in order to remove these unwanted phase errors. Unless those unwanted phase errors produced by the target's motion are removed prior to target identification, we cannot expect a reliable target identification performance. In this paper, we use the entropy-based ISAR autofocus technique which consists of two steps: range alignment and phase adjustment. We analyze a relationship between the number of sampling point and a image quality in a range alignment algorithm and also analyze a technique for reducing computation time of the SSA(Stage-by-Stage Approachng) algorithm in a phase adjustment.

Computation of Bessel Coordinates of the Cadastral Control Points by Trilateration Adjustment of GPS Baseline Measurements (GPS 관측기선의 삼변망 조정계산에 의한 우리나라 지적측량기준점의 베셀성과 산출)

  • Yang, Chul-Soo;Kang, Sang-Gu;Jung, Rea-Jung;Kim, Yong-Ho;Lee, Min-Seok
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.15 no.3
    • /
    • pp.41-49
    • /
    • 2007
  • In this study, the software to compute Bessel coordinates by trilateration adjustment was developed, and the software was used to determine coordinates of the cadastral control points over the southern Korean peninsula. The baseline measured by GPS was reduced to the distance on geoid surface by applying PNU95 geoid model, and the distance on geoid surface was reduced to the plane grid distance by applying scale factor of map projection of Bessel coordinates. Using the plane grid distance, Bessel coordinates of 32 CORS (Continuously Operating Reference Station) were computed by free adjustment at first, and then the coordinates of the cadastral control points were computed by joining the control points to adjacent CORS. The result shows a possibility of construction of highly accurate and consistent cadastral survey network with coordinate error less than 1ppm of distance, when newly computing the coordinates of the control points by using distances measured by GPS.

  • PDF

Reliability Analysis of the Three-Dimensional Deformation Measurement by Terrestrial Photogrammetry (지상사진(地上寫眞)에 의한 삼차원변형측량(三次元變形測量)의 신뢰도(信賴度) 분석(分析)(기일(其一)))

  • Yeu, Bock Mo;Yoo, Hwan Hee;Kim, In Sub
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.7 no.4
    • /
    • pp.139-146
    • /
    • 1987
  • The 3-dimensional deformation measurement by the terrestrial photogrammetry is consist of 3-dimensional coordinates computation, displaced point detection and deformation estimation of object targets. In this study, at the first step of deformation analysis, the variation of the variance-covariance matrix for the exterior orientation elements was analyzed by the increment of the ground control points and the photos in the Bundle adjustment. And then, to give the constraints for improving accuracy of ground control points, the concept of Free-Network adjustment was applied to Bundle adjustment. As a result, we knew that it was desired in the accuracy and the economy, the observation time when the numbers of ground control point and photo were respectively 6 points and 3 photos. In addition, in the case of applying the concept of Free Network adjustment in Bundle adjutment, it was desirable that the space distance for the constraints is distributed outside.

  • PDF

1-Point Ransac Based Robust Visual Odometry

  • Nguyen, Van Cuong;Heo, Moon Beom;Jee, Gyu-In
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.2 no.1
    • /
    • pp.81-89
    • /
    • 2013
  • Many of the current visual odometry algorithms suffer from some extreme limitations such as requiring a high amount of computation time, complex algorithms, and not working in urban environments. In this paper, we present an approach that can solve all the above problems using a single camera. Using a planar motion assumption and Ackermann's principle of motion, we construct the vehicle's motion model as a circular planar motion (2DOF). Then, we adopt a 1-point method to improve the Ransac algorithm and the relative motion estimation. In the Ransac algorithm, we use a 1-point method to generate the hypothesis and then adopt the Levenberg-Marquardt method to minimize the geometric error function and verify inliers. In motion estimation, we combine the 1-point method with a simple least-square minimization solution to handle cases in which only a few feature points are present. The 1-point method is the key to speed up our visual odometry application to real-time systems. Finally, a Bundle Adjustment algorithm is adopted to refine the pose estimation. The results on real datasets in urban dynamic environments demonstrate the effectiveness of our proposed algorithm.