아바타를 이용한 애니메이션 생성 장치 및 방법
    51.
    发明公开
    아바타를 이용한 애니메이션 생성 장치 및 방법 有权
    使用AVATAR生成动画的装置和方法

    公开(公告)号:KR1020120130627A

    公开(公告)日:2012-12-03

    申请号:KR1020110048714

    申请日:2011-05-23

    Inventor: 김재환

    CPC classification number: G06T13/40 G06K9/00275 G06K9/6202 G10L13/08

    Abstract: PURPOSE: A device for generating an animation by using an avatar and a method thereof are provided to compose animations through avatars for users in a virtual space by using a 2D image and a text. CONSTITUTION: A model generator(120) generates a parameter model by using feature points extracted from a 2D facial image. The model generator searches a pre-stored database for expression parameters matched with the feature points and feature words extracted from text data. When the text data is expressed by a voice, an animation generator(130) generates a vector indicating position changes of the feature points. The animation generator applies the expression parameters and the vector to the parameter model. [Reference numerals] (110) Input unit; (120) Model generator; (130) Animation generator; (140) Output unit

    Abstract translation: 目的:提供一种通过使用化身生成动画的装置及其方法,用于通过使用2D图像和文本在虚拟空间中的用户构成动画。 构成:模型生成器(120)通过使用从2D面部图像提取的特征点来生成参数模型。 模型生成器在预存储的数据库中搜索与从文本数据提取的特征点和特征词匹配的表达式参数。 当文本数据由语音表示时,动画生成器(130)生成指示特征点的位置变化的向量。 动画生成器将表达式参数和向量应用于参数模型。 (附图标记)(110)输入单元; (120)型号发生器; (130)动画发生器; (140)输出单元

    데이터 변조방법 및 복조방법
    53.
    发明公开
    데이터 변조방법 및 복조방법 有权
    PPM的调制和解调方法

    公开(公告)号:KR1020100055955A

    公开(公告)日:2010-05-27

    申请号:KR1020080114871

    申请日:2008-11-18

    CPC classification number: H03K7/04 H03K9/04 H04L25/4902

    Abstract: PURPOSE: A data modulating method and demodulation method group a plurality of symbols is provided so that the symbol configuration is added in the fixed symbol, and the average information content is multiplied. CONSTITUTION: A data for to transmitting a message is inputted(S101). The transmitter confirms the value of the first bit among data for to transmitting of four bits(S102). The first bit is 0. According to transmitter is the second bit, the third bit, and the value of the fourth bit, the first symbol, and the second symbol and the third symbol are decided(S103-S105).

    Abstract translation: 目的:提供多个符号的数据调制方法和解调方法组,使得符号配置被添加到固定符号中,并且平均信息内容被乘以。 构成:输入用于发送消息的数据(S101)。 发送器确认用于发送四个比特的数据中的第一比特的值(S102)。 第一位为0.根据发送器是第二位,第三位,第四位的值,第一符号,第二符号和第三符号被决定(S103-S105)。

    영상 다면체 구조를 이용한 영상 분할 및 합성 방법
    54.
    发明公开
    영상 다면체 구조를 이용한 영상 분할 및 합성 방법 有权
    基于场景分析的视频分类和组合方法

    公开(公告)号:KR1020090064246A

    公开(公告)日:2009-06-18

    申请号:KR1020070131831

    申请日:2007-12-15

    CPC classification number: G06K9/00765

    Abstract: An image dividing and synthesizing method using an image polyhedral structure is provided to offer a work handling environment at an X axis and a time axis, thereby obtaining consistent results at more diversified viewpoints. When a random image frame is inputted(S200), a contour of a particular area of the image frame is defined according to rotoscoping process results obtained by user(S202). An area is divided by using an X axis and a time axis with regard to the defined contour of the particular area(S204). The divided image areas are synthesized together. When the contour is defined, the contour is first defined for a region of interest on two key frames through the rotoscoping process, then the defined contour is clearly shown based on the X axis and the time axis.

    Abstract translation: 提供了使用图像多面体结构的图像分割和合成方法,以在X轴和时间轴上提供工作处理环境,从而在更多样化的观点获得一致的结果。 当输入随机图像帧(S200)时,根据用户获得的旋转处理结果来定义图像帧的特定区域的轮廓(S202)。 通过使用相对于特定区域的限定轮廓的X轴和时间轴来划分区域(S204)。 划分的图像区域被合成在一起。 当定义轮廓时,首先通过旋转过程在两个关键帧上为感兴趣区域定义轮廓,然后根据X轴和时间轴清晰地显示定义的轮廓。

    컨벡스 최적화법에 기반한 데이터 군집화 방법
    55.
    发明公开
    컨벡스 최적화법에 기반한 데이터 군집화 방법 无效
    基于数据的优化方法

    公开(公告)号:KR1020080005849A

    公开(公告)日:2008-01-15

    申请号:KR1020070057223

    申请日:2007-06-12

    CPC classification number: G06K9/6224

    Abstract: A data clustering method based on a convex optimization method is provided to obtain a more ideally optimal feasible solution by using a matrix to which a strong duality for a graph partition method of a user is well reflected in a semi-definite relaxation process to improve graph spectral clustering performance. An optimal feasible solution which satisfies a provided strong duality is obtained by using a convex optimization method for an inputted objective function(S1-S3). Eigen-values are extracted and clustered from the optimal feasible solution(S4). A semi-definite relaxation method is used as the convex optimization method.

    Abstract translation: 提供了一种基于凸优化方法的数据聚类方法,通过使用一个矩阵,获得更理想的最佳可行解,用户的图分割方法的强对偶性很好地反映在半定义松弛过程中,以改善图形 光谱聚类性能。 通过对输入的目标函数(S1-S3)使用凸优化方法,获得满足提供的强对偶性的最佳可行解。 从最优可行解中提取特征值并聚类(S4)。 使用半定定松弛法作为凸优化方法。

Patent Agency Ranking