• Title/Summary/Keyword: Sparse

Search Result 1,171, Processing Time 0.025 seconds

Optimal design of a sparse planar array sensor for underwater vehicles (수중 운동체용 희소 평면배열 센서의 최적 설계)

  • Afzal, Muhammad Shakeel;Roh, Yongrae
    • The Journal of the Acoustical Society of Korea
    • /
    • v.37 no.1
    • /
    • pp.53-59
    • /
    • 2018
  • In this study, a new design method is developed to optimize the structure of an underwater sparse array sensor. The purpose of this research is to design the structure of a sparse array that has the performance equivalent to a fully sampled array. The directional factor of a sparse planar array is derived as a function of the structural parameters of the array. With the derived equation, the structure of the sparse array sensor is designed to have the performance equivalent to that of the fully array sensor through structural optimization of the number and location of transmitting and receiving elements in the array. The designed sparse array sensor shows beam patterns very close to those of the fully array sensor in terms of PSLL (Peak Side Lobe Level) and MLBW (Main Lobe Beam Width), which confirms the effectiveness of the present optimal design method. Further, the validity of the analytic beam patterns is verified by comparing them with those from the FEA (Finite Element Analysis) of the optimized sparse array structure.

Sparse Channel Estimation using weighted $l_1$-minimization (Weighted $l_1$-최소화기법을 이용한 Sparse한 채널 추정 기법)

  • Kwon, Seok-Beop;Ha, Mi-Ri;Shim, Byong-Hyo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2010.07a
    • /
    • pp.50-52
    • /
    • 2010
  • 통신 시스템의 성능을 향상시키는 핵심 문제 중에 하나인 채널을 추정하는 문제는 다양한 분야에서 연구되고 있다. 채널의 sparse한 특징으로 인해 기존의 linear square나 minimum mean square error보다 발전된 $l_1$-norm minimization 방법 등이 많이 연구되고 있다. 이에 본 논문은 sparse한 채널의 특징과 천천히 변화하는 채널환경 특징을 이용하여 기존의 방법에 비해 더 높은 성능의 채널 추정 기법을 연구한다. 천천히 변화하는 채널환경의 특징으로 인해 이전 채널 정보를 현재 채널 추정에 사용할 수 있고 sparse한 채널의 특징으로 $l_1$-norm minimization을 사용할 수 있다. 이러한 두 가지의 정보를 이용하여 weighted $l_1$-norm minimization 이용한 support detection후 MMSE를 이용한 채널 추정기법을 연구한다.

  • PDF

High Performance Current Controller for Sparse Matrix Converter Based on Model Predictive Control

  • Lee, Eunsil;Lee, Kyo-Beum;Lee, Young Il;Song, Joong-Ho
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.5
    • /
    • pp.1138-1145
    • /
    • 2013
  • A novel predictive current control strategy for a sparse matrix converter is presented. The sparse matrix converter is functionally-equivalent to the direct matrix converter but has a reduced number of switches. The predictive current control uses a model of the system to predict the future value of the load current and generates the reference voltage vector that minimizes a given cost function so that space vector modulation is achieved. The results show that the proposed controller for sparse matrix converters controls the load current very effectively and performs very well through simulation and experimental results.

