• Title/Summary/Keyword: block-adaptive

Search Result 593, Processing Time 0.025 seconds

Distributed Video Compressive Sensing Reconstruction by Adaptive PCA Sparse Basis and Nonlocal Similarity

  • Wu, Minghu;Zhu, Xiuchang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.8
    • /
    • pp.2851-2865
    • /
    • 2014
  • To improve the rate-distortion performance of distributed video compressive sensing (DVCS), the adaptive sparse basis and nonlocal similarity of video are proposed to jointly reconstruct the video signal in this paper. Due to the lack of motion information between frames and the appearance of some noises in the reference frames, the sparse dictionary, which is constructed using the examples directly extracted from the reference frames, has already not better obtained the sparse representation of the interpolated block. This paper proposes a method to construct the sparse dictionary. Firstly, the example-based data matrix is constructed by using the motion information between frames, and then the principle components analysis (PCA) is used to compute some significant principle components of data matrix. Finally, the sparse dictionary is constructed by these significant principle components. The merit of the proposed sparse dictionary is that it can not only adaptively change in terms of the spatial-temporal characteristics, but also has ability to suppress noises. Besides, considering that the sparse priors cannot preserve the edges and textures of video frames well, the nonlocal similarity regularization term has also been introduced into reconstruction model. Experimental results show that the proposed algorithm can improve the objective and subjective quality of video frame, and achieve the better rate-distortion performance of DVCS system at the cost of a certain computational complexity.

Adaptive Gripper Mimicking Large Deforming Proleg of Hydraulic Skeleton Caterpillar (유체골격 애벌레의 다리조직 대변형을 모사한 적응형 그리퍼)

  • Jung, Gwang-Pil;Koh, Je-Sung;Cho, Kyu-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.29 no.1
    • /
    • pp.25-32
    • /
    • 2012
  • In this study, we present a gripping mechanism that is inspired by caterpillar's proleg. A caterpillar's proleg has planta that gives compliance to the proleg by greatly deforming its shape. In the bio-inspired gripper, the planta is implemented by flexure joints. The flexures buckle when end force and end moment is applied on the joint in opposite direction. Using this characteristic, the gripping structure is designed so that the flexure buckling can occur. Flexure buckling increases the region where gripping force is constant and this region leads to increasing in gripping range. At the same time, flexure buckling decouples all spines and therefore all spines can move differentially and independently. With this simple but effective mechanism, the bioinspire gripper can achieve adaptive gripping on rough and rugged surfaces. A prototype is built to demonstrate adaptive gripping on rough and rugged surfaces such as cement block, brick.

Adaptive Motion Estimation Algorithm UsingTemporal Continuity of Motion (움직임의 시간적 연속성을 이용한 적응적 움직임 추정 알고리즘)

  • Choi, Jung-Hyun;Lee, Kyeong-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.8
    • /
    • pp.1025-1034
    • /
    • 2004
  • This paper proposes an adaptive motion estimation algorithm using the temporal continuity of motion. We set up a squared global search region (GSR), which basically corresponds to the search region of FSA, and non-squared adaptive local search regions (LSRs), the positions for which are predicted by the motion vectors of the temporal neighbor blocks, are constructed in the GSR. The previous frame blocks that possibly have effects on the current block are to be the temporal neighbor blocks. Because motion estimation is only performed in the areas made by LSRs, we can estimate motion more correctly and reduce processing time. Experimental results show that the proposed method can enhance visual qualities with significant reductions of complexity by reducing search regions, when compared to the conventional methods.

  • PDF

Adaptive Writeback-aware Cache Management Policy for Lifetime Extension of Non-volatile Memory

  • Hwang, Sang-Ho;Choi, Ju Hee;Kwak, Jong Wook
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.17 no.4
    • /
    • pp.514-523
    • /
    • 2017
  • In this paper, we propose Adaptive Writeback-aware Cache management (AWC) to prolong the lifetime of non-volatile main memory systems by reducing the number of writebacks. The last-level cache in AWC is partitioned into Least Recently Used (LRU) segment and LRU using Dirty block Precedence (DP-LRU) segment. The DP-LRU segment evicts clean blocks first for giving reuse opportunity to dirty blocks. AWC can also determine the efficient size of DP-LRU segment for reducing the number of writebacks according to memory access patterns of programs. In the performance evaluation, we showed that AWC reduced the number of writebacks up to 29% and 46%, and saved the energy of a main memory system up to 23% and 49% in a single-core and multi-core, respectively. AWC also reduced the runtime by 1.5% and 3.2% on average compared to previous cache managements for non-volatile main memory systems, in a single-core and a multi-core, respectively.

Performance Analysis of Space-Time Coded Spatial Multiplexing Systems with Rate Allocation and Power Control (전송률 할당 및 전력 제어를 갖는 시공간 블록 부호화한 공간 다중화 시스템의 성능 분석)

  • Na, Seung-Gun;Hwang, Hyeon-Chyeol;Kim, Seok-Ho;Choi, Sun-Ho;Kwak, Kyung-Sup
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7A
    • /
    • pp.568-577
    • /
    • 2005
  • In this paper, we propose the transmission scheme for the space-time block coded spatial multiplexing systems that have adaptive rate and power allocation per each transmit antenna through the use of feedback information related to channel state. Simulation results show that the adaptive power and rate transmission scheme gain more than 4.5 dB over conventional equal-power and rate transmission scheme.

