• The Journal of the Korea Contents Association
• /
• v.10 no.7
• /
• pp.10-22
• /
• 2010

This study proposes a new method of multiple homographies estimation between two images. With a large proportion of outliers, RANSAC is a general and very successful robust parameter estimator. However it is limited by the assumption that a single model acounts for all of the data inliers. Therefore, it has been suggested to sequentially apply RANSAC to estimate multiple 2D projective transformations. In this case, because outliers stay in the correspondence data set through the estimation process sequentially, it tends to progress slowly for all models. And, it is difficult to parallelize the sequential process due to the estimation order by the number of inliers for each model. We introduce a guided sequential RANSAC algorithm, using the local model instances that have been obtained from RANSAC procedure, which is able to reduce the number of random samples and deal simultaneously with multiple models.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.4
• /
• pp.113-123
• /
• 2004

This paper presents a new collusion-secure fingerprinting scheme to embed fingerprints into three-dimensional(3-D) mesh models efficiently. In the proposed scheme, we make the same number of fingerprints as the number of customers based on the finite projective geometry, partition a 3-D mesh model related to the number of bits assigned to each fingerprint and then embed a watermark representing copyright information into each submesh to be marked. Considering imperceptibility and robustness of the watermarking algorithm we embed the watermark signal into mid-frequency DCT coefficients obtained by transforming vertex coordinates in the triangle strips which are generated from the submeshes to be marked. Experimental results show that our scheme is robust to additive random noises, MPEG-4 SNHC 3-D mesh coding, geometrical transformations, and fingerprint attacks by two traitors' collusion. In addition, we can reduce the number of bits assigned to each fingerprint significantly.

• Journal of the Korean association of regional geographers
• /
• v.6 no.3
• /
• pp.83-99
• /
• 2000

This paper purposes to provide a new perspective for better development of geography texts. For this purpose, we have applied spatial cognition development theory to children's drawings. We have suggested that children's spatial operation ability has three development stages according to their age: topological space, projective space, euclidean space. This study turns out that Piaget and Inhelder's spatial concept development theory is on the right track. However, we make clear that their division according to the age is not always accurate due to children's individual differences. These findings have educational implications as the following: First, it is dubious that most children can understand pictures, pictorial maps and illustrations in the third grader's textbook. Second, current textbooks require pictorial map understanding and drawing to third grade students and map drawing to fourth grade students. However, according to this study, the placement of these tasks are not fit for children's developmental stage because both tasks correspond to euclidean space operation. Therefore, we should remove them from the textbook for children at the age.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.10
• /
• pp.49-54
• /
• 2007

As digital contents based on 3D graphics are increased, the requirement for low power 3D graphic hardware for mobile devices is increased. We design a transformation engine for mobile 3D graphic processor. We propose a simplified transformation engine for mobile 3D graphic processor. The area of the transformation engine is reduced by merging a mapping transformation unit into a projective transformation unit and by replacing a clipping unit with a selection unit. It consists of a viewing transformation unit a projective transformation unit a divide by w nit, and a selection unit. It can process 32 bit floating point format of the IEEE-754 standard or a reduced 24 bit floating point format. It has a pipelined architecture so that a vertex is processed every 4 cycles except for the initial latency. The RTL code is verified using an FPGA.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2540-2547
• /
• 1999

Chromakey method is one of key technologies for realizing virtual studio, and the blue portions of a captured image in virtual studio, are replaced with a computer generated or real image. The replaced image must be changed according to the camera parameter of studio for natural merging with the non-blue portions of a captured image. This paper proposes a novel method to extract camera parameters using the recognition of pentagonal patterns that are painted on a blue screen. We extract corresponding points between a blue screen. We extract corresponding points between a blue screen and a captured image using the projective invariant features of a pentagon. Then, calculate camera parameters using corresponding points by the modification of Tsai's method. Experimental results indicate that the proposed method is more accurate compared to conventional method and can process about twelve frames of video per a second in Pentium-MMX processor with CPU clock of 166MHz.

