• Title/Summary/Keyword: Projection Matrix

Search Result 181, Processing Time 0.022 seconds

An Improved RSR Method to Obtain the Sparse Projection Matrix (희소 투영행렬 획득을 위한 RSR 개선 방법론)

  • Ahn, Jung-Ho
    • Journal of Digital Contents Society
    • /
    • v.16 no.4
    • /
    • pp.605-613
    • /
    • 2015
  • This paper addresses the problem to make sparse the projection matrix in pattern recognition method. Recently, the size of computer program is often restricted in embedded systems. It is very often that developed programs include some constant data. For example, many pattern recognition programs use the projection matrix for dimension reduction. To improve the recognition performance, very high dimensional feature vectors are often extracted. In this case, the projection matrix can be very big. Recently, RSR(roated sparse regression) method[1] was proposed. This method has been proved one of the best algorithm that obtains the sparse matrix. We propose three methods to improve the RSR; outlier removal, sampling and elastic net RSR(E-RSR) in which the penalty term in RSR optimization function is replaced by that of the elastic net regression. The experimental results show that the proposed methods are very effective and improve the sparsity rate dramatically without sacrificing the recognition rate compared to the original RSR method.

Estimators Shrinking towards Projection Vector for Multivariate Normal Mean Vector under the Norm with a Known Interval

  • Baek, Hoh Yoo
    • Journal of Integrative Natural Science
    • /
    • v.11 no.3
    • /
    • pp.154-160
    • /
    • 2018
  • Consider the problem of estimating a $p{\times}1$ mean vector ${\theta}(p-r{\geq}3)$, r = rank(K) with a projection matrix K under the quadratic loss, based on a sample $Y_1$, $Y_2$, ${\cdots}$, $Y_n$. In this paper a James-Stein type estimator with shrinkage form is given when it's variance distribution is specified and when the norm ${\parallel}{\theta}-K{\theta}{\parallel}$ is constrain, where K is an idempotent and symmetric matrix and rank(K) = r. It is characterized a minimal complete class of James-Stein type estimators in this case. And the subclass of James-Stein type estimators that dominate the sample mean is derived.

Registration of the 3D Range Data Using the Curvature Value (곡률 정보를 이용한 3차원 거리 데이터 정합)

  • Kim, Sang-Hoon;Kim, Tae-Eun
    • Convergence Security Journal
    • /
    • v.8 no.4
    • /
    • pp.161-166
    • /
    • 2008
  • This paper proposes a new approach to align 3D data sets by using curvatures of feature surface. We use the Gaussian curvatures and the covariance matrix which imply the physical characteristics of the model to achieve registration of unaligned 3D data sets. First, the physical characteristics of local area are obtained by the Gaussian curvature. And the camera position of 3D range finder system is calculated from by using the projection matrix between 3D data set and 2D image. Then, the physical characteristics of whole area are obtained by the covariance matrix of the model. The corresponding points can be found in the overlapping region with the cross-projection method and it concentrates by removed points of self-occlusion. By the repeatedly the process discussed above, we finally find corrected points of overlapping region and get the optimized registration result.

  • PDF

James-Stein Type Estimators Shrinking towards Projection Vector When the Norm is Restricted to an Interval

  • Baek, Hoh Yoo;Park, Su Hyang
    • Journal of Integrative Natural Science
    • /
    • v.10 no.1
    • /
    • pp.33-39
    • /
    • 2017
  • Consider the problem of estimating a $p{\times}1$ mean vector ${\theta}(p-q{\geq}3)$, $q=rank(P_V)$ with a projection matrix $P_v$ under the quadratic loss, based on a sample $X_1$, $X_2$, ${\cdots}$, $X_n$. We find a James-Stein type decision rule which shrinks towards projection vector when the underlying distribution is that of a variance mixture of normals and when the norm ${\parallel}{\theta}-P_V{\theta}{\parallel}$ is restricted to a known interval, where $P_V$ is an idempotent and projection matrix and rank $(P_V)=q$. In this case, we characterize a minimal complete class within the class of James-Stein type decision rules. We also characterize the subclass of James-Stein type decision rules that dominate the sample mean.

An approach to improving the James-Stein estimator shrinking towards projection vectors

  • Park, Tae Ryong;Baek, Hoh Yoo
    • Journal of the Korean Data and Information Science Society
    • /
    • v.25 no.6
    • /
    • pp.1549-1555
    • /
    • 2014
  • Consider a p-variate normal distribution ($p-q{\geq}3$, q = rank($P_V$) with a projection matrix $P_V$). Using a simple property of noncentral chi square distribution, the generalized Bayes estimators dominating the James-Stein estimator shrinking towards projection vectors under quadratic loss are given based on the methods of Brown, Brewster and Zidek for estimating a normal variance. This result can be extended the cases where covariance matrix is completely unknown or ${\sum}={\sigma}^2I$ for an unknown scalar ${\sigma}^2$.

