• 제목/요약/키워드: isometry

검색결과 103건 처리시간 0.024초

낮은 계수 행렬의 Compressed Sensing 복원 기법 (Compressed Sensing of Low-Rank Matrices: A Brief Survey on Efficient Algorithms)

  • 이기륭;예종철
    • 대한전자공학회논문지SP
    • /
    • 제46권5호
    • /
    • pp.15-24
    • /
    • 2009
  • Compressed sensing은 소수의 선형 관측으로부터 sparse 신호를 복원하는 문제를 언급하고 있다. 최근 벡터 경우에서의 성공적인 연구 결과가 행렬의 경우로 확장되었다. Low-rank 행렬의 compressed sensing은 ill-posed inverse problem을 low-rank 정보를 이용하여 해결한다. 본 문제는 rank 최소화 혹은 low-rank 근사의 형태로 나타내질 수 있다. 본 논문에서는 최근 제안된 여러 가지 효율적인 알고리즘에 대한 survey를 제공한다.

COMPOSITION OPERATORS ON UNIFORM ALGEBRAS AND THE PSEUDOHYPERBOLIC METRIC

  • Galindo, P.;Gamelin, T.W.;Lindstrom, M.
    • 대한수학회지
    • /
    • 제41권1호
    • /
    • pp.1-20
    • /
    • 2004
  • Let A be a uniform algebra, and let $\phi$ be a self-map of the spectrum $M_A$ of A that induces a composition operator $C_{\phi}$, on A. It is shown that the image of $M_A$ under some iterate ${\phi}^n$ of \phi is hyperbolically bounded if and only if \phi has a finite number of attracting cycles to which the iterates of $\phi$ converge. On the other hand, the image of the spectrum of A under $\phi$ is not hyperbolically bounded if and only if there is a subspace of $A^{**}$ "almost" isometric to ${\ell}_{\infty}$ on which ${C_{\phi}}^{**}$ "almost" an isometry. A corollary of these characterizations is that if $C_{\phi}$ is weakly compact, and if the spectrum of A is connected, then $\phi$ has a unique fixed point, to which the iterates of $\phi$ converge. The corresponding theorem for compact composition operators was proved in 1980 by H. Kamowitz [17].

MINIMAL AND CONSTANT MEAN CURVATURE SURFACES IN 𝕊3 FOLIATED BY CIRCLES

  • Park, Sung-Ho
    • 대한수학회보
    • /
    • 제56권6호
    • /
    • pp.1539-1550
    • /
    • 2019
  • We classify minimal surfaces in ${\mathbb{S}}^3$ which are foliated by circles and ruled constant mean curvature (cmc) surfaces in ${\mathbb{S}}^3$. First we show that minimal surfaces in ${\mathbb{S}}^3$ which are foliated by circles are either ruled (that is, foliated by geodesics) or rotationally symmetric (that is, invariant under an isometric ${\mathbb{S}}^1$-action which fixes a geodesic). Secondly, we show that, locally, there is only one ruled cmc surface in ${\mathbb{S}}^3$ up to isometry for each nonnegative mean curvature. We give a parametrization of the ruled cmc surface in ${\mathbb{S}}^3$(cf. Theorem 3).

On [m, C]-symmetric Operators

  • Cho, Muneo;Lee, Ji Eun;Tanahashi, Kotaro;Tomiyama, Jun
    • Kyungpook Mathematical Journal
    • /
    • 제58권4호
    • /
    • pp.637-650
    • /
    • 2018
  • In this paper first we show properties of isosymmetric operators given by M. Stankus [13]. Next we introduce an [m, C]-symmetric operator T on a complex Hilbert space H. We investigate properties of the spectrum of an [m, C]-symmetric operator and prove that if T is an [m, C]-symmetric operator and Q is an n-nilpotent operator, respectively, then T + Q is an [m + 2n - 2, C]-symmetric operator. Finally, we show that if T is [m, C]-symmetric and S is [n, D]-symmetric, then $T{\otimes}S$ is [m + n - 1, $C{\otimes}D$]-symmetric.

MAPS PRESERVING m- ISOMETRIES ON HILBERT SPACE

  • Majidi, Alireza
    • Korean Journal of Mathematics
    • /
    • 제27권3호
    • /
    • pp.735-741
    • /
    • 2019
  • Let ${\mathcal{H}}$ be a complex Hilbert space and ${\mathcal{B}}({\mathcal{H}})$ the algebra of all bounded linear operators on ${\mathcal{H}}$. In this paper, we prove that if ${\varphi}:{\mathcal{B}}({\mathcal{H}}){\rightarrow}{\mathcal{B}}({\mathcal{H}})$ is a unital surjective bounded linear map, which preserves m- isometries m = 1, 2 in both directions, then there are unitary operators $U,V{\in}{\mathcal{B}}({\mathcal{H}})$ such that ${\varphi}(T)=UTV$ or ${\varphi}(T)=UT^{tr}V$ for all $T{\in}{\mathcal{B}}({\mathcal{H}})$, where $T^{tr}$ is the transpose of T with respect to an arbitrary but fixed orthonormal basis of ${\mathcal{H}}$.

