• Journal of KIISE:Software and Applications
• /
• v.31 no.12
• /
• pp.1581-1590
• /
• 2004

We present a robust off-line method recognizing handwritten digits by only using stroke direction codes as a feature of handwritten digits. This method makes general 8-direction codes for an input digit and then has the multi-layered neural networks learn them and recognize each digit. The 8-direction codes are made of the thinned results of each digit through SOG*(Improved Self-Organizing Graph). And the usage of these codes simplifies the complex steps processing at least two features of the existing methods. The experimental result shows that the recognition rates of this method are constantly better than 98.85% for any images in all digit databases.

• Journal of Elementary Mathematics Education in Korea
• /
• v.23 no.1
• /
• pp.119-141
• /
• 2019

This study was carried out in order to draw some implications for teaching statistical graph in mathematics education with respect to practical statistics education for promoting students' statistical literacy. We analyze 133 graphs appearing in 99 elementary textbooks of other subjects (subjects except from mathematics) by subjects and types, and identify some cases of graphs addressed by other subjects. As a results, statistical graph was most addressed in social studies, and bar graphs, line graphs, tables, and circle graphs are most used in other subjects. Moreover, there are some issues related to contents-(1) the problem of curricular sequencing between mathematics and other subjects, (2) the level of addressing ratio graph, and (3) the use of wavy lines. In terms of forms, (1) the visual variation of graphical representations, (2) representation combining multiple graphs, and (2) graphs specialized for particular subjects are drawn as other issues. We suggest some implications to be considered when teaching the statistical graph in elementary mathematics classes.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.12 no.2
• /
• pp.11-17
• /
• 1975

The paper examined the character structure as a basic study for the recognition of Korean characters. In view of concave structure, line structure and node relationship of character graph, the algebraic structure of the basic Korean characters is are analized. Also, the degree of complexities in their character structure is discussed and classififed. Futhermore, by describing the fact that some equivalence relations are existed between the 10 vowels of rotational transformation group by Affine transformation of one element into another, it could be pointed out that the geometrical properting in addition to the topological properties are very important for the recognition of Korean characters.

• Korean Journal of Remote Sensing
• /
• v.26 no.6
• /
• pp.731-740
• /
• 2010

A region merging technique is suggested in this paper for the segmentation of high-spatial resolution imagery. It employs a region growing scheme based on the region adjacency graph (RAG). The proposed algorithm uses directional neighbor-line average feature vectors to improve the quality of segmentation. The feature vector consists of 9 components which includes an observation and 8 directional averages. Each directional average is the average of the pixel values along the neighbor line for a given neighbor line length at each direction. The merging coefficients of the segmentation process use a part of the feature components according to a given merging coefficient order. This study performed the extensive experiments using simulation data and a real high-spatial resolution data of IKONOS. The experimental results show that the new approach proposed in this study is quite effective to provide segments of high quality for the object-based analysis of high-spatial resolution images.

• Journal of the Korea Society for Simulation
• /
• v.15 no.2
• /
• pp.31-39
• /
• 2006

The visibility graph is a well-known method for efficient path-finding with the minimum search space modelling the game world. The generalized visibility graph is constructed on the expanded obstacle boundaries to eliminate the "wall-hugging" problem which is a major disadvantage of using the visibility graph. The paths generated by the generalized visibility graph are guaranteed to be near optimal and natural-looking. In this paper we propose the method to apply the generalized visibility graph efficiently for game characters who moves among static obstacles between varying start and goal points. Even though the space is minimal once the generalized visibility graph is constructed, the construction itself is time-consuming in checking the intersection between every two links connecting nodes. The idea is that we build the map for static obstacles first and then incorporate start and goal nodes quickly. The incorporation of start and goal nodes is the part that must be executed repeatedly. Therefore we propose to use the rotational plane-sweep algorithm in the computational geometry for incorporating start and goal nodes efficiently. The simulation result shows that the execution time has been improved by 39%-68% according to running times in the game environment with multiple static obstacles.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.6
• /
• pp.677-682
• /
• 2015

