• Aerospace Engineering and Technology
• /
• v.12 no.2
• /
• pp.147-155
• /
• 2013

The nominal radiometric calibration equation and additional five algorithms are applied in the infrared channel radiometric calibration for the COMS (Communication, Ocean, Meteorological Satellite) MI (Meteorological Imager). The processing end time of the radiometric calibration is directly related with the start time of geometric calibration processing since the geometric calibration processing is followed by that of the radiometric calibration. This paper describes comparison and analysis results for geometric calibration processing using two types of the radiometric calibration results, outputs from only the nominal radiometric calibration equation and outputs from the complete one (the nominal radiometric calibration equation with additional five algorithms), to propose a method with the earlier start time of the geometric calibration processing. Experimental results show that both of radiometric calibration results, from the nominal radiometric calibration equation with a fast processing speed and from the complete one with accurate radiometric values, can be used in the geometric calibration as the appropriate inputs because those processing results satisfied the requirements of geometric calibration processing accuracy. Thus the radiometric calibration results from the nominal radiometric calibration equation can be used to improve geometric calibration processing time.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.1168-1170
• /
• 2003

The GMS geometric correction method with highspeed and high accuracy is needed. In this paper, a selection method of residual errors for the GMS geometric correction using GCPs (ground control points) is described. Namely, it is a technique for limiting the number of residual error acquisition using GCPs in each block to reduce the processing time. As the result, since the processing time was about 7.0 minutes on conventional geometric correction and about 5.6 minutes on the proposed method, it was shown that the processing time of about 1.4 minutes was shortened.

• Journal of Information Processing Systems
• /
• v.4 no.4
• /
• pp.153-158
• /
• 2008

This paper deals with the geometric fitting algorithms for parametric curves and surfaces in 2-D/3-D space, which estimate the curve/surface parameters by minimizing the square sum of the shortest distances between the curve/surface and the given points. We identify three algorithmic approaches for solving the nonlinear problem of geometric fitting. As their general implementation we describe a new algorithm for geometric fitting of parametric curves and surfaces. The curve/surface parameters are estimated in terms of form, position, and rotation parameters. We test and evaluate the performances of the algorithms with fitting examples.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.462-465
• /
• 2000

It is important to compress three dimensional (3D) data efficiently, since 3D data are too large to store or transmit in general. In this paper, we propose a lossless compression algorithm of the 3D mesh connectivity, based on the vertex degree. Most techniques for the 3D mesh compression treat the connectivity and the geometric separately, but our approach attempts to exploit the geometric information for compressing the connectivity information. We use the geometric angle constraint of the vertex fanout pattern to predict the vertex degree, so the proposed algorithm yields higher compression efficiency than the conventional algorithms.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.4
• /
• pp.294-305
• /
• 2004

Highly detailed geometric models are rapidly becoming commonplace in computer graphics and other applications. These complex models, which is often represented as complex1 triangle meshes, mainly suffer from the vast memory requirement for real-time manipulation of arbitrary geometric shapes without loss of data. Various techniques have been devised to challenge these problems in views of geometric processing, not a representation scheme. This paper proposes the new mesh structure for the compact representation and the efficient handling of the highly complex models. To verify the compactness and the efficiency, the memory requirement of our representation is first investigated and compared with other existing representations. And then we analyze the time complexity of our data structure by the most critical operation, that is, the enumeration of the so-called one-ring neighborhood of a vertex. Finally, we evaluate some elementary modeling functions such as mesh smoothing, simplification, and subdivision, which is to demonstrate the effectiveness and robustness of our mesh structure in the context of the geometric modeling and processing.

• International Journal of CAD/CAM
• /
• v.8 no.1
• /
• pp.69-72
• /
• 2009

In this paper, we present a new shape descriptor, which is named Poisson equation-Fourier-Mellin moment Descriptor. We solve the Poisson equation in the shape area, and use the solution to get feature function, which are then integrated using Fourier-Mellin moment to represent the shape. This method develops the Poisson equation-geometric moment Descriptor proposed by Lena Gorelick, and keeps both advantages of Poisson equation-geometric moment and Fourier-Mellin moment. It is proved better than Poisson equation-geometric moment Descriptor in shape recognition and classification experiments.

