• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3749-3768
• /
• 2018

As one of the most potential types of low-density parity-check (LDPC) codes, CPM-QC-LDPC code has considerable advantages but there still exist some limitations in practical application, for example, the existing decoding algorithm has a low convergence rate and a high decoding complexity. According to the structural property of this code, we propose a new method based on a CPM-RID decoding algorithm that decodes block-by-block with weights, which are obtained by neural network training. From the simulation results, we can conclude that our proposed method not only improves the bit error rate and frame error rate performance but also increases the convergence rate, when compared with the original CPM-RID decoding algorithm and scaled MSA algorithm.

• IE interfaces
• /
• v.21 no.3
• /
• pp.274-282
• /
• 2008

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition or cancellation of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times : 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose heuristic algorithms which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Four heuristic algorithms for transporter scheduling are proposed and their performance is evaluated.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.11
• /
• pp.73-79
• /
• 2009

In this paper, a method is proposed that enhances the performance of the facial expression recognition using template matching of Local Binary Pattern(LBP) histogram. In this method, the face image is segmented into blocks, and the LBP histogram is constructed to be used as the feature of the block. Block dissimilarity is calculated between a block of input image and the corresponding block of the model image. Image dissimilarity is defined as the weighted sum of the block dissimilarities. In conventional methods, the block weights are assigned by intuition. In this paper a new method is proposed that optimizes the weights from training samples. An experiment shows the recognition rate is enhanced by the proposed method.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.1
• /
• pp.13-20
• /
• 2013

A combined DWT and DCT based watermarking technique of low frequency watermarking with weighted correction is proposed. The DWT has excellent spatial localization, frequency spread and multi-resolution characteristics, which are similar to the theoretical models of the human visual system (HVS). The DCT based watermarking techniques offer compression while DWT based watermarking techniques offer scalability. These desirable properties are used in this combined watermarking technique. In the proposed method watermark bits are embedded in the low frequency band of each DCT block of selected DWT sub-band. The weighted correction is also used to improve the imperceptibility. The extracting procedure reverses the embedding operations without the reference of the original image. Compared with the similar approach by DCT based approach and DWT based approach, the experimental results show that the proposed algorithm apparently preserves superiori mage quality and robustness under various attacks such as JPEG compression, cropping, sharping, contrast adjustments and so on.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5377-5391
• /
• 2017

In this paper, we propose a new scheme to suppress the narrowband interference (NBI) in OFDM-based systems. The scheme utilizes code division multiple access (CDMA) and weighted-type fractional Fourier transform (WFRFT) domain preprocessing technologies. Through setting the WFRFT order, the scheme can switch into a single carrier (SC) or a multi-carrier (MC) frequency division multiple access block transmission system. The residual NBI can be eliminated to the maximum extent when the WFRFT order is selected properly. Final simulation results show that the proposed system can outperform MC and SC with CDMA and frequency domain preprocessing in terms of the narrowband interference suppression.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.103-110
• /
• 2011

In this paper, an adaptive motion vector smoothing scheme based on weighted vector median filtering is proposed in order to eliminate the motion outliers more effectively for improving the quality of side information in frame-based distributed video coding. We use a simple motion vector outlier reliability measure for each block in a motion compensated interpolated frame and apply weighted vector median filtering only to the blocks with unreliable motion vectors. Simulation results show that the proposed adaptive motion vector smoothing algorithm improves the quality of the side information significantly while maintaining low complexity at the encoder in frame-based distributed video coding.

• The Korean Journal of Applied Statistics
• /
• v.27 no.1
• /
• pp.61-70
• /
• 2014

A randomized block design is a method to apply a treatment into the experimental unit of each block after dividing into several blocks with a binded homogeneous experimental unit. Jonckheere (1964) and Terpstra (1952), Page (1963), Hollander (1967) proposed various methods of ordered alternative in randomized block design. Especially, Page (1963) test is a weighted combination of within block rank sums for ordered alternatives. In this paper, we suggest a new nonparametric method expanding the Page test for an ordered alternative. A Monte Carlo simulation study is also adapted to compare the power of the proposed methods with previous methods.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.8
• /
• pp.35-46
• /
• 2000

In this paper, we propose a subband acoustic echo canceller using the weighted Overlap-add adaptive filter bank to prevent the decrease of convergence speed in full-band US processing, and make it possible to realize the adaptive filter in block-parallel processing, this paper introduces the weighted overlap-add technique for subband echo canceller. Moreover, we propose a new double-talk detector which employs dedicated filter in addition to the energy comparison method simultaneously. The computer simulation results show that the performance of the proposed subband adaptive echo canceller double-talk detection

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.1
• /
• pp.43-53
• /
• 2001

WT(Wavelet Transform) is used to avoid blocking effect that is the disadvantage of JPEG using DCT(Discrete Cosine Transform). Because the proposed coding scheme is the same as JPEG, the proposed algorithm is compatible with that of JPEG. To achieve the goal, WT'ed image is reconstructed into 8$\times$8 coding block. Each coding block is quantized with the proposed weighting matrix that is derived from human visual characteristic and error analysis in WT'ed domain. By experiments, the proposed algorithm is superior to JPEG, in terms of PSNR(Peak Signal to Noise Ratio) and WMSE(Weighted Mean Square Error).

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.217-220
• /
• 1996

This paper describes a new hierarchial block matching algorithm especially appropriate for a large search area. The proposed algorithm consists of higher level search for an initial motion vector estimate by using a new matching criterion over the evenly subsampled search points, and lower level search for the final motion vector refinement. In the higher level matching criterion, mean absolute differences at the search points (or motion vector candidates) similar to motion vectors of causally neighboring blocks, are weighted properly so that these points can have a higher chance to being selected. The proposed algorithm outperforms existing hierarchical block matching algorithms, and its computational regularity makes hardware implementation simple.