• Title/Summary/Keyword: 텐서 분해

Search Result 39, Processing Time 0.025 seconds

S-PARAFAC: Distributed Tensor Decomposition using Apache Spark (S-PARAFAC: 아파치 스파크를 이용한 분산 텐서 분해)

  • Yang, Hye-Kyung;Yong, Hwan-Seung
    • Journal of KIISE
    • /
    • v.45 no.3
    • /
    • pp.280-287
    • /
    • 2018
  • Recently, the use of a recommendation system and tensor data analysis, which has high-dimensional data, is increasing, as they allow us to analyze the tensor and extract potential elements and patterns. However, due to the large size and complexity of the tensor, it needs to be decomposed in order to analyze the tensor data. While several tools are used for tensor decomposition such as rTensor, pyTensor, and MATLAB, since such tools run on a single machine, they are unable to handle large data. Also, while distributed tensor decomposition tools based on Hadoop can handle a scalable tensor, its computing speed is too slow. In this paper, we propose S-PARAFAC, which is a tensor decomposition tool based on Apache Spark, in distributed in-memory environments. We converted the PARAFAC algorithm into an Apache Spark version that enables rapid processing of tensor data. We also compared the performance of the Hadoop based tensor tool and S-PARAFAC. The result showed that S-PARAFAC is approximately 4~25 times faster than the Hadoop based tensor tool.

Nonnegative Tucker Decomposition (텐서의 비음수 Tucker 분해)

  • Kim, Yong-Deok;Choi, Seung-Jin
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.3
    • /
    • pp.296-300
    • /
    • 2008
  • Nonnegative tensor factorization(NTF) is a recent multiway(multilineal) extension of nonnegative matrix factorization(NMF), where nonnegativity constraints are imposed on the CANDECOMP/PARAFAC model. In this paper we consider the Tucker model with nonnegativity constraints and develop a new tensor factorization method, referred to as nonnegative Tucker decomposition (NTD). We derive multiplicative updating algorithms for various discrepancy measures: least square error function, I-divergence, and $\alpha$-divergence.

Nonnegative Tensor Factorization for Continuous EEG Classification (연속적인 뇌파 분류를 위한 비음수 텐서 분해)

  • Lee, Hye-Kyoung;Kim, Yong-Deok;Cichocki, Andrzej;Choi, Seung-Jin
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.5
    • /
    • pp.497-501
    • /
    • 2008
  • In this paper we present a method for continuous EEG classification, where we employ nonnegative tensor factorization (NTF) to determine discriminative spectral features and use the Viterbi algorithm to continuously classily multiple mental tasks. This is an extension of our previous work on the use of nonnegative matrix factorization (NMF) for EEG classification. Numerical experiments with two data sets in BCI competition, confirm the useful behavior of the method for continuous EEG classification.

Vehicle Recognition using Non-negative Tensor Factorization (비음수 텐서 분해를 이용한 차량 인식)

  • Ban, Jae Min;Kang, Hyunchul
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.5
    • /
    • pp.136-146
    • /
    • 2015
  • The active control of a vehicle based on vehicle recognition is one of key technologies for the intelligent vehicle, and the part-based image representation is necessary to recognize vehicles with only partial shapes of vehicles especially in urban scene where occlusions frequently occur. In this paper, we implemented a part-based image representation scheme using non-negative tensor factorization(NTF) and realized a robust vehicle recognition system using the NTF feature. The result shows that the proposed method gives more intuitive part-based representation and more robust recognition in urban scene.

A New Interpretation on the Additive and Multiplicative Decompositions of Elastic-Plasmic Deformation Gradient Tensor (탄소성 변형구배텐서의 가산분해와 곱분해에 대한 새로운 역학적 이해)

  • Y.Y. Nam;J.G. Shin
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.33 no.3
    • /
    • pp.94-102
    • /
    • 1996
  • An interpretation for the additive and multiplicative decomposition theory of the deformation gradient tensor in finite deformation problems is presented. the conventional methods have not provided the additive deformation velocity gradient. Moreover the plastic deformation velocity gradients are not free from elastic deformations. In this paper, a modified multiplicative decomposition is introduced with the assumption of coaxial plastic deformation velocity gradient. This strategy well gives the additive deformation velocity gradient in which the plastic deformation velocity gradient is not affect4d by the elastic deformation.

  • PDF

