• Title/Summary/Keyword: Information Symmetry

Search Result 290, Processing Time 0.035 seconds

THE STRONG STABILITY OF ALGORITHMS FOR SOLVING THE SYMMETRIC EIGENPROBLEM

  • Smoktunowicz, Alicja
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.7 no.1
    • /
    • pp.25-31
    • /
    • 2003
  • The concepts of stability of algorithms for solving the symmetric and generalized symmetric-definite eigenproblems are discussed. An algorithm for solving the symmetric eigenproblem $Ax={\lambda}x$ is stable if the computed solution z is the exact solution of some slightly perturbed system $(A+E)z={\lambda}z$. We use both normwise approach and componentwise way of measuring the size of the perturbations in data. If E preserves symmetry we say that an algorithm is strongly stable (in a normwise or componentwise sense, respectively). The relations between the stability and strong stability are investigated for some classes of matrices.

  • PDF

Laryngeal Stroboscopy (후두 스트로보스코피)

  • Park, Young-Hak;Choi, Ji-Young
    • Journal of the Korean Society of Laryngology, Phoniatrics and Logopedics
    • /
    • v.19 no.2
    • /
    • pp.96-100
    • /
    • 2008
  • Laryngeal stroboscopy is a important clinical tool in the diagnosis and evaluation of patients with voice disorders. Stroboscopic parameters evaluated during examination include symmetry, periodicity, glottic losure, amplitude, mucosal wave, and amplitude. Stroboscopy can provide useful information on glottal closure patterns in patient with/without vocal fold pathology and this paper describes the stroboscopic findings of the laryngeal pathologic lesions.

  • PDF

Parallel Speedup of NTGST on SIMD type Multiprocessor (SIMD 구조의 다중 프로세서를 이용한 NTGST의 병렬고속화)

  • 김복만;서경석;김종화;최흥문
    • Proceedings of the IEEK Conference
    • /
    • 2001.06d
    • /
    • pp.127-130
    • /
    • 2001
  • 본 논문에서는 SIMD (Single Instruction stream and Multiple Data stream)형 병렬 구조의 다중 프로세서를 이용하여 NTGST (noise-tolerant generalized symmetry transform)를 병렬 고속화하였다. 먼저 NTGST의 화소 및 영상 영역간의 계산 독립성을 이용하여 영상을 분할하여 P개의 프로세서에 할당하고, 이들 각각을 N개의 데이터를 한번에 처리하는 SIMD 구조로 병렬화하여 NP에 비례하는 속도 향상을 얻었다. 실험에서 MMX 기술의 펜티엄 Ⅲ 프로세서를 2개 사용하여 제안한 알고리즘이 기존의 NTGST 보다 8배 가까이 고속으로 처리됨을 확인하였다.

  • PDF

Bifurcation of Combinatorial Oscillations in Coupled Buffing′s Circuits

  • A, Yue-M;Hiroshi KAWAKMI
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1622-1625
    • /
    • 2002
  • This paper studies the bifurcation of combinatorial oscillations in coupled Duffing’s circuits when symmetry is broken. The system consists of two periodic farced circuits coupled by a linear resistor, These two periodic external forces are sinusoidal voltage sources with various phase-shift. We investigate the relation between phase-shift and periodic solutions by analyzing many bifurcation diagrams.

  • PDF

Two-Dimensional Probability Functions of Morphological Dilation and Erosion of a Memoryless Source

  • Sangsin Na;Park, Tae-Young
    • Journal of Electrical Engineering and information Science
    • /
    • v.1 no.1
    • /
    • pp.151-155
    • /
    • 1996
  • This paper derives the two-dimensional probability distribution and density functions of morphological dilation and erosion of a one-dimensional memoryless source and reports numerical results for a uniform source, thus providing methodology for joint distributions for other morphological operations. The joint density functions expressed in closed forms contain the Dirac delta functions due to the joint discontinuity within the dilation and erosion. They also exhibit symmetry between these two morphological density functions of dilated and/or eroded sources, in the computation of other higher moments thereof, and in multidimensional quantization.

  • PDF

