• Title/Summary/Keyword: 아핀 공간

Search Result 5, Processing Time 0.019 seconds

유클리드 기하학

  • 김홍종
    • Communications of the Korean Mathematical Society
    • /
    • v.15 no.1
    • /
    • pp.111-121
    • /
    • 2000
  • 유클리드 공간의 정의와 평행이동 및 벡터의 성질을 현대적인 관점에서 살펴본다. 또 이를 이용하여 아핀 공간을 정의한다.

  • PDF

Perception and action: Approach to convergence on embodied cognition (지각과 행위: 체화된 인지와의 융복합적 접근)

  • Lee, Young-Lim
    • Journal of Digital Convergence
    • /
    • v.14 no.8
    • /
    • pp.555-564
    • /
    • 2016
  • Space perception is generally treated as a problem relevant to the ability to recognize objects. Alternatively, the data from shape perception studies contributes to discussions about the geometry of visual space. This geometry is generally acknowledged not to be Euclidian, but instead, elliptical, hyperbolic or affine, which is to say, something that admits the distortions found in so many shape perception studies. The purpose of this review article is to understand perceived shape and the geometry of visual space in the context of visually guided action. Thus, two prominent approaches that explain the relation between perception and action were compared. It is important to understand the fundamental information of how human perceive visual space and perform visually guided action for the convergence on embodied cognition, and further on artificial intelligence researches.

Wavelet-Based Fast Fractal Image Compression with Multiscale Factors (레벨과 대역별 스케일 인자를 갖는 웨이브릿 기반 프랙탈 영상압축)

  • 설문규
    • Journal of the Korea Computer Industry Society
    • /
    • v.4 no.4
    • /
    • pp.589-598
    • /
    • 2003
  • In the conventional fractal image compression in the DWT(discrete wavelet transform), the domain and range blocks were classified as B${\times}$B block size first before all domain block for each range block was searched. The conventional method has a disadvantages that the encoding time takes too long, since the domain block for entire image was searched. As an enhancement to such inefficiencies and image quality, this paper proposes wavelet-based fractal image compression with multiscale factors. Thus, this proposed method uses multiscale factor along each level and band to enhance an overall image quality. In encoding process of this method, the range blocks are not searched for all the domain blocks; however, using the self affine system the range blocks are selected from the blocks in the upper level. The image qualify of the conventional method is 32.30[dB], and the proposed method is 35.97[dB]. The image quality is increased by 3.67[dB].

  • PDF

Automatic Detection of the Updating Object by Areal Feature Matching Based on Shape Similarity (형상유사도 기반의 면 객체 매칭을 통한 갱신 객체 탐지)

  • Kim, Ji-Young;Yu, Ki-Yun
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.1
    • /
    • pp.59-65
    • /
    • 2012
  • In this paper, we proposed a method for automatic detection of a updating object from spatial data sets of different scale and updating cycle by using areal feature matching based on shape similarity. For this, we defined a updating object by analysing matching relationships between two different spatial data sets. Next, we firstly eliminated systematic errors in different scale by using affine transformation. Secondly, if any object is overlaid with several areal features of other data sets, we changed several areal features into a single areal feature. Finally, we detected the updating objects by applying areal feature matching based on shape similarity into the changed spatial data sets. After applying the proposed method into digital topographic map and a base map of Korean Address Information System in South Korea, we confirmed that F-measure is highly 0.958 in a statistical evaluation and that significant updating objects are detected from a visual evaluation.

New Efficient Scalar Multiplication Algorithms Based on Montgomery Ladder Method for Elliptic Curve Cryptosystems (타원곡선암호시스템에서 Montgomery ladder 방법에 기반한 새로운 스칼라 곱셈 알고리즘)

  • Cho, Sung-Min;Seo, Seog-Chung;Kim, Tae-Hyun;Park, Yung-Ho;Hong, Seok-Hie
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.19 no.4
    • /
    • pp.3-19
    • /
    • 2009
  • This paper proposes efficient scalar multiplication algorithms based on Montgomery ladder method. The proposed algorithm represents the scalar as ternary or quaternary and applies new composite formulas utilizing only x coordinate on affine coordinate system in order to improve performance. Furthermore, side-channel atomicity mechanism is applied on the proposed composite formulas to prevent simple power analysis. The proposed methods saves at least 26% of running time with the reduced number of storage compared with existing algorithms such as window-based methods and comb-based methods.