• Title/Summary/Keyword: 대응행렬도

Search Result 127, Processing Time 0.038 seconds

Analytical and Numerical Study on Saptially Coupled Free Vibration of Nonsymmetric Thin-Walled Curved Girders (비대칭 단면을 갖는 박벽곡선보의 자유진동에 관한 수치적 및 해석적 연구)

  • Kim, Nam Il;Kim, Moon Young
    • Journal of Korean Society of Steel Construction
    • /
    • v.14 no.3
    • /
    • pp.423-432
    • /
    • 2002
  • This study presented analytical and numerical solutions for spatial free vibration of nonsymmetric thin-walled circular curved beams. The closed-form solutions were obtained for in-plane free vibration analylsis of monosymmetric curved beams. Likewise, two types of thin-walled curved beam elements were developed using the third and the fifth order Hermitian polynomials. In order to illustrate the accuracy and usefulness of the present method, this study presented analytical and numerical solution and compared these with the results using the ABAQUS's shell elements. In particular, effects of the thickness-curvature as well as the inextensional condition were investigated on the free vibration of curved beams with nonsymmetric sections.

Removal of Additive White Noise Using an Adaptive Wiener Filter with Edge Retention (화상의 에지 보존을 고려한 적응 위너 필터에 의한 가법성 백샙잡음의 제거)

  • Do, Jae-Su
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.6
    • /
    • pp.1693-1702
    • /
    • 1999
  • This paper proposes the use of an adaptive Wiener filter for edge-preserving image filtering. Images are partitioned into a set of blocks of pixels which is divided into five subsets of blocks according to their edge contents and orientations. Each subset of blocks is used to define a covariance matrix, from which a Wiener filter is derived. Five covariance matrices and Wiener filters are thus obtained. An image-block classifier using the five sets of covariance matrices of the class is designed to classify each incoming block of pixels according to its edge content in the presence of noise. Experimental results are included to verify the usefulness of the proposed method.

  • PDF

A Real-time Traffic Signal Control Algorithm based on Travel Time and Occupancy Rate (통행시간과 점유율 기반의 실시간 신호운영 알고리즘)

  • Park, Soon-Yong;Jeong, Young-Je
    • The Journal of the Korea Contents Association
    • /
    • v.16 no.8
    • /
    • pp.671-680
    • /
    • 2016
  • This research suggested a new real-time traffic signal control algorithm using fusion data of the travel time and the occupancy rate. This research applied the travel time data of traffic information system to traffic signal operation, and developed the signal control process using the degree of saturation that was estimated from the travel time data. This algorithm estimates a queue length from the travel time based on a deterministic delay model, and includes the process to change from the queue length to the degree of saturation. In addition, this model can calculate the traffic signal timings using fusion data of the travel time and the occupancy rate based on the saturation degree. The micro simulation analysis was conducted for effectiveness evaluation. We checked that the average delay decreased by up to 27 percent. In addition, we checked that this signal control algorithm could respond to a traffic condition of oversaturation and detector breakdown effectively and usefully. This research has important contribution to apply the traffic information system to traffic signal operation sectors.

BCDR algorithm for network estimation based on pseudo-likelihood with parallelization using GPU (유사가능도 기반의 네트워크 추정 모형에 대한 GPU 병렬화 BCDR 알고리즘)

  • Kim, Byungsoo;Yu, Donghyeon
    • Journal of the Korean Data and Information Science Society
    • /
    • v.27 no.2
    • /
    • pp.381-394
    • /
    • 2016
  • Graphical model represents conditional dependencies between variables as a graph with nodes and edges. It is widely used in various fields including physics, economics, and biology to describe complex association. Conditional dependencies can be estimated from a inverse covariance matrix, where zero off-diagonal elements denote conditional independence of corresponding variables. This paper proposes a efficient BCDR (block coordinate descent with random permutation) algorithm using graphics processing units and random permutation for the CONCORD (convex correlation selection method) based on the BCD (block coordinate descent) algorithm, which estimates a inverse covariance matrix based on pseudo-likelihood. We conduct numerical studies for two network structures to demonstrate the efficiency of the proposed algorithm for the CONCORD in terms of computation times.

Realistic 3D model generation of a real product based on 2D-3D registration (2D-3D 정합기반 실제 제품의 사실적 3D 모델 생성)

  • Kim, Gang Yeon;Son, Seong Min
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.11
    • /
    • pp.5385-5391
    • /
    • 2013
  • As on-line purchases is activated, customers' demand increases for the realistic and accurate digital information of a product design. In this paper, we propose a practical method that can generate a realistic 3D model of a real product using a 3D geometry obtained by a 3D scanner and its photographic images. In order to register images to the 3D geometry, the camera focal length, the CCD scanning aspect ratio and the transformation matrix between the camera coordinate and the 3D object coordinate must be determined. To perform this 2D-3D registration with consideration of computational complexity, a three-step method is applied, which consists of camera calibration, determination of a temporary optimum translation vector (TOTV) and nonlinear optimization for three rotational angles. A case study for a metallic coated industrial part, of which the colour appearance is hardly obtained by a 3D colour scanner has performed to demonstrate the effectiveness of the proposed method.

