• Title/Summary/Keyword: projective

Search Result 597, Processing Time 0.024 seconds

Online Face Pose Estimation based on A Planar Homography Between A User's Face and Its Image (사용자의 얼굴과 카메라 영상 간의 호모그래피를 이용한 실시간 얼굴 움직임 추정)

  • Koo, Deo-Olla;Lee, Seok-Han;Doo, Kyung-Soo;Choi, Jong-Soo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.4
    • /
    • pp.25-33
    • /
    • 2010
  • In this paper, we propose a simple and efficient algorithm for head pose estimation using a single camera. First, four subimages are obtained from the camera image for face feature extraction. These subimages are used as feature templates. The templates are then tracked by Kalman filtering, and camera projective matrix is computed by the projective mapping between the templates and their coordinate in the 3D coordinate system. And the user's face pose is estimated from the projective mapping between the user's face and image plane. The accuracy and the robustness of our technique is verified on the experimental results of several real video sequences.

Mosaic Technique on Panning Video Images using Interpolation Search (보간 검색을 이용한 Panning 비디오 영상에서의 모자이크 기법)

  • Jang, Sung-Gab;Kim, Jae-Shin
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.5 s.305
    • /
    • pp.63-72
    • /
    • 2005
  • This paper proposes a new method to construct a panorama image from video sequences captured by the video camcoder revolving on the center axis of the tripod. The proposed method is consisted of two algorithms; frame selection and image mosaics. In order to select frames to construct the panorama image, we employ the interpolation search using the information in overlapped areas. This method can search suitable frames quickly. We construct an image mosaic using the projective transform induced from four pairs of quasi-features. The conventional methods select feature points by using only texture information, but the presented method in this paper uses the position of each feature point as well. We make an experiment on the proposed method with real video sequences. The results show that the proposed method is better than the conventional one in terms of image quality.

Function Embedding and Projective Measurement of Quantum Gate by Probability Amplitude Switch (확률진폭 스위치에 의한 양자게이트의 함수 임베딩과 투사측정)

  • Park, Dong-Young
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.12 no.6
    • /
    • pp.1027-1034
    • /
    • 2017
  • In this paper, we propose a new function embedding method that can measure mathematical projections of probability amplitude, probability, average expectation and matrix elements of stationary-state unit matrix at all control operation points of quantum gates. The function embedding method in this paper is to embed orthogonal normalization condition of probability amplitude for each control operating point into a binary scalar operator by using Dirac symbol and Kronecker delta symbol. Such a function embedding method is a very effective means of controlling the arithmetic power function of a unitary gate in a unitary transformation which expresses a quantum gate function as a tensor product of a single quantum. We present the results of evolutionary operation and projective measurement when we apply the proposed function embedding method to the ternary 2-qutrit cNOT gate and compare it with the existing methods.

Realistic 3D Scene Reconstruction from an Image Sequence (연속적인 이미지를 이용한 3차원 장면의 사실적인 복원)

  • Jun, Hee-Sung
    • The KIPS Transactions:PartB
    • /
    • v.17B no.3
    • /
    • pp.183-188
    • /
    • 2010
  • A factorization-based 3D reconstruction system is realized to recover 3D scene from an image sequence. The image sequence is captured from uncalibrated perspective camera from several views. Many matched feature points over all images are obtained by feature tracking method. Then, these data are supplied to the 3D reconstruction module to obtain the projective reconstruction. Projective reconstruction is converted to Euclidean reconstruction by enforcing several metric constraints. After many triangular meshes are obtained, realistic reconstruction of 3D models are finished by texture mapping. The developed system is implemented in C++, and Qt library is used to implement the system user interface. OpenGL graphics library is used to realize the texture mapping routine and the model visualization program. Experimental results using synthetic and real image data are included to demonstrate the effectiveness of the developed system.

Analysis of size distribution of riverbed gravel through digital image processing (영상 처리에 의한 하상자갈의 입도분포 분석)

  • Yu, Kwonkyu;Cho, Woosung
    • Journal of Korea Water Resources Association
    • /
    • v.52 no.7
    • /
    • pp.493-503
    • /
    • 2019
  • This study presents a new method of estimating the size distribution of river bed gravel through image processing. The analysis was done in two steps; first the individual grain images were analyzed and then the grain particle segmentation of river-bed images were processed. In the first part of the analysis, the relationships (long axes, intermediate axes and projective areas) between grain features from images and those measured were compared. For this analysis, 240 gravel particles were collected at three river stations. All particles were measured with vernier calipers and weighed with scales. The measured data showed that river gravel had shape factors of 0.514~0.585. It was found that the weight of gravel had a stronger correlation with the projective areas than the long or intermediate axes. Using these results, we were able to establish an area-weight formula. In the second step, we calculated the projective areas of the river-bed gravels by detecting their edge lines using the ImageJ program. The projective areas of the gravels were converted to the grain-size distribution using the formula previously established. The proposed method was applied to 3 small- and medium- sized rivers in Korea. Comparisons of the analyzed size distributions with those measured showed that the proposed method could estimate the median diameter within a fair error range. However, the estimated distributions showed a slight deviation from the observed value, which is something that needs improvement in the future.

Vector Bundles on Curves with Many "spread" Sections

  • Ballico, E.
    • Kyungpook Mathematical Journal
    • /
    • v.45 no.2
    • /
    • pp.167-169
    • /
    • 2005
  • Here we introduce and study vector bundles, E, on a smooth projective curve X having many "spread" sections and for which $E^{*}\;{\otimes}{\omega}X$ has many "spread" sections. We show that no such bundle exists on X if the gonality of X is too low.

  • PDF

MODULES WITH PRIME ENDOMORPHISM RINGS

  • Bae, Soon-Sook
    • Journal of the Korean Mathematical Society
    • /
    • v.38 no.5
    • /
    • pp.987-1030
    • /
    • 2001
  • Some discrimination of modules whose endomorhism rings are prime is introduced, by means of structures of submodules inducing prime ideals of the endomorphism ring End(sub)R (M) of a left R-module (sub)RM over a ring R. Modules with non-prime endomorphism rings are contrapositively studied as well.

  • PDF

MODULES THAT SUBMODULES LIE OVER A SUMMAND

  • Min, Kang-Joo
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.20 no.4
    • /
    • pp.569-575
    • /
    • 2007
  • Let M be a nonzero module. M has the property that every submodule of M lies over a direct summand of M. We study some properties of such a module. The endomorphism ring of such a module is also studied. The relationships of such a module to the semi-regular modules, and to the semi-perfect modules are described.

  • PDF