• Title/Summary/Keyword: 그래픽스

Search Result 1,199, Processing Time 0.022 seconds

Development of MPEG-4 IPMP Authoring Tool (MPEG-4 IPMP 저작 도구 개발)

  • Kim Kwangyong;Hong Jinwoo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2003.11a
    • /
    • pp.75-78
    • /
    • 2003
  • MPEG-4 표준은 저작자가 정지영상, 텍스트, 2D/3D 그래픽스, 오디오, 심지어 임의형의 비디오 등과 같이 다양한 형태의 객체들을 개별적으로 구성하고 이들을 시/공간자적으로 다루기 용이하게 해 준다. 이와 같은 객체 기반 코딩 특성에 의해서 대화형 방송 콘텐츠를 제작하는데 가장 유용한 방식으로 고려할 수 있다. 피러나, 콘텐츠의 제작, 전송, 소비 관전에서 고려해 달 때, 콘텐츠 제작자 또는 저작권자의 보호 및 관리가 필요하게 되었다. 이에 따라 최근에는 OPIMA (Open Platform Initiative for Multimedia Access), SDMI (Secure Digital Music Initiative) and MPEG(Moving Picture Expert Group) OPIMATfMr(Intellectual Property Management & Protection)와 같은 국제 표준 단체들이 콘텐츠 보호 및 관리에 대한 관심을 가지게 되었다. 특히, MPEG의 경우에 MPEG-4 IPMP를 표준화하여 디지털 콘텐츠와 저작권에 대한 보호를 체계적이고 효과적으로 다루는 연구를 가장 활발히 해오고 있다. 이 논문에서 우리는 MPEG-4 콘텐츠 저작자가 MPEG-4 규격에 맞게 보호화 된 객체 기반 방송용 콘텐츠를 쉽고 편리하게 제작학 수 있도록 하기 위한 MPEG씨 콘텐츠 및 저자권 보호를 위한 MPEG-4 IPMP 저작 도구를 제안하고자 한다. 제안한 MPEG-4 콘텐츠 및 저작권 보호 저작 도구는 저작자에게 친근한 사용자 인터페이스를 제공하여 편집 및 수정이 용이한 텍스트 포맷인 IPMP회된 XMT(extensible Mpeg-4 Textual format) 파일을 생성한다. 또한, 콘텐츠 전송 및 저장의 효율성을 위해 이진 포멧인 IPMP화된 MP4 파일을 생성할 수 있다.으로써, 에러 이미지가 가지고 있는 엔트로피에 좀 근접하게 코딩을 할 수 있게 되었다. 이 방법은 실제로 Arithmetic Coder를 이용하는 다른 압축 방법에 그리고 적용할 수 있다. 실험 결과 압축효율은 JPEG-LS보다 약 $5\%$의 압축 성능 개선이 있었으며, CALIC과는 대등한 압축률을 보이며, 부호화/복호화 속도는 CALIC보다 우수한 것으로 나타났다.우 $23.87\%$($18.00\~30.91\%$), 갑폭 $23.99\%$($17.82\~30.48\%$), 체중 $91.51\%$($58.86\~129.14\%$)이였으며 성장율은 사육 온도구간별 차는 없었다.20 km 까지의 지점들(지점 2에서 지점 6)에서 매우 높은 값을 보이며 이는 조석작용으로 해수와 담수가 강제혼합되면서 표층퇴적물이 재부유하기 때문이라고 판단된다. 영양염류는 월별로 다소의 차이는 있으나, 대체적으로 지점 1과 2에서 가장 낮고, 상류로 갈수록 점차 증가하며 지점 7 상류역이 하류역에 비해 높은 농도이다. 월별로는 7월에 규산염, 용존무기태질소 및 암모니아의 농도가 가장 높은 반면에 용존산소포화도는 가장 낮다. 그러나 지점 14 상류역에서는 5월에 측정한 용존무기태질소, 암모니아, 인산염 및 COD 값이 7월보다 다소 높거나 비슷하다. 한편 영양염류와 COD값은 대체적으로 8월에 가장 낮으나 용존산소포화도는 가장 높다.출조건은 $100^{\circ}C$에서 1분간의 고온단시간 추출이 적합하였다. 증가를 나타내었는데, 저장기간에 따른 물성의 변화는 숭어에 비하여 붕장어가 적었다.양식산은 aspartic acid 및 proline이 많았다. 또한 잉어는 천연산이

  • PDF

