• Title/Summary/Keyword: Projection map

Search Result 165, Processing Time 0.032 seconds

SVM-Guided Biplot of Observations and Variables

  • Huh, Myung-Hoe
    • Communications for Statistical Applications and Methods
    • /
    • v.20 no.6
    • /
    • pp.491-498
    • /
    • 2013
  • We consider support vector machines(SVM) to predict Y with p numerical variables $X_1$, ${\ldots}$, $X_p$. This paper aims to build a biplot of p explanatory variables, in which the first dimension indicates the direction of SVM classification and/or regression fits. We use the geometric scheme of kernel principal component analysis adapted to map n observations on the two-dimensional projection plane of which one axis is determined by a SVM model a priori.

NONLINEAR MAPS PRESERVING THE MIXED PRODUCT *[X ⋄ Y, Z] ON *-ALGEBRAS

  • Raof Ahmad Bhat;Abbas Hussain Shikeh;Mohammad Aslam Siddeeque
    • Communications of the Korean Mathematical Society
    • /
    • v.38 no.4
    • /
    • pp.1019-1028
    • /
    • 2023
  • Let 𝔄 and 𝔅 be unital prime *-algebras such that 𝔄 contains a nontrivial projection. In the present paper, we show that if a bijective map Θ : 𝔄 → 𝔅 satisfies Θ(*[X ⋄ Y, Z]) = *[Θ(X) ⋄ Θ(Y), Θ(Z)] for all X, Y, Z ∈ 𝔄, then Θ or -Θ is a *-ring isomorphism. As an application, we shall characterize such maps in factor von Neumann algebras.

Representation of Translucent Objects using Multiple Projection Images for Real-time Rendering (시점을 달리한 여러 장의 투영 영상을 이용한 반투명 재질의 실시간 렌더링)

  • Lee, Jae-Young;Kim, Kang-Yeon;Yoo, Jae-Doug;Lee, Kwan-H.
    • 한국HCI학회:학술대회논문집
    • /
    • 2006.02a
    • /
    • pp.878-883
    • /
    • 2006
  • 반투명 물체(Translucent Object)는 불투명한 물체와는 달리 물체 내부에서 산란이 일어난다. 반투명 물체의 한 표면(Surface)을 렌더링하기 위해서는 그 표면의 정규 벡터뿐만 아니라 그 표면의 주변 기하 정보가 필요하다. 그러나 그래픽 하드웨어 구조는 반투명 물체의 실시간 렌더링의 구현에 많은 제약을 준다. 3D 기하 정보 대신에 라디언스 맵(Radiance map)과 깊이 맵(Depth map)과 같은 투영 영상(Projected Image)을 기반으로 하는 영상 공간 접근 방법(Image Space Approach)을 사용함으로써 GPU 상에서 반투명 재질을 실시간으로 표현할 수 있다. 본 논문에서는 영상 공간 접근 방법(Image Space Approach)의 연장선에서 시점을 달리한 여러 장의 투영 영상을 이용함으로써 기존의 한 장의 투영 영상만을 이용한 방법이 가지고 있는 가시성 한계점을 해결한다. 또한 복수 투영 영상의 이용에 따른 계산량 증가에 의해서 손실된 프레임 속도(Frame Rate)에 대해 분석한다.

  • PDF

