• Korean Journal of Remote Sensing
• /
• v.10 no.2
• /
• pp.133-160
• /
• 1994

In this paper, we propose a comprehensive geometric correction algorithm of Along Track Scanning Radiometer(ATSR) images. The procedure consists of two cascaded modules; precorrection and fine co-location. The pre-correction algorithm is based on the navigation model which was derived in mathematical forms. This model was applied for correction raw(un-geolocated) ATSR images. The non-systematic geometric errors are also introduced as the limitation of the geometric correction by this analytical method. A fast and automatic algorithm is also presented in the paper for co-locating nadir and forward views of the ATSR images by using a binary cross-correlation matching technique. It removes small non-systematic errors which cannot be corrected by the analytic method. The proposed algorithm does not require any auxiliary informations, or a priori processing and avoiding the imperfect co-registratio problem observed with multiple channels. Coastlines in images are detected by a ragion segmentation and an automatic thresholding technique. The matching procedure is carried out with binaty coastline images (nadir and forward), and it gives comparable accuracy and faster processing than a patch based matching technique. This technique automatically reduces non-systematic errors between two views to .$\pm$ 1 pixel.

• Kyungpook Mathematical Journal
• /
• v.59 no.3
• /
• pp.415-431
• /
• 2019

In this paper we introduce a new class of operators which will be called the class of k-quasi-class A(s, t) operators. An operator $T{\in}B(H)$ is said to be k-quasi-class A(s, t) if $$T^{*k}(({\mid}T^*{\mid}^t{\mid}T{\mid}^{2s}{\mid}T^*{\mid}^t)^{\frac{1}{t+s}}-{\mid}T^*{\mid}^{2t})T^k{\geq}0$$, where s > 0, t > 0 and k is a natural number. We show that an algebraically k-quasi-class A(s, t) operator T is polaroid, has Bishop's property ${\beta}$ and we prove that Weyl type theorems for k-quasi-class A(s, t) operators. In particular, we prove that if $T^*$ is algebraically k-quasi-class A(s, t), then the generalized a-Weyl's theorem holds for T. Using these results we show that $T^*$ satisfies generalized the Weyl's theorem if and only if T satisfies the generalized Weyl's theorem if and only if T satisfies Weyl's theorem. We also examine the hyperinvariant subspace problem for k-quasi-class A(s, t) operators.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2008.03a
• /
• pp.659-665
• /
• 2008

The 1-D numerical study of the interior ballistics has been conducted. The unsteady compressible 1-D CFD code using SIMPLER algorithm and QUICK scheme has been developed. The mathematical model of the two-phase flow has been established for the behavior of the interior ballistics. The moving boundary due to the projectile motion as the physical phenomena of the interior ballistics results in the varied control volume. In order to analyze the moving boundary, the numerical codes, which apply the ghost-cell extrapolation method and the Lagrangian method respectively, have been developed. The ghost-cell extrapolation method has been used in the Eulerian coordinate system. The Lagrangian method has been used in Non-Eulerian coordinate system. These codes have been verified through the analysis of the free piston motion problem in the tube. Through this study, the basic techniques of the numerical code for the multi-dimensional two-phase flow of the interior ballistics have been obtained.

• Advances in environmental research
• /
• v.3 no.3
• /
• pp.217-230
• /
• 2014

The large quantity of green cull bananas has the potential of being used industrially and, thereby, to improve banana economics and eliminate the large environmental problem presented by banana waste. Wastewaters from textile, cosmetics, printing, dying, food colouring, and paper-making industries are polluted by dyes. The adsorption of basic dye by waste banana pith was investigated by varying dye concentrations, adsorbent dose, particle size and agitation rate. The adsorption capacity was found to be maximum value of removal by using 0.1 g of sorbent with particle size 1mm at mixing speed 200 rpm for initial concentration 25 mg/l to reach value of approximate 89%. The Langmuir, Temkin and Freundlich adsorption models were used for mathematical description of the adsorption equilibrium and it was found that experimental data fitted very well to these models except Langmuir model. Adsorption of dye was applied on (pseudo-first and pseudo-second-order kinetics), and the experimental data was more fitted to pseudo second order. The results of this study showed that banana pith could be employed as effective and low-cost materials for the removal of dyes from aqueous solutions.

• Proceedings of the KOR-KST Conference
• /
• 2000.02a
• /
• pp.25-47
• /
• 2000

In route guidance systems fastest-path routing has typically been adopted because of its simplicity. However, empirical studies on route choice behavior have shown that drivers use numerous criteria in choosing a route. The objective of this study is to develop computationally efficient algorithms for identifying a manageable subset of the nondominated (i.e. Pareto optimal) paths for real-time vehicle routing which reflect the drivers' preferences and route choice behaviors. We propose two pruning algorithms that reduce the search area based on a context-dependent linear utility function and thus reduce the computation time. The basic notion of the proposed approach is that ⅰ) enumerating all nondominated paths is computationally too expensive, ⅱ) obtaining a stable mathematical representation of the drivers' utility function is theoretically difficult and impractical, and ⅲ) obtaining optimal path given a nonlinear utility function is a NP-hard problem. Consequently, a heuristic two-stage strategy which identifies multiple routes and then select the near-optimal path may be effective and practical. As the first stage, we utilize the relaxation based pruning technique based on an entropy model to recognize and discard most of the nondominated paths that do not reflect the drivers' preference and/or the context-dependency of the preference. In addition, to make sure that paths identified are dissimilar in terms of links used, the number of shared links between routes is limited. We test the proposed algorithms in a large real-life traffic network and show that the algorithms reduce CPU time significantly compared with conventional multi-criteria shortest path algorithms while the attributes of the routes identified reflect drivers' preferences and generic route choice behaviors well.