Performance Comparison of the Recognition Methods of a Touched Area on a Touch-Screen Panel for Embedded Systems (임베디드 시스템을 위한 터치스크린 패널의 터치 영역 인식 기법의 성능 비교)

  • Oh, Sam-Kweon;Park, Geun-Duk;Kim, Byoung-Kuk
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.9
    • /
    • pp.2334-2339
    • /
    • 2009
  • In case of an embedded system having an LCD panel with touch-screen capability, various figures such as rectangles, pentagons, circles, and arrows are frequently used for the delivery of user-input commands. In such a case, it is necessary to have an algorithm that can recognize whether a touched location is within a figure on which a specific user-input command is assigned. Such algorithms, however, impose a considerable amount of overhead for embedded systems with restricted amount of computing resources. This paper first describes a method for initializing and driving a touch-screen LCD and a coordinate-calibration method that converts touch-screen coordinates into LCD panel coordinates. Then it introduces methods that can be used for recognizing touched areas of rectangles, many-sided figures like pentagons, and circles; they are a range checking method for rectangles, a crossing number checking method for many-sided figures, a distance measurement method for circles, and a color comparison method that can be applied to all figures. In order to evaluate the performance of these methods, we implement two-dimensional graphics functions for drawing figures like triangles, rectangles, circles, and images. Then, we draw such figures and measures times spent for the touched-area recognition of these figures. Measurements show that the range checking is the most suitable method for rectangles, the distance measurement for circles, and the color comparison for many-sided figures and images.

Development of Linking & Management System for High-Resolution Raw Geo-spatial Data based on the Point Cloud DB (Point Cloud 기반의 고해상도 원시데이터 연계 및 관리시스템 개발)

  • KIM, Jae-Hak;LEE, Dong-Ha
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.21 no.4
    • /
    • pp.132-144
    • /
    • 2018
  • 3D Geo-spatial information models have been widely used in the field of Civil Engineering, Medical, Computer Graphics, Urban Management and many other. Especially, in surveying and geo-spatial field, the demand for high quality 3D geospatial information and indoor spatial information is so highly increasing. However, it is so difficult to provide a low-cost and high efficiency service to the field which demand the highest quality of 3D model, because pre-constructed spatial data are composed of different formats and storage structures according to the application purpose of each institutes. In fact, the techniques to construct a high applicable 3D geo-spatial model is very expensive to collect and analyze geo-spatial data, but most demanders of 3D geo-spatial model never want to pay the high-cost to that. This study, therefore, suggest the effective way to construct 3D geo-spatial model with low-cost of construction. In general, the effective way to reduce the cost of constructing 3D geo-spatial model as presented in previous studies is to combine the raw data obtained from point cloud observatory and UAV imagery, however this method has some limitation of usage from difficulties to approve the use of raw data because of those have been managed separately by various institutes. To solve this problem, we developed the linking & management system for unifying a high-Resolution raw geo-spatial data based on the point cloud DB and apply this system to extract the basic database from 3D geo-spatial mode for the road database registration. As a result of this study, it can be provided six contents of main entries for road registration by applying the developed system based on the point cloud DB.

A Study of VR Interaction for Non-contact Hair Styling (비대면 헤어 스타일링 재현을 위한 VR 인터렉션 연구)

  • Park, Sungjun;Yoo, Sangwook;Chin, Seongah
    • The Journal of the Convergence on Culture Technology
    • /
    • v.8 no.2
    • /
    • pp.367-372
    • /
    • 2022
  • With the recent advent of the New Normal era, realistic technologies and non-contact technologies are receiving social attention. However, the hair styling field focuses on the direction of the hair itself, individual movements, and modeling, focusing on hair simulation. In order to create an improved practice environment and demand of the times, this study proposed a non-contact hair styling VR system. In the theoretical review, we studied the existing cases of hair cut research. Existing haircut-related research tend to be mainly focused on force-based feedback. Research on the interactive haircut work in the virtual environment as addressed in this paper has not been done yet. VR controllers capable of finger tracking the movements necessary for beauty enable selection, cutting, and rotation of beauty tools, and built a non-contact collaboration environment. As a result, we conducted two experiments for interactive hair cutting in VR. First, it is a haircut operation for synchronization using finger tracking and holding hook animation. We made position correction for accurate motion. Second, it is a real-time interactive cutting operation in a multi-user virtual collaboration environment. This made it possible for instructors and learners to communicate with each other through VR HMD built-in microphones and Photon Voice in non-contact situations.