A Square-Root Forward Backward Correlation-based Projection Approximation for Subspace Tracking (신호부공간 추정 성능 향상을 위한 전후방 상관과 제곱근행렬 갱신을 이용한 COPAST(correlation-based projection approximation for subspace-tracking) 알고리즘 연구)

  • Lim, June-Seok;Pyeon, Yong-Kug
    • 전자공학회논문지 IE
    • /
    • v.48 no.1
    • /
    • pp.7-15
    • /
    • 2011
  • In this paper, we propose a correlation-based subspace estimation technique, which is called square-root forward/backward correlation-based projection approximation subspace tracking(SRFB-COPAST). The SRFB-COPAST utilizes the forward and backward correlation matrix as well as square-root recursive matrix update in projection approximation approach to develop the subspace tracking algorithm. With the projection approximation, the square-root recursive FB-COPAST is presented. The proposed algorithm has the better performance than the recently developed COPAST method.

Acellular Dermal Matrix as a Core Strut for Projection in Nipple Reconstruction: Approaches for Three Different Methods of Breast Reconstruction

  • Park, Gui-Yong;Yoon, Eul-Sik;Cho, Hee-Eun;Lee, Byung-Il;Park, Seung-Ha
    • Archives of Plastic Surgery
    • /
    • v.43 no.5
    • /
    • pp.424-429
    • /
    • 2016
  • Background The objective of this paper was to describe a novel technique for improving the maintenance of nipple projection in primary nipple reconstruction by using acellular dermal matrix as a strut in one of three different configurations, according to the method of prior breast reconstruction. The struts were designed to best fill the different types of dead spaces in nipple reconstruction depending on the breast reconstruction method. Methods A total of 50 primary nipple reconstructions were performed between May 2012 and May 2015. The prior breast reconstruction methods were latissimus dorsi (LD) flap (28 cases), transverse rectus abdominis myocutaneous (TRAM) flap (10 cases), or tissue expander/implant (12 cases). The nipple reconstruction technique involved the use of local flaps, including the C-V flap or star flap. A $1{\times}2-cm$ acellular dermal matrix was placed into the core with O-, I-, and L-shaped struts for prior LD, TRAM, and expander/implant methods, respectively. The projection of the reconstructed nipple was measured at the time of surgery and at 3, 6, and 9 months postoperatively. Results The nine-month average maintenance of nipple projection was $73.0%{\pm}9.67%$ for the LD flap group using an O-strut, $72.0%{\pm}11.53%$ for the TRAM flap group using an I-strut, and $69.0%{\pm}10.82%$ for the tissue expander/implant group using an L-strut. There were no cases of infection, wound dehiscence, or flap necrosis. Conclusions The application of an acellular dermal matrix with a different kind of strut for each of 3 breast reconstruction methods is an effective addition to current techniques for improving the maintenance of long-term projection in primary nipple reconstruction.

Improved Leakage Signal Blocking Methods for Two Channel Generalized Sidelobe Canceller

  • Kim, Ki-Hyeon;Ko, Han-Seok
    • Speech Sciences
    • /
    • v.13 no.1
    • /
    • pp.117-128
    • /
    • 2006
  • The two-channel Generalized Sidelobe Canceller (GSC) scheme suffers from the presence of leakage signal in the reference channel. The leakage signal is caused by the dissimilar impulse responses between microphones, and different paths from speech source to microphones. Such leakage is detrimental to speech enhancement of the GSC since the desired reference signal becomes corrupted. In order to suppress the signal leakage, two matrix injection methods are proposed. In the first method, a simple gain compensation matrix is used. In the second, a projection matrix for reducing the error between the actual and the ideal primary and reference signals, is used. This paper describes the performance degradation resulting from leakage, and proposes effective methods to resolve the problem. Representative experiments were conducted to demonstrate the effectiveness of the proposed methods on recorded speech and noise in an actual automobile environment.

  • PDF

Number Recognition of Dot Matrix LED Display Using Morphological Processing and Template Matching (영상 형태학적 처리와 원형 정합을 이용한 도트 매트릭스 LED 디스플레이의 숫자 인식)

  • Jung, Min Chul
    • Journal of the Semiconductor & Display Technology
    • /
    • v.17 no.2
    • /
    • pp.41-46
    • /
    • 2018
  • This paper proposes a new method for the number recognition on dot matrix LED display. The proposed method uses morphological processing that dilates dots of numbers and connects the dots into strokes. The size of numbers is normalized using horizontal projection because the gaps of dots are different according to the size of numbers. The numbers are segmented by connected component analysis and finally, template matching method recognizes the segmented numbers. The proposed method is implemented using C language in Raspberry Pi system with a camera module for a real-time image processing. Experiments were conducted by using various dot matrix LED displays. The results show that the proposed method is successful for the number recognition on dot matrix LED display.

User Selection Scheme Based on the Projection Matrix (투영 행렬을 이용한 사용자 선택 기법)

  • Kim, Gibum;Kim, Jinwoo;Park, Hyuncheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.7
    • /
    • pp.1257-1265
    • /
    • 2015
  • In this paper, we describe a greedy user selection scheme for multiuser multiple-input multiple-output (MIMO) systems. We propose a new metric which has significantly improved performance compared to the Frobenius norm metric. The approximation of projection matrix is applied to increase the accuracy of Frobenius norm of effective channel matrix. We analyze the computational complexity of two metrics by using flop counts, and also verify the achievable sum rate through numerical simulation. Our simulation result shows that the proposed metric can achieve the improved sum rate as the number of user antenna increases.