• Title/Summary/Keyword: X-vector

Search Result 596, Processing Time 0.029 seconds

CUDA-based Fast DRR Generation for Analysis of Medical Images (의료영상 분석을 위한 CUDA 기반의 고속 DRR 생성 기법)

  • Yang, Sang-Wook;Choi, Young;Koo, Seung-Bum
    • Korean Journal of Computational Design and Engineering
    • /
    • v.16 no.4
    • /
    • pp.285-291
    • /
    • 2011
  • A pose estimation process from medical images is calculating locations and orientations of objects obtained from Computed Tomography (CT) volume data utilizing X-ray images from two directions. In this process, digitally reconstructed radiograph (DRR) images of spatially transformed objects are generated and compared to X-ray images repeatedly until reasonable transformation matrices of the objects are found. The DRR generation and image comparison take majority of the total time for this pose estimation. In this paper, a fast DRR generation technique based on GPU parallel computing is introduced. A volume ray-casting algorithm is explained with brief vector operations and a parallelization technique of the algorithm using Compute Unified Device Architecture (CUDA) is discussed. This paper also presents the implementation results and time measurements comparing to those from pure-CPU implementation and open source toolkit.

ON THE (n, d)th f-IDEALS

  • GUO, JIN;WU, TONGSUO
    • Journal of the Korean Mathematical Society
    • /
    • v.52 no.4
    • /
    • pp.685-697
    • /
    • 2015
  • For a field K, a square-free monomial ideal I of K[$x_1$, . . ., $x_n$] is called an f-ideal, if both its facet complex and Stanley-Reisner complex have the same f-vector. Furthermore, for an f-ideal I, if all monomials in the minimal generating set G(I) have the same degree d, then I is called an $(n, d)^{th}$ f-ideal. In this paper, we prove the existence of $(n, d)^{th}$ f-ideal for $d{\geq}2$ and $n{\geq}d+2$, and we also give some algorithms to construct $(n, d)^{th}$ f-ideals.

SINGULAR SOLUTIONS OF SEMILINEAR PARABOLIC EQUATIONS IN SEVERAL SPACE DIMENSIONS

  • Baek, Jeong-Seon;Kwak, Min-Kyu
    • Journal of the Korean Mathematical Society
    • /
    • v.34 no.4
    • /
    • pp.1049-1064
    • /
    • 1997
  • We study the existence and uniqueness of nonnegative singular solution u(x,t) of the semilinear parabolic equation $$ u_t = \Delta u - a \cdot \nabla(u^q) = u^p, $$ defined in the whole space $R^N$ for t > 0, with initial data $M\delta(x)$, a Dirac mass, with M > 0. The exponents p,q are larger than 1 and the direction vector a is assumed to be constant. We here show that a unique singular solution exists for every M > 0 if and only if 1 < q < (N + 1)/(N - 1) and 1 < p < 1 + $(2q^*)$/(N + 1), where $q^* = max{q, (N + 1)/N}$. This result agrees with the earlier one for N = 1. In the proof of this result, we also show that a unique singular solution of a diffusion-convection equation without absorption, $$ u_t = \Delta u - a \cdot \nabla(u^q), $$ exists if and only if 1 < q < (N + 1)/(N - 1).

  • PDF

이동과 축척과 회전에 불변인 실용적인 패턴 인식 시스템

  • 김회율
    • The Magazine of the IEIE
    • /
    • v.21 no.10
    • /
    • pp.47-54
    • /
    • 1994
  • 본 논문에서는 물체들의 이동(translation) 축적(scale) 그리고 회전방향(orientation)에 무관하게 물체를 인식하는 실용적인 패턴 인식 시스템을 소개한다. 이 시스템은 2진영상으로 변환하는데 필요한 임계치(threshold)의 큰 변화에도 덜 민감하다. 특징 벡터(feature vector)로 서는 Zernike 모멘트를 사용하였는데 지금까지 잘 알려진 Hu가 제안한 7개의 모멘트 불변수 (moment invariants)와 비교한다. 또한, 실용적인 기계 시각(machine vision) 시스템에 대해 세 가지 중요한 문제로서 패턴 정규화(pattern nomalization), Zernike 모멘트의 신속한 계산, 그리고 k-NN 규칙을 이용한 분류 등을 논의하였다. 실험에서는 임의의 회전 방향에서 문자들의 크기가 10x10 화소(pixel)에서 512x512 화소까지 변하는 서로 다른 크기를 가진 인쇄된 62개의 문자와 숫자 그리고 기호들을 서로 다른 임계치에서 인식하는 것을 보여준다.

  • PDF

A Wireless Location-Based Routing Algorithm in Multi-User Game Environments

  • Lee, Jong-Min;Kim, Seong-Woo;Lee, Jung-Hwa
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.12
    • /
    • pp.1733-1740
    • /
    • 2007
  • In this paper, we propose a wireless location-based routing algorithm which uses the location information of its neighbor nodes and a destination node. At first, the proposed routing algorithm forwards a packet to the X direction by selecting a closest node to its destination as a next hop in terms of the X coordinate until the packet reaches closely to the packet's destination. Then the packet is forwarded to the Y direction by selecting a closest node to its destination in terms of the Y coordinate. We use a back off mechanism in case that a next hop cannot be found using the proposed routing algorithm, which resolves loops while forwarding. The experimental results show that the proposed routing algorithm performs well like the existing routing algorithms Ad hoc On-demand Distance Vector and Greedy Perimeter Stateless Routing. It is expected to use the proposed routing algorithm in the digital battlefield of military environments and survival games of commercial environments.

  • PDF