3D Reconstruction using the Key-frame Selection from Reprojection Error (카메라 재투영 오차로부터 중요영상 선택을 이용한 3차원 재구성)

  • Seo, Yung-Ho;Kim, Sang-Hoon;Choi, Jong-Soo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.1
    • /
    • pp.38-46
    • /
    • 2008
  • Key-frame selection algorithm is defined as the process of selecting a necessary images for 3D reconstruction from the uncalibrated images. Also, camera calibration of images is necessary for 3D reconstuction. In this paper, we propose a new method of Key-frame selection with the minimal error for camera calibration. Using the full-auto-calibration, we estimate camera parameters for all selected Key-frames. We remove the false matching using the fundamental matrix computed by algebraic deviation from the estimated camera parameters. Finally we obtain 3D reconstructed data. Our experimental results show that the proposed approach is required rather lower time costs than others, the error of reconstructed data is the smallest. The elapsed time for estimating the fundamental matrix is very fast and the error of estimated fundamental matrix is similar to others.

A Matrix-Based Graph Matching Algorithm with Application to a Musical Symbol Recognition (행렬기반의 정합 알고리듬에 의한 음악 기호의 인식)

  • Heo, Gyeong-Yong;Jang, Kyung-Sik;Jang, Moon-Ik;Kim, Jai-Hie
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.8
    • /
    • pp.2061-2074
    • /
    • 1998
  • In pattern recognition and image analysis upplications, a graph is a useful tool for complex obect representation and recognition. However it takes much time to pair proper nodes between the prototype graph and an input data graph. Futhermore it is difficult to decide whether the two graphs in a class are the same hecause real images are degradd in general by noise and other distortions. In this paper we propose a matching algorithm using a matrix. The matrix is suiable for simple and easily understood representation and enables the ordering and matching process to be convenient due to its predefined matrix manipulation. The nodes which constitute a gaph are ordered in the matrix by their geometrical positions and this makes it possible to save much comparison time for finding proper node pairs. for the classification, we defined a distance measure thatreflects the symbo's structural aspect that is the sum of the mode distance and the relation distance; the fornet is from the parameters describing the node shapes, the latter from the relations with othes node in the matrix. We also introduced a subdivision operation to compensate node merging which is mainly due t the prepreocessing error. The proposed method is applied to the recognition of musteal symbols and the result is given. The result shows that almost all, except heavily degraded symbols are recognized, and the recognition rate is approximately 95 percent.

  • PDF

Improved Method Evaluating the Stiffness Matrices of Thin-walled Beam on Elastic Foundations (탄성지반위에 놓인 박벽보의 강성행렬산정을 위한 개선된 해석기법)

  • Kim, Nam-Il;Jung, Sung-Yeop;Lee, Jun-Seok;Kim, Moon-Young
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.20 no.2
    • /
    • pp.113-125
    • /
    • 2007
  • Improved numerical method to obtain the exact stiffness matrices is newly proposed to perform the spatially coupled elastic and stability analyses of non-symmetric and open/closed thin-walled beam on elastic foundation. This method overcomes drawbacks of the previous method to evaluate the exact stiffness matrix for the spatially coupled stability analysis of thin-walled beam-column This numerical technique is accomplished via a generalized eigenproblem associated with 14 displacement parameters by transforming equilibrium equations to a set of first order simultaneous ordinary differential equations. Next polynomial expressions as trial solutions are assumed for displacement parameters corresponding to zero eigenvalues and the eigenmodes containing undetermined parameters equal to the number of zero eigenvalues are determined by invoking the identity condition. And then the exact displacement functions are constructed by combining eigensolutions and polynomial solutions corresponding to non-zero and zero eigenvalues, respectively. Consequently an exact stiffness matrix is evaluated by applying the member force-deformation relationships to these displacement functions. In order to illustrate the accuracy and the practical usefulness of this study, the numerical solutions are compared with results obtained from the thin-walled beam and shell elements.

Blind Rhythmic Source Separation (블라인드 방식의 리듬 음원 분리)

  • Kim, Min-Je;Yoo, Ji-Ho;Kang, Kyeong-Ok;Choi, Seung-Jin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.28 no.8
    • /
    • pp.697-705
    • /
    • 2009
  • An unsupervised (blind) method is proposed aiming at extracting rhythmic sources from commercial polyphonic music whose number of channels is limited to one. Commercial music signals are not usually provided with more than two channels while they often contain multiple instruments including singing voice. Therefore, instead of using conventional modeling of mixing environments or statistical characteristics, we should introduce other source-specific characteristics for separating or extracting sources in the under determined environments. In this paper, we concentrate on extracting rhythmic sources from the mixture with the other harmonic sources. An extension of nonnegative matrix factorization (NMF), which is called nonnegative matrix partial co-factorization (NMPCF), is used to analyze multiple relationships between spectral and temporal properties in the given input matrices. Moreover, temporal repeatability of the rhythmic sound sources is implicated as a common rhythmic property among segments of an input mixture signal. The proposed method shows acceptable, but not superior separation quality to referred prior knowledge-based drum source separation systems, but it has better applicability due to its blind manner in separation, for example, when there is no prior information or the target rhythmic source is irregular.

Verification Process for Stable Human Detection and Tracking (안정적 사람 검출 및 추적을 위한 검증 프로세스)

  • Ahn, Jung-Ho;Choi, Jong-Ho
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.4 no.3
    • /
    • pp.202-208
    • /
    • 2011
  • Recently the technologies that control the computer system through human computer interaction(HCI) have been widely studied. Their applications usually involve the methods that locate user's positions via face detection and recognize user's gestures, but face detection performance is not good enough. In case that the applications do not locate user's position stably, user interface performance, such as gesture recognition, is significantly decreased. In this paper we propose a new stable face detection algorithm using skin color detection and cumulative distribution of face detection results, whose effectiveness was verified by experiments. The propsed algorithm can be applicable in the area of human tracking that uses correspondence matrix analysis.