• Title/Summary/Keyword: Matrix image

Search Result 1,012, Processing Time 0.023 seconds

Estimation of Trifocal Tensor with Corresponding Mesh of Two Frontal Images

  • Tran Duy Dung;Jun Byung Hwan
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.133-136
    • /
    • 2004
  • We are going to procedure various view from two frontal image using trifocal tensor. We found that warping is effective to produce synthesized poses of a face with the small number of mesh point of a given image in previous research[1]. For this research, fundamental matrix is important to calculate trifocal tensor. So, in this paper, we investigate two existing algorithms: Hartley's[2] and Kanatani's[3]. As an experimental result, Kenichi Kantani's algorithm has better performance of fundamental matrix than Harley's algorithm. Then we use the fundamental matrix of Kenichi Kantani's algorithm to calculate trifocal tensor. From trifocal tensor we calculate new trifocal tensor with rotation input and translation input and we use warping to produce new virtual views.

  • PDF

CERTAIN DISCRIMINATIONS OF PRIME ENDOMORPHISM AND PRIME MATRIX

  • Bae, Soon-Sook
    • East Asian mathematical journal
    • /
    • v.14 no.2
    • /
    • pp.259-268
    • /
    • 1998
  • In this paper, for a commutative ring R with an identity, considering the endomorphism ring $End_R$(M) of left R-module $_RM$ which is (quasi-)injective or (quasi-)projective, some discriminations of prime endomorphism were found as follows: each epimorphism with the irreducible(or simple) kernel on a (quasi-)injective module and each monomorphism with maximal image on a (quasi-)projective module are prime. It was shown that for a field F, any given square matrix in $Mat_{n{\times}n}$(F) with maximal image and irreducible kernel is a prime matrix, furthermore, any given matrix in $Mat_{n{\times}n}$(F) for any field F can be factored into a product of prime matrices.

  • PDF

Improvment of Accuracy of Projective Transformation Matrix for Image Mosaicing (영상 모자이킹을 위한 사영 변환 행렬의 정밀도 개선)

  • 노현영;이상욱
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.11a
    • /
    • pp.226-230
    • /
    • 2002
  • This paper proposes a method of improvement of accuracy of projective transformation matrix for Image Mosaicing. Using shift theorem, we extracted global translation components between images and using translation components, we found matching points between images so we solve general matching point problem we extracted highly trusted matching point using RANSAC algorithm. we normalized matching point coordinates and improved accuracy of projective transformation matrix.

  • PDF

A Novel Image Encryption using Complemented MLCA based on NBCA and 2D CAT (NBCA 에 기초한 여원 MLCA와 2D CAT를 이용한 새로운 영상 암호화)

  • Kim, Ha-Kyung;Nam, Tae-Hee;Cho, Sung-Jin;Kim, Seok-Tae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.6C
    • /
    • pp.361-367
    • /
    • 2011
  • In this paper, we propose encryption method to using complemented MLCA(Maximum Length Cellular Automata) based on NBCA(Null Boundary CA) and 2D CAT (Two-Dimensional Cellular Automata Transform) for efficient image encryption. The encryption method is processed in the following order. First, a transition matrix T is created using the Wolfram Rule matrix. Then, the transition matrix T is multiplied to the original image that is intended to be encrypted, which transfers the pixel values of the original image. Furthermore, the converted original image goes through a XOR operation with complemented vector F to convert into a complemented MLCA applied image. Then, the gateway value is set and 2D CAT basis function is created. Also, the 2D CAT is encrypted by multiplying the created basis function to the complemented MLCA applied image. Lastly, the stability analysis verifies that proposed method holds a high encryption quality status.

Comparison and Performance Validation of On-line Aerial Triangulation Algorithms for Real-time Image Georeferencing (실시간 영상 지오레퍼런싱을 위한 온라인 항공삼각측량 알고리즘의 비교 및 성능 검증)

  • Choi, Kyoung-Ah;Lee, Im-Pyeong
    • Korean Journal of Remote Sensing
    • /
    • v.28 no.1
    • /
    • pp.55-67
    • /
    • 2012
  • Real-time image georeferencing is required to generate spatial information rapidly from the image sequences acquired by multi-sensor systems. To complement the performance of position/attitude sensors and process in real-time, we should employ on-line aerial triangulation based on a sequential estimation algorithm. In this study, we thus attempt to derive an efficient on-line aerial triangulation algorithm for real-time georeferencing of image sequences. We implemented on-line aerial triangulation using the existing Given transformation update algorithm, and a new inverse normal matrix update algorithm based on observation classification, respectively. To compare the performance of two algorithms in terms of the accuracy and processing time, we applied these algorithms to simulated airborne multi-sensory data. The experimental results indicate that the inverse normal matrix update algorithm shows 40 % higher accuracy in the estimated ground point coordinates and eight times faster processing speed comparing to the Given transformation update algorithm. Therefore, the inverse normal matrix update algorithm is more appropriate for the real-time image georeferencing.