LIE TRIPLE DERIVATIONS ON FACTOR VON NEUMANN ALGEBRAS

  • Liu, Lei
    • Bulletin of the Korean Mathematical Society
    • /
    • v.52 no.2
    • /
    • pp.581-591
    • /
    • 2015
  • Let $\mathcal{A}$ be a factor von Neumann algebra with dimension greater than 1. We prove that if a linear map ${\delta}:\mathcal{A}{\rightarrow}\mathcal{A}$ satisfies $${\delta}([[a,b],c])=[[{\delta}(a),b],c]+[[a,{\delta}(b),c]+[[a,b],{\delta}(c)]$$ for any $a,b,c{\in}\mathcal{A}$ with ab = 0 (resp. ab = P, where P is a fixed nontrivial projection of $\mathcal{A}$), then there exist an operator $T{\in}\mathcal{A}$ and a linear map $f:\mathcal{A}{\rightarrow}\mathbb{C}I$ vanishing at every second commutator [[a, b], c] with ab = 0 (resp. ab = P) such that ${\delta}(a)=aT-Ta+f(a)$ for any $a{\in}\mathcal{A}$.

Development of a Robot arm capable of recognizing 3-D object using stereo vision

  • Kim, Sungjin;Park, Seungjun;Park, Hongphyo;Sangchul Won
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.128.6-128
    • /
    • 2001
  • In this paper, we present a methodology of sensing and control for a robot system designed to be capable of grasping an object and moving it to target point Stereo vision system is employed to determine to depth map which represents the distance from the camera. In stereo vision system we have used a center-referenced projection to represent the discrete match space for stereo correspondence. This center-referenced disparity space contains new occlusion points in addition to the match points which we exploit to create a concise representation of correspondence an occlusion. And from the depth map we find the target object´s pose and position in 3-D space. To find the target object´s pose and position, we use the method of the model-based recognition.

  • PDF

Detection of Traditional Costumes: A Computer Vision Approach

  • Marwa Chacha Andrea;Mi Jin Noh;Choong Kwon Lee
    • Smart Media Journal
    • /
    • v.12 no.11
    • /
    • pp.125-133
    • /
    • 2023
  • Traditional attire has assumed a pivotal role within the contemporary fashion industry. The objective of this study is to construct a computer vision model tailored to the recognition of traditional costumes originating from five distinct countries, namely India, Korea, Japan, Tanzania, and Vietnam. Leveraging a dataset comprising 1,608 images, we proceeded to train the cutting-edge computer vision model YOLOv8. The model yielded an impressive overall mean average precision (MAP) of 96%. Notably, the Indian sari exhibited a remarkable MAP of 99%, the Tanzanian kitenge 98%, the Japanese kimono 92%, the Korean hanbok 89%, and the Vietnamese ao dai 83%. Furthermore, the model demonstrated a commendable overall box precision score of 94.7% and a recall rate of 84.3%. Within the realm of the fashion industry, this model possesses considerable utility for trend projection and the facilitation of personalized recommendation systems.

Integrated Management of Digital Topographic Map and Digital Nautical Chart Using Analysis of Control Points in Precise DGPS Surveying (정밀 DGPS측량의 기준점 분석에 따른 수치지형도와 수치해도의 통합관리)

  • Jang Yong-Gu;Kim Sang-Seok
    • Journal of Navigation and Port Research
    • /
    • v.29 no.3 s.99
    • /
    • pp.269-274
    • /
    • 2005
  • Geodetic surveying using precise GPS equipment are used without analysis with a statistical verification of GPS observed value and it was preformed by necessity to integration projection of digital topographic map and nautical Chart for integration geographic information system construction. The purpose of this study proposes method that improve accuracy of GPS observed value and direction that integrally manage digital topographic map and electronic nautical chart in analyzing the boundary line error between digital topographic map and nautical Chart. For improvement of the precision of GPS observed value, the author studied precision-analysis of GPS observed value by geometric strength and variance factor in 3 control points used in GPS network adjustment. And like this, produce EDM measurement using this GPS observation results and compare the whole boundary point error when set digital topographic map and nautical chart by these boundary.

A Study on 3D-Transformation of Krazovsky Coordinate System (Krassovsky 타원체 좌표의 3차원 변환에 대한 연구)

  • 김감래;전호원;현민호
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.19 no.2
    • /
    • pp.117-123
    • /
    • 2001
  • Requiring topographic information of map due to retaining russia map, which needed accuracy analysis of russia map and relation between its and south korea's map. In order to obtain exact location information from the map which has different reference datum. We have to operate coordinate transformation between maps applied different ellipsoid. In this paper, in order to evaluate accuracy between two maps applied different ellipsoid, it has studied theory of map projection and coordinate transformation. Then, select each point which can be recognized on the two maps for accuracy evaluation. After obtaining coordinate values for each point of same area, it is evaluated accuracy each geodetic coordinate and each TM coordinate. As a result of this study, the maps which have different reference datum could be used if the exact origin shift could be obtained and applied.

  • PDF

Centroid Neural Network with Bhattacharyya Kernel (Bhattacharyya 커널을 적용한 Centroid Neural Network)

  • Lee, Song-Jae;Park, Dong-Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.861-866
    • /
    • 2007
  • A clustering algorithm for Gaussian Probability Distribution Function (GPDF) data called Centroid Neural Network with a Bhattacharyya Kernel (BK-CNN) is proposed in this paper. The proposed BK-CNN is based on the unsupervised competitive Centroid Neural Network (CNN) and employs a kernel method for data projection. The kernel method adopted in the proposed BK-CNN is used to project data from the low dimensional input feature space into higher dimensional feature space so as the nonlinear problems associated with input space can be solved linearly in the feature space. In order to cluster the GPDF data, the Bhattacharyya kernel is used to measure the distance between two probability distributions for data projection. With the incorporation of the kernel method, the proposed BK-CNN is capable of dealing with nonlinear separation boundaries and can successfully allocate more code vector in the region that GPDF data are densely distributed. When applied to GPDF data in an image classification probleml, the experiment results show that the proposed BK-CNN algorithm gives 1.7%-4.3% improvements in average classification accuracy over other conventional algorithm such as k-means, Self-Organizing Map (SOM) and CNN algorithms with a Bhattacharyya distance, classed as Bk-Means, B-SOM, B-CNN algorithms.

Real-time Soft-shadow using Shadow Atlas (그림자 아틀라스를 이용한 부드러운 그림자 생성 방법)

  • Park, Sun-Yong;Yang, Jin-Suk;Oh, Kyoung-Su
    • Journal of the Korea Computer Graphics Society
    • /
    • v.17 no.2
    • /
    • pp.11-16
    • /
    • 2011
  • In computer graphics, shadows play a very important role as a hint of inter-object distance as well as themselves in terms of realism. To represent shadows, some traditional methods such as shadow mapping and shadow volume have been frequently used for the purpose. However, the rendering results are not natural since they assume the point light. On the contrary, an area light can render soft-shadows, but its computation is too burdensome due to integral over the whole light source surface. Many alternatives have been introduced, back-projection of occluder onto the light source to get visibility of light or filtering of shadow boundary by calculating size of penumbra. But they also have problems of light bleeding or ringing effects because of low order approximation, or low performance. In this paper, we describe a method to improve those problems using shadow atlas.