A Study on the Abstraction of Movements Based on Laban's Space Theory "Choreutics" (라반의 공간조화이론 "코레우틱스(Choreutics)"를 활용한 움직임의 추상적 시각화 연구)

  • Kim, Hyeran;Lee, Sang Wook
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.7 no.3
    • /
    • pp.371-381
    • /
    • 2017
  • This paper presents a methodology for creating abstract animation based on the human movement theories originating from the work of dance theorist Rudolf von Laban. Laban Movement Analysis is a method and language for describing, visualizing, interpreting and documenting all varieties of human movement, and Choreutics is based on universal patterns of nature and of human as part of a universal design. Laban defines the space of movements in a profoundly dualistic way. Outwardly, his objective and scientific definitions provide a concrete base for generating human movements in computer graphics in terms of geometric and motion primitives such as points, lines, planes, polygons, linear and nonlinear movements. On the other hand, he also offers a system for understanding the subtle characteristics about the way a movement is dynamically done with respect to inner intention. Laban's interpretations of human motion can be utilized potentially in plastic arts and computer arts. Our work was inspired by those physical and psychological analyses and computer algorithms have been developed for creating abstract animation. We presented our computer animation works entitled "Choreography" in the exhibitions: a special section in "2015 Craft Trend Fair" and "Make Your Movement" held in the Korean Cultural Centre in UK, 2016. In this paper, we describe our ideas and methods for creating abstract object movements based on the Laban's motion representations.

Modernist painting style in Disney animation (디즈니 애니메이션에 나타난 모더니즘 회화스타일 : 색, 형태, 공간을 중심으로)

  • Moon, Jae-Cheol;Kim, Yu-Mi
    • Cartoon and Animation Studies
    • /
    • s.33
    • /
    • pp.31-53
    • /
    • 2013
  • In the early twentieth century, history of animation began by modern artists, they produced various experimental images with the newly invented film and cameras. Artists in the field of movie, photography, paintings and others manipulated images in motion. But as some animated movies won industrial success and popularity, they became the trend but experimental style of early animation preserved by so-called non-mainstreamers or experimental animators, counteracting commercialism. Disney animation also followed the trend by applying realistic Hollywood film style, the worse critics placed a low value on the animation and it tarnished the image, although it was profitable investment from a business standpoint. To make images realistic, they opened a drawing class that animators developed skills to imitate motions and forms from subjects in real life. Also some techniques and gizmos were used to mimic and simulate three dimensional objects and spaces, multiplane camera and compositing 3D CG images with 2D drawings. Moreover, they brought animation stories from fairly tales or folk tales, and Walt's personal interest in live-action movies, they applied Hollywood-film-like narratives and realistic visual, and harsh criticism ensued. On the surface early disney animations' potential seems to be weakened, but in reality it still exists by simplifying and exaggerating forms and color as modern arts. Disney animation employs concepts of the modernism paintings such as simplified shapes and colors to a character design, when their characters are placed together in a scene, that visual elements cause mental reaction. This modification gives a new internal experience to audiences. As conceptual colors in abstract paintings make images appeared to be flat, coloring characters with no shading make them look flat and comparing to them, background images are also appeared to be flat. On top of that, multi-perspective at background images recalls modernist paintings. This essay goes in details with the animation pioneers' works and how Disney animation developed its techniques to emulate real life and analyses color schemes, forms, and spaces in Disney animation compared with modern artists' works, in that the visual language of Disney animation reminds of impression from abstract paintings in the beginning of the twentieth centuries.

