• The Journal of the Korea Contents Association
• /
• v.13 no.8
• /
• pp.334-347
• /
• 2013

This study aimed to develop positioning strategies through the preparation of a positioning map by introducing brand personality to online shopping malls. Such a study will be able to furnish useful information for establishing differentiated marketing strategies in the online shopping mall market, which has faced fierce competition. For research subjects, the study was aimed at students who were attending S college in the Busan region. The results of an empirical analysis are as follows. The brand personality of online shopping malls were deduced to be the following factors: "competence refinement", "vitality", "intimateness", and "reliability". Then the study prepared a positioning map with these assessment attributes. As a result, there were mutually significant differences among competitive shopping malls in the positioning of consumers. The most differentiated attributes in the perception of the entire group were discovered to be "intimateness" and "vitality", whereas the least differentiated attribute was found to be "reliability". In addition, also in terms of the preference and ideal points for online shopping malls in accordance with brand personality between the entire group and segmented groups, there were mutually significant differences.

• Spatial Information Research
• /
• v.6 no.1
• /
• pp.11-23
• /
• 1998

Map generalization functions to visualize the spatial data or to change their scale by changing the level of details of data. Until recently, the studies on map generalization have concentrated more on line features than on point features. However, point features are one of the essential components of digital maps and cannnot be ignored because of the great amount of information they carry. This study, therefore, aimed to find out a detailed procedure of point features' generalization. Particularly, this work chose the distribution pattern of point features as the most important factor in the point generalization in investigating the geometric characteristics of source data. First, it attempted to find out the characteristics of distribution pattern of point features through quadrat analysis with Grieg-Smith method and nearest-neighbour analysis. It then generalized point features through the generalization threshold which did not alter the characteristics of distribution pattern and the removal of redudant point feautres. Therefore, the generalization procedure of point features provided by this work maintained the geometric characteristics as much as possible.

• 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 Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.16 no.1
• /
• pp.67-74
• /
• 1998

This paper performed terrain analysis using DTM(digital terrain model) with TIN/ GRID structure on PC environment. Contour layer from 1:5,000 scale map was used to produce DTM. DTHs were produced with and without considering breakline for each data structure. Processing time, file size, mean elevation and standard variation were analyzed for each DTM. slope map, aspect map were analyzed for grid structure with consideration of TEX>$5\times{5m},\;l0\times{10m},\;15\times{15m},\;l0\times{30m},\;45\times{45m},\;60\times{60m}$ cell size respectively. The results suggest following; The incorporation of breakline does improve mapping accuracy for highly disturbed landscape, Mean elevation doesn't increase as the grid size increases, while processing time, storage room is significantly lessened. Thus, the optimal grid size must be determined in advance for efficient application. slope decreases, while aspect increases as grid size is increasing.

• Journal of the Korean Society for Library and Information Science
• /
• v.41 no.2
• /
• pp.335-357
• /
• 2007

There has been many studies representing intellectual structures with multidimensional scaling(MDS) However MDS configuration is limited in representing local details and explicit structures. In this paper, we identified two components of MDS mapping approach; one is MDS algorithm and the other is preparation of data matrix. Various combinations of the two components of MDS mapping are compared through some measures of fit. It is revealed that the conventional approach composed of ALSCAL algorithm and Euclidean distance matrix calculated from Pearson's correlation matrix is the worst of the compared MDS mapping approaches. Otherwise the best approach to make MDS map is composed of PROXSCAL algorithm and z-scored Euclidean distance matrix calculated from Pearson's correlation matrix. These results suggest that we could obtain more detailed and explicit map of a knowledge domain through careful considerations on the process of MDS mapping.

• Journal of The Korean Association For Science Education
• /
• v.17 no.4
• /
• pp.461-479
• /
• 1997

The concept map is the diagram of two dimensions which hierachically arrays main concepts from those of the textbook and shows their relations. The research analyzed five of the ten high school earthscience textbooks approved by the Minister of Education according to the 6th reformed curriculum in 1995, one of which this research chose to make out the concept maps. The chapter [III. the Universe] contains the outer space of the earth presents new concepts about the stars and the universe and introduces the latest research in astronomy. This study changed textbook contents into Novak's concept map, searched for concepts requiring complement for learners in oder to obtain concepts from those of the textbook and pointed out problems on the basis of that result still better concept map is set up. We have the following conclusions. First, it is necessary to rule out unnecessary small units so as to make more effective understanding and to rearrange the units to have relation to contents. Second, the higher concept and lower concept need to be rearranged systematically in making an array of textbook contents. Third, the concept should have something to do with learners' experences and consciousness by showing learners the real examples relevant to the concept for the link between them.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.1070-1075
• /
• 2009

In this paper, we propose new depth estimation and intermediate view synthesis algorithms for three-dimensional video generation. In order to improve temporal consistency of the depth map sequence, we add a temporal weighting function to the conventional matching function when we compute the matching cost for estimating the depth information. In addition, we propose a boundary noise removal method in the view synthesis operation. after finding boundary noise areas using the depth map, we replace them with corresponding texture information from the other reference image. Experimental results showed that the proposed algorithm improved temporal consistency of the depth sequence and reduced flickering artifacts in the virtual view. It also improved visual quality of the synthesized virtual views by removing the boundary noise.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.1
• /
• pp.33-45
• /
• 2011

In this paper, we present a method for extracting video objects efficiently by using the modified graph cut algorithm based on contour information. First, we extract objects at the first frame by an automatic object extraction algorithm or the user interaction. To estimate the objects' contours at the current frame, motion information of objects' contour in the previous frame is analyzed. Block-based histogram back-projection is conducted along the estimated contour point. Each color model of objects and background can be generated from back-projection images. The probabilities of links between neighboring pixels are decided by the logarithmic based distance transform map obtained from the estimated contour image. Energy of the graph is defined by predefined color models and logarithmic distance transform map. Finally, the object is extracted by minimizing the energy. Experimental results of various test images show that our algorithm works more accurately than other methods.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.213-219
• /
• 2005

In order to move NPC's to target location at game maps, various algorithm including A* has been used. The most frequently used algorithm among them is A* with fast finding speed. But A* has the following problems. The first problem is that at randomly changing map, it is necessary to calculate all things again whenever there are any changes. And when calculation is wrong, it is not possible to search for target. The second problem is that it is difficult to move avoiding dangerous locations damaging NPC such as an obstruction. Although it is possible to avoid moving to locations with high weight by giving weight to dangerous factors. it is difficult to control in case NPC moves nearby dangerous factors. In order to solve such problems, in this thesis, the researcher applied Dynamic Programming to path-finding algorithm. As the result of its application, the researcher could confirm that the programming was suitable for changes at the map with random change and NPC's avoided the factors being dangerous to them far away. In addition. when compared to A*, there were good results.

• Korean Journal of Environmental Biology
• /
• v.25 no.2
• /
• pp.149-157
• /
• 2007

This study focused on patterning waterbirds occurrences at the western costal area of the Korean Peninsula in winter and relating the occurrence patterns with their environmental factors. Waterbird communities were monitored at 10 different study areas, and the composition of land cover as environmental factors was estimated at each study area. Overall dabbling ducks were the most abundant with 84% of total individuals, followed by shorebird and diving ducks. Species Anae platyrhynchos was the first dominant species, and Anas formosa was the second one. Self-organizing map (SOM), an unsupervised artificial neural network, was applied for patterning wintering waterbird communities, and identified 6 groups according to the differences of communities compositions. Each group reflected the differences of indicator species as well as their habitats.