• 제목/요약/키워드: Sparse Systems

검색결과 271건 처리시간 0.022초

A NOTE ON MULTILINEAR PSEUDO-DIFFERENTIAL OPERATORS AND ITERATED COMMUTATORS

  • Wen, Yongming;Wu, Huoxiong;Xue, Qingying
    • 대한수학회보
    • /
    • 제57권4호
    • /
    • pp.851-864
    • /
    • 2020
  • This paper gives a sparse domination for the iterated commutators of multilinear pseudo-differential operators with the symbol σ belonging to the Hörmander class, and establishes the quantitative bounds of the Bloom type estimates for such commutators. Moreover, the Cp estimates for the corresponding multilinear pseudo-differential operators are also obtained.

희소 투영행렬 획득을 위한 RSR 개선 방법론 (An Improved RSR Method to Obtain the Sparse Projection Matrix)

  • 안정호
    • 디지털콘텐츠학회 논문지
    • /
    • 제16권4호
    • /
    • pp.605-613
    • /
    • 2015
  • 본 논문은 패턴인식에서 자주 사용되는 투영행렬을 희소화하는 문제를 다룬다. 최근 임베디드 시스템이 널리 사용됨에 따라 탑재되는 프로그램의 용량이 제한받는 경우가 빈번히 발생한다. 개발된 프로그램은 상수 데이터를 포함하는 경우가 많다. 예를 들어, 얼굴인식과 같은 패턴인식 프로그램의 경우 고차원 벡터를 저차원 벡터로 차원을 축소하는 투영행렬을 사용하는 경우가 많다. 인식성능 향상을 위해 영상으로부터 매우 높은 차원의 고차원 특징벡터를 추출하는 경우 투영행렬의 사이즈는 매우 크다. 최근 라소 회귀분석 방법을 이용한 RSR(rotated sparse regression) 방법론[1]이 제안되었다. 이 방법론은 여러 실험을 통해 희소행렬을 구하는 가장 우수한 알고리즘 중 하나로 평가받고 있다. 우리는 본 논문에서 RSR을 개선할 수 있는 세 가지 방법론을 제안한다. 즉, 학습데이터에서 이상치를 제거하여 일반화 성능을 높이는 방법, 학습데이터를 랜덤 샘플링하여 희소율을 높이는 방법, RSR의 목적함수에 엘라스틱 넷 회귀분석의 패널티 항을 사용한 E-RSR(elastic net-RSR) 방법을 제안한다. 우리는 실험을 통해 제안한 방법론이 인식률을 희생하지 않으며 희소율을 크게 증가시킴으로써 기존 RSR 방법론을 개선할 수 있음을 보였다.

Active Learning on Sparse Graph for Image Annotation

  • Li, Minxian;Tang, Jinhui;Zhao, Chunxia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권10호
    • /
    • pp.2650-2662
    • /
    • 2012
  • Due to the semantic gap issue, the performance of automatic image annotation is still far from satisfactory. Active learning approaches provide a possible solution to cope with this problem by selecting most effective samples to ask users to label for training. One of the key research points in active learning is how to select the most effective samples. In this paper, we propose a novel active learning approach based on sparse graph. Comparing with the existing active learning approaches, the proposed method selects the samples based on two criteria: uncertainty and representativeness. The representativeness indicates the contribution of a sample's label propagating to the other samples, while the existing approaches did not take the representativeness into consideration. Extensive experiments show that bringing the representativeness criterion into the sample selection process can significantly improve the active learning effectiveness.

