• Title/Summary/Keyword: Mapping Algorithm

Search Result 1,090, Processing Time 0.046 seconds

Performance analysis on the geometric correction algorithms using GCPs - polynomial warping and full camera modelling algorithm

  • Shin, Dong-Seok;Lee, Young-Ran
    • Proceedings of the KSRS Conference
    • /
    • 1998.09a
    • /
    • pp.252-256
    • /
    • 1998
  • Accurate mapping of satellite images is one of the most important Parts in many remote sensing applications. Since the position and the attitude of a satellite during image acquisition cannot be determined accurately enough, it is normal to have several hundred meters' ground-mapping errors in the systematically corrected images. The users which require a pixel-level or a sub-pixel level mapping accuracy for high-resolution satellite images must use a number of Ground Control Points (GCPs). In this paper, the performance of two geometric correction algorithms is tested and compared. One is the polynomial warping algorithm which is simple and popular enough to be implemented in most of the commercial satellite image processing software. The other is full camera modelling algorithm using Physical orbit-sensor-Earth geometry which is used in satellite image data receiving, pre-processing and distribution stations. Several criteria were considered for the performance analysis : ultimate correction accuracy, GCP representatibility, number of GCPs required, convergence speed, sensitiveness to inaccurate GCPs, usefulness of the correction results. This paper focuses on the usefulness of the precision correction algorithm for regular image pre-processing operations. This means that not only final correction accuracy but also the number of GCPs and their spatial distribution required for an image correction are important factors. Both correction algorithms were implemented and will be used for the precision correction of KITSAT-3 images.

  • PDF

New Technology Mapping Algorithm of Multiple-Output Functions for TLU-Type FPGAs (TLU형 FPGA를 위한 새로운 다출력 함수 기술 매핑 알고리즘)

  • Park, Jang-Hyun;Kim, Bo-Gwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.11
    • /
    • pp.2923-2930
    • /
    • 1997
  • This paper describes two algorithms for technology mapping of multiple output functions into interesting and popular FPGAs (Field Programmable Gate Arrays) that lise look-up table memories. For improvement of technology mapping for FPGA, we use the functional decomposition method for multiple output functions. Two algorithms are proposed. The one is the Roth-Karp algorithm extended for multiple output functions. The other is the novel and efficient algorithm which looks for common decomposition functions through the decomposition procedure. The cost function is used to minimize the number of CLBs and nets and to improve performance of the network. Finally we compare our new algorithm with previous logic design technique. Experimental results show significant reduction in the number of CLBs and nets.

  • PDF

Color Enhanced Method in Digital PDP TV Using Nonlinear Shortest Distance Mapping Algorithm (비선형적 최단거리 매핑 알고리즘을 이용한 PDP칼라 특성 보정 방법)

  • 허태욱;김재철;조맹섭
    • Proceedings of the IEEK Conference
    • /
    • 2002.06d
    • /
    • pp.255-258
    • /
    • 2002
  • Recently, Digital TV viewer have been replacing cathode ray tubes (CRT) with Plasma display panel(PDP). But the chromaticity of the primaries are dependent on RGB input signals. And the colorimetry of PDP changes with gray scale and has a poor performance in color reproduction. In this paper we propose the enhanced algorithm of color reproduction considering nonlinear gamut mapping algorithm. In order to test performance of this algorithm we use the sample colors. As a result of experiments, it was confirmed that the color difference of the digital PDP using the proposed algorithm was considerably reduced.

  • PDF

STRONG CONVERGENCE OF GENERAL ITERATIVE ALGORITHMS FOR NONEXPANSIVE MAPPINGS IN BANACH SPACES

  • Jung, Jong Soo
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.3
    • /
    • pp.1031-1047
    • /
    • 2017
  • In this paper, we introduce two general iterative algorithms (one implicit algorithm and other explicit algorithm) for nonexpansive mappings in a reflexive Banach space with a uniformly $G{\hat{a}}teaux$ differentiable norm. Strong convergence theorems for the sequences generated by the proposed algorithms are established.

A Critical Design Method of the Space-Based SARP Using RDA (RDA사용 위성기반 SARP 주요설계기법)

  • Hong, In-Pyo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.1C
    • /
    • pp.46-54
    • /
    • 2006
  • The design method of synthetic aperture radar processor (SARP) in the critical design stage is to describe the processing algorithm, to estimate the fractional errors, and to set out the software (SW) and hardware (HW) mapping. The previous design methods for SARP are complex and depend on HW. Therefore, this paper proposes a critical design method that is of more general and independent of HW. This methodology can be applied for developing the space-based SARP using range-Doppler algorithm (RDA).

