• Journal of KIISE:Software and Applications
• /
• v.26 no.10
• /
• pp.1167-1167
• /
• 1999

Although spatial databases support an efficient spatial management on objects in the real world, they have a characteristic that process only spatial information valid at current time, So in case of change in the spatial domain, it is very hard to support an efficient historical management for time-varying spatial information because they delete an old value and then replace with new value that is valid at current time. To solve these problems, there are rapidly increasing of interest for spatiotemporal databases, which serve historical functions for spatial information as well as spatial management functions for an object. However most of them presented in an abstract time-varying spatial phenomenon, but have not presented a concrete policy in spatiotemporal databases. In this paper, we propose a spatiotemporal data model that supports bitemporal time concepts in three dimensional architecture. In the proposed model, not only data types and their operation for object of spatiotemporal databases have been classified, but also mathematical expressions using formal semantics for them have been given. Then, the data structures and their operations based on relational database model as well as object-oriented database model are presented.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.7 no.1
• /
• pp.1-6
• /
• 2007

The SVDD (support vector data description) is one of the most well-known one-class support vector learning methods, in which one tries the strategy of utilizing balls defined on the feature space in order to distinguish a set of normal data from all other possible abnormal objects. Recently, with the objective of generalizing the SVDD which treats all training data with equal importance, the so-called D-SVDD (density-induced support vector data description) was proposed incorporating the idea that the data in a higher density region are more significant than those in a lower density region. In this paper, we consider the problem of further improving the D-SVDD toward the use of a partial reference set for testing, and propose an LMI (linear matrix inequality)-based optimization approach to solve the improved version of the D-SVDD problems. Our approach utilizes a new class of density-induced distance measures based on the RSDE (reduced set density estimator) along with the LMI-based mathematical formulation in the form of the SDP (semi-definite programming) problems, which can be efficiently solved by interior point methods. The validity of the proposed approach is illustrated via numerical experiments using real data sets.

• International Journal of Automotive Technology
• /
• v.2 no.1
• /
• pp.17-23
• /
• 2001

Measurements of the initial values lead to an inverse and mathematically unprecisely formulated problem. A precise definition of an inverse problem is possible. It is to state a mathematical model of a physical process with clearly defined initial and exit values for the system behind the process. One can grasp the idea of an inverse problem by considering the tire as a copy of the objects of nature in a room with observations. Interpretation of nature is generally a result of an inverse problem. On one hand, the tire may be represented through the sensory organs and the nervous system as well as the experiences of the developer's existing apparatus of the projection of reality. On the other hand, it may be represented by a physical law or a model that can be confirmed or is to be refuted with the help of suitable measurements. During reconstruction of a measuring signal and the identification of a black box that can be assumed to be linear and causal, the tire becomes a first type Volterra integral equation of the convolution type. But measurements of the initial values are always fuzzy, the errors grow and the system behavior can no longer be forecasted. Thus, we have to deal with a chaotic system. This chaos produces fractals in a natural way. These are self-similar geometric structures. This self-similarity is clearly visible in the design.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.18 no.2
• /
• pp.181-192
• /
• 2014

In this paper, we propose a robust real-time myocardial border tracking algorithm for echocardiography. Commonly, after an initial contour of LV border is traced at one or two frame from the entire cardiac cycle, LV contour tracking is performed over the remaining frames. Among a variety of tracking techniques, optical flow method is the most widely used for motion estimation of moving objects. However, when echocardiography data is heavily corrupted in some local regions, the errors bring the tracking point out of the endocardial border, resulting in distorted LV contours. This shape distortion often occurs in practice since the data acquisition is affected by ultrasound artifacts, dropout or shadowing phenomena of cardiac walls. The proposed method deals with this shape distortion problem and reflects the motion realistic LV shape by applying global deformation modeled as affine transform partitively to the contour. We partition the tracking points on the contour into a few groups and determine each affine transform governing the motion of the partitioned contour points. To compute the coefficients of each affine transform, we use the least squares method with equality constraints that are given by the relationship between the coefficients and a few contour points showing good tracking results. Many real experiments show that the proposed method supports better performance than existing methods.

• International Journal of Precision Engineering and Manufacturing
• /
• v.9 no.4
• /
• pp.16-21
• /
• 2008

