• 제목/요약/키워드: Space Projection

검색결과 434건 처리시간 0.03초

GENERALIZED PROJECTION AND APPROXIMATION FOR GENERALIZED VARIATIONAL INEQUALITIES SYSTEM IN BANACH SPACES

  • He, Xin-Feng;Xu, Yong-Chun;He, Zhen
    • East Asian mathematical journal
    • /
    • 제24권1호
    • /
    • pp.57-65
    • /
    • 2008
  • The approximate solvability of a generalized system for non-linear variational inequality in Hilbert spaces was studied, based on the convergence of projection methods. But little research was done in Banach space. The primary reason was that projection mapping lacked preferably property in Banach space. In this paper, we introduced the generalized projection methods. By using these methods, the results presented in this paper extended the main results of S. S. Chang [3] from Hilbert spaces to Banach space.

  • PDF

Estimation of Unknown Projection DATA Based on the Bandwidth of Projection DATA

  • Kil-Houm Park
    • 대한의용생체공학회:의공학회지
    • /
    • 제15권3호
    • /
    • pp.275-280
    • /
    • 1994
  • In the case of the image reconstruction from unknown projection data such as imaging the object with opaque obstructions, conventional reconstruction algorithms may reconstruct a degraded image. In this paper, a new method for the estimation of the unknown projection data based on known projection data and the bandwidth of projection data is proposed. The proposed method successfully estimates the unknown projection data through iterative transformation between projection space and frequency space using the known projection data and the bandwidth of the projection data. Computer simulation shows that the proposed method significantly improves image quality and convergence behavior over conventional algorithms. In addition, the proposed method is successfully applied to ultrasound attenuation CT using a sponge phantom.

  • PDF

A STRONGLY CONVERGENT PARALLEL PROJECTION ALGORITHM FOR CONVEX FEASIBILITY PROBLEM

  • Dang, Ya-Zheng;Gao, Yan
    • Journal of applied mathematics & informatics
    • /
    • 제30권1_2호
    • /
    • pp.93-100
    • /
    • 2012
  • In this paper, we present a strongly convergent parallel projection algorithm by introducing some parameter sequences for convex feasibility problem. To prove the strong convergence in a simple way, we transmit the parallel algorithm in the original space to an alternating one in a newly constructed product space. Thus, the strong convergence of the parallel projection algorithm is derived with the help of the alternating one under some parametric controlling conditions.

SZEGÖ PROJECTIONS FOR HARDY SPACES IN QUATERNIONIC CLIFFORD ANALYSIS

  • He, Fuli;Huang, Song;Ku, Min
    • 대한수학회보
    • /
    • 제59권5호
    • /
    • pp.1215-1235
    • /
    • 2022
  • In this paper we study Szegö kernel projections for Hardy spaces in quaternionic Clifford analysis. At first we introduce the matrix Szegö projection operator for the Hardy space of quaternionic Hermitean monogenic functions by the characterization of the matrix Hilbert transform in the quaternionic Clifford analysis. Then we establish the Kerzman-Stein formula which closely connects the matrix Szegö projection operator with the Hardy projection operator onto the Hardy space, and we get the matrix Szegö projection operator in terms of the Hardy projection operator and its adjoint. At last, we construct the explicit matrix Szegö kernel function for the Hardy space on the sphere as an example, and get the solution to a Diriclet boundary value problem for matrix functions.

A HYBRID SCHEME USING LU DECOMPOSITION AND PROJECTION MATRIX FOR DYNAMIC ANALYSIS OF CONSTRAINED MULTIBODY SYSTEMS

  • Yoo, W.S.;Kim, S.H.;Kim, O.J.
    • International Journal of Automotive Technology
    • /
    • 제2권3호
    • /
    • pp.117-122
    • /
    • 2001
  • For a dynamic analysis of a constrained multibody system, it is necessary to have a routine for satisfying kinematic constraints. LU decomposition scheme, which is used to divide coordinates into dependent and independent coordinates, is efficient but has great difficulty near the singular configuration. Other method such as the projection matrix, which is more stable near a singular configuration, takes longer simulation time due to the large amount of calculation for decomposition. In this paper, the row space and the null space of the Jacobian matrix are proposed by using the pseudo-inverse method and the projection matrix. The equations of the motion of a system are replaced with independent acceleration components using the null space of the Jacobian matrix. Also a new hybrid method is proposed, combining the LU decomposition and the projection matrix. The proposed hybrid method has following advantages. (1) The simulation efficiency is preserved by the LU method during the simulation. (2) The accuracy of the solution is also achieved by the projection method near the singular configuration.

  • PDF

