• Title/Summary/Keyword: Triangular decomposition

Search Result 30, Processing Time 0.018 seconds

A Novel Visual Servoing Method Using QR Decomposition and Disturbance Observer (QR분해와 외란관측기를 이용한 시각구동 방법)

  • 이준수;서일홍;유범재;오상록
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.6 no.6
    • /
    • pp.462-470
    • /
    • 2000
  • This paper proposes a visual servoing method based on QR decomposition and disturbance observer. The QR decomposition factors the image feature Jacobian into a unitary matrix and an upper triangular matrix. And it is shown that several performance indices such as measurement sensitivity of visual features, sensitivity of the control to noise and controllability can be improved for any general image feature Jacobian by QR decomposition and disturbance observer. To show the validity of the proposed approach, visual servoing with stereo vision is carried out for a Samsung FARAMAN 6-axis industrial robot manipulator.

  • PDF

Automatic Quadrilateral Element Mesh Generation Using Boundary Normal Offsetting In Various Two Dimensional Objects (다양한 2차원 형상에서의 외부 경계 절점 오프셋 방법을 이용한 자동 사각 요소 및 요소망 생성)

  • 김도헌;양현익
    • Korean Journal of Computational Design and Engineering
    • /
    • v.8 no.4
    • /
    • pp.270-277
    • /
    • 2003
  • In two dimensional mechanical design analysis, quadrilateral element mesh is preferred because it provides more accurate result than triangular element mesh. However, automation of quadrilateral element mesh generation is much more complex because of its geometrical complexities. In this study, an automatic quadrilateral element mesh generation algorithm based on the boundary normal offsetting method and the boundary decomposition method is developed. In so doing, nodes are automatically placed using the boundary normal offsetting method and the decomposition method is applied to decompose the designed domain into a set of convex subdomains. The generated elements are improved by relocation of the existing nodes based on the four criteria - uniformity, aspect ratio, skewness and taper degree. The developed algorithm requires minimal user inputs such as boundary data and the distance between nodes.

Blind Color Image Watermarking Based on DWT and LU Decomposition

  • Wang, Dongyan;Yang, Fanfan;Zhang, Heng
    • Journal of Information Processing Systems
    • /
    • v.12 no.4
    • /
    • pp.765-778
    • /
    • 2016
  • In watermarking schemes, the discrete wavelet transform (DWT) is broadly used because its frequency component separation is very useful. Moreover, LU decomposition has little influence on the visual quality of the watermark. Hence, in this paper, a novel blind watermark algorithm is presented based on LU transform and DWT for the copyright protection of digital images. In this algorithm, the color host image is first performed with DWT. Then, the horizontal and vertical diagonal high frequency components are extracted from the wavelet domain, and the sub-images are divided into $4{\times}4$ non-overlapping image blocks. Next, each sub-block is performed with LU decomposition. Finally, the color image watermark is transformed by Arnold permutation, and then it is inserted into the upper triangular matrix. The experimental results imply that this algorithm has good features of invisibility and it is robust against different attacks to a certain degree, such as contrast adjustment, JPEG compression, salt and pepper noise, cropping, and Gaussian noise.

Generating FE Mesh Automatically from STL File Model (STL 파일 모델로부터 유한 요소망 자동 생성)

  • Park, Jung-Min;Kwon, Ki-Youn;Lee, Byung-Chai;Chae, Soo-Won
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.31 no.7 s.262
    • /
    • pp.739-746
    • /
    • 2007
  • Recently, models in STL files are widely used in reverse engineering processes, CAD systems and analysis systems. However the models have poor geometric quality and include only triangles, so the models are not suitable for the finite element analysis. This paper presents a general method that generates finite element mesh from STL file models. Given triangular meshes, the method estimates triangles and makes clusters which consist of triangles. The clusters are merged by some geometric indices. After merging clusters, the method applies plane meshing algorithm, based on domain decomposition method, to each cluster and then the result plane mesh is projected into the original triangular set. Because the algorithm uses general methods to generate plane mesh, we can obtain both tri and quad meshes unlike previous researches. Some mechanical part models are used to show the validity of the proposed method.

Tetrahedral Mesh Generation by Using the Advancing-Front Method and the Optimal Surface Triangular Mesh Generation Technique (전진경계기법과 최적 표면 삼각형 요소망 생성 기법을 이용한 사면체 요소망의 생성)

  • Lee M.C.;Joun M.S.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.11 no.2
    • /
    • pp.138-147
    • /
    • 2006
  • A systematic approach to tetrahedral element or mesh generation, based on an advancing-front method and an optimal triangular mesh generation technique on the surface, is presented in this paper. The possible internal nodes are obtained by the octree-decomposition scheme. The initial tetrahedral mesh system is constructed by the advancing-front method and then it is improved by the quality improvement processes including mesh swapping and nodal smoothing. The approach is evaluated by investigating the normalized length, the normalized volume, the dihedral angle and the normalized quality