• Korean Journal of Logic
• /
• v.22 no.2
• /
• pp.253-290
• /
• 2019

Wittgenstein presents so-called picture theory in the Tractatus Logico-Philosophicus. What is, then, the point of the picture theory? What are the philosophical problems which the picture theory tries to solve? In this paper, I will endeavor to show that the object of a picture is different from the sense of a picture, that the representing relation is different from the projective relation, that picture theory is applied to composite propositions as well as elementary propositions and that on the one hand the basic problems that picture theory tries to solve are problem of theory of meaning and that of theory of truth, but on the other hand the more important problem is what Wittgenstein calls "the mystery of negation." From these discussions, we can see that it is not correct at all to interpret that the picture theory in the Tractatus Logico-Philosophicus is nothing but an analogy which does not have a significant content.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.3
• /
• pp.497-508
• /
• 2021

In this paper, we focus on optimizing the performance of CSURF, which uses the tweaked Montgomery curves. The projective version of elliptic curve arithmetic is slower on tweaked Montgomery curves than on Montgomery curves, so that CSURF is slower than the hybrid version of CSIDH. However, as the square-root Velu formula uses less number of ellitpic curve arithmetic than the standard Velu formula, there is room for optimization We optimize the square-root Velu formula and 2-isogeny formula on tweaked Montgomery curves. Our CSURFis 14% faster than the standard CSURF, and 10.8% slower than the CSIDH using the square-root Velu formula. The constant-time CSURF is 6.8% slower than constant-time CSIDH. Compared to the previous implementations, this is a remarkable result.

• Korean Journal of Mathematics
• /
• v.22 no.1
• /
• pp.151-167
• /
• 2014

Let M, N be modules over a ring R and $[M,N]=Hom_R(M,N)$. The concern is study of: (1) Some fundamental properties of [M, N] when [M, N] is regular or semipotent. (2) The substructures of [M, N] such as radical, the singular and co-singular ideals, the total and others has raised new questions for research in this area. New results obtained include necessary and sufficient conditions for [M, N] to be regular or semipotent. New substructures of [M, N] are studied and its relationship with the Tot of [M, N]. In this paper we show that, the endomorphism ring of a module M is regular if and only if the module M is semi-injective (projective) and the kernel (image) of every endomorphism is a direct summand.

• Journal of the Korean Mathematical Society
• /
• v.44 no.1
• /
• pp.151-167
• /
• 2007

If k is a subfield of $\mathbb{Q}(\varepsilon_m)$ then the cohomology group $H^2(k(\varepsilon_n)/k)$ is isomorphic to $H^2(k(\varepsilon_{n'})/k)$ with gcd(m, n') = 1. This enables us to reduce a cyclotomic k-algebra over $k(\varepsilon_n)$ to the one over $k(\varepsilon_{n'})$. A radical extension in projective Schur algebra theory is regarded as an analog of cyclotomic extension in Schur algebra theory. We will study a reduction of cohomology group of radical extension and show that a Galois cohomology group of a radical extension is isomorphic to that of a certain subextension of radical extension. We then draw a cohomological characterization of radical group.

• Journal of the Korean Mathematical Society
• /
• v.44 no.1
• /
• pp.35-54
• /
• 2007

Let $M_c$ = M(2, 0, c) be the moduli space of O(l)-semistable rank 2 torsion-free sheaves with Chern classes $c_1=0\;and\;c_2=c$ on a K3 surface X, where O(1) is a generic ample line bundle on X. When $c=2n\geq4$ is even, $M_c$ is a singular projective variety equipped with a holomorphic symplectic structure on the smooth locus. In particular, $M_c$ has trivial canonical divisor. In [22], O'Grady asks if there is any symplectic desingularization of $M_{2n}$ for $n\geq3$. In this paper, we show that there is no crepant resolution of $M_{2n}$ for $n\geq3$. This obviously implies that there is no symplectic desingularization.