• Journal of KIISE:Software and Applications
• /
• v.32 no.3
• /
• pp.215-226
• /
• 2005

Loop invariant code motion (LICM) optimization includes relatively heavy code analyses, thus being not readily applicable to Java Just-In-Time (JIT) compilation where the JIT compilation time is part of the whole running time. 'Classical' LICM optimization first analyzes the code and constructs both the def-use chains and the use-def chains. which are then used for performing code motions. This paper proposes a light-weight LICM algorithm, which requires only the def-use chains of loop invariant code (without use-def chains) by exploiting the fact that the Java virtual machine is based on a stack machine, hence generating code with simpler patterns. We also propose two techniques that allow more code motions than classical LICM techniques. First, unlike previous JIT techniques that uses LICM only in single-path loops for simplicity, we apply LICM to multi-path loops (natural loops) safely for partially redundant code. Secondly, we move loop-invariant, partially-redundant null pointer check code via predication support in Itanium. The proposed techniques were implemented in a JIT compiler for Itanium processor on ORP (Open Runtime Platform) Java virtual machine of Intel. On SPECjvrn98 benchmarks, the proposed technique increases the JIT compilation overhead by the geometric mean of 1.3％, yet it improves the total running time by the geometric mean of 2.2％.

• Journal of the Korean Mathematical Society
• /
• v.55 no.3
• /
• pp.623-669
• /
• 2018

In Donaldson-Thomas theory, moduli spaces are locally the critical locus of a holomorphic function defined on a complex manifold. In this paper, we develop a theory of critical virtual manifolds which are the gluing of critical loci of holomorphic functions. We show that a critical virtual manifold X admits a natural semi-perfect obstruction theory and a virtual fundamental class $[X]^{vir}$ whose degree $DT(X)=deg[X]^{vir}$ is the Euler characteristic ${\chi}_{\nu}$(X) weighted by the Behrend function ${\nu}$. We prove that when the critical virtual manifold is orientable, the local perverse sheaves of vanishing cycles glue to a perverse sheaf P whose hypercohomology has Euler characteristic equal to the Donaldson-Thomas type invariant DT(X). In the companion paper, we proved that a moduli space X of simple sheaves on a Calabi-Yau 3-fold Y is a critical virtual manifold whose perverse sheaf categorifies the Donaldson-Thomas invariant of Y and also gives us a mathematical theory of Gopakumar-Vafa invariants.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.680-684
• /
• 2005

This paper presents a data-based stability analysis of a MIMO linear time-invariant discrete-time system, as an extension of the previous results for a SISO system. In the MIMO case, a similar discussion as in the case of a SISO system is also applied, except that an augmented input and output space is considered whose dimension is determined in relation to both the orders of the input and output vectors and the numbers of inputs and outputs. As certain subspaces of the input and output space, both output data space and closed-loop data space are defined, which contain all the behaviors of a system, respectively, with zero input in open-loop and with a control input in closed-loop. Then, we can derive the data-based stability conditions, in which the open-loop stability can be checked by using a data matrix whose column vectors span the output data space and the closed-loop stability can also be checked by using a data matrix whose column vectors span the closed-loop data space.

• East Asian mathematical journal
• /
• v.40 no.1
• /
• pp.1-23
• /
• 2024

Let M be a semi-invariant submanifold of codimension 3 with almost contact metric structure (𝜙, 𝜉, 𝜂, g) in a complex space form M_n+1(c). We denote by A, K and L the second fundamental forms with respect to the unit normal vector C, D and E respectively, where C is the distinguished normal vector, and by R_𝜉 = R(𝜉, ·)𝜉 the structure Jacobi operator. Suppose that the third fundamental form t satisfies dt(X, Y) = 2𝜃g(𝜙X, Y) for a scalar 𝜃(≠ 2c) and any vector fields X and Y , and at the same time R_𝜉K = KR_𝜉 and ∇_{𝜙∇𝜉𝜉}R_𝜉 = 0. In this paper, we prove that if it satisfies ∇_𝜉R_𝜉 = 0 on M, then M is a real hypersurface of type (A) in M_n(c) provided that the scalar curvature $\bar{r}$ of M holds $\bar{r}-2(n-1)c{\leq}0$.

• Journal of Korea Multimedia Society
• /
• v.3 no.3
• /
• pp.241-252
• /
• 2000