3D Deinterlacing Algorithm Based on Wide Sparse Vector Correlations

  • Kim, Yeong-Taeg
    • 방송공학회논문지
    • /
    • 제1권1호
    • /
    • pp.44-54
    • /
    • 1996
  • In this paper, we propose a new 3-D deinterlacing algorithm based on wide sparse vector correlations and a vertical edge based motion detection algorithm. which is an extension of the deinterlacing algorithm proposed in [10. llJ by the authors. The prooised algorithm is developed mainly for the format conversion problem encountered in current HDTV system, but can also be aplicable to the double scan conversion problesm frequently encountered in ths NTSC systems. By exploiting the edge oriented spatial interpolation based on the wide vector correlations, visually annoying artifiacts caused by interlacing such as a serrate line. line crawling, a line flicker, and a large area flicker can be remarkably reduced since the use of the wide vectors increases the range of the edge orientations that can be detected, and by exploiting sparse vectors correlations the HjW complexity for realizing the algorithm in applications cam be significantly simplified. Simulations are provided indicating thet the proposed algorithm results in a high performance comparable to the performance of the deinterlacing algorithm. based on the wide vector correlations.

  • PDF

Performance Improvement of Iterative Demodulation and Decoding for Spatially Coupling Data Transmission by Joint Sparse Graph

  • Liu, Zhengxuan;Kang, Guixia;Si, Zhongwei;Zhang, Ningbo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권12호
    • /
    • pp.5401-5421
    • /
    • 2016
  • Both low-density parity-check (LDPC) codes and the multiple access technique of spatially coupling data transmission (SCDT) can be expressed in bipartite graphs. To improve the performance of iterative demodulation and decoding for SCDT, a novel joint sparse graph (JSG) with SCDT and LDPC codes is constructed. Based on the JSG, an approach for iterative joint demodulation and decoding by belief propagation (BP) is presented as an exploration of the flooding schedule, and based on BP, density evolution equations are derived to analyze the performance of the iterative receiver. To accelerate the convergence speed and reduce the complexity of joint demodulation and decoding, a novel serial schedule is proposed. Numerical results show that the joint demodulation and decoding for SCDT based on JSG can significantly improve the system's performance, while roughly half of the iterations can be saved by using the proposed serial schedule.

Domain Adaptation Image Classification Based on Multi-sparse Representation

  • Zhang, Xu;Wang, Xiaofeng;Du, Yue;Qin, Xiaoyan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권5호
    • /
    • pp.2590-2606
    • /
    • 2017
  • Generally, research of classical image classification algorithms assume that training data and testing data are derived from the same domain with the same distribution. Unfortunately, in practical applications, this assumption is rarely met. Aiming at the problem, a domain adaption image classification approach based on multi-sparse representation is proposed in this paper. The existences of intermediate domains are hypothesized between the source and target domains. And each intermediate subspace is modeled through online dictionary learning with target data updating. On the one hand, the reconstruction error of the target data is guaranteed, on the other, the transition from the source domain to the target domain is as smooth as possible. An augmented feature representation produced by invariant sparse codes across the source, intermediate and target domain dictionaries is employed for across domain recognition. Experimental results verify the effectiveness of the proposed algorithm.

A novel hybrid method for robust infrared target detection

  • Wang, Xin;Xu, Lingling;Zhang, Yuzhen;Ning, Chen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권10호
    • /
    • pp.5006-5022
    • /
    • 2017
  • Effect and robust detection of targets in infrared images has crucial meaning for many applications, such as infrared guidance, early warning, and video surveillance. However, it is not an easy task due to the special characteristics of the infrared images, in which the background clutters are severe and the targets are weak. The recent literature demonstrates that sparse representation can help handle the detection problem, however, the detection performance should be improved. To this end, in this text, a hybrid method based on local sparse representation and contrast is proposed, which can effectively and robustly detect the infrared targets. First, a residual image is calculated based on local sparse representation for the original image, in which the target can be effectively highlighted. Then, a local contrast based method is adopted to compute the target prediction image, in which the background clutters can be highly suppressed. Subsequently, the residual image and the target prediction image are combined together adaptively so as to accurately and robustly locate the targets. Based on a set of comprehensive experiments, our algorithm has demonstrated better performance than other existing alternatives.

Building structural health monitoring using dense and sparse topology wireless sensor network

  • Haque, Mohammad E.;Zain, Mohammad F.M.;Hannan, Mohammad A.;Rahman, Mohammad H.
    • Smart Structures and Systems
    • /
    • 제16권4호
    • /
    • pp.607-621
    • /
    • 2015
  • Wireless sensor technology has been opened up numerous opportunities to advanced health and maintenance monitoring of civil infrastructure. Compare to the traditional tactics, it offers a better way of providing relevant information regarding the condition of building structure health at a lower price. Numerous domestic buildings, especially longer-span buildings have a low frequency response and challenging to measure using deployed numbers of sensors. The way the sensor nodes are connected plays an important role in providing the signals with required strengths. Out of many topologies, the dense and sparse topologies wireless sensor network were extensively used in sensor network applications for collecting health information. However, it is still unclear which topology is better for obtaining health information in terms of greatest components, node's size and degree. Theoretical and computational issues arising in the selection of the optimum topology sensor network for estimating coverage area with sensor placement in building structural monitoring are addressed. This work is an attempt to fill this gap in high-rise building structural health monitoring application. The result shows that, the sparse topology sensor network provides better performance compared with the dense topology network and would be a good choice for monitoring high-rise building structural health damage.

Post-Processing for JPEG-Coded Image Deblocking via Sparse Representation and Adaptive Residual Threshold

  • Wang, Liping;Zhou, Xiao;Wang, Chengyou;Jiang, Baochen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권3호
    • /
    • pp.1700-1721
    • /
    • 2017
  • The problem of blocking artifacts is very common in block-based image and video compression, especially at very low bit rates. In this paper, we propose a post-processing method for JPEG-coded image deblocking via sparse representation and adaptive residual threshold. This method includes three steps. First, we obtain the dictionary by online dictionary learning and the compressed images. The dictionary is then modified by the histogram of oriented gradient (HOG) feature descriptor and K-means cluster. Second, an adaptive residual threshold for orthogonal matching pursuit (OMP) is proposed and used for sparse coding by combining blind image blocking assessment. At last, to take advantage of human visual system (HVS), the edge regions of the obtained deblocked image can be further modified by the edge regions of the compressed image. The experimental results show that our proposed method can keep the image more texture and edge information while reducing the image blocking artifacts.