• 대한전자공학회논문지SP
• /
• 제39권3호
• /
• pp.58-65
• /
• 2002

본 논문에서는 프레임간 압축된 영상의 블록화 현상을 감소시키기 위해 재구성하기 전 차분 영상을 처리하는 새로운 복원 알고리듬을 제안한다. 프레임내 압축 영상의 블록화 현상은 오직 8×8 DCT에 의해서 일어나는 반면에, 프레임간 압축된 영상에서는 8×8 DCT뿐만 아니라 움직임 보상을 위해 사용한 16×16의 매크로 블록에 의해서 발생된다. 이러한 이유로 본 논문에서는 차분 영상에 대한 새로운 열화모델을 제시하고, 블록 경계와 내부의 불연속에 대한 POCS를 이용한 복원 알고리듬을 제시한다. 제안된 알고리듬은 DCT계수의 일부를 이용해 블록 경계의 방향을 고려하는 공간 적응적 저대역 통과 필터를 포함하는 표준 정규화의 변환된 형태이다. 일반적인 비디오 압축 표준은 블록을 기준으로 하는 움직임 보상과 블록 이산여현 변환(BDCT)을 이용한 혼성(hybrid) 구조를 채택하고 있다. 이러한 이유에서 블록화 현상은 블록 경계와 블록 내부에서 일어난다. 두 종류의 블록화 현상을 좀 더 완벽히 제거하기 위해서 복원된 차분 영상은 블록 경계와 블록 내부에서의 방향성 불연속과 같은 제약조건을 만족시켜야만 한다. 그러한 제약조건은 차분 영상을 복구하기 위한 convex set을 정의하는데 이용한다.

• Nuclear Engineering and Technology
• /
• 제53권10호
• /
• pp.3327-3334
• /
• 2021

Present electric grids are advanced to integrate smart grids, distributed resources, high-speed sensing and control, and other advanced metering technologies. Cybersecurity is one of the challenges of the smart grid and nuclear plant digital system. It affects the advanced metering infrastructure (AMI), for grid data communication and controls the information in real-time. The research article is emphasized solving the nuclear and smart grid hardware security issues with the integration of field programmable gate array (FPGA), and implementing the latest Time Authenticated Cryptographic Identity Transmission (TACIT) cryptographic algorithm in the chip. The cryptographic-based encryption and decryption approach can be used for a smart grid distribution system embedding with FPGA hardware. The chip design is carried in Xilinx ISE 14.7 and synthesized on Virtex-5 FPGA hardware. The state of the art of work is that the algorithm is implemented on FPGA hardware that provides the scalable design with different key sizes, and its integration enhances the grid hardware security and switching. It has been reported by similar state-of-the-art approaches, that the algorithm was limited in software, not implemented in a hardware chip. The main finding of the research work is that the design predicts the utilization of hardware parameters such as slices, LUTs, flip-flops, memory, input/output blocks, and timing information for Virtex-5 FPGA synthesis before the chip fabrication. The information is extracted for 8-bit to 128-bit key and grid data with initial parameters. TACIT security chip supports 400 MHz frequency for 128-bit key. The research work is an effort to provide the solution for the industries working towards embedded hardware security for the smart grid, power plants, and nuclear applications.

• 한국경영과학회지
• /
• 제6권1호
• /
• pp.65-70
• /
• 1981

L.G. Khachiyan's algorithm for solving a system of strict (or open) linear inequalities with integral coefficients is described. This algorithm is based on the construction of a sequence of ellipsoids in R$^n$ of decreasing n-dimensional volume and contain-ing feasible region. The running time of the algorithm is polynomial in the number of bits of computer core memory required to store the coefficients. It can be applied to solve linear programming problems in polynomially bounded time by the duality theorem of the linear programming problem. But it is difficult to use in solving practical problems. Because it requires the computation of a square roots, besides other arithmatic operations, it is impossible to do these computations exactly with absolute precision.

• 전자공학회논문지S
• /
• 제35S권1호
• /
• pp.68-79
• /
• 1998

In this paper, we propose a model-based FDI(fault detetion and isolation) algorithm to detect and isolate fault in a linear system. The proposed algorithm is gased on an HFC(hydrid fault classifier) which consists of an FCART2(fault classifier by ART2 neural network) and an FCFM(fault classifier by fault models) which operate in parallel to isolate faults. The proposed algorithm is functionally composed of three main parts-parameter estimation, fault detection, and isolation. When a change in the system occurs, the estimated parameters go through a transition zone in which errors between the system output and the stimated output and the estimated output cross a predetermined thrseshold, and in this zone the estimated parameters are tranferred to the FCART2 for fault isolation. On the other hand, once a fault in the system is detected, the FCFM statistically isolates the fault by using the error between ach fault model out put and the system output. From the computer simulation resutls, it is verified that the proposed model-based FDI algorithm can be performed successfully to detect and isolate faults in a position control system of a DC motor.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2015년도 추계학술대회
• /
• pp.4-7
• /
• 2015

In this paper, we propose a matrix completion algorithm for Internet of Things (IoT) localization. The proposed algorithm recovers the Gram matrix of sensors by performing optimization over the Riemannian manifold of fixed-rank positive semidefinite matrices. We compute and show the closed forms of all the differentially geometric components required for applying nonlinear conjugate gradients combined with Armijo line search method. The numerical experiments show that the performance of the proposed algorithm in solving IoT localization is outstanding compared with the state-of-the-art matrix completion algorithms both in noise and noiseless scenarios.