The mnemonic-system in numbers is helped you to remember numbers. In this mnemonic-system, a graph or image is a rather neat mnemonic. In graph-based systems, there are many ways such as dot, line, bar, and etc to represent a mnemonic system. Mnemonics aim to translate information into a form that the brain can retain better than its original form. This is the same in the mnemonic-system in numbers. Alternative methods in mnemonic-system for numbers are a image. In this paper, we suggest a simple graph algorithm and arranged image algorithm for the mnemonic-system in numbers, and show comparative results based on the retention of the mnemonic system about two methods.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2009.09a
• /
• pp.1141-1146
• /
• 2009

The compressibility of clay has been expressed e-log p' graph. In natural clay, e-log p' graph are changed by deposition condition and chemical cementation as well as Atterberg limits, whereas in reconstituted clay, it is generally known that e-log p’ curve is varied with Atterberg limits. However, e-log p' graph is possible to change according to the reconstituting methods and test conditions. In this study, consolidation tests are performed as various test condition for reconstituted Busan clay. Test results show that the relationship e/$e_L$ and log p' is almost constant with $e_L$. And the compression index obtained from slurry method sample is larger than one obtained from kneading method sample. Intrinsic compression line (ICL) of Busan clay is identical with ICL suggested by Burland.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.202-213
• /
• 2007

A network is an important model widely used in natural and social science as well as engineering. To analyze these networks easily it is necessary that we should layout the features of networks visually. These Graph-Layout researches have been performed recently according to the development of the computer technology. Among them, the Scale-free Network that stands out in these days is widely used in analyzing and understanding the complicated situations in various fields. The Scale-free Network is featured in two points. The first, the number of link(Degree) shows the Power-function distribution. The second, the network has the hub that has multiple links. Consequently, it is important for us to represent the hub visually in Scale-free Network but the existing Graph-layout algorithms only represent clusters for the present. Therefor in this thesis we suggest Graph-layout algorithm that effectively presents the Scale-free network. The Hubity(hub+ity) repulsive force between hubs in suggested algorithm in this thesis is in inverse proportion to the distance, and if the degree of hubs increases in a times the Hubity repulsive force between hubs is ${\alpha}^{\gamma}$ times (${\gamma}$??is a connection line index). Also, if the algorithm has the counter that controls the force in proportion to the total node number and the total link number, The Hubity repulsive force is independent of the scale of a network. The proposed algorithm is compared with Graph-layout algorithm through an experiment. The experimental process is as follows: First of all, make out the hub that exists in the network or not. Check out the connection line index to recognize the existence of hub, and then if the value of connection line index is between 2 and 3, then conclude the Scale-free network that has a hub. And then use the suggested algorithm. In result, We validated that the proposed Graph-layout algorithm showed the Scale-free network more effectively than the existing cluster-centered algorithms[Noack, etc.].

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.22 no.3
• /
• pp.654-662
• /
• 1998

Shift quality of an automatic transmission in a vehicle is mainly affected by transient pressures in the hydraulic system during shifting. In this study, dynamic modelings of the hydraulic system and the power train of an automatic transmission are made systematically by a bond-graph method. The dynamic characteristics of the line pressures and clutch/brake pressures during shiftings are investigated by simulations and verified by experiments. The effects of clutch/brake pressures on the shift torque are also investigated through driving simulation.

• Kyungpook Mathematical Journal
• /
• v.57 no.2
• /
• pp.301-307
• /
• 2017

In this paper, we solve the following four graph equations $L^k(G)=H{\oplus}J$; $M(G)=H{\oplus}J$; ${\bar{L^k(G)}}=H{\oplus}J$ and ${\bar{M(G)}}=H{\oplus}J$, where J is $nK_2$ for $n{\geq}1$. Here, the equality symbol = means the isomorphism between the corresponding graphs. In particular, we shall obtain all pairs of graphs (G, H), which satisfy the above mentioned equations, upto isomorphism.