The demand for three-dimensional (3D) shape measurements is increasing in a variety of fields, including the manufacture of molds and dies. The most popular technology for 3D shape measurement is the coordinate measuring machine (CMM) with a contact trigger probe. Although a CMM provides a high degree of accuracy, it is inefficient due to its long measuring time. It also has difficulty measuring soft objects that can be deformed by the touch of the contact probe. In addition, a CMM cannot digitize areas that are difficult to reach, and cannot capture very minute details on the surface of complex parts. For these reasons, optical non-contact measurement techniques are receiving more attention since they eliminate most of the problems associated with contact methods. Laser scanning is emerging as one of the more promising non-contact measurement techniques. This paper describes various acquisition considerations for laser scanning, including the accuracy of the 3D scan data, which depends on the charge-coupled device (CCD) gain and noise. The CCD gain and noise of a 3D laser scanner are varied while keeping the other conditions constant, and the measurement results are compared to the dimensions of a standard model. The experimental results show that a considerable time savings and an optimum degree of accuracy are possible by selecting the proper CCD gain and noise.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.165-168
• /
• 2001

It is possible to classify image data into two types according to the internal representation: one is bitmap, the other is vector. A bitmap image is represented by the two dimensional pixels whereas a vector image is represented by mathematical functions to draw vector objects such as line, rectangle and circle on the two or three dimensional space. So it is necessary for users to use a individual application program for each different image. In this paper, we present a method for designing and implementation of image editing tool based on combining of bitmap and vector image.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.3
• /
• pp.319-326
• /
• 1994

Automatic control has been for the most part applied to linear systems where ti can be approximately formalized. In case that it is not definitely established the mathematical modelling to control objects, it requires manual control strategies which put under the human rule. In this paper, it constructs an FLC (Fuzzy Logic Controller) in order to turn a hand control into an automatic control in the domain of swimming pool that has been almost absolutely dependant on a skilled worker's experience. Genetic algorithms upgrade the knowledge which is acquired from human expert, using by FLC, so as to maintain knowledge in the very optimal way. It also designs an algorithm that modifies the rule base and the membership function at the same time, and ultimately will show that it can get better result than human controllers.

• Journal of The Korean Astronomical Society
• /
• v.36 no.3
• /
• pp.177-187
• /
• 2003

Active galactic nuclei (AGNs) are distant, powerful sources of radiation over the entire electromagnetic spectrum, from radio waves to gamma-rays. There is much evidence that they are driven by gravitational accretion of stars, dust, and gas, onto central massive black holes (MBHs) imprisoning anywhere from $\~$1 to $\~$10,000 million solar masses; such objects may naturally form in the centers of galaxies during their normal dynamical evolution. A small fraction of AGNs, of the radio-loud type (RLAGNs), are somehow able to generate powerful synchrotron-emitting structures (cores, jets, lobes) with sizes ranging from pc to Mpc. A brief summary of AGN observations and theories is given, with an emphasis on RLAGNs. Preliminary results from the imaging of 10000 extragalactic radio sources observed in the MITVLA snapshot survey, and from a new analytic theory of the time-variable power output from Kerr black hole magnetospheres, are presented. To better understand the complex physical processes within the central engines of AGNs, it is important to confront the observations with theories, from the viewpoint of analyzing the time-variable behaviours of AGNs - which have been recorded over both 'short' human ($10^0-10^9\;s$) and 'long' cosmic ($10^{13} - 10^{17}\;s$) timescales. Some key ingredients of a basic mathematical formalism are outlined, which may help in building detailed Monte-Carlo models of evolving AGN populations; such numerical calculations should be potentially important tools for useful interpretation of the large amounts of statistical data now publicly available for both AGNs and RLAGNs.

• Journal of Korea Game Society
• /
• v.15 no.3
• /
• pp.189-200
• /
• 2015

These days computer graphics technology has been applied in diverse IT fields. Needs for computer graphics such as 3D Printer, Head Mount Display, VR & AR are growing rapidly. Computer graphics will be more specialized and demanding for graphics specialists will be also increased. However, serious mathematical background obstructs people to learning computer graphics. An efficient computer graphics learning system would be helpful for graphics experts training. By analyzing the graphics theory, we propose an educational software system with that students can effectively learn computer graphics. Our system focuses on theoretical objects of computer graphics and enhances accessibility and intuition using web and blocks.

• IE interfaces
• /
• v.24 no.1
• /
• pp.78-86
• /
• 2011

To mitigate space restriction and to raise productivity, some shipbuilding companies use floating-docks on the sea instead of dry-docks on the land. In that case, a floating-crane that can lift very heavy objects (up to 3,600 tons) is used to handle the blocks which are the basic units in shipbuilding processes, and so, very large blocks (these are called the mega-blocks) can be used to build a ship. But, because these mega-blocks can be made only in the area near the floating-dock and beside the sea, the space is very important resource for the process. Therefore, our problem is to make an efficient spatial schedule for the mega-block assembly yard. First of all, we formulate this situation into a mathematical model and find optimal solution for a small problem using a commercial optimization software. But, the software could not give optimal solutions for practical sized problems in a reasonable time, and so we propose a GA-based heuristic algorithm. Through a numerical experiment, finally, we show that the spatial scheduling algorithm can provide a very good performance.