Analysis of Linear Time-Invariant Spare Network and its Computer Programming (sparse 행렬을 이용한 저항 회로망의 해석과 전산프로그래밍)

  • 차균현
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.11 no.2
    • /
    • pp.1-4
    • /
    • 1974
  • Matrix inversion is very inefficient for computing direct solutions of the large sparse systems of linear equations that arise in many network problems. This paper describes some computer programming techniques for taking advantage of the sparsity of the admittance matrix. with this method, direct solutions are computed from sparse matrix. It is Possible to gain a significant reduction in computing time, memory and round-off emir[r. Retails of the method, numerical examples and programming are given.

  • PDF

Sparse Signal Recovery with Pruning-based Tree search

  • Kim, Jinhong;Shim, Byonghyo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2015.11a
    • /
    • pp.51-53
    • /
    • 2015
  • In this paper, we propose an efficient sparse signal recovery algorithm referred to as the matching pursuit with a tree pruning (TMP). Two key ingredients of TMP are the pre-selection to put a restriction on columns of the sensing matrix to be investigated and the tree pruning to eliminate unpromising paths from the search tree. In our analysis, we show that the sparse signal is accurately reconstructed when the sensing matrix satisfies the restricted isometry property. In our simulations, we confirm that TMP is effective in recovering sparse signals and outperforms conventional sparse recovery algorithms.

  • PDF

Sparse Index Multiple Access for Multi-Carrier Systems with Precoding

  • Choi, Jinho
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.439-445
    • /
    • 2016
  • In this paper, we consider subcarrier-index modulation (SIM) for precoded orthogonal frequency division multiplexing (OFDM) with a few activated subcarriers per user and its generalization to multi-carrier multiple access systems. The resulting multiple access is called sparse index multiple access (SIMA). SIMA can be considered as a combination of multi-carrier code division multiple access (MC-CDMA) and SIM. Thus, SIMA is able to exploit a path diversity gain by (random) spreading over multiple carriers as MC-CDMA. To detect multiple users' signals, a low-complexity detection method is proposed by exploiting the notion of compressive sensing (CS). The derived low-complexity detection method is based on the orthogonal matching pursuit (OMP) algorithm, which is one of greedy algorithms used to estimate sparse signals in CS. From simulation results, we can observe that SIMA can perform better than MC-CDMA when the ratio of the number of users to the number of multi-carrier is low.

Comparison of Local and Global Features for Sparse Representation-based Human Action Recognition (Sparse Representation 기반의 인간행동인식에 대한 지역특징과 전역특징 비교)

  • Hwang, Jung-Hyon;Min, Hyun-seok;Ro, Yong Man
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2013.11a
    • /
    • pp.246-247
    • /
    • 2013
  • 인간행동의 자동인식 기술은 영상보안 및 인간-사물 상호작용 분야에 핵심적 기술이다. 그러나 실제 비디오 환경에서는 인간 행동의 다양성 및 잡음 등 많은 제한점들로 인해 효과적인 행동인식에 어려움이 있다. 최근 이러한 문제점을 해결하기 위하여 많은 영상 처리 및 인식 분야에서 연구되고 있는 sparse representation 기반의 방법들이 제시되고 있다. 이에 본 논문에서는 효과적으로 sparse representation을 행동인식에 적용하고, sparse representation 기반 인간행동인식을 위해 사용되는 지역특징 및 전역특징에 대하여 비교했다.

  • PDF

Clustering Effects in Sparse NMF(Non-negative Matrix Factorization) (Sparse NMF에 의한 클러스터링)

  • Oh, Sang-Hoon
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2008.05a
    • /
    • pp.92-95
    • /
    • 2008
  • NMF(Non-negative Matrix Factorization) has been proposed as an useful algorithm for feature extraction. Using NMF, we can extract low-dimensional feature vectors. Also, we can find clustering effects in the NMF algorithm. Also, it is reported that the sparse NMF algorithm shows better clustering effects. This paper compares the two approaches in the viewpoint of clustering effects.

  • PDF

2D Sparse Array Transducer Optimization for 3D Ultrasound Imaging

  • Choi, Jae Hoon;Park, Kwan Kyu
    • Journal of the Korean Society for Nondestructive Testing
    • /
    • v.34 no.6
    • /
    • pp.441-446
    • /
    • 2014
  • A 3D ultrasound image is desired in many medical examinations. However, the implementation of a 2D array, which is needed for a 3D image, is challenging with respect to fabrication, interconnection and cabling. A 2D sparse array, which needs fewer elements than a dense array, is a realistic way to achieve 3D images. Because the number of ways the elements can be placed in an array is extremely large, a method for optimizing the array configuration is needed. Previous research placed the target point far from the transducer array, making it impossible to optimize the array in the operating range. In our study, we focused on optimizing a 2D sparse array transducer for 3D imaging by using a simulated annealing method. We compared the far-field optimization method with the near-field optimization method by analyzing a point-spread function (PSF). The resolution of the optimized sparse array is comparable to that of the dense array.

Tucker Modeling based Kronecker Constrained Block Sparse Algorithm

  • Zhang, Tingping;Fan, Shangang;Li, Yunyi;Gui, Guan;Ji, Yimu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.657-667
    • /
    • 2019
  • This paper studies synthetic aperture radar (SAR) imaging problem which the scatterers are often distributed in block sparse pattern. To exploiting the sparse geometrical feature, a Kronecker constrained SAR imaging algorithm is proposed by combining the block sparse characteristics with the multiway sparse reconstruction framework with Tucker modeling. We validate the proposed algorithm via real data and it shows that the our algorithm can achieve better accuracy and convergence than the reference methods even in the demanding environment. Meanwhile, the complexity is smaller than that of the existing methods. The simulation experiments confirmed the effectiveness of the algorithm as well.