Rapid Die Surface Modification for Sheet Metal Forming (박판성형을 위한 신속한 금형곡면의 수정)

  • Yoo, D.J.
    • Transactions of Materials Processing
    • /
    • v.16 no.7
    • /
    • pp.538-548
    • /
    • 2007
  • In this paper, a novel approach which enables rapid die surface modification for sheet metal forming process is proposed. In this method an implicit surface which interpolates a given set of control points and displacement constraints is generated to compute the displacements at arbitrary points located on die surface. The proposed method does not depend on the underlying surface representation type and is affected neither by its complexity nor by its quality. In addition, the domain decomposition method is introduced in order to treat large surface model. The global domain of interest is divided into smaller domains where the problem can be solved locally. And then the local solutions are combined together to obtain a global solution. In order to verify the validity and effectiveness of the proposed method, various surface modifications are carried out fur three kinds of die surface model including polygonal surface composed of triangular and rectangular meshes, polynomial surface and NURBS surface.

A Simplified Efficient Algorithm for Blind Detection of Orthogonal Space-Time Block Codes

  • Pham, Van Su;Mai, Linh;Lee, Jae-Young;Yoon, Gi-Wan
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.3
    • /
    • pp.261-265
    • /
    • 2008
  • This work presents a simplified efficient blind detection algorithm for orthogonal space-time codes(OSTBC). First, the proposed decoder exploits a proper decomposition approach of the upper triangular matrix R, which resulted from Cholesky-factorization of the composition channel matrix, to form an easy-to-solve blind detection equation. Secondly, in order to avoid suffering from the high computational load, the proposed decoder applies a sub-optimal QR-based decoder. Computer simulation results verify that the proposed decoder allows to significantly reduce computational complexity while still satisfying the bit-error-rate(BER) performance.

A Realization of Multidimensional Digital Filters by using the Triangular Decompostition of the Coefficient Matrix (계수행렬의 삼각분해에 의한 다차원 디지털 필터의 실현)

  • 김태수;김명기
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.14 no.2
    • /
    • pp.95-107
    • /
    • 1989
  • This paper proposes a realization method of multidimensional digital filters that has high modularity, regularity and parallelism enjoying the attributes for efficient VLSI implementation. The method shows that multidimensional transfer functions can be treated as two-dimensional transfer functions modifying the decomposition method of multidimensional transfer functions proposed by Venetsanopoulos etal, and then be displayed by multiplications and additions of one-dimensional transfer functions by applying the griangular decomposition theorem to the coefficient matrices of the two-dimensional transfer functions.

  • PDF

A Study of Fast Contingency Analysis Algorithm (신속한 상정사고해석 알고리즘에 관한 연구)

  • Moon, Young-Hyun
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.34 no.11
    • /
    • pp.421-429
    • /
    • 1985
  • With the rapid increase of contingency cases due to complication of power system, the reduction of computation time in contingency analysis has become more significant than ever before. This paper deals with the development of a fast contingency analysis algorithm by using a matrix decomposition method. The proposed matrix decomposition method of contingency analysis yields an accurate solution by using the original triangular factor table. An outstanding feature of this method is of no need of factor table modification for network changes due to contingency outages. The proposed method is also applicable to multiple contingency analysis withremarkable reduction of computation time. The algorithm has been tested for a number of single and multiple contigencies in 17-bus and 50-bus systems. The numerical results show its applicability to practical power systems.

  • PDF

Quadrangulation of Sewing Pattern Based on Recursive Geometry Decomposition (재귀적 기하 분해 방법에 기반한 봉제 패턴의 사각화 방법)

  • Gizachew, Gocho Yirga;Jeong, Moon Hwan;Ko, Hyeong Seok
    • Journal of the Korea Computer Graphics Society
    • /
    • v.22 no.2
    • /
    • pp.1-10
    • /
    • 2016
  • The computational cost of clothing simulation and rendering is mainly depends on the type of mesh and its quality. Thus, quadrilateral meshes are generally preferred over triangular meshes for the reasons of accuracy and efficiency. This paper presents a method of quadrangulating sewing pattern based on the recursive geometry decomposition method. Herein, we proposed two simple improvements to the previous algorithms. The first one deals with the recursive geometry decomposition in which the physical domain is decomposed into simple and mappable regions. The second proposed algorithm deals with the vertex validation in which the invalid vertex classification can be validated.