• ETRI Journal
• /
• v.43 no.4
• /
• pp.603-616
• /
• 2021

Over the last few years, autonomous vehicles have progressed very rapidly. The odometry technique that estimates displacement from consecutive sensor inputs is an essential technique for autonomous driving. In this article, we propose a fast, robust, and accurate odometry technique. The proposed technique is light detection and ranging (LiDAR)-based direct odometry, which uses a spherical range image (SRI) that projects a three-dimensional point cloud onto a two-dimensional spherical image plane. Direct odometry is developed in a vision-based method, and a fast execution speed can be expected. However, applying LiDAR data is difficult because of the sparsity. To solve this problem, we propose an SRI generation method and mathematical analysis, two key point sampling methods using SRI to increase precision and robustness, and a fast optimization method. The proposed technique was tested with the KITTI dataset and real environments. Evaluation results yielded a translation error of 0.69%, a rotation error of 0.0031°/m in the KITTI training dataset, and an execution time of 17 ms. The results demonstrated high precision comparable with state-of-the-art and remarkably higher speed than conventional techniques.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.25 no.4
• /
• pp.296-311
• /
• 2021

Topological Data Analysis (TDA), a relatively new field of data analysis, has proved very useful in a variety of applications. The main persistence tool from TDA is persistent homology in which data structure is examined at many scales. Representations of persistent homology include persistence barcodes and persistence diagrams, both of which are not straightforward to reconcile with traditional machine learning algorithms as they are sets of intervals or multisets. The problem of faithfully representing barcodes and persistent diagrams has been pursued along two main avenues: kernel methods and vectorizations. One vectorization is the Betti sequence, or Betti curve, derived from the persistence barcode. While the Betti sequence has been used in classification problems in various applications, to our knowledge, the stability of the sequence has never before been discussed. In this paper we show that the Betti sequence is unstable under the 1-Wasserstein metric with regards to small perturbations in the barcode from which it is calculated. In addition, we propose a novel stabilized version of the Betti sequence based on the Gaussian smoothing seen in the Stable Persistence Bag of Words for persistent homology. We then introduce the normalized cumulative Betti sequence and provide numerical examples that support the main statement of the paper.

• Steel and Composite Structures
• /
• v.29 no.5
• /
• pp.635-645
• /
• 2018

Beam-column joints play a significant role in static and dynamic performances of reinforced concrete frame structures. This study contributes a numerical approach of topologically optimal design of carbon fiber reinforced plastics (CFRP) to retrofit existing beam-column connections with crack patterns. In recent, CFRP is used commonly in the rehabilitation and strengthening of concrete members due to the remarkable properties, such as lightweight, anti-corrosion and simplicity to execute construction. With the target to provide an optimal CFRP configuration to effectively retrofit the beam-column connection under semi-failure situation such as given cracks, extended finite element method (X-FEM) is used by combining with multi-material topology optimization (MTO) as a mechanical description approach for strong discontinuity state to mechanically model cracked structures. The well founded mathematical formulation of topology optimization problem for cracked structures by using multiple materials is described in detail in this study. In addition, moved and regularized Heaviside functions (MRHF), that have the role of a filter in multiple materials case, is also considered. The numerical example results illustrated in two cases of beam-column joints with stationary cracks verify the validity, benefit and supremacy of the proposed method.

• Environmental Engineering Research
• /
• v.24 no.2
• /
• pp.220-237
• /
• 2019

Solid waste management (SWM) is one of the poorly rendered services in developing countries - limited resources, increasing population, rapid urbanization and application of outdated systems leads to inefficiency. Lack of proper planning and inadequate data regarding solid waste generation and collection compound the SWM problem. Decision makers need to formulate solutions that consider multiple goals and strategies. Given the large number of available options for SWM and the inter-relationships among these options, identifying SWM strategies that satisfy economic or environmental objectives is a complex task. The paper develops a mathematical model for a municipal Integrated SWM system, taking into account waste generation rates, composition, transportation modes, processing techniques, revenues from waste processing, simulating waste management as closely as possible. The constraints include those linking waste flows and mass balance, processing plants capacity, landfill capacity, transport vehicle capacity and number of trips. The linear programming model integrating different functional elements was solved by LINGO optimization software and various possible waste management options were considered during analysis. The model thus serves as decision support tool to evaluate various waste management alternatives and obtain the least-cost combination of technologies for handling, treatment and disposal of solid waste.

• Journal of the Korea Society for Simulation
• /
• v.27 no.4
• /
• pp.27-45
• /
• 2018

The terrestrial communication network and the underwater acoustic communication network have very different communication characteristics each other in operational environments, communication media, propagation delay, frequency bandwidth, transmission speed, bit error rate, and so on. These different characteristics cause some different address schemes and different maximum transmission units and, as a result, these differences must form certainly obstacles to the intercommunication between a terrestrial communication network and an underwater acoustic communication network. In this paper, we presents a method to use the virtual addresses to resolve the interconnection problem caused by different address schemes between a terrestrial communication network and an underwater acoustic communication network, and, through a mathematical modeling, we analyze the performance on the message transceiving delay time in the underwater environment.