An Acoustic Event Detection Method in Tunnels Using Non-negative Tensor Factorization and Hidden Markov Model (비음수 텐서 분해와 은닉 마코프 모델을 이용한 터널 환경에서의 음향 사고 검지 방법)

  • Kim, Nam Kyun;Jeon, Kwang Myung;Kim, Hong Kook
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.8 no.9
    • /
    • pp.265-273
    • /
    • 2018
  • In this paper, we propose an acoustic event detection method in tunnels using non-negative tensor factorization (NTF) and hidden Markov model (HMM) applied to multi-channel audio signals. Incidents in tunnel are inherent to the system and occur unavoidably with known probability. Incidents can easily happen minor accidents and extend right through to major disaster. Most incident detection systems deploy visual incident detection (VID) systems that often cause false alarms due to various constraints such as night obstacles and a limit of viewing angle. To this end, the proposed method first tries to separate and detect every acoustic event, which is assumed to be an in-tunnel incident, from noisy acoustic signals by using an NTF technique. Then, maximum likelihood estimation using Gaussian mixture model (GMM)-HMMs is carried out to verify whether or not each detected event is an actual incident. Performance evaluation shows that the proposed method operates in real time and achieves high detection accuracy under simulated tunnel conditions.

MPM-Based Angular Animation of Particles using Polar Decomposition Theory (극 분해 이론을 활용한 MPM기반의 입자 회전 애니메이션)

  • Song, Chang-yong;Kim, Ki-hoon;Kim, Sun-jeong;Kim, Changhun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.28 no.4
    • /
    • pp.13-22
    • /
    • 2022
  • In this paper, we propose a single framework based on the MPM(Material Point Method) that can represent the dynamic angular motion of the elementary particle unit. In this study, the particles can have various shapes while also describing linear and angular motion. As a result, unlike other particle-based simulations, which only represent linear movements of spherical (e.g. Circle, Sphere) particles, it is possible to express the visually dynamic motion of them. The proposed framework utilizes MPM, due to the fact that rotational motion can be decomposed and derived from large deformation. During the integration process of the presented technique, a deformation gradient tensor is decomposed by polar decomposition theory for extracting rotation tensor. By applying this together with the linear motion of each particle, as a result, it is possible to simultaneously express the angluar and linear motion of the particle itself. To verify the proposed method, we show the simulation of rotating particles scattering in the wind field, and the interaction(e.g. Collision) between a moving object and them by comparing the traditional MPM

Corrupted Region Restoration based on 2D Tensor Voting (2D 텐서 보팅에 기반 한 손상된 텍스트 영상의 복원 및 분할)

  • Park, Jong-Hyun;Toan, Nguyen Dinh;Lee, Guee-Sang
    • The KIPS Transactions:PartB
    • /
    • v.15B no.3
    • /
    • pp.205-210
    • /
    • 2008
  • A new approach is proposed for restoration of corrupted regions and segmentation in natural text images. The challenge is to fill in the corrupted regions on the basis of color feature analysis by second order symmetric stick tensor. It is show how feature analysis can benefit from analyzing features using tensor voting with chromatic and achromatic components. The proposed method is applied to text images corrupted by manifold types of various noises. Firstly, we decompose an image into chromatic and achromatic components to analyze images. Secondly, selected feature vectors are analyzed by second-order symmetric stick tensor. And tensors are redefined by voting information with neighbor voters, while restore the corrupted regions. Lastly, mode estimation and segmentation are performed by adaptive mean shift and separated clustering method respectively. This approach is automatically done, thereby allowing to easily fill-in corrupted regions containing completely different structures and surrounding backgrounds. Applications of proposed method include the restoration of damaged text images; removal of superimposed noises or streaks. We so can see that proposed approach is efficient and robust in terms of restoring and segmenting text images corrupted.

Pectoral Muscle Segmentation of Breast MRI using Structure Tensor and Morphological Operation (구조 텐서와 모폴로지 연산을 이용한 유방 MR 영상의 흉근분할)

  • Lee, Myung-Eun;Chen, Yan-Juan;Kim, Soo-Hyung;Kim, Jong-Hyo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.04a
    • /
    • pp.416-417
    • /
    • 2011
  • 본 논문에서는 구조텐서와 모폴로지 연산을 이용한 유방 MR 영상에서 흉근을 제거하기 위한 분할 방법을 제안한다. 제안하는 방법은 영상의 그레디언트 정보를 나타내는 구조텐서와 복잡한 구조텐서를 평활화하기 위한 모폴로지 연산을 적용하여 영상 진단 및 영상 정합시 불필요한 흉근부분을 자동으로 분할하고자 한다. 실험결과에서 확인할 수 있듯이 정확한 분할의 결과는 향후 컴퓨터 보조 진단 시스템에 유용하게 사용할 수 있을 것으로 기대된다.