Amino Acid Sequence Homology of Hybrid Poplar O-methyltransferuse Involved in Lignin Biosynthesis

  • Park, Young-Goo;Sul, Ill-Whan;Shin, Dong-Ill;Park, Jang-Won;Park, Hee-Sung
    • Journal of Plant Biotechnology
    • /
    • v.3 no.3
    • /
    • pp.131-134
    • /
    • 2001
  • In $\lambda$-Zap II vector system, a cDNA library was constructed for the developing secondary xylem mRNA from hybrid poplar, Populus nigra x maximowiczii. A cDNA clone of 1.5 kb in size, pOMTB1.4 encoding a lignin-bispecific O-methyltransferase was screened by plaque hybridization using a probe of 540 bp cDNA amplified by polymerase chain reaction from the cDNA library and identified by nucleotide sequencing. Its nucleotide sequence contains one open reading frame of 366 amino acids. The deduced amino acid sequence in comparison with that of Populus tremuloides showed the differences of 9 amino acids and revealed 85-99% homology among alfalfa, poplar and aspen.

  • PDF

CERTAIN CLASS OF CONTACT CR-SUBMANIFOLDS OF A SASAKIAN SPACE FORM

  • Kim, Hyang Sook;Choi, Don Kwon;Pak, Jin Suk
    • Communications of the Korean Mathematical Society
    • /
    • v.29 no.1
    • /
    • pp.131-140
    • /
    • 2014
  • In this paper we investigate (n+1)($n{\geq}3$)-dimensional contact CR-submanifolds M of (n-1) contact CR-dimension in a complete simply connected Sasakian space form of constant ${\phi}$-holomorphic sectional curvature $c{\neq}-3$ which satisfy the condition h(FX, Y)+h(X, FY) = 0 for any vector fields X, Y tangent to M, where h and F denote the second fundamental form and a skew-symmetric endomorphism (defined by (2.3)) acting on tangent space of M, respectively.

Image Restoration in Dual Energy Digital Radiography using Wiener Filtering Method

  • Min, Byoung-Goo;Park, Kwang-Suk
    • Journal of Biomedical Engineering Research
    • /
    • v.8 no.2
    • /
    • pp.171-176
    • /
    • 1987
  • Wiener filtering method was applied to the dual energy imaging procedure in digital radiography(D.R.). A linear scanning photodiode arrays with 1024 elements(0.6mm H 1.3mm pixel size) were used to obtain chest images in 0.7 sec. For high energy image acquisition, X-ray tube was set at 140KVp, 100mA with a rare-earth phosphor screen. Low energy image was obtained with X-ray tube setting at 70KVp, 150mA. These measured dual energy images are represented in the vector matrix notation as a linear discrete model including the additive random noise. Then, the object images are restored in the minimum mean square error sense using Wiener filtering method in the transformed domain. These restored high and low energy images are used for computation of the basis image decomposition. Then the basis images are linearly combined to produce bone or tissue selective images. Using this process, we could improve the signal to noise ratio characteristics in the material selective images.

  • PDF

ON OPTIMALITY AND DUALITY FOR GENERALIZED NONDIFFERENTIABLE FRACTIONAL OPTIMIZATION PROBLEMS

  • Kim, Moon-Hee;Kim, Gwi-Soo
    • Communications of the Korean Mathematical Society
    • /
    • v.25 no.1
    • /
    • pp.139-147
    • /
    • 2010
  • A generalized nondifferentiable fractional optimization problem (GFP), which consists of a maximum objective function defined by finite fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions, is considered. Recently, Kim et al. [Journal of Optimization Theory and Applications 129 (2006), no. 1, 131-146] proved optimality theorems and duality theorems for a nondifferentiable multiobjective fractional programming problem (MFP), which consists of a vector-valued function whose components are fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions. In fact if $\overline{x}$ is a solution of (GFP), then $\overline{x}$ is a weakly efficient solution of (MFP), but the converse may not be true. So, it seems to be not trivial that we apply the approach of Kim et al. to (GFP). However, modifying their approach, we obtain optimality conditions and duality results for (GFP).

ON SOME SOLUTIONS OF A FUNCTIONAL EQUATION RELATED TO THE PARTIAL SUMS OF THE RIEMANN ZETA FUNCTION

  • Martinez, Juan Matias Sepulcre
    • Bulletin of the Korean Mathematical Society
    • /
    • v.51 no.1
    • /
    • pp.29-41
    • /
    • 2014
  • In this paper, we prove that infinite-dimensional vector spaces of -dense curves are generated by means of the functional equations f(x)+f(2x)+${\cdots}$+f(nx) = 0, with $n{\geq}2$, which are related to the partial sums of the Riemann zeta function. These curves ${\alpha}$-densify a large class of compact sets of the plane for arbitrary small ${\alpha}$, extending the known result that this holds for the cases n = 2, 3. Finally, we prove the existence of a family of solutions of such functional equation which has the property of quadrature in the compact that densifies, that is, the product of the length of the curve by the $n^{th}$ power of the density approaches the Jordan content of the compact set which the curve densifies.