• International Journal of Advanced Culture Technology
• /
• 제6권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.

• 한국정보기술학회 영문논문지
• /
• 제10권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.

• 한국경영과학회지
• /
• 제28권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.

• 대한수학교육학회지:학교수학
• /
• 제5권2호
• /
• pp.259-273
• /
• 2003

본 연구는 Vinner와 Moore의 개념정의, 개념이미지, 개념이용의 이론적 체계를 활용하여 초등학생의 분수이해에 대해 조사하였다. 이를 위해 먼저 주어진 분수와 분수식으로 설명할 수 있는 상황을 설정하게 함으로써 아동의 개념이미지를 조사하였다. 두 번째로 분수가 포함된 문제해결이 분수개념이해를 바탕으로 하는 바, 다양한 분수하위개념과 관련된 문제를 제시하고 이를 해결하게 하였다. 세 번째로 분수와 분수식으로 문장제 문제를 만들어 보게 함으로써 아동의 분수개념 이용을 살펴보았다. 연구한 결과, 분수에 대한 아동의 개념이미지가 부분-전체에 제한되어 있었으며 이로 인해 다른 하위개념에 대한 이해가 부족한 것으로 나타났다. 또 분수와 분수식을 효과적으로 적용할 수 있는 문제 상황을 설정하는데 익숙하지 못했다. 아동의 분수이해를 위해서는 다양한 하위개념에 대한 균형된 이해를 돕는 학습활동이 필요하며 교과서에 분수와 분수식을 활용한 문장제 문제만들기 활동이 더 많이 제공될 필요가 있다.

• 대한공간정보학회지
• /
• 제17권1호
• /
• pp.167-174
• /
• 2009

Tile Map Service는 정적인 이미지들을 모아둔 저장소를 이용하여 매우 빠르게 지도 서비스를 수행하는 서비스이다. 지도 이미지 저장소는 특정 축척별로 지도 영역을 Tile 이미지로 저장한 디렉토리 구조이다. 따라서 디렉토리 구조로부터 이미지를 불러오는 것은 사용자의 요구에 따라서 지도를 데이터베이스로부터 직접 생성하는 것보다 훨씬 시간 단축이 이루어진다. 이와 같은 Tile Map Service를 이용하면 사용자가 복잡한 지도를 생성할 때 획기적으로 지도 생성 시간을 단축시키는 효과와 성능 향상을 위한 제반 노력을 제거할 수 있다. 본 논문은 Open Source GIS를 사용하여 고해상도 영상의 Tile Map Service 시스템을 구축하는 방안을 제시하는 것이다. Open Source GIS중 GDAL(Geospatial Data Abstraction Library)을 사용하여 Tile Map Image를 생성하였으며, OpenLayers를 이용하여 웹브라우저를 통한 서비스를 구축하였다. 또한 Tile Map Service 시스템을 구축 한 후 전통적인 방식으로 지도 렌더링을 수행하는 시스템과 성능테스트를 수행하여 결과를 비교 분석하였다. 수행 결과 본 연구를 통하여 제안된 방법으로 고해상도의 영상 데이터를 상용소프트웨어의 도입 없이 고가용성의 Tile Map Service 시스템을 구축할 수 있었다.

• ETRI Journal
• /
• 제36권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.

• 전기학회논문지
• /
• 제56권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.

• 기술혁신학회지
• /
• 제8권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.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2008년도 추계종합학술대회 B
• /
• pp.91-94
• /
• 2008

본 논문에서는 Full 하드웨어 기반 베이스라인 프로파일 레벨 3규격 H.264 인코더 코덱에서 사용할 수 있는 Direct Memory Access (DMA)를 설계하였다. 설계된 모듈은 CMOS Image Sensor(CIS)로부터 영상을 입력받아 메모리에 저장한 후 인코더 코덱 모듈의 동작에 맞춰 원영상과 참조영상을 각각 한 매크로블록씩 메모리에서 읽어 공급 또는 저장하며, 인코더는 한 매크로블록씩 처리하는데 660 cycle이 소요된다. 설계한 구조를 검증하기 위해 JM 9.4와 같은 reference Encoder C를 개발하였으며, Encoder C로부터 test vector를 추출하여 설계한 회로를 검증하였다.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1995년도 학술대회
• /
• 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.