In this paper, a translation, rotation and scale invariant system for the recognition of closed 2-D images using the bispectrum of a contour sequence and a weighted fuzzy classifier is derived and compared with the recognition process using one of the competitive neural algorithm, called a LVQ( Loaming Vector Quantization). The bispectrum based on third order cumulants is applied to the contour sequences of an image to extract fifteen feature vectors for each planar image. These bispectral feature vectors, which are invariant to shape translation, rotation and scale transformation, can be used to the represent two-dimensional planar images and are fed into a weighted fuzzy classifier. The experimental processes with eight different shapes of aircraft images are presented to illustrate a relatively high performance of the proposed recognition system.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.5
• /
• pp.449-457
• /
• 2011

As automated image processing techniques have been required in multi-temporal/multi-sensor geospatial image applications, use of automated but highly invariant image matching technique has been a critical ingredient. Note that there is high possibility of geometric and spectral differences between multi-temporal/multi-sensor geospatial images due to differences in sensor, acquisition geometry, season, and weather, etc. Among many image matching techniques, the SIFT (Scale Invariant Feature Transform) is a popular method since it has been recognized to be very robust to diverse imaging conditions. Therefore, the SIFT has high potential for the geospatial image processing. This paper presents a performance test results of the SIFT on geospatial imagery by simulating various image differences such as shear, scale, rotation, intensity, noise, and spectral differences. Since a geospatial image application often requires a number of good matching points over the images, the number of matching points was analyzed with its matching positional accuracy. The test results show that the SIFT is highly invariant but could not overcome significant image differences. In addition, it guarantees no outlier-free matching such that it is highly recommended to use outlier removal techniques such as RANSAC (RANdom SAmple Consensus).

• Journal of Korea Multimedia Society
• /
• v.5 no.2
• /
• pp.158-166
• /
• 2002

In this paper, we proposed a contour shape description method which use the CFR(contour fluctuation ratio) feature. The CFR is the ratio of the line length to the curve length of a contour segment. The line length means the distance of two end points on a contour segment, and the curve length means the sum of distance of all adjacent two points on a contour segment. We should acquire rotation and scale invariant contour segments because each CFR is computed from contour segments. By using the interleaved contour segment of which length is proportion to the entire contour length and which is generated from all the points on contour, we could acquire rotation and scale invariant contour segments. The CFR can describes the local or global feature of contour shape according to the unit length of contour segment. Therefore we describe the shape of objects with the feature vector which represents the distribution of CFRs, and calculate the similarity by comparing the feature vector of corresponding unit length segments. We implemented the proposed method and experimented with rotated and scaled 165 fish images of fifteen types. The experimental result shows that the proposed method is not only invariant to rotation and scale but also superior to NCCH and TRP method in the clustering power.

• Journal of KIISE:Information Networking
• /
• v.31 no.3
• /
• pp.243-251
• /
• 2004

This paper proposes a digital image watermarking scheme, which is robust to geometrical attacks. The method improves image normalization-based watermarking (INW) technique that doesn't effectively deal with geometrical attacks with cropping. Image normalization is based on the moments of the image, however, in general, geometrical attacks bring the image boundary cropping and the moments are not preserved original ones. Thereafter the normalized images of before and after are not same form, i.e., the synchronization is lost. To solve the cropping problem of INW, Invariant Centroid (IC) is proposed in this paper. IC is a gravity center of a central area on a gray scale image that is invariant although an image is geometrically attacked and the only central area, which has less cropping possibility by geometrical attacks, is used for normalization. Experimental results show that the IC-based method is especially robust to geometrical attack with cropping.

• The Journal of the Korea Contents Association
• /
• v.11 no.3
• /
• pp.1-8
• /
• 2011

Automatic vehicle license plate recognition technology is widely used in gate control and parking control of vehicles, and police enforcement of illegal vehicles. However inherent geometric information of the license plate can be transformed in the vehicle images due to the slant and the sunlight or lighting environment. In this paper, a distortion invariant vehicle license plate extraction and recognition algorithm is proposed. First, a binary image reserving clean character strokes can be achieved by using a DoG filter. A plate area can be extracted by using the location of consecutive digit numbers that reserves distortion invariant characteristic. License plate is recognized by using neural networks after geometric distortion correction and image enhancement. The simulation results of the proposed algorithm show that the accuracy is 98.4% and the average speed is 0.05 seconds in the recognition of 6,200 vehicle images that are obtained by using commercial LPR system.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2017.06a
• /
• pp.83-84
• /
• 2017

We propose a novel high dynamic range (HDR) video synthesis algorithm from alternatively exposed low dynamic range (LDR) videos. We first estimate correspondences between input fames using an illumination invariant descriptor. Then, we synthesize an HDR frame with the weights computed to maximize detail preservation in the output HDR frame. Experimental results demonstrate that the proposed algorithm provides high-quality HDR videos without noticeable artifacts.