Improvement of Image Scrambling Scheme Using DPSS(Discrete Prolate Spheroidal Sequence) and Digital Watermarking Application (DPSS(Discrete Prolate Spheroidal Sequence)를 이용한 영상 스크램블링 방식의 개선 및 디지털 워터마킹 응용)

  • Lee, Hye-Joo;Nam, Je-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.11
    • /
    • pp.1417-1426
    • /
    • 2007
  • As one of schemes to protect multimedia content. it is the selective encryption scheme to encrypt partially multimedia content. Compared AES(advanced encryption standard) of traditional encryption, the selective encryption scheme provides low security but is applicable to applications of multimedia content not to require high secrecy. In this paper, we improve the image scrambling scheme proposed by Van De Ville which scrambles an image without bandwidth expansion using DPSS(discrete prolate spheroidal sequence) to make it more secure based on Shujun's research which verifies the secrecy of Van De Ville's scheme. The proposed method utilizes an orthonormalized random matrix instead of Hadamard matrix for secret matrix and to add it for providing high secrecy against statistical attack or known-plaintext attack using some statistical property or estimate of secret matrix from a scrambled image. The experimental results show that the proposed method is more secure than the existing scheme. In addition, we show that the proposed method can be applied to access control or copy control of watermarking application.

  • PDF

Iterative Low Rank Approximation for Image Denoising (영상 잡음 제거를 위한 반복적 저 계수 근사)

  • Kim, Seehyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.10
    • /
    • pp.1317-1322
    • /
    • 2021
  • Nonlocal similarity of natural images leads to the fact that a patch matrix whose columns are similar patches of the reference patch has a low rank. Images corrupted by additive white Gaussian noises (AWGN) make their patch matrices to have a higher rank. The noise in the image can be reduced by obtaining low rank approximation of the patch matrices. In this paper, an image denoising algorithm is proposed, which first constructs the patch matrices by combining the similar patches of each reference patch, which is a part of the noisy image. For each patch matrix, the proposed algorithm calculates its low rank approximate, and then recovers the original image by aggregating the low rank estimates. The simulation results using widely accepted test images show that the proposed denoising algorithm outperforms four recent methods.

Research of the Strength of Super Personal Conflicts in Animations using Pseudo Inverse (의사 역행렬을 이용한 애니메이션의 초개인적 갈등(SPC) 강도 관련 다학제적 연구)

  • Kim, Jae Ho;Zhang, Zheng Yang;Wang, Yu Chao;Jang, So Eun;Lee, Tae Rin
    • Korea Science and Art Forum
    • /
    • v.30
    • /
    • pp.41-56
    • /
    • 2017
  • This study is an intensive study on Tae Rin Lee's research results. A linear system for Estimating the Strength of Super Personal Conflict (ESSPC) in animations is proposed. Tae Rin Lee has extracted the Super Personal Conflict (SPC) shots of animations, and obtained the strength through the experts' psychological test experiment. The purpose of this study is to find a model that automatically computes the superpersonal conflict intensity value (ESSPC). By utilizing these results, 1) 20 image feature vectors are suggested for analyzing the SPC, and 2) a linear system is found for auto-calculating ESSPC by using the pseudo inverse matrix. The proposed system shows 9.25% root mean square error and the effectiveness is proven.

Texture analysis of Thyroid Nodules in Ultrasound Image for Computer Aided Diagnostic system (컴퓨터 보조진단을 위한 초음파 영상에서 갑상선 결절의 텍스쳐 분석)

  • Park, Byung eun;Jang, Won Seuk;Yoo, Sun Kook
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.1
    • /
    • pp.43-50
    • /
    • 2017
  • According to living environment, the number of deaths due to thyroid diseases increased. In this paper, we proposed an algorithm for recognizing a thyroid detection using texture analysis based on shape, gray level co-occurrence matrix and gray level run length matrix. First of all, we segmented the region of interest (ROI) using active contour model algorithm. Then, we applied a total of 18 features (5 first order descriptors, 10 Gray level co-occurrence matrix features(GLCM), 2 Gray level run length matrix features and shape feature) to each thyroid region of interest. The extracted features are used as statistical analysis. Our results show that first order statistics (Skewness, Entropy, Energy, Smoothness), GLCM (Correlation, Contrast, Energy, Entropy, Difference variance, Difference Entropy, Homogeneity, Maximum Probability, Sum average, Sum entropy), GLRLM features and shape feature helped to distinguish thyroid benign and malignant. This algorithm will be helpful to diagnose of thyroid nodule on ultrasound images.