• International Journal of Advanced Culture Technology
• /
• v.6 no.4
• /
• pp.317-322
• /
• 2018

We use edge detection technique for the input image to extract the entire edges of the object in the image and then select only the edges that construct the outline of the object. By examining the positional relation between these pixels composing the outline, a simplified version of the outline of the object in the input image is generated by removing unnecessary pixels while maintaining the condition of connection of the outline. For each pixel constituting the outline, its direction is calculated by examining the positional relation with the next pixel. Then, we group the consecutive pixels with same direction into one and then change them to a line segment instead of a point. Among those line segments composing the outline of the object, a line segment whose length is smaller than a predefined minimum length of acceptable line segment is removed by merging it into one of the adjacent line segments. As a result, an outline composed of line segments of over a certain length is obtained through this process.

• Journal of Advanced Information Technology and Convergence
• /
• v.10 no.1
• /
• pp.111-120
• /
• 2020

Generative adversarial networks (GANs) achieved impressive performance on image generation and visual classification applications. However, adversarial networks meet difficulties in combining the generative model and unstable training process. To overcome the problem, we combined the deep residual network with upsampling convolutional layers to construct the generative network. Moreover, the study shows that image generation and classification performance become more prominent when the residual layers include on the generator. The proposed network empirically shows that the ability to generate images with higher visual accuracy provided certain amounts of additional complexity using proper regularization techniques. Experimental evaluation shows that the proposed method is superior to image generation and classification tasks.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.1
• /
• pp.97-113
• /
• 2003

In numerous studios of Technology Acceptance Model ( TAM ), the social Influence construct has been operationalized as subjective norm. This study Proposes to stretch two construct to Include two more constructs : image and visibility. This paper also questions about the paths regarding this comprehensive construct. Due to the controversies regarding the significance of social Influence on IS usage, this study taps the possibility that social influence works as an antecedent to PU (Perceived Usefulness) and PEU ( Perceived Ease of Use) We could find the significant differences In path coefficients depending on how social Influence Is operationalzied.

• School Mathematics
• /
• v.5 no.2
• /
• pp.259-273
• /
• 2003

A fraction is one of the most important concepts that students have to learn in elementary school. But it is a challenge for students to understand fraction concept because of its conceptual complexity. The focus of fraction learning is understanding the concept. Then the problem is how we can facilitate the conceptual understanding and estimate it. In this study, Moore's concept understanding scheme(concept definition, concept image, concept usage) was adopted as an theoretical framework to investigate students' fraction understanding. The questions of this study were a) what concept image do students have\ulcorner b) How well do students solve fraction problems\ulcorner c) How do students use fraction concept to generate fraction word problem\ulcorner By analyzing the data gathered from three elementary school, several conclusion was drawn. 1) The students' concept image of fraction is restricted to part-whole sub-construct. So is students' fraction understanding. 2) Students can solve part-whole fraction problems well but others less. This also imply that students' fraction understanding is partial. 3) Half of the subject(N=98) cannot pose problems that involve fraction and fraction operation. And some succeeded applied the concept mistakenly. To understand fraction, various fraction subconstructs have to be integrated as whole one. To facilitate this integration, fraction program should focus on unit, partitioning and quantity. This may be achieved by following activities: * Building on informal knowledge of fraction * Focusing on meaning other than symbol * Various partitioning activities * Facing various representation * Emphasizing quantitative aspects of fraction * Understanding the meanings of fraction operation Through these activities, teacher must help students construct various faction concept image and apply it to meaningful situation. Especially, to help students to construct various concept image and to use fraction meaningfully to pose problems, much time should be spent to problem posing using fraction.

• Journal of Korean Society for Geospatial Information Science
• /
• v.17 no.1
• /
• pp.167-174
• /
• 2009