Computer-generated integral imaging system used in virtual reality (가상현실에 이용할 수 있는 컴퓨터 생성 집적 영상 시스템)

  • Seok, Myeong-Hun;Min, Seong-Uk
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 2005.07a
    • /
    • pp.158-159
    • /
    • 2005
  • Three-dimensional(3D) integral imaging system which can be used in a virtual reality system is proposed. The proposed system uses a new image mapping algorithm which can achieve the real time processing, which is indispensable for the virtual reality system. 3D images generated by the advanced graphic software such as OpenGL API can be directly used without complex adaptation. Therefore, the computer-generated integral imaging system using the proposed mapping algorithm can be successfully applied to virtual reality.

  • PDF

PERTURBED PROXIMAL POINT ALGORITHMS FOR GENERALIZED MIXED VARIATIONAL INEQUALITIES

  • Jeong, Jae-Ug
    • East Asian mathematical journal
    • /
    • v.18 no.1
    • /
    • pp.95-109
    • /
    • 2002
  • In this paper, we study a class of variational inequalities, which is called the generalized set-valued mixed variational inequality. By using the properties of the resolvent operator associated with a maximal monotone mapping in Hilbert spaces, we have established an existence theorem of solutions for generalized set-valued mixed variational inequalities, suggesting a new iterative algorithm and a perturbed proximal point algorithm for finding approximate solutions which strongly converge to the exact solution of the generalized set-valued mixed variational inequalities.

  • PDF

An Iterative Method for Equilibrium and Constrained Convex Minimization Problems

  • Yazdi, Maryam;Shabani, Mohammad Mehdi;Sababe, Saeed Hashemi
    • Kyungpook Mathematical Journal
    • /
    • v.62 no.1
    • /
    • pp.89-106
    • /
    • 2022
  • We are concerned with finding a common solution to an equilibrium problem associated with a bifunction, and a constrained convex minimization problem. We propose an iterative fixed point algorithm and prove that the algorithm generates a sequence strongly convergent to a common solution. The common solution is identified as the unique solution of a certain variational inequality.

ITERATIVE ALGORITHM FOR COMPLETELY GENERALIZED QUASI-VARIATIONAL INCLUSIONS WITH FUZZY MAPPINGS IN HILBERT SPACES

  • Jeong, Jae-Ug
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.1_2
    • /
    • pp.451-463
    • /
    • 2010
  • In this paper, we introduce and study a class of completely generalized quasi-variational inclusions with fuzzy mappings. A new iterative algorithm for finding the approximate solutions and the convergence criteria of the iterative sequences generated by the algorithm are also given. These results of existence, algorithm and convergence generalize many known results.

Construction of a artificial levee line in river zones using LiDAR Data (라이다 자료를 이용한 하천지역 인공 제방선 추출)

  • Choung, Yun-Jae;Park, Hyeon-Cheol;Jo, Myung-Hee
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2011.05a
    • /
    • pp.185-185
    • /
    • 2011
  • Mapping of artificial levee lines, one of major tasks in river zone mapping, is critical to prevention of river flood, protection of environments and eco systems in river zones. Thus, mapping of artificial levee lines is essential for management and development of river zones. Coastal mapping including river zone mapping has been historically carried out using surveying technologies. Photogrammetry, one of the surveying technologies, is recently used technology for national river zone mapping in Korea. Airborne laser scanning has been used in most advanced countries for coastal mapping due to its ability to penetrate shallow water and its high vertical accuracy. Due to these advantages, use of LiDAR data in coastal mapping is efficient for monitoring and predicting significant topographic change in river zones. This paper introduces a method for construction of a 3D artificial levee line using a set of LiDAR points that uses normal vectors. Multiple steps are involved in this method. First, a 2.5-dimensional Delaunay triangle mesh is generated based on three nearest-neighbor points in the LiDAR data. Second, a median filtering is applied to minimize noise. Third, edge selection algorithms are applied to extract break edges from a Delaunay triangle mesh using two normal vectors. In this research, two methods for edge selection algorithms using hypothesis testing are used to extract break edges. Fourth, intersection edges which are extracted using both methods at the same range are selected as the intersection edge group. Fifth, among intersection edge group, some linear feature edges which are not suitable to compose a levee line are removed as much as possible considering vertical distance, slope and connectivity of an edge. Sixth, with all line segments which are suitable to constitute a levee line, one river levee line segment is connected to another river levee line segment with the end points of both river levee line segments located nearest horizontally and vertically to each other. After linkage of all the river levee line segments, the initial river levee line is generated. Since the initial river levee line consists of the LiDAR points, the pattern of the initial river levee line is being zigzag along the river levee. Thus, for the last step, a algorithm for smoothing the initial river levee line is applied to fit the initial river levee line into the reference line, and the final 3D river levee line is constructed. After the algorithm is completed, the proposed algorithm is applied to construct the 3D river levee line in Zng-San levee nearby Ham-Ahn Bo in Nak-Dong river. Statistical results show that the constructed river levee line generated using a proposed method has high accuracy in comparison to the ground truth. This paper shows that use of LiDAR data for construction of the 3D river levee line for river zone mapping is useful and efficient; and, as a result, it can be replaced with ground surveying method for construction of the 3D river levee line.

  • PDF