• Title/Summary/Keyword: matrix representation

Search Result 268, Processing Time 0.045 seconds

Face Recognition Robust to Local Distortion using Modified ICA Basis Images (개선된 ICA 기저영상을 이용한 국부적 왜곡에 강인한 얼굴인식)

  • Kim Jong-Sun;Yi June-Ho
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.5
    • /
    • pp.481-488
    • /
    • 2006
  • The performance of face recognition methods using subspace projection is directly related to the characteristics of their basis images, especially in the cases of local distortion or partial occlusion. In order for a subspace projection method to be robust to local distortion and partial occlusion, the basis images generated by the method should exhibit a part-based local representation. We propose an effective part-based local representation method named locally salient ICA (LS-ICA) method for face recognition that is robust to local distortion and partial occlusion. The LS-ICA method only employs locally salient information from important facial parts in order to maximize the benefit of applying the idea of 'recognition by parts.' It creates part-based local basis images by imposing additional localization constraint in the process of computing ICA architecture I basis images. We have contrasted the LS-ICA method with other part-based representations such as LNMF (Localized Non-negative Matrix Factorization) and LFA (Local Feature Analysis). Experimental results show that the LS-ICA method performs better than PCA, ICA architecture I, ICA architectureII, LFA, and LNMF methods, especially in the cases of partial occlusions and local distortions.

Direction Relation Representation and Reasoning for Indoor Service Robots (실내 서비스 로봇을 위한 방향 관계 표현과 추론)

  • Lee, Seokjun;Kim, Jonghoon;Kim, Incheol
    • Journal of KIISE
    • /
    • v.45 no.3
    • /
    • pp.211-223
    • /
    • 2018
  • In this paper, we propose a robot-centered direction relation representation and the relevant reasoning methods for indoor service robots. Many conventional works on qualitative spatial reasoning, when deciding the relative direction relation of the target object, are based on the use of position information only. These reasoning methods may infer an incorrect direction relation of the target object relative to the robot, since they do not take into consideration the heading direction of the robot itself as the base object. In this paper, we present a robot-centered direction relation representation and the reasoning methods. When deciding the relative directional relationship of target objects based on the robot in an indoor environment, the proposed methods make use of the orientation information as well as the position information of the robot. The robot-centered reasoning methods are implemented by extending the existing cone-based, matrix-based, and hybrid methods which utilized only the position information of two objects. In various experiments with both the physical Turtlebot and the simulated one, the proposed representation and reasoning methods displayed their high performance and applicability.

Joint Estimation of TOA and DOA in IR-UWB System Using Sparse Representation Framework

  • Wang, Fangqiu;Zhang, Xiaofei
    • ETRI Journal
    • /
    • v.36 no.3
    • /
    • pp.460-468
    • /
    • 2014
  • This paper addresses the problem of joint time of arrival (TOA) and direction of arrival (DOA) estimation in impulse radio ultra-wideband systems with a two-antenna receiver and links the joint estimation of TOA and DOA to the sparse representation framework. Exploiting this link, an orthogonal matching pursuit algorithm is used for TOA estimation in the two antennas, and then the DOA parameters are estimated via the difference in the TOAs between the two antennas. The proposed algorithm can work well with a single measurement vector and can pair TOA and DOA parameters. Furthermore, it has better parameter-estimation performance than traditional propagator methods, such as, estimation of signal parameters via rotational invariance techniques algorithms matrix pencil algorithms, and other new joint-estimation schemes, with one single snapshot. The simulation results verify the usefulness of the proposed algorithm.

Modelling dowel action of discrete reinforcing bars for finite element analysis of concrete structures

  • Kwan, A.K.H.;Ng, P.L.
    • Computers and Concrete
    • /
    • v.12 no.1
    • /
    • pp.19-36
    • /
    • 2013
  • In the finite element analysis of reinforced concrete structures, discrete representation of the steel reinforcing bars is considered advantageous over smeared representation because of the more realistic modelling of their bond-slip behaviour. However, there is up to now limited research on how to simulate the dowel action of discrete reinforcing bars, which is an important component of shear transfer in cracked concrete structures. Herein, a numerical model for the dowel action of discrete reinforcing bars is developed. It features derivation of the dowel stiffness based on the beam-on-elastic-foundation theory and direct assemblage of the dowel stiffness matrix into the stiffness matrices of adjoining concrete elements. The dowel action model is incorporated in a nonlinear finite element program based on secant stiffness formulation and application to deep beams tested by others demonstrates that the incorporation of dowel action can improve the accuracy of the finite element analysis.

A Study on the Comparison Between Full-3D and Quasi-1D Supercompact Multiwavelets (Full-3D와 Quasi-1D Supercompact Multiwavelets의 비교 연구)

  • Park, June-Pyo;Lee, Do-Hyung;Kwon, Do-Hoon
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.28 no.12
    • /
    • pp.1608-1615
    • /
    • 2004
  • CFD data compression methods based on Full-3D and Quasi-1D supercompact multiwavelets are presented. Supercompact wavelets method provide advantageous benefit that it allows higher order accurate representation with compact support. Therefore it avoids unnecessary interaction with remotely located data across singularities such as shock. Full-3D wavelets entails appropriate cross-derivative scaling function & wavelets, hence it can allow highly accurate multi-spatial data representation. Quasi-1D method adopt 1D multiresolution by alternating the directions rather than solving huge transformation matrix in Full-3D method. Hence efficient and relatively handy data processing can be conducted. Several numerical tests show swift data processing as well as high data compression ratio for CFD simulation data.