A Tile Map Service is a regular map service that has been enhanced to serve maps very quickly using a cache of static images. The map cache is a directory that contains image tiles of a map extent at specific scale levels. Returning a tile from the cache takes the server much less time than drawing the map image on demand. Use of a Tile Map Service can dramatically improve the time that clients take to display complex base-maps. Using Tile Map Services thus eliminate the need to trade quality for performance. This study provides a way to construct Tile Map Service System using Open Source GIS. We used GDAL(Geospatial Data Abstraction Library) which is one of the Open Source GIS Softwares to make Tile Map Image and OpenLayers to publish Web Page. Moreover, We conducted a performance test on Tile Map System and Dynamic Map System and evaluated the results of it. As a result, the proposed method makes it easier to construct high performance Tile Map Service using Open Source GIS without commercial products.

• ETRI Journal
• /
• v.36 no.3
• /
• pp.450-459
• /
• 2014

In this paper, we present a new, easy-to-generate system that is capable of creating virtual 3D tree models and simulating a variety of growth processes of a tree from a single, real tree image. We not only construct various tree models with the same trunk through our proposed digital image matting method and skeleton-based abstraction of branches, but we also animate the visual growth of the constructed 3D tree model through usage of the branch age information combined with a scaling factor. To control the simulation of a tree growth process, we consider tree-growing attributes, such as branching orders, branch width, tree size, and branch self-bending effect, at the same time. Other invisible branches and leaves are automatically attached to the tree by employing parametric branch libraries under the conventional procedural assumption of structure having a local self-similarity. Simulations with a real image confirm that our system makes it possible to achieve realistic tree models and growth processes with ease.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.3
• /
• pp.615-622
• /
• 2007

In general, Harris detector is commonly used for finding salient points in watermarking systems using feature points. Harris detector is a kind of combined comer and edge detector which is based on neighboring image data distribution, therefore it has some limitation to find accurate salient points after watermark embedding or any kinds of digital attacks. In this paper, we have used cross reference points which use not data distribution but geometrical structure of a normalized image in order to avoid pointing error caused by the distortion of image data. After normalization, we find cross reference points and take inverse normalization of these points. Next, we construct a group of triangles using tessellation with inversely normalized cross reference points. The watermarks are affine transformed and transformed-watermarks are embedded into not normalized image but original one. Only locations of watermarks are determined on the normalized image. Therefore, we can reduce data loss of watermark which is caused by inverse normalization. As a result, we can detect watermarks with high correlation after several digital attacks.

• Journal of Korea Technology Innovation Society
• /
• v.8 no.spc1
• /
• pp.323-336
• /
• 2005

Digital content industry is growing rapidly because of the property of high-speed networking and greater demand for digital fulltext-image. However, we know the fact that it is many difficulty in production and supply for good quality of content. Hereupon, we suggest digital fulltext-image service framework to protect copyright. More concretely, we propose integrated model and reference model to securely serve digital fulltext-image by recompositing core objects and reconstructing the value-chain structure of digital content industry to framework including the process(from its production (creators or copyrighters) to consumption (users or consumers)). Also, we construct the digital fulltext- image service system based on reference model and reconstruct its interface that occurs between core subjects.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.91-94
• /
• 2008

The designed module save to memory after received Image from CMOS image Sensor(CIS), and set a motion of Encoder module, read from memory per one macroblock each original Image and reference image then supply or save. the time required 470 cycle when processed one macroblock. For designed construct verification, I develop reference Encoder C like JM 9.4 and I proved this module with test vector which achieved from reference encoder C.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1995.06a
• /
• pp.83-86
• /
• 1995

Many image display devices allow only a limited number of colors to be simultaneously displayed. In displaying of natural color image using color palette, it is necessary to construct an optimal color palette and map each pixel of the original image to a color palette with fast. In this paper, we proposed the clustering algorithm using local region block centered one color cluster in the prequantized 3-D histogram. Cluster pairs which have the least distortion error are merged by considering distortion measure. The clustering process is continued until to obtain the desired number of colors. Same as the clustering process, original color image is mapped to palette color via a local region block centering around prequantized original color value. The proposed algorithm incorporated with a spatial activity weighting value which is smoothing region. The method produces high quality display images and considerably reduces computation time.