A Variable Latency Goldschmidt's Floating Point Number Square Root Computation (가변 시간 골드스미트 부동소수점 제곱근 계산기)

  • Kim, Sung-Gi;Song, Hong-Bok;Cho, Gyeong-Yeon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.1
    • /
    • pp.188-198
    • /
    • 2005
  • The Goldschmidt iterative algorithm for finding a floating point square root calculated it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's square root algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the square root of a floating point number F, the algorithm repeats the following operations: $R_i=\frac{3-e_r-X_i}{2},\;X_{i+1}=X_i{\times}R^2_i,\;Y_{i+1}=Y_i{\times}R_i,\;i{\in}\{{0,1,2,{\ldots},n-1} }}'$with the initial value is $'\;X_0=Y_0=T^2{\times}F,\;T=\frac{1}{\sqrt {F}}+e_t\;'$. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than $'e_r=2^{-p}'$. The value of p is 28 for the single precision floating point, and 58 for the doubel precision floating point. Let $'X_i=1{\pm}e_i'$, there is $'\;X_{i+1}=1-e_{i+1},\;where\;'\;e_{i+1}<\frac{3e^2_i}{4}{\mp}\frac{e^3_i}{4}+4e_{r}'$. If '|X_i-1|<2^{\frac{-p+2}{2}}\;'$ is true, $'\;e_{i+1}<8e_r\;'$ is less than the smallest number which is representable by floating point number. So, $\sqrt{F}$ is approximate to $'\;\frac{Y_{i+1}}{T}\;'$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal square root tables ($T=\frac{1}{\sqrt{F}}+e_i$) with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a square root unit. Also, it can be used to construct optimized approximate reciprocal square root tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

Matching Points Filtering Applied Panorama Image Processing Using SURF and RANSAC Algorithm (SURF와 RANSAC 알고리즘을 이용한 대응점 필터링 적용 파노라마 이미지 처리)

  • Kim, Jeongho;Kim, Daewon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.4
    • /
    • pp.144-159
    • /
    • 2014
  • Techniques for making a single panoramic image using multiple pictures are widely studied in many areas such as computer vision, computer graphics, etc. The panorama image can be applied to various fields like virtual reality, robot vision areas which require wide-angled shots as an useful way to overcome the limitations such as picture-angle, resolutions, and internal informations of an image taken from a single camera. It is so much meaningful in a point that a panoramic image usually provides better immersion feeling than a plain image. Although there are many ways to build a panoramic image, most of them are using the way of extracting feature points and matching points of each images for making a single panoramic image. In addition, those methods use the RANSAC(RANdom SAmple Consensus) algorithm with matching points and the Homography matrix to transform the image. The SURF(Speeded Up Robust Features) algorithm which is used in this paper to extract featuring points uses an image's black and white informations and local spatial informations. The SURF is widely being used since it is very much robust at detecting image's size, view-point changes, and additionally, faster than the SIFT(Scale Invariant Features Transform) algorithm. The SURF has a shortcoming of making an error which results in decreasing the RANSAC algorithm's performance speed when extracting image's feature points. As a result, this may increase the CPU usage occupation rate. The error of detecting matching points may role as a critical reason for disqualifying panoramic image's accuracy and lucidity. In this paper, in order to minimize errors of extracting matching points, we used $3{\times}3$ region's RGB pixel values around the matching points' coordinates to perform intermediate filtering process for removing wrong matching points. We have also presented analysis and evaluation results relating to enhanced working speed for producing a panorama image, CPU usage rate, extracted matching points' decreasing rate and accuracy.

A Performance Comparison of the Mobile Agent Model with the Client-Server Model under Security Conditions (보안 서비스를 고려한 이동 에이전트 모델과 클라이언트-서버 모델의 성능 비교)

  • Han, Seung-Wan;Jeong, Ki-Moon;Park, Seung-Bae;Lim, Hyeong-Seok
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.3
    • /
    • pp.286-298
    • /
    • 2002
  • The Remote Procedure Call(RPC) has been traditionally used for Inter Process Communication(IPC) among precesses in distributed computing environment. As distributed applications have been complicated more and more, the Mobile Agent paradigm for IPC is emerged. Because there are some paradigms for IPC, researches to evaluate and compare the performance of each paradigm are issued recently. But the performance models used in the previous research did not reflect real distributed computing environment correctly, because they did not consider the evacuation elements for providing security services. Since real distributed environment is open, it is very vulnerable to a variety of attacks. In order to execute applications securely in distributed computing environment, security services which protect applications and information against the attacks must be considered. In this paper, we evaluate and compare the performance of the Remote Procedure Call with that of the Mobile Agent in IPC paradigms. We examine security services to execute applications securely, and propose new performance models considering those services. We design performance models, which describe information retrieval system through N database services, using Petri Net. We compare the performance of two paradigms by assigning numerical values to parameters and measuring the execution time of two paradigms. In this paper, the comparison of two performance models with security services for secure communication shows the results that the execution time of the Remote Procedure Call performance model is sharply increased because of many communications with the high cryptography mechanism between hosts, and that the execution time of the Mobile Agent model is gradually increased because the Mobile Agent paradigm can reduce the quantity of the communications between hosts.