• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.112-115
• /
• 2000

This paper describes the algorithm, architecture and design of the circuit implementing motion tracing features based on the edge detection. The Sobel operation was used to compute the edges of moving objects. Motion tracing is performed by searching for the center of the edges for each frame and adding those centers. The edger and the centers of the moving object from camera were displayed in the monitor and verified using Xillinx FPGA.

• Journal of the Korean Mathematical Society
• /
• v.44 no.3
• /
• pp.707-717
• /
• 2007

Arches are constrained with rotational resistance at both edges. An energy method is used to derive variational formulation which is used to prove the existence of equilibrium states of elastic circular arches for the torsional spring constants ${\rho}-\;{\geq}\;0,\;{\rho}+\;{\geq}\;0,\;and\;{\rho}-\;+\;{\rho}+\;>\;0$. The boundary conditions are searched using the existence of minimum potential energy.

• Communications for Statistical Applications and Methods
• /
• v.4 no.3
• /
• pp.817-825
• /
• 1997

Images reconstructed with EM algorithm have been observed to have checkerboard effects and have large distortions near edges as iterations proceed. We suggest a aimple algorithm of applying line process to the EM and Bayesian EM to reduce the distortions near edges. We show by simulation that this algorithm improves the clarity of the reconstructed image and has good properties based on root mean square error.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.11
• /
• pp.876-885
• /
• 1991

This paper proposes an on-line method of understanding humans conducting action observed through a vision sensor. The vision system captures images of conducting action and extracts image coordinates of endpoint of the baton. A proposed algorithm based on the expert knowledge about conducting recognizes patterns of the conducting action from the extracted image coordimates and play the corresponding music score. Complementary algorithms are also proposed for identifying the first beat static point and dynamics through extensive experiments, this algorithm is found to detect lower edges and upper edges without error.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.105-108
• /
• 2002

This paper proposes a new watermarking algorithm to embed data in 1-bit images using edges for protecting illegal copies or modifications. This method is based on edge detection to decide the most invisible region. This paper also introduces a new shuffling method which embeds data in each blocks uniformly and finds Positions under the limited attacks. In experiment, we compare the proposed shuffling method with M. Wu's method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.10
• /
• pp.130-138
• /
• 1996

In this paper, we propose a neural network which detect edges of different orentation and spatial frequency in arbitrary image data. We constructed the proposed neural network iwth two different types neural network. A diffusion network performs the gaussian operation efficiently by the diffusion process. And the spatial difference network has specially designed connections suitble to detect the contours of a specific oriention. Simulation results showed that the proposed neural network can extract the edges of selected orientation efficiently by applying the neural network to a test pattern and the real image.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.5
• /
• pp.726-731
• /
• 1986

An effective filtering algorithm which can reduce noise and preserve edges for the restoration of an image degraded by additive white Gaussian noise is presented. The algorithm proposed in this paper is an extension of Lee's algorithm modified to use local gradient information as well as local statistics. It does not require image modeling, and removes noise along the orientaiton of edges so that it does not blur the edge.

• Journal of the Korean Society for Precision Engineering
• /
• v.10 no.1
• /
• pp.89-99
• /
• 1993

A solid modeller was developed in this paper. Representation scheme of modelling is nonmanifold B-rep. While namy B-rep modellers use edges as basic element of modelling, this modeller is triangle-based. New modelling element, split triangle that is composed of 3 pure half-edges and has no information about the adjoining triangles, was defined to enlarge the range of representation. Corresponding algorithms for Boolean set operations were also developed.

• The Bulletin of The Korean Astronomical Society
• /
• v.45 no.1
• /
• pp.47.2-47.2
• /
• 2020

The Experiment to Detect the Global EoR Signature (EDGES) has probed the status of the early Universe through the global 21cm observation. The claimed (brightness temperature) of ~ 500 mK absorption dip at z~17 against the continuum background cannot be explained in the standard LambdaCDM framework. In the meantime, the Planck 2018 Legacy Data, especially the E-mode polarization power spectrum, puts rather strong constraints on the high-redshift reionization process. We show how these two observational contraints can be accomodated in a series of reionization scenarios, with a special focus on the strongly self-regulated reionization by first stars.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.3
• /
• pp.107-113
• /
• 2015

This paper presents a polynomial time algorithm to the minimum cardinality feedback edge set and minimum weight feedback edge set problems. The algorithm makes use of the property wherein the sum of the minimum spanning tree edge set and the minimum feedback edge set equals a given graph's edge set. In other words, the minimum feedback edge set is inherently a complementary set of the former. The proposed algorithm, in pursuit of the optimal solution, modifies the minimum spanning tree finding Kruskal's algorithm so as to arrange the weight of edges in a descending order and to assign cycle-deficient edges to the maximum spanning tree edge set MXST and cycle-containing edges to the feedback edge set FES. This algorithm runs with linear time complexity, whose execution time corresponds to the number of edges of the graph. When extensively tested on various undirected graphs both with and without the weighed edge, the proposed algorithm has obtained the optimal solutions with 100% success and accuracy.