A Study on the Statistical Model Validation using Response-adaptive Experimental Design (반응적응 시험설계법을 이용하는 통계적 해석모델 검증 기법 연구)

  • Jung, Byung Chang;Huh, Young-Chul;Moon, Seok-Jun;Kim, Young Joong
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2014.10a
    • /
    • pp.347-349
    • /
    • 2014
  • Model verification and validation (V&V) is a current research topic to build computational models with high predictive capability by addressing the general concepts, processes and statistical techniques. The hypothesis test for validity check is one of the model validation techniques and gives a guideline to evaluate the validity of a computational model when limited experimental data only exist due to restricted test resources (e.g., time and budget). The hypothesis test for validity check mainly employ Type I error, the risk of rejecting the valid computational model, for the validity evaluation since quantification of Type II error is not feasible for model validation. However, Type II error, the risk of accepting invalid computational model, should be importantly considered for an engineered products having high risk on predicted results. This paper proposes a technique named as the response-adaptive experimental design to reduce Type II error by adaptively designing experimental conditions for the validation experiment. A tire tread block problem and a numerical example are employed to show the effectiveness of the response-adaptive experimental design for the validity evaluation.

  • PDF

KOHONEN NETWORK FOR ADAPTIVE IMAGE COMPRESSION (영상압축을 위한 코넨네트워크)

  • 손형경;이영식;배철수
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.10a
    • /
    • pp.571-574
    • /
    • 2001
  • In our paper, We propose an efficient adaptive coding method using kohonen neural network. An efficient adaptive encoding method using Kohonen net work is discribed through the analysis of those compression methods with the application of the neural network. In order to increase the compression ratio, a image is first divided into 8*8 subimages, then all subimages are transformed by DCT. These DCT sub-blocks are divided into N(4) classes by Kohonen network. Hits are distributed according to the variance of the DCT sub-block. Thus we get N(4)bit allocation matrices. Excellent performance is shown by the computer simulation. so we found that our proposed method is better then classifing subimages by AC energy.

  • PDF

Two-stage ML-based Group Detection for Direct-sequence CDMA Systems

  • Buzzi, Stefano;Lops, Marco
    • Journal of Communications and Networks
    • /
    • v.5 no.1
    • /
    • pp.33-42
    • /
    • 2003
  • In this paper a two-stage maximum-likelihood (ML) detection structure for group detection in DS/CDMA systems is presented. The first stage of the receiver is a linear filter, aimed at suppressing the effect of the unwanted (i.e., out-of-grout) users' signals, while the second stage is a non-linear block, implementing a ML detection rule on the set of desired users signals. As to the linear stage, we consider both the decorrelating and the minimum mean square error approaches. Interestingly, the proposed detection structure turns out to be a generalization of Varanasi's group detector, to which it reduces when the system is synchronous, the signatures are linerly independent and the first stage of the receiver is a decorrelator. The issue of blind adaptive receiver implementation is also considered, and implementations of the proposed receiver based on the LMS algorithm, the RLS algorithm and subspace-tracking algorithms are presented. These adaptive receivers do not rely on any knowledge on the out-of group users' signals, and are thus particularly suited for rejection of out-of-cell interference in the base station. Simulation results confirm that the proposed structure achieves very satisfactory performance in comparison with previously derived receivers, as well as that the proposed blind adaptive algorithms achieve satisfactory performance.

Image quality enhancement using signal subspace method (신호 부공간 기법을 이용한 영상화질 향상)

  • Lee, Ki-Seung;Doh, Won;Youn, Dae-Hee
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.11
    • /
    • pp.72-82
    • /
    • 1996
  • In this paper, newly developed algorithm for enhancing images corrupted by white gaussian noise is proposed. In the method proposed here, image is subdivided into a number of subblocks, and each block is separated into cimponents corresponding to signal and noise subspaces, respectively through the signal subspace method. A clean signal is then estimated form the signal subspace by the adaptive wiener filtering. The decomposition of noisy signal into noise and signal subspaces in is implemented by eigendecomposition of covariance matrix for noisy image, and by performing blockwise KLT (karhunen loeve transformation) using eigenvector. To reduce the perceptual noise level and distortion, wiener filtering is implementd by adaptively adjusting noise level according to activity characteristics of given block. Simulation results show the effectiveness of proposed method. In particular, edge bluring effects are reduced compared to the previous methods.

  • PDF

SPEECH ENHANCEMENT BY FREQUENCY-WEIGHTED BLOCK LMS ALGORITHM

  • Cho, D.H.
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1985.10a
    • /
    • pp.87-94
    • /
    • 1985
  • In this paper, enhancement of speech corrupted by additive white or colored noise is stuided. The nuconstrained frequency-domain block least-mean-square (UFBLMS) adaptation algorithm and its frequency-weighted version are newly applied to speech enhancement. For enhancement of speech degraded by white noise, the performance of the UFBLMS algorithm is superior to the spectral subtraction method or Wiener filtering technique by more than 3 dB in segmented frequency-weighted signal-to-noise ratio(FWSNERSEG) when SNR of speech is in the range of 0 to 10 dB. As for enhancement of noisy speech corrupted by colored noise, the UFBLMS algorithm is superior to that of the spectral subtraction method by about 3 to 5 dB in FWSNRSEG. Also, it yields better performance by about 2 dB in FWSNR and FWSNRSEG than that of time-domain least-mean-square (TLMS) adaptive prediction filter(APF). In view of the computational complexity and performance improvement in speech quality and intelligibility, the frequency-weighted UFBLMS algorithm appears to yield the best performance among various algorithms in enhancing noisy speech corrupted by white or colored noise.

  • PDF