STABLE AND ROBUST ℓp-CONSTRAINED COMPRESSIVE SENSING RECOVERY VIA ROBUST WIDTH PROPERTY

  • Yu, Jun;Zhou, Zhiyong
    • 대한수학회지
    • /
    • 제56권3호
    • /
    • pp.689-701
    • /
    • 2019
  • We study the recovery results of ${\ell}_p$-constrained compressive sensing (CS) with $p{\geq}1$ via robust width property and determine conditions on the number of measurements for standard Gaussian matrices under which the property holds with high probability. Our paper extends the existing results in Cahill and Mixon from ${\ell}_2$-constrained CS to ${\ell}_p$-constrained case with $p{\geq}1$ and complements the recovery analysis for robust CS with ${\ell}_p$ loss function.

HYERS-ULAM STABILITY OF FRACTIONAL STOCHASTIC DIFFERENTIAL EQUATIONS WITH RANDOM IMPULSE

  • Dumitru Baleanu;Banupriya Kandasamy;Ramkumar Kasinathan;Ravikumar Kasinathan;Varshini Sandrasekaran
    • 대한수학회논문집
    • /
    • 제38권3호
    • /
    • pp.967-982
    • /
    • 2023
  • The goal of this study is to derive a class of random impulsive non-local fractional stochastic differential equations with finite delay that are of Caputo-type. Through certain constraints, the existence of the mild solution of the aforementioned system are acquired by Kransnoselskii's fixed point theorem. Furthermore through Ito isometry and Gronwall's inequality, the Hyers-Ulam stability of the reckoned system is evaluated using Lipschitz condition.

실감 영상을 위한 압축 센싱 기법 (Novel Compressed Sensing Techniques for Realistic Image)

  • 이선의;정국현;김진영;박구만
    • 한국위성정보통신학회논문지
    • /
    • 제9권3호
    • /
    • pp.59-63
    • /
    • 2014
  • 본 논문에서는 3D 방송의 기본적인 원리를 설명하고 압축 센싱(Compressed Sensing) 기술을 적용하여 3D 방송의 데이터 용량을 줄이는 방식을 제안한다. 샘플링 이론과 압축 센싱 기술의 차이점을 설명하고 개념과 동작원리를 설명한다. 최근 제안된 압축 센싱의 복원 알고리즘인 SS-CoSaMP(Single-Space Compressive Sampling Matched Pursuit) 와 CoSaMP(Compressive Sampling Matched Pursuit)를 소개하고 이를 이용하여 데이터를 압축 복원하여 정확도를 비교한다. 두 알고리즘의 다양한 이미지 복원을 수행하고 계산시간을 비교한다. 결론적으로 낮은 복잡도를 갖는 3D 방송에 적합한 알고리즘을 판단한다.

CONTINUITY OF HOMOMORPHISMS BETWEEN BANACH ALGEBRAS

  • Cho, Tae-Geun
    • 대한수학회보
    • /
    • 제20권2호
    • /
    • pp.71-74
    • /
    • 1983
  • The problems of the continuity of homomorphisms between Banach algebras have been studied widely for the last two decades to obtain various fruitful results, yet it is far from characterizing the calss of Banach algebras for which each homomorphism from a member of the class into a Banach algebra is conitnuous. For commutative Banach algebras A and B a simple proof shows that every homomorphism .theta. from A into B is continuous provided that B is semi-simple, however, with a non semi-simple Banach algebra B examples of discontinuous homomorphisms from C(K) into B have been constructed by Dales [6] and Esterle [7]. For non commutative Banach algebras the problems of automatic continuity of homomorphisms seem to be much more difficult. Many positive results and open questions related to this subject may be found in [1], [3], [5] and [8], in particular most recent development can be found in the Lecture Note which contains [1]. It is well-known that a$^{*}$-isomorphism from a $C^{*}$-algebra into another $C^{*}$-algebra is an isometry, and an isomorphism of a Banach algebra into a $C^{*}$-algebra with self-adjoint range is continuous. But a$^{*}$-isomorphism from a $C^{*}$-algebra into an involutive Banach algebra is norm increasing [9], and one can not expect each of such isomorphisms to be continuous. In this note we discuss an isomorphism from a commutative $C^{*}$-algebra into a commutative Banach algebra with dense range via separating space. It is shown that such an isomorphism .theta. : A.rarw.B is conitnuous and maps A onto B is B is semi-simple, discontinuous if B is not semi-simple.

  • PDF

멀티콥터 영상 전송을 위한 압축 센싱 기법 (Compressed Sensing Techniques for Video Transmission of Multi-Copter)

  • 정국현;이선의;이상화;김진영
    • 한국위성정보통신학회논문지
    • /
    • 제9권2호
    • /
    • pp.63-68
    • /
    • 2014
  • 본 논문에서는 멀티콥터의 효율적 영상 전송을 위해 필요한 압축센싱 기법을 제안한다. 제안된 구조는 압축센싱에 기반한 데이터 용량을 줄이는 것에 중점을 둔다. 우선 Spectrum sensing의 기본원리를 설명하고 AMP(Approximate Message Passing)와 CoSaMP(Compressive Sampling Matched Pursuit)을 수학적 분석과 모의실험 결과를 통해서 비교한다. 또한 두 알고리즘을 계산시간과 복잡도 관점에서 평가하고 멀티콥터 동작에 적합한 알고리즘을 제안한다. 본 논문의 실험결과는 AMP 알고리즘이 CoSaMP 알고리즘보다 계산시간이 적고 이미지 에러 확률도 낮다는 것을 보여준다.