• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.410-421
• /
• 2019

Distributed compressed sensing (DCS) states that we can recover the sparse signals from very few linear measurements. Various studies about DCS have been carried out recently. In many practical applications, there is no prior information except for standard sparsity on signals. The typical example is the sparse signals have block-sparse structures whose non-zero coefficients occurring in clusters, while the cluster pattern is usually unavailable as the prior information. To discuss this issue, a new algorithm, called backtracking-based adaptive orthogonal matching pursuit for block distributed compressed sensing (DCSBBAOMP), is proposed. In contrast to existing block methods which consider the single-channel signal reconstruction, the DCSBBAOMP resorts to the multi-channel signals reconstruction. Moreover, this algorithm is an iterative approach, which consists of forward selection and backward removal stages in each iteration. An advantage of this method is that perfect reconstruction performance can be achieved without prior information on the block-sparsity structure. Numerical experiments are provided to illustrate the desirable performance of the proposed method.

• Advances in Computational Design
• /
• v.4 no.3
• /
• pp.197-210
• /
• 2019

Motion generation of a four-bar linkage is a type of mechanism synthesis that has a wide range of applications such as a pick-and-place operation in manufacturing. In this research, the use of meta-heuristics for motion generation of a four-bar linkage is demonstrated. Three problems of motion generation were posed as a constrained optimization probably using the weighted sum technique to handle two types of tracking errors. A simple penalty function technique was used to deal with design constraints while three meta-heuristics including differential evolution (DE), self-adaptive differential evolution (JADE) and teaching learning based optimization (TLBO) were employed to solve the problems. Comparative results and the effect of the constraint handling technique are illustrated and discussed.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.4
• /
• pp.133-142
• /
• 2014

The least mean square(LMS) algorithm has been popular owing to its simplicity, stability, and availability to implement. But it inherently has a problem of slow convergence speed, and the presence of a transfer function in the secondary path following the adaptive controller and the error path has been shown to generally degrade the stability and the performance of the LMS algorithm in applications of acoustical noise control. In general, in order to solve these problems, the filtered-x LMS (FX-LMS) type algorithms can be used and the bi-directional Filtered-x LMS(BFXLMS) algorithm is very attractive among them, which increase the convergence speed and the performance of the controller with nearly equivalent computation complexity. In this paper, a mathematical analysis for the BFXLMS algorithm is presented. In terms of view points of time domain, frequency domain, and stochastic domain, the characteristics and stabilities of algorithm is accurately analyzed.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.1
• /
• pp.121-140
• /
• 2022

In this paper, we study the strong convergence of new methods for solving classical variational inequalities problems involving semistrictly quasimonotone and Lipschitz-continuous operators in a real Hilbert space. Three proposed methods are based on Tseng's extragradient method and use a simple self-adaptive step size rule that is independent of the Lipschitz constant. The step size rule is built around two techniques: the monotone and the non-monotone step size rule. We establish strong convergence theorems for the proposed methods that do not require any additional projections or knowledge of an involved operator's Lipschitz constant. Finally, we present some numerical experiments that demonstrate the efficiency and advantages of the proposed methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.10
• /
• pp.1563-1566
• /
• 2022

Video streaming applications such as Netflix and Youtube are widely used in our daily life. A DASH based streaming client exploits adaptive bit rate (ABR) method to choose the most appropriate video source representation that the network can support. In this paper we propose a novel energy-aware ABR scheme that adds the ability to monitor energy efficiency in addition to the linear quadratic regulator algorithm we previously introduced. Our trace-driven simulation studies show that our proposed scheme mitigates and shortens re-buffering, resulting in energy savings of mobile devices while preserving the similar QoE compared to the state-of-the-art ABR algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1249-1265
• /
• 2022

Video streaming has become one of the most popular applications for mobile devices. The network bandwidth required for video streaming continues to exponentially increase as video quality increases and the user base grows. Multi-Path TCP (MPTCP), which allows devices to communicate simultaneously through multiple network interfaces, is one of the solutions for providing robust and reliable streaming of such high-definition video. However, mobile video streaming over MPTCP raises new concerns, e.g., power consumption and cellular data usage, since mobile device resources are constrained, and users prefer to minimize such costs. In this work, we propose a mobile video streaming framework over MPTCP (mDASH) to reduce the costs of energy and cellular data usage while preserving feasible streaming quality. Our evaluation results show that by utilizing knowledge about video behavior, mDASH can reduce energy consumption by up to around 20%, and cellular usage by 15% points, with minimal quality degradation.

• Journal of information and communication convergence engineering
• /
• v.20 no.3
• /
• pp.195-203
• /
• 2022

Noise generated during image acquisition and transmission can negatively impact the results of image processing applications, and noise removal is typically a part of image preprocessing. Denoising techniques combined with nonlocal techniques have received significant attention in recent years, owing to the development of sophisticated hardware and image processing algorithms, much attention has been paid to; however, this approach is relatively poor for edge preservation of fine image details. To address this limitation, the current study combined a steering kernel technique with adaptive masks that can adjust the size according to the noise intensity of an image. The algorithm sets the steering weight based on a similarity comparison, allowing it to respond to edge components more effectively. The proposed algorithm was compared with existing denoising algorithms using quantitative evaluation and enlarged images. The proposed algorithm exhibited good general denoising performance and better performance in edge area processing than existing non-local techniques.

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.1
• /
• pp.205-235
• /
• 2023

In this paper, we introduce and study an iterative technique for solving quasimonotone split variational inequality problems and fixed point problem in the framework of real Hilbert spaces. Our proposed iterative technique is self adaptive, and easy to implement. We establish that the proposed iterative technique converges strongly to a minimum-norm solution of the problem and give some numerical illustrations in comparison with other methods in the literature to support our strong convergence result.

• The Journal of Korea Robotics Society
• /
• v.18 no.3
• /
• pp.271-280
• /
• 2023

FMCW (Frequency Modulated Continuous Wave) radar system is widely used in autonomous driving and navigation applications due to its high detection capabilities independent of weather conditions and environments. However, radar signals can be easily contaminated by various noises such as speckle noise, receiver saturation, and multipath reflection, which can worsen sensing performance. To handle this problem, we propose a learning-free noise removal technique for radar to enhance detection performance. The proposed method leverages adaptive thresholding to remove speckle noise and receiver saturation, and wavelet transform to detect multipath reflection. After noise removal, the radar image is reconstructed with the geometric structure of the surrounding environments. We verify that our method effectively eliminated noise and can be applied to autonomous driving by improving the accuracy of odometry and place recognition.

• Communications for Statistical Applications and Methods
• /
• v.30 no.2
• /
• pp.179-189
• /
• 2023

Hybrid sufficient dimension reduction (SDR) methods to a weighted mean of kernel matrices of two different SDR methods by Ye and Weiss (2003) require heavy computation and time consumption due to bootstrapping. To avoid this, Park et al. (2022) recently develop the so-called cross-distance selection (CDS) algorithm. In this paper, two variations of the original CDS algorithm are proposed depending on how well and equally the covk-SAVE is treated in the selection procedure. In one variation, which is called the larger CDS algorithm, the covk-SAVE is equally and fairly utilized with the other two candiates of SIR-SAVE and covk-DR. But, for the final selection, a random selection should be necessary. On the other hand, SIR-SAVE and covk-DR are utilized with completely ruling covk-SAVE out, which is called the smaller CDS algorithm. Numerical studies confirm that the original CDS algorithm is better than or compete quite well to the two proposed variations. A real data example is presented to compare and interpret the decisions by the three CDS algorithms in practice.