• Title/Summary/Keyword: Projection Vector

Search Result 143, Processing Time 0.024 seconds

Realtime Facial Expression Control of 3D Avatar by PCA Projection of Motion Data (모션 데이터의 PCA투영에 의한 3차원 아바타의 실시간 표정 제어)

  • Kim Sung-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.10
    • /
    • pp.1478-1484
    • /
    • 2004
  • This paper presents a method that controls facial expression in realtime of 3D avatar by having the user select a sequence of facial expressions in the space of facial expressions. The space of expression is created from about 2400 frames of facial expressions. To represent the state of each expression, we use the distance matrix that represents the distances between pairs of feature points on the face. The set of distance matrices is used as the space of expressions. Facial expression of 3D avatar is controled in real time as the user navigates the space. To help this process, we visualized the space of expressions in 2D space by using the Principal Component Analysis(PCA) projection. To see how effective this system is, we had users control facial expressions of 3D avatar by using the system. This paper evaluates the results.

  • PDF

Fast Search with Data-Oriented Multi-Index Hashing for Multimedia Data

  • Ma, Yanping;Zou, Hailin;Xie, Hongtao;Su, Qingtang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.7
    • /
    • pp.2599-2613
    • /
    • 2015
  • Multi-index hashing (MIH) is the state-of-the-art method for indexing binary codes, as it di-vides long codes into substrings and builds multiple hash tables. However, MIH is based on the dataset codes uniform distribution assumption, and will lose efficiency in dealing with non-uniformly distributed codes. Besides, there are lots of results sharing the same Hamming distance to a query, which makes the distance measure ambiguous. In this paper, we propose a data-oriented multi-index hashing method (DOMIH). We first compute the covariance ma-trix of bits and learn adaptive projection vector for each binary substring. Instead of using substrings as direct indices into hash tables, we project them with corresponding projection vectors to generate new indices. With adaptive projection, the indices in each hash table are near uniformly distributed. Then with covariance matrix, we propose a ranking method for the binary codes. By assigning different bit-level weights to different bits, the returned bina-ry codes are ranked at a finer-grained binary code level. Experiments conducted on reference large scale datasets show that compared to MIH the time performance of DOMIH can be improved by 36.9%-87.4%, and the search accuracy can be improved by 22.2%. To pinpoint the potential of DOMIH, we further use near-duplicate image retrieval as examples to show the applications and the good performance of our method.

Intrusion Detection Technique using Distributed Mobile Agent (Distributed Mobile Agent를 이용한 침입탐지 기법)

  • Yang, Hwan Seok;Yoo, Seung Jae;Yang, Jeong Mo
    • Convergence Security Journal
    • /
    • v.12 no.6
    • /
    • pp.69-75
    • /
    • 2012
  • MANET(Mobile Ad-hoc Network) is target of many attacks because of dynamic topology and hop-by-hop data transmission method. In MANET, location setting of intrusion detection system is difficult and attack detection using information collected locally is more difficult. The amount of traffic grow, intrusion detection performance will be decreased. In this paper, MANET is composed of zone form and we used random projection technique which reduces dimension without loss of information in order to perform stable intrusion detection in even massive traffic. Global detection node is used to detect attacks which are difficult to detect using only local information. In the global detection node, attack detection is performed using received information from IDS agent and pattern of nodes. k-NN and ZBIDS were experimented to evaluate performance of the proposed technique in this paper. The superiority of performance was confirmed through the experience.

Projection of Spatial Correlation-Based Antenna Selection for Cognitive Radio Systems in Correlated Channels (인지무선 시스템의 상관채널에서 공간 상관 행렬 사영을 이용한 안테나 선택기법)

  • Cho, Jae-Bum;Jang, Sung-Jeen;Jung, Won-Sik;Kim, Jae-Moung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.1A
    • /
    • pp.8-16
    • /
    • 2012
  • Recent work has been shown that cognitive radio systems with multiple antenna at both transmitter and receiver are able to improve performance of secondary users. In such system, the main drawback is the increased complexity and raised cost as the number of antennas increase. It is desirable to apply antenna selection which select a subset of the available antennas so as to solve these problems. In this paper, we consider antenna selection method for cognitive radio systems in correlated channel from the IEEE 802.11n. For a multiple-input multiple-output(MIMO) system with more antennas at transmitter than the receiver, we select the same number of transmit antennas as that of receive antennas. The exhaustive search for optimal antenna becomes impractical. We present criterion for selecting subset in terms of projection of channel correlation vector to increase performance of secondary user with decreasing interference at primary user.

Reconstruction of parametrized model using only three vanishing points from a single image (한 영상으로부터 3개의 소실 점들만을 사용한 매개 변수의 재구성)

  • 최종수;윤용인
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3C
    • /
    • pp.419-425
    • /
    • 2004
  • 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. Our approach is to only compute three vanishing points without informations such as the focal length and rotation matrix from images in the case of perspective projection. We assume that the object can be modeled as a linear function of a dimension vector v. 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 standard nonlinear optimization techniques with a multi-start method which generates multiple starting points for the optimizer by sampling the parameter space uniformly.