Exploiting Chaotic Feature Vector for Dynamic Textures Recognition

  • Wang, Yong;Hu, Shiqiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.4137-4152
    • /
    • 2014
  • This paper investigates the description ability of chaotic feature vector to dynamic textures. First a chaotic feature and other features are calculated from each pixel intensity series. Then these features are combined to a chaotic feature vector. Therefore a video is modeled as a feature vector matrix. Next by the aid of bag of words framework, we explore the representation ability of the proposed chaotic feature vector. Finally we investigate recognition rate between different combinations of chaotic features. Experimental results show the merit of chaotic feature vector for pixel intensity series representation.

Improving Transformer with Dynamic Convolution and Shortcut for Video-Text Retrieval

  • Liu, Zhi;Cai, Jincen;Zhang, Mengmeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.7
    • /
    • pp.2407-2424
    • /
    • 2022
  • Recently, Transformer has made great progress in video retrieval tasks due to its high representation capability. For the structure of a Transformer, the cascaded self-attention modules are capable of capturing long-distance feature dependencies. However, the local feature details are likely to have deteriorated. In addition, increasing the depth of the structure is likely to produce learning bias in the learned features. In this paper, an improved Transformer structure named TransDCS (Transformer with Dynamic Convolution and Shortcut) is proposed. A Multi-head Conv-Self-Attention module is introduced to model the local dependencies and improve the efficiency of local features extraction. Meanwhile, the augmented shortcuts module based on a dual identity matrix is applied to enhance the conduction of input features, and mitigate the learning bias. The proposed model is tested on MSRVTT, LSMDC and Activity-Net benchmarks, and it surpasses all previous solutions for the video-text retrieval task. For example, on the LSMDC benchmark, a gain of about 2.3% MdR and 6.1% MnR is obtained over recently proposed multimodal-based methods.

A NOTE ON REPRESENTATION NUMBERS OF QUADRATIC FORMS MODULO PRIME POWERS

  • Ran Xiong
    • Bulletin of the Korean Mathematical Society
    • /
    • v.61 no.4
    • /
    • pp.907-915
    • /
    • 2024
  • Let f be an integral quadratic form in k variables, F the Gram matrix corresponding to a ℤ-basis of ℤk. For r ∈ F-1k, a rational number n with f(r) ≡ n mod ℤ and a positive integer c, set Nf(n, r; c) := #{x ∈ ℤk/cℤk : f(x + r) ≡ n mod c}. Siegel showed that for each prime p, there is a number w depending on r and n such that Nf(n, r; pν+1) = pk-1Nf(n, r; pν) holds for every integer ν > w and gave a rough estimation on the upper bound for such w. In this short note, we give a more explicit estimation on this bound than Siegel's.

Fault Identification Matrix in Linear Networks (선형회로에 있어서의 결함식별 매트릭스)

  • 임광호
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.9 no.1
    • /
    • pp.17-24
    • /
    • 1972
  • A method utilizing vector representation is investigated for determining a faulty elenlent in passive and active networks by simple external measurements. A large system may be considered as an interconnection of a number of subnetlvorks. By utilizing the relationships between the magintudes of a transfer function at various frequencies and the deviations of a circuit element, the fault simulation curves can be drawn. The fault identification regions are defined from the fault simulation curves. A fault identlfication matrix is constructed corresponding the defined fault identification regions. The fault identification matrix, when premultiplied by a vector whose components are measured from a network, yieldg another vector whose components identify a network element which is faulty. A test procedure for the fault identification method is presented and verified by experiments.

  • PDF

Adaptive Selective Compressive Sensing based Signal Acquisition Oriented toward Strong Signal Noise Scene

  • Wen, Fangqing;Zhang, Gong;Ben, De
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3559-3571
    • /
    • 2015
  • This paper addresses the problem of signal acquisition with a sparse representation in a given orthonormal basis using fewer noisy measurements. The authors formulate the problem statement for randomly measuring with strong signal noise. The impact of white Gaussian signals noise on the recovery performance is analyzed to provide a theoretical basis for the reasonable design of the measurement matrix. With the idea that the measurement matrix can be adapted for noise suppression in the adaptive CS system, an adapted selective compressive sensing (ASCS) scheme is proposed whose measurement matrix can be updated according to the noise information fed back by the processing center. In terms of objective recovery quality, failure rate and mean-square error (MSE), a comparison is made with some nonadaptive methods and existing CS measurement approaches. Extensive numerical experiments show that the proposed scheme has better noise suppression performance and improves the support recovery of sparse signal. The proposed scheme should have a great potential and bright prospect of broadband signals such as biological signal measurement and radar signal detection.