Novel Preamble Design for Channel Estimation in FBMC/OQAM Systems

  • Wang, Han;Du, Wencai;Xu, Lingwei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3672-3688
    • /
    • 2016
  • The nonorthogonality between the real and imaginary FBMC/OQAM modulated signals complicates the channel estimation (CE) process, and conventional OFDM CE methods cannot be directly applied to FBMC/OQAM. The conventional preamble-based CE schemes in FBMC/OQAM systems are mainly based on the interference approximation method (IAM) to improve the estimation performance. In this paper, we develop a novel preamble structure to improve the CE performance. We exploit the symmetry pattern to cancel interference and take into account the interference weights in this symmetric structure. The conventional preamble and the proposed preamble are compared via simulations in the IEEE 802.22, 3GPP Vehicular A and Pedestrian A channels. Numerical simulation results demonstrate that the proposed preamble can achieve better bit error ratio (BER) and mean squared error (MSE) performance under the three channel models considered.

Directional texture information for connecting road segments in high spatial resolution satellite images

  • Lee, Jong-Yeol
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.245-245
    • /
    • 2005
  • This paper addresses the use of directional textural information for connecting road segments. In urban scene, some roads are occluded by buildings, casting shadow of buildings, trees, and cars on streets. Automatic extraction of road network from remotely sensed high resolution imagery is generally hindered by them. The results of automatic road network extraction will be incomplete. To overcome this problem, several perceptual grouping algorithms are often used based on similarity, proximity, continuation, and symmetry. Roads have directions and are connected to adjacent roads with certain angles. The directional information is used to guide road fragments connection based on roads directional inertia or characteristics of road junctions. In the primitive stage, roads are extracted with textural and direction information automatically with certain length of linearity. The primitive road fragments are connected based on the directional information to improve the road network. Experimental results show some contribution of this approach for completing road network, specifically in urban area.

  • PDF

Direct tracking of noncircular sources for multiple arrays via improved unscented particle filter method

  • Yang Qian;Xinlei Shi;Haowei Zeng;Mushtaq Ahmad
    • ETRI Journal
    • /
    • v.45 no.3
    • /
    • pp.394-403
    • /
    • 2023
  • Direct tracking problem of moving noncircular sources for multiple arrays is investigated in this study. Here, we propose an improved unscented particle filter (I-UPF) direct tracking method, which combines system proportional symmetry unscented particle filter and Markov Chain Monte Carlo (MCMC) algorithm. Noncircular sources can extend the dimension of sources matrix, and the direct tracking accuracy is improved. This method uses multiple arrays to receive sources. Firstly, set up a direct tracking model through consecutive time and Doppler information. Subsequently, based on the improved unscented particle filter algorithm, the proposed tracking model is to improve the direct tracking accuracy and reduce computational complexity. Simulation results show that the proposed improved unscented particle filter algorithm for noncircular sources has enhanced tracking accuracy than Markov Chain Monte Carlo unscented particle filter algorithm, Markov Chain Monte Carlo extended Kalman particle filter, and two-step tracking method.

Noninformative Priors in Freund's Bivariate Exponential Distribution : Symmetry Case

  • Cho, Jang-Sik;Baek, Sung-Uk;Kim, Hee-Jae
    • Journal of the Korean Data and Information Science Society
    • /
    • v.13 no.2
    • /
    • pp.235-242
    • /
    • 2002
  • In this paper, we develop noninformative priors that are used for estimating the ratio of failure rates under Freund's bivariate exponential distribution. A class of priors is found by matching the coverage probabilities of one-sided Baysian credible interval with the corresponding frequentist coverage probabilities. Also the propriety of posterior under the noninformative priors is proved and the frequentist coverage probabilities are investigated for small samples via simulation study.

  • PDF

Face Recognition Based on PCA on Wavelet Subband of Average-Half-Face

  • Satone, M.P.;Kharate, G.K.
    • Journal of Information Processing Systems
    • /
    • v.8 no.3
    • /
    • pp.483-494
    • /
    • 2012
  • Many recent events, such as terrorist attacks, exposed defects in most sophisticated security systems. Therefore, it is necessary to improve security data systems based on the body or behavioral characteristics, often called biometrics. Together with the growing interest in the development of human and computer interface and biometric identification, human face recognition has become an active research area. Face recognition appears to offer several advantages over other biometric methods. Nowadays, Principal Component Analysis (PCA) has been widely adopted for the face recognition algorithm. Yet still, PCA has limitations such as poor discriminatory power and large computational load. This paper proposes a novel algorithm for face recognition using a mid band frequency component of partial information which is used for PCA representation. Because the human face has even symmetry, half of a face is sufficient for face recognition. This partial information saves storage and computation time. In comparison with the traditional use of PCA, the proposed method gives better recognition accuracy and discriminatory power. Furthermore, the proposed method reduces the computational load and storage significantly.