Downscaling Technique of the Monthly Precipitation Data using Support Vector Machine (지지벡터기구를 이용한 월 강우량자료의 Downscaling 기법)

  • Kim, Seong-Won;Kyoung, Min-Soo;Kwon, Hyun-Han;Kim, Hyung-Soo
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2009.05a
    • /
    • pp.112-115
    • /
    • 2009
  • The research of climate change impact in hydrometeorology often relies on climate change information. In this paper, neural networks models such as support vector machine neural networks model (SVM-NNM) and multilayer perceptron neural networks model (MLP-NNM) are proposed statistical downscaling of the monthly precipitation. The input nodes of neural networks models consist of the atmospheric meteorology and the atmospheric pressure data for 2 grid points including $127.5^{\circ}E/35^{\circ}N$ and $125^{\circ}E/35^{\circ}N$, which produced the best results from the previous study. The output node of neural networks models consist of the monthly precipitation data for Seoul station. For the performances of the neural networks models, they are composed of training and test performances, respectively. From this research, we evaluate the impact of SVM-NNM and MLP-NNM performances for the downscaling of the monthly precipitation data. We should, therefore, construct the credible monthly precipitation data for Seoul station using statistical downscaling method. The proposed methods can be applied to future climate prediction/projection using the various climate change scenarios such as GCMs and RCMs.

  • PDF

A Study on Performance Improvement of Adaptive SLC System Using Eigenanalysis Method and Comparing with RLS Method (Eigenanalysis 방식의 적응 SLC(sidelobe canceller) 시스템의 적용에 따른 성능향상 및 RLS 방식과외 비교에 관한 연구)

  • Jung, Sin-Chul;Kim, Se-Yon;Lee, Byung-Seub
    • Journal of Advanced Navigation Technology
    • /
    • v.5 no.2
    • /
    • pp.111-122
    • /
    • 2001
  • In this paper, we study the performance of eigencanceller which use a eigenvector and eigenvalue in order to update a weighter vector. Eigencanceller can suppress directional interferences and noise effectively while maintaining specified beam pattern constraints. The constraints and optimal weight vector of eigencanceller vary by using interference and noise or desired signal, interference signal and noise as array input signal. From the analysis results in the steady state, We show that weight vectors in each case are simplified the form of projection equation that belongs to desired subspace orthogonal to interference subspace and eigencanceller has the better performance than RLS method through mathematical analysis and simulation.

  • PDF

The analysis of random effects model by projections (사영에 의한 확률효과모형의 분석)

  • Choi, Jaesung
    • Journal of the Korean Data and Information Science Society
    • /
    • v.26 no.1
    • /
    • pp.31-39
    • /
    • 2015
  • This paper deals with a method for estimating variance components on the basis of projections under the assumption of random effects model. It discusses how to use projections for getting sums of squares to estimate variance components. The use of projections makes the vector subspace generated by the model matrix to be decomposed into subspaces that are orthogonal each other. To partition the vector space by the model matrix stepwise procedure is used. It is shown that the suggested method is useful for obtaining Type I sum of squares requisite for the ANOVA method.

Development and Application of High-resolution 3-D Volume PIV System by Cross-Correlation (해상도 3차원 상호상관 Volume PIV 시스템 개발 및 적용)

  • Kim Mi-Young;Choi Jang-Woon;Lee Hyun;Lee Young-Ho
    • Proceedings of the KSME Conference
    • /
    • 2002.08a
    • /
    • pp.507-510
    • /
    • 2002
  • An algorithm of 3-D particle image velocimetry(3D-PIV) was developed for the measurement of 3-D velocity Held of complex flows. The measurement system consists of two or three CCD camera and one RGB image grabber. Flows size is $1500{\times}100{\times}180(mm)$, particle is Nylon12(1mm) and illuminator is Hollogen type lamp(100w). The stereo photogrammetry is adopted for the three dimensional geometrical mesurement of tracer particle. For the stereo-pair matching, the camera parameters should be decide in advance by a camera calibration. Camera parameter calculation equation is collinearity equation. In order to calculate the particle 3-D position based on the stereo photograrnrnetry, the eleven parameters of each camera should be obtained by the calibration of the camera. Epipolar line is used for stereo pair matching. The 3-D position of particle is calculated from the three camera parameters, centers of projection of the three cameras, and photographic coordinates of a particle, which is based on the collinear condition. To find velocity vector used 3-D position data of the first frame and the second frame. To extract error vector applied continuity equation. This study developed of various 3D-PIV animation technique.

  • PDF

Improved Face Recognition based on 2D-LDA using Weighted Covariance Scatter (가중치가 적용된 공분산을 이용한 2D-LDA 기반의 얼굴인식)

  • Lee, Seokjin;Oh, Chimin;Lee, Chilwoo
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.12
    • /
    • pp.1446-1452
    • /
    • 2014
  • Existing LDA uses the transform matrix that maximizes distance between classes. So we have to convert from an image to one-dimensional vector as training vector. However, in 2D-LDA, we can directly use two-dimensional image itself as training matrix, so that the classification performance can be enhanced about 20% comparing LDA, since the training matrix preserves the spatial information of two-dimensional image. However 2D-LDA uses same calculation schema for transformation matrix and therefore both LDA and 2D-LDA has the heteroscedastic problem which means that the class classification cannot obtain beneficial information of spatial distances of class clusters since LDA uses only data correlation-based covariance matrix of the training data without any reference to distances between classes. In this paper, we propose a new method to apply training matrix of 2D-LDA by using WPS-LDA idea that calculates the reciprocal of distance between classes and apply this weight to between class scatter matrix. The experimental result shows that the discriminating power of proposed 2D-LDA with weighted between class scatter has been improved up to 2% than original 2D-LDA. This method has good performance, especially when the distance between two classes is very close and the dimension of projection axis is low.