• Membrane and Water Treatment
• /
• 제9권2호
• /
• pp.129-136
• /
• 2018

In this contribution, the control of multivariable reverse osmosis (RO) desalination plant using proportional-integral-derivative (PID) controllers is presented. First, feed-forward compensators are designed using simplified decoupling method and then the PID controllers are tuned for flux (flow-rate) and conductivity (salinity). The tuning of PID controllers is accomplished by minimization of the integral of squared error (ISE). The ISEs are minimized using a recently proposed algorithm named as teacher-learner-based-optimization (TLBO). TLBO algorithm is used due to being simple and being free from algorithm-specific parameters. A comparative analysis is carried out to prove the supremacy of TLBO algorithm over other state-of-art algorithms like particle swarm optimization (PSO), artificial bee colony (ABC) and differential evolution (DE). The simulation results and comparisons show that the purposed method performs better in terms of performance and can successfully be applied for tuning of PID controllers for RO desalination plants.

• ETRI Journal
• /
• 제45권6호
• /
• pp.1035-1045
• /
• 2023

We propose a novel graphics processing unit (GPU) algorithm that can handle a large-scale 3D fast Fourier transform (i.e., 3D-FFT) problem whose data size is larger than the GPU's memory. A 1D FFT-based 3D-FFT computational approach is used to solve the limited device memory issue. Moreover, to reduce the communication overhead between the CPU and GPU, we propose a 3D data-transposition method that converts the target 1D vector into a contiguous memory layout and improves data transfer efficiency. The transposed data are communicated between the host and device memories efficiently through the pinned buffer and multiple streams. We apply our method to various large-scale benchmarks and compare its performance with the state-of-the-art multicore CPU FFT library (i.e., fastest Fourier transform in the West [FFTW]) and a prior GPU-based 3D-FFT algorithm. Our method achieves a higher performance (up to 2.89 times) than FFTW; it yields more performance gaps as the data size increases. The performance of the prior GPU algorithm decreases considerably in massive-scale problems, whereas our method's performance is stable.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권10호
• /
• pp.4976-4994
• /
• 2018

The diffusion-based salient object detection methods have shown excellent detection results and more efficient computation in recent years. However, the current diffusion-based salient object detection methods still have disadvantage of detecting the object appearing at the image boundaries and different scales. To address the above mentioned issues, this paper proposes a multi-scale diffusion-based salient object detection algorithm with background and objectness seeds. In specific, the image is firstly over-segmented at several scales. Secondly, the background and objectness saliency of each superpixel is then calculated and fused in each scale. Thirdly, manifold ranking method is chosen to propagate the Bayessian fusion of background and objectness saliency to the whole image. Finally, the pixel-level saliency map is constructed by weighted summation of saliency values under different scales. We evaluate our salient object detection algorithm with other 24 state-of-the-art methods on four public benchmark datasets, i.e., ASD, SED1, SED2 and SOD. The results show that the proposed method performs favorably against 24 state-of-the-art salient object detection approaches in term of popular measures of PR curve and F-measure. And the visual comparison results also show that our method highlights the salient objects more effectively.

• Nuclear Engineering and Technology
• /
• 제53권9호
• /
• pp.2968-2976
• /
• 2021

This paper introduces a method to reconstruct the three-dimensional (3D) microstructure of two-phase materials, e.g., porous materials such as highly irradiated nuclear fuel, from two-dimensional (2D) sections via a multi-objective optimization genetic algorithm. The optimization is based on the comparison between the reference and reconstructed 2D sections on specific target properties, i.e., 2D pore number, and mean value and standard deviation of the pore-size distribution. This represents a multi-objective fitness function subject to weaker hypotheses compared to state-of-the-art methods based on n-points correlations, allowing for a broader range of application. The effectiveness of the proposed method is demonstrated on synthetic data and compared with state-of-the-art methods adopting a fitness based on 2D correlations. The method here developed can be used as a cost-effective tool to reconstruct the pore structure in highly irradiated materials using 2D experimental data.

• Journal of Computational Design and Engineering
• /
• 제3권3호
• /
• pp.226-249
• /
• 2016

The symbiotic organisms search (SOS) algorithm is an effective metaheuristic developed in 2014, which mimics the symbiotic relationship among the living beings, such as mutualism, commensalism, and parasitism, to survive in the ecosystem. In this study, three modified versions of the SOS algorithm are proposed by introducing adaptive benefit factors in the basic SOS algorithm to improve its efficiency. The basic SOS algorithm only considers benefit factors, whereas the proposed variants of the SOS algorithm, consider effective combinations of adaptive benefit factors and benefit factors to study their competence to lay down a good balance between exploration and exploitation of the search space. The proposed algorithms are tested to suit its applications to the engineering structures subjected to dynamic excitation, which may lead to undesirable vibrations. Structure optimization problems become more challenging if the shape and size variables are taken into account along with the frequency. To check the feasibility and effectiveness of the proposed algorithms, six different planar and space trusses are subjected to experimental analysis. The results obtained using the proposed methods are compared with those obtained using other optimization methods well established in the literature. The results reveal that the adaptive SOS algorithm is more reliable and efficient than the basic SOS algorithm and other state-of-the-art algorithms.