• Korean Journal of Computational Design and Engineering
• /
• v.7 no.4
• /
• pp.269-279
• /
• 2002

Geometric shape morphing is an interesting geometric operation that interpolates two geometric shapes to generate in-betweens. It is well known that Minkowski operations can be used to test and build collision-free motion paths and to modify shapes in digital image processing. In this paper, we present a new geometric modeling technique to control the morphing on geometric shapes based on Minkowski sum. The basic idea develops from the linear interpolation on two geometric shapes where the traditional algebraic sum is replaced by Minkowski sum. We extend this scheme into a Bezier-like control structure with multiple control shapes, which enables the interactive control over the intermediate shapes during the morphing sequence as in the traditional CAGD curve/surface editing. Moreover, we apply the theory of blossoming to our control structure, whereby our control structure becomes even more flexible and general. In this paper, we present mathematical models of control structure, their properties, and computational issues with examples.

• International Journal of CAD/CAM
• /
• v.6 no.1
• /
• pp.173-181
• /
• 2006

In this paper, an integration framework of Geometric Constraint Solving Engine and AutoCAD is presented, and a dynamic geometric constraint system is introduced. According to inherent orientation features of geometric entities and various Object Snap results of AutoCAD, the' proposed system can automatically construct an under-constrained geometric constraint model during interactive drawing. And then the directed constraint graph in a geometric constraint model is realtime modified in order to produce an optimal constraint solving sequence. Due to the open object-oriented characteristics of AutoCAD, a set of user-defined entities including basic geometric elements and graphics constraint relations are defined through derivation. And the custom-made Object Reactor and Command Reactor are also constructed. Several powerful characteristics are achieved based on these user-defined entities and reactors, including synchronously processing geometric constraint information while saving and opening DWG files, visual constraint relations, and full adaptability to Undo/Redo operations. These characteristics of the proposed system can help the designers more easily manage geometric entities and constraint relations between them.

• Journal of the Korea Computer Graphics Society
• /
• v.7 no.3
• /
• pp.9-18
• /
• 2001

Feature detection is important in various mesh processing techniques, such as mesh editing, mesh morphing, mesh compression, and mesh signal processing. In this paper, we propose a geometric snake as an interactive tool for feature detection on a 3D triangular mesh. A geometric snake is an extension of an image snake, which is an active contour model that slithers from its initial position specified by the user to a nearby feature while minimizing an energy functional. To constrain the movement of a geometric snake onto the surface of a mesh, we use the parameterization of the surrounding region of a geometric snake. Although the definition of a feature may vary among applications, we use the normal changes of faces to detect features on a mesh.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1294-1310
• /
• 2010

User authentication using fingerprint information provides convenience as well as strong security. However, serious problems may occur if fingerprint information stored for user authentication is used illegally by a different person since it cannot be changed freely as a password due to a limited number of fingers. Recently, research in fuzzy fingerprint vault system has been carried out actively to safely protect fingerprint information in a fingerprint authentication system. In addition, research to solve the fingerprint alignment problem by applying a geometric hashing technique has also been carried out. In this paper, we propose the hardware architecture for a geometric hashing based fuzzy fingerprint vault system that consists of the software module and hardware module. The hardware module performs the matching for the transformed minutiae in the enrollment hash table and verification hash table. On the other hand, the software module is responsible for hardware feature extraction. We also propose the hardware architecture which parallel processing technique is applied for high speed processing. Based on the experimental results, we confirmed that execution time for the proposed hardware architecture was 0.24 second when number of real minutiae was 36 and number of chaff minutiae was 200, whereas that of the software solution was 1.13 second. For the same condition, execution time of the hardware architecture which parallel processing technique was applied was 0.01 second. Note that the proposed hardware architecture can achieve a speed-up of close to 100 times compared to a software based solution.