NOTES ON BERGMAN PROJECTION TYPE OPERATOR RELATED WITH BESOV SPACE

  • CHOI, KI SEONG
    • 충청수학회지
    • /
    • 제28권3호
    • /
    • pp.473-482
    • /
    • 2015
  • Let Qf be the maximal derivative of f with respect to the Bergman metric $b_B$. In this paper, we will find conditions such that $(1-{\parallel}z{\parallel})^s(Qf)^p(z)$ is bounded on B. We will also find conditions such that Bergman projection type operator $P_r$ is bounded operator from $L^p(B,d{\mu}_r)$ to the holomorphic Besov p-space Bs $B^s_p(B)$ with weight s.

준역행렬과 투영행렬을 이용한 구속 다물체계의 동역학 해석 (A dynamic analysis for constrained multibody systems using pseudo-inverse and projection matrix)

  • 김외조;유완석
    • 대한기계학회논문집A
    • /
    • 제22권1호
    • /
    • pp.170-176
    • /
    • 1998
  • In this paper, the column space and null space of the Jacobian matrix were obtained by using the pseudo-inverse method and projection matrix. The equations of motion of the system were replaced by independent acceleration components using the null space matrix. The proposed method has the following advantages. (1) It is simple to derive the null space. (2) The efficiency is improved by getting rid of constrained force terms. (3) Neither null space updating nor coordinate partitioning method is required. The suggested algorithm is applied to a three-dimensional vehicle model to show the efficiency.

4 산업혁명과 멀티미디어 융합 기술 : 모바일 로봇 기반 이동형 프로젝션 기술을 이용한 Pervasive AR 플랫폼 구축 (The Fourth Industrial Revolution and Multimedia Converging Technology: Pervasive AR Platform Construction using a Mobile Robot based Projection Technology)

  • 채승호;양윤식;한탁돈
    • 한국멀티미디어학회논문지
    • /
    • 제20권2호
    • /
    • pp.298-312
    • /
    • 2017
  • The fourth industrial revolution is expected to show technological innovation that develops among different fields beyond boundaries through the convergence and integration of fields. With the development and convergence of digital technology, users can receive information anywhere in the world. In this paper, we propose an adaptive interaction concept in a various environment by using a mobile robot based on projection augmented reality (AR). Most previous studies have aimed fixed projector or projection for a pre-designed environment. Thus, they provide only limited information. To overcome the abovementioned problem, we provide the adaptive information by implementing a projection AR system that can be mounted on the mobile robot. For that, the mobile robot based on the projection system was defined as Pervasive AR. Pervasive AR is configured with a pervasive display, a pervasive interface, and seamless interaction. The Pervasive AR technology enables the user to access information immediately by expanding the display area into real space, which implies an environment of intuitive and convenient interaction by expanding the user interface. This system can be applied to various areas, such as a home environment and a public space.

IHP 알고리즘을 이용한 SIMO 시스템용 적응 직접 결정 등화기 연구 (An Adaptive Decision-Directed Equalizer using Iterative Hyperplane Projection for SIMO systems)

  • 이원철
    • 한국통신학회논문지
    • /
    • 제30권1C호
    • /
    • pp.82-91
    • /
    • 2005
  • 본 논문은 iterative hyperplane projection 을 이용한 효율적인 APA(affine projection algorithm)을 소개한다. 다양한 적응 알고리즘들 중 APA는 랭크 부족 문제를 해결하며 고속 수렴의 특성 때문에 다양한 응용분야에 적용되고 있다. SIMO(Single-Input-Multiple-Output) 시스템을 위한 STDE(Space-Time Decision- directed Equalizer) 적용 시 흔히 단일 채널 환경에서 발생하는 "shifting invariance property"를 이용할 수 없으므로 인해 FTF(Fast Transversal Filter)와 같이 저 복잡도를 갖는 고속 적응 알고리즘을 사용할 수 없다. 따라서 APA 기반의 STDE 기능을 수행하는 과정에서 SMI(Sample Matrix Inversion) 처리가 불가피하며, 계산상의 복잡도가 증가하게 된다. 이러한 문제점을 해결하고자 본 논문에서는 APA 기법 고유의 우수한 추적 특성 및 고속 수렴 성질을 유지하면서, 낮은 복잡도를 갖는 IHP(Iterative Hyperplane Projection) 알고리즘 기반의 효율적인 수정 APA 기법을 소개한다. 제안된 IHP 기반 APA 기법의 성능을 확인하기 위하여, 무선 SIMO 채널 환경 하에서 제안된 IHP-APA 알고리즘을 적용한 STED에 대한 비트 에러 오률 (BER) 특성과 계산량 분석을 통해서 우수성을 입증하였다.