• Title/Summary/Keyword: Projection Vector

Search Result 143, Processing Time 0.031 seconds

Adaptive Projection Matrix Beamformer for Frequency Hopping Systems Robust to Jamming environment (의도적 간접신호에 강한 주파수 도약 시스템용 적응 투영행렬 빔형성 기법)

  • Jung, Sung-Hun;Shim, Sei-Joon;Kim, Sang-Heon;Lee, Chung-Yong;Youn, Dae-Hee
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.8 s.338
    • /
    • pp.25-32
    • /
    • 2005
  • Frequency hopping system has been adopted to many communication systems in order to overcome the inferior situation such as jamming environment. But typically its processing gain being limited, data interfered by jamming signal could not be fully recovered. This can be enhanced by combing FH system with spatial interference canceller which is a kind of active beamformer In this Paper, we proposed the compensation method of weight vector discrepancy according to the hopped frequencies and the PMBF method which is able to eliminate the inference effectively with less computational complexity. That is, the steering vector of wanted signals can be calculated from the frame without jamming signals using eigen analysis. New projection matrix extracted by the steering vector of wanted signal eliminates the interferences from the covariance matrix of received signal including wanted signal and jamming signals. This PMBF has similar performance of SINR beamformer with less computational complexity.

A Study on an Image Stabilization for Car Vision System (차량용 비전 시스템을 위한 영상 안정화에 관한 연구)

  • Lew, Sheen;Lee, Wan-Joo;Kang, Hyun-Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.4
    • /
    • pp.957-964
    • /
    • 2011
  • The image stabilization is the procedure of stabilizing the blurred image with image processing method. Due to easy detection of global motion, PA(Projection algorithm) based on digital image stabilization has been studied by many researchers. PA has the advantage of easy implementation and low complexity, but in the case of serious rotational motion the accuracy of the algorithm will be cut down because of its fixed exploring range, and, on the other hand, if extending the exploring range, the block for detecting motion will become small, then we cannot detect correct global motion. In this paper, to overcome the drawback of conventional PA, an Iterative Projection Algorithm (IPA) is proposed, which improved the correctness of global motion by detecting global motion with detecting block which is appropriate to different extent of motion. With IPA, in the case of processing 1000 continual frames shot in automobile, compared with conventional algorithm and other detecting range, the results of PSNR is improved 6.8% at least, and 28.9% at the most.

Projection analysis for balanced incomplete block designs (균형불완비블럭설계의 사영분석)

  • Choi, Jaesung
    • Journal of the Korean Data and Information Science Society
    • /
    • v.26 no.2
    • /
    • pp.347-354
    • /
    • 2015
  • This paper deals with a method for intrablock anlaysis of balanced incomplete block designs on the basis of projections under the assumption of mixed effects model. It shows how to construct a model at each step by the stepwise procedure and discusses how to use projection for the analysis of intrablock. Projections are obtained in vector subspaces orthogonal to each other. So the estimates of the treatment effects are not affected by the block effects. The estimability of a parameter or a function of parameters is discussed and eigenvectors are dealt for the construction of estimable functions.

A Study on Response Surface Method Using the Vector Projection Technique (벡터투영법을 이용한 응답면기법에 관한 연구)

  • 김상효;나성원;김우곤
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1994.10a
    • /
    • pp.167-174
    • /
    • 1994
  • In this study, an improved response surface method is proposed. By using gradient projection method, the sampling points for creating response surface are evaluated at the region close to the failure surface. This points are combined with linear response surface function and Rackwitz-Fiessler algorithm. Also, a method controlling the range of selecting sampling points considering the non-linearity of the limit states is proposed to reduce the error produced by approximating the non-linear limit state to linear response surface. With the examples the result of the proposed method is found to be more accurate and efficient than the previous response surface method.

  • PDF

Face Recognition using Karhunen-Loeve projection and Elastic Graph Matching (Karhunen-Loeve 근사 방법과 Elastic Graph Matching을 병합한 얼굴 인식)

  • 이형지;이완수;정재호
    • Proceedings of the IEEK Conference
    • /
    • 2001.06d
    • /
    • pp.231-234
    • /
    • 2001
  • This paper proposes a face recognition technique that effectively combines elastic graph matching (EGM) and Fisherface algorithm. EGM as one of dynamic lint architecture uses not only face-shape but also the gray information of image, and Fisherface algorithm as a class specific method is robust about variations such as lighting direction and facial expression. In the proposed face recognition adopting the above two methods, the linear projection per node of an image graph reduces dimensionality of labeled graph vector and provides a feature space to be used effectively for the classification. In comparison with a conventional method, the proposed approach could obtain satisfactory results in the perspectives of recognition rates and speeds. Especially, we could get maximum recognition rate of 99.3% by leaving-one-out method for the experiments with the Yale Face Databases.

  • PDF

3D Reconstruction using three vanishing points from a single image

  • Yoon, Yong-In;Im, Jang-Hwan;Kim, Dae-Hyun;Park, Jong-Soo
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.1145-1148
    • /
    • 2002
  • This paper presents a new method which is calculated to use only three vanishing points in order to compute the dimensions of object and its pose from a single image of perspective projection taken by a camera and the problem of recovering 3D models from three vanishing points of box scene. Our approach is to compute only three vanishing points without this information such as the focal length, rotation matrix, and translation from images in the case of perspective projection. We assume that the object can be modeled as a linear function of a dimension vector ν. The input of reconstruction is a set of correspondences between features in the model and features in the image. To minimize each the dimensions of the parameterized models, this reconstruction of optimization can be solved by the standard nonlinear optimization techniques with a multi-start method which generates multiple starting points for the optimizer by sampling the parameter space uniformly.

  • PDF

Color reproduction using color appearance model in LCD projection systems (표색계를 이용한 액정 프로젝션 시스템의 색재현)

  • 김지홍
    • Korean Journal of Optics and Photonics
    • /
    • v.9 no.6
    • /
    • pp.373-379
    • /
    • 1998
  • A new method is proposed for the design of the dichroic mirrors in 3-LCD projection systems for color separation/composition. Rather than simply basing the color performance cirterion on luminance or chromatic saturation only, the optimum design parameters can be found by maximizing the volume of the perceived color gamut in RLAB color space and related color appearance model and used the linearly approximated spectrum of dichroic mirrors for simplicity and vector space description. By this method, we found optimal half-power wavelengths in dichroic mirrors which maximized our performance criterion.

  • PDF

A PROJECTION ALGORITHM FOR SYMMETRIC EIGENVALUE PROBLEMS

  • PARK, PIL SEONG
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.3 no.2
    • /
    • pp.5-16
    • /
    • 1999
  • We introduce a new projector for accelerating convergence of a symmetric eigenvalue problem Ax = x, and devise a power/Lanczos hybrid algorithm. Acceleration can be achieved by removing the hard-to-annihilate nonsolution eigencomponents corresponding to the widespread eigenvalues with modulus close to 1, by estimating them accurately using the Lanczos method. However, the additional Lanczos results can be obtained without expensive matrix-vector multiplications but a very small amount of extra work, by utilizing simple power-Lanczos interconversion algorithms suggested. Numerical experiments are given at the end.

  • PDF

Orthogonalization principle for hybrid control of robot arms under geometric constraint

  • Arimoto, Suguru
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10b
    • /
    • pp.1-6
    • /
    • 1992
  • A principle of "orthogonalization" is proposed as an extended notion of hybrid (force and position) control for robot manipulators under geometric endpoint constraints. The principle realizes the hybrid control in a strict sense by letting position and velocity feedback signals be orthogonal in joint space to the contact force vector whose components are exerted at corresponding joints. This orthogonalization is executed via a projection matrix computed in real-time from a gradient of the equation of the surface in joint coordinates and hence both projected position and velocity feedback signals become perpendicular to the force vector that is normal to the surface at the contact point in joint space. To show the important role of the principle in control of robot manipulators, three basic problems are analyzed, the first is a hybrid trajectory tracking problem by means of a "modified hybrid computed torque method", the second is a model-based adaptive control problem for robot manipulators under geometric endpoint constraints, and the third is an iterative learning control problem. It is shown that the passivity of residual error dynamics of robots follows from the orthogonalization principle and it plays a crucial role in convergence properties of both positional and force error signals.force error signals.

  • PDF

Hangul Segmentation and Word Verification System for Automatic Address Processing (문자 가분할과 Support Vector Machine을 이용한 필기 한글 단어 고속 검증기)

  • 이충식;김인중;신종탁;김진형
    • Proceedings of the IEEK Conference
    • /
    • 2000.11c
    • /
    • pp.37-40
    • /
    • 2000
  • A fast method of Hangul address word verification is presented in this Paper. Pre-segmentation and recognition by DP matching is adopted in this paper. An address line image is over-segmented by analyzing the topology of connected components and the projection profile. A fast individual Hangul character verifier was developed by applying SVM (Support Vector Machine). The segmentation hypothesis was represented by lattice structure, and a best path search by dynamic programming generates the most probable segmentation path and the final verification score. The word verifier was tested on 310 address image DB, and it show the possibility of improvements of this method.

  • PDF