Earticle

This paper will focus on improving the performance of orthogonal frequency division multiplexing (OFDM) in Rayleigh fading environments. The proposed technique will use a previously published method that has been shown to improve OFDM performance in independent fading, based on ordered sub-carrier selection. Then, a simple non-iterative method for finding the optimal bit-loading allocation was proposed. It was also based on ordered sub-carrier selection. We compared both of these algorithms to an optimal bit-loading solution to determine their effectiveness in a correlated fading environment. The correlated fading was simulated using the JTC channel models. Our intent was not to create an optimal solution, but to create a low complexity solution that can be used in a wireless environment in which the channel conditions change rapidly and that require a simple algorithm for fast bit loading.

Background: This study aims to calculate detector positions as a design of a radioactive source localizing radiation portal monitor (RPM) system using an improved genetic algorithm. Materials and Methods: To calculate of detector positions for a source localizing RPM system optimization problem is defined. To solve the problem, a modified iterative genetic algorithm (MIGA) is developed. In general, a genetic algorithm (GA) finds a globally optimal solution with a high probability, but it is not perfect at all times. To increase the probability to find globally optimal solution rather, a MIGA is designed by supplementing the iteration, competition, and verification with GA. For an optimization problem that is defined to find detector positions that maximizes differences of detector signals, a localization method is derived by modifying the inverse radiation transport model, and realistic parameter information is suggested. Results and Discussion: To compare the MIGA and GA, both algorithms are implemented in a MATLAB environment. The performance of the GA and MIGA and that of the procedures supplemented in the MIGA are analyzed by computer simulations. The results show that the iteration, competition, and verification procedures help to search for globally optimal solutions. Further, the MIGA is more robust against falling into local minima and finds a more reliably optimal result than the GA. Conclusion: The positions of the detectors on an RPM for radioactive source localization are optimized using the MIGA. To increase the contrast of the measurements from each detector, a relationship between the source and the detectors is derived by modifying the inverse transport model. Realistic parameters are utilized for accurate simulations. Furthermore, the MIGA is developed to achieve a reliable solution. By utilizing results of this study, an RPM for radioactive source localization has been designed and will be fabricated soon.

This paper deals with a approximation and tracking control of hydraulic servo system using a real time recurrent neural networks (RTRN) with 2-dimensional iterative learning rule. And it was driven that 2-dimensional iterative learning rule in discrete time. In order to control the trajectory of position, two RTRN with same network architecture were used. Simulation results show that two RTRN using 2-D learning algorithm is able to approximate the plant output and desired trajectory to a very high degree of a accuracy respectively and the control algorithm using two same RTRN was very effective to control trajectory tracking of electro-hydraulic servo system.

최근 데이터의 폭발적인 증가로 인해 대규모 데이터의 분석에 대한 요구를 충족할 수 있는 방 법들이 계속 연구되고 있다. 본 논문에서는 맵리듀스를 이용한 분산 병렬 처리를 통해 대규모 데이터 큐브의 효율적인 계산이 가능한 MRIterativeBUC 알고리즘을 제안하였다. MRIterativeBUC 알고 리즘은 기존의 BUC 알고리즘을 맵리듀스의 반복적 단계에 따른 효율적인 동작이 가능하도록 개발되 었고, 기존의 대규모 데이터 큐브 계산에 따른 문제인 데이터 크기와 저장 및 처리 능력의 한계를 해 결하였다. 또한, 분석자의 관심 부분에 대해서만 계산하는 빙산 큐브 개념의 도입과 파티셔닝, 정렬과 같은 큐브 계산을 분산 병렬 처리하는 방법 등의 장점들을 통해 데이터 방출량을 줄여서 네트워크 부 하를 줄이고, 각 노드의 처리량을 줄이며, 궁극적으로 전체 큐브 계산 비용을 줄일 수 있다. 본 연구 결과는 맵리듀스를 이용한 데이터 큐브 계산에 대해서 상향식 처리와 반복적 알고리즘을 통해 다양한 확장이 가능하며, 여러 응용 분야에서 활용이 가능할 것으로 예상된다.

Due to the recent data explosion, methods which can meet the requirement of large data analysis has been studying. This paper proposes MRIterativeBUC algorithm which enables efficient computation of large data cube by distributed parallel processing with MapReduce framework. MRIterativeBUC algorithm is developed for efficient iterative operation of the BUC method with MapReduce, and overcomes the limitations about the storage size and processing ability caused by large data cube computation. It employs the idea from the iceberg cube which computes only the interesting aspect of analysts and the distributed parallel process of cube computation by partitioning and sorting. Thus, it reduces data emission so that it can reduce network overload, processing amount on each node, and eventually the cube computation cost. The bottom-up cube computation and iterative algorithm using MapReduce, proposed in this paper, can be expanded in various way, and will make full use of many applications.

깊이 카메라를 이용해서 인간의 정밀한 전신 포인트 클라우드를 획득하기 위해서는 다양한 위치와 각도에서 촬영한 포인트 클라우드 간의 정합 및 깊이 보정이 필요하다. 기존에는 주로 Iterative Closet Point (ICP) 알고리즘을 이용해서 포인트 클라우드 간의 정합을 위한 3차원 변환을 추정한 후, 후처리로 독립적인 깊이 보정을 수행해 왔다. 본 논문에서는 ICP 알고리즘에서 사용되는 비용함수의 인수로 3차원 변환 뿐만 아니라 포인트 클라우드의 깊이 값이 사용될 수 있다는 점에 착안한 새로운 깊이 보정 알고리즘을 소개하고, 기존 후처리 방법과의 성능 비교를 통해 그 효용성을 검증한다.

무선 통신 시스템에서 재밍 공격은 통신 성능을 심각하게 저하시킬 수 있는 치명적 위협이다. 특히 반응 재밍은 송신기와 수신기가 통신할 때만 재밍할 수 있기 때문에 반응 재밍을 통해 공격 효율을 극대화할 수 있다. 본 논문에서 반응 재밍의 공격 효과를 저감시 키기 위해 multi-input multi-output (MIMO) 기반의 orthogonal frequency-division multiplexing (OFDM) 통신 기술의 특징을 활용 하고, 이에 기반한 반복적 채널 추정 알고리즘을 제안하였다. 실험 결과를 통해 본 논문에서 제안한 알고리즘과 기존 항재밍 알고리 즘을 비교하였으며, 반응 재밍 공격이 있는 MIMO-OFDM 통신 시스템에서 제안한 알고리즘의 우수성을 입증한다.

In wireless communication systems, jamming attack is a critical threat. Especially, reactive jamming can jam when the sender and receiver are communicating, which can maximize the attack efficiency of jamming. In this paper, we use the property of multi-input multi-output (MIMO) technology to achieve jamming resilient orthogonal frequency-division multiplexing (OFDM) communications. In particular, we use MIMO interference cancellation to remove the jamming signals strategically. We first investigate the reactive jamming attack model and their impacts on the MIMO-OFDM systems. We then present an iterative channel estimation algorithm that exploits MIMO interference cancellation. Our simulations show various anti-jamming methods and demonstrate the efficiency of our proposed algorithm under the reactive jamming attack.

In heterogeneous networks, the issue of interference between femtocells and macrocells should be carefully considered. Resource allocation schemes with cognitive technologies have been a key challenge to manage interference. In this paper, we investigate price-based power allocation strategies with the energy efficiency criterion for a spectrum-sharing heterogeneous cognitive network from the aspect of energy efficiency, and provide the utility function of macrocell and femtocells based on a non-cooperative Stackleberg game model. We build a combination of price vector and power allocation values by standard Lagrangian method and propose an improved iteration algorithm based on price updating to obtain the Stackleberg equilibrium solution. The simulation results verify the proposed method can improve energy efficiency and achieve better utility.

Optimization problems, variational inequalities, minimax problems can be formulated as equilibrium problems. The iterative algorithms of fixed points are often applied to finding the solution of equilibrium problems. In this paper, we introduce a new hybrid iterative algorithm for finding a common element of the set of fixed points of asymptotically nonexpansive mappings and the set of solutions of an equilibrium problem in Hilbert spaces. Besides, an example of variational inequality problem is given to illustrate the efficiency and performance of the newly algorithm.

The images of different areas require different test results on the edge. In this paper, the images of red blood cells in medical field need to be detected theirs cell size, roundness, number and other features. For the test requirements, an image edge detection algorithm is proposed based on improved Canny operator. This algorithm calculates the optimal high and low dual-threshold by using iteration arithmetic, and uses mathematical morphology to thin the detected images. The results proved that this algorithm can effectively reduce interference and noise edge and make more prominent detection characteristics, which is good ready for subsequent processing of the image.

This paper models image deconvolution as an l2-l1 minimization problem, which is an approach taken by many state-of-the-art image deconvolution algorithms. We present a novel iterative algorithm based on the split Bregman method and the stationary second-degree method, which efficiently addresses the classic convex minimization problem. The split Bregman method, which has been proven to be very efficient for non-differentiable minimization problems, decomposes the equivalent constrained version of the l2-l1 deconvolution problem into a series of sub-problems. These sub-problems are then individually solved using appropriate methods to obtain their closed-form solutions. Unlike the majority of other similar deconvolution algorithms, we use a modified stationary second-degree method to solve the l2-l1 denoising sub-problem, prompted by some recent work on the improvement of the iterative thresholding method. The presented algorithm can be categorized as a split Bregman method, so convergence of the solution can be guaranteed. In our experiment, the presented algorithm and the algorithms in references [6] and [8] are used to restore Gaussian-blurry and uniform-blurry images. The experimental results show that the presented algorithm is effective and it outperforms other algorithms in comparison.

According to the limitations of a single measurement algorithm in the current 3D models’ viewpoint extraction, this essay puts forward a viewpoint extraction algorithm based on AdaBoost iterative algorithm, which can make the features adaptive automatically. It, firstly, extracts 3D models’ feature descriptor and feature vector in the model library and adopts AdaBoost iterative algorithm to establish rules about classification and matching from geometric features and various viewpoint extraction algorithm; then, it constructs decision classifier in order to extract optimal viewpoint. In query process, the model obtains viewpoint extraction algorithm which can suit its geometric feature through decision classifier and then gets its best view by calculation. The experimental result shows this algorithm extraction effect is superior to the one by a single measurement algorithm.

In order to realize location in cellular networks, the location model with uniform noise based on AOA is established when seven base stations are available. Then a maximum likelihood estimation (MLE) method is proposed and realized by an iterative algorithm under this model. Finally, the simulation result of the iterative algorithm as compared to least squares estimation(LSE) algorithm under this AOA model is shown that the iterative algorithm is less error and more robust to noise disturbance than LSE algorithm.

Due to the wide application of range-based location algorithm for received signal strength, and according to the requirements of high accuracy and low power cost in the location algorithm for WSNs, in this paper, a Bayesian optimization RSSI and an indoor location algorithm for ILS were introduced by setting RRS ranging as location framework. Firstly, through analyzing the RSSI-based ranging model, an indoor location model was introduced. Secondly, in view of the influence on RSSI value caused by the indoor environment,the Bayesian probabilistic model was adopted to process the RSSI measured value and to screen out the "big probability" of RSSI value. Thirdly, Obtaining accurate measured data by estimating distance using method of minimum mean square error. Finally, Estimating the node location using least square method, and according to the TelosB node of Telos Series produced by company Crossbow, the ranging experiment can be designed and thus groups of experimental data were obtained and analyzed..The experimental results showed that the proposed location project greatly increased the location accuracy and decreased the computation complexity, and has obviously more advantage of running time over other location projects.

Stencils are finite-difference algorithms for solving large-scale and high-dimension partial differential equations. Due to the data dependences among the iterative statements in Stencils, traditional Stencil computations are be executed serially, rather than in parallel. It’s challenging to design an effective and scalable Stencil parallelized method. To address the issue of 3D data space computing, we present a serial execution model based on multi-layers symmetric Stencil method and time skewing techniques. Within this model, the iteration space is divided to multiple tiles based on time skewing, where the executive process is ordered by the sequence of tiles, and the nodes in each individual tile can be swept repeatedly to improve the data locality. In addition, we propose a novel 3D iterative space alternate tiling Stencil parallel method, which subdivides the iteration space along high dimension, and changes the execution sequence of tiles to reduce the data dependency and communication cost, where the partial order of tiles is still guaranteed. Experimental results demonstrate our proposed alternative tiling parallel method achieves better parallel efficiency and scalability compared with the domain-decomposition methods.

Fingerprint Identification System performance largely depends on the quality of input fingerprint images. High quality input fingerprint images are prerequisite for high performance systems. In this paper, we have proposed an algorithm of fingerprint image enhancement by using Iterative Fast Fourier Transform (IFFT). Iterative image reconstruction algorithms play an important role in fingerprint identification systems in order to achieve higher degree of efficiency. With the fast increase of the sizes of the fingerprint data, design of the reconstruction algorithms is of great importance in order to improve the performance. Fourier-based frequency orientation methods have the potential to considerably reduce the computation time in iterative reconstruction. We also have designed an approach for removing the false minutia generated during the fingerprint processing and a method to reduce the false minutia to increase the efficacy of identification system. We have used fingerprint Verification Competition 2006 (FVC 2006) as a database for implementation of proposed algorithm to verify the degree of efficiency of proposed algorithm. Experimental result shows that the proposed enhancement algorithm is better than existing Fast Fourier Transform algorithm.

This research considers a low carbon scheduling problem in unrelated parallel machines. To solve this problem, we first establish a low carbon scheduling mathematical model. Then an iterative ant optimization algorithm is presented. Furthermore, parameters of proposed iterative ant optimization algorithm are selected by Taguchi methods on generating test dataset. Finally, comparative experiments indicate the proposed iterative ant optimization algorithm has better performance on minimizing energy consumption as well as total tardiness.

Biological tissues have electrical conductivity and permittivity properties which depend on tissue composition, structure and health status. Bioelectrical properties can be utilized for non invasive disease diagnosis. Electrical Impedance Tomography (EIT) is a method for reconstructing the image of distribution of electrical conductivity and permittivity inside a volume from measurements made at the surface of the volume. EIT image reconstruction is an ill-posed problem that requires a priori information called regularization. The Total Variation (TV) regularization is often used in solving EIT inverse problem. In this paper, simulation has been carried out in noise free and noisy cases and TV regularized iterative Primal Dual Interior Point Method (PD-IPM) has been used to reconstruct the difference conductivity image.

본 논문에서는 멀티프로세서 아키텍처 상에 반복적인 데이터흐름 알고리즘을 스케줄링하는 방법을 제안한다. 기본적인 하드웨어 모델을 기반으로 멀티프로세서 아키텍처라는 세부적인 특성을 가지도록 확장하여 용량이 제한된 통신 네트워크상에 전송할 데이터를 라우팅 하는데 필요한 하드웨어 모델을 구현하고, 스케줄링 방법을 적용한다. 제안한 스케줄링 방법은 세 가지 계층으로 구성된다. 가장 상위 계층에 구현된 유전 알고리즘은 반복 데이터흐름 그래프의 최적화를 담당한다. 유전 알고리즘은 대상이 되는 연산들에 대해 서로 다른 조합을 생성한다. 그리고서 이 조합들은 중간 계층으로 전달된다. 이 중간 계층에는 전역 스케줄링이 위치하며, 연산들의 조합을 바탕으로 스케줄링에 관한 주요 결정을 이 스케줄이 내리게 된다. 마지막으로, 하부 계층에서는 하드웨어 세부사항을 고려하며 블랙-박스 스케줄링을 이용한다. 연산에 대한 스케줄링을 완료하고, 세부적인 하드웨어 모델이 이 결정을 준수하는지 확인한다. 스케줄 사이에 사이클을 삽입할 수 있는 두 가지 스케줄링을 통해 유효한 스케줄을 항상 빨리 찾아낼 수 있다. 본 논문에서 제안한 스케줄링 방법의 성능을 테스트하기 위하여 다섯 가지 필터들에 대한 벤치마크를 수행하여 합당한 시간 안에 양질의 스케줄을 찾아낼 수 있음을 입증한다.

In this paper, we proposed an iterative data-flow optimal scheduling algorithm based on genetic algorithm for high-performance multiprocessor. The basic hardware model can be extended to include detailed features of the multiprocessor architecture. This is illustrated by implementing a hardware model that requires routing the data transfers over a communication network with a limited capacity. The scheduling method consists of three layers. In the top layer a genetic algorithm takes care of the optimization. It generates different permutations of operations, that are passed on to the middle layer. The global scheduling makes the main scheduling decisions based on a permutation of operations. Details of the hardware model are not considered in this layer. This is done in the bottom layer by the black-box scheduling. It completes the scheduling of an operation and ensures that the detailed hardware model is obeyed. Both scheduling method can insert cycles in the schedule to ensure that a valid schedule is always found quickly. In order to test the performance of the scheduling method, the results of benchmark of the five filters show that the scheduling method is able to find good quality schedules in reasonable time.

목 적: CT(computed tomography) 영상에서 Metal Artifact로 인해 왜곡된 영상을 보정하는 Iterative Metal Artifact Reduction(IMAR) Algorithm의 정확성을 평가하고 양성자 치료계획에서 IMAR Algorithm 적용의 유용성을 평가하고자 한다. 대상 및 방법: CT simulator를 이용하여 CIRS Phantom 내에 금속을 삽입한 것과 삽입하지 않은 영상을 각각 촬영하였다. Phantom 내의 동일한 위치에 ROI1, ROI2를 설정하여 금속이 없는 경우의 영상과 금속으로 인한 Artifact가 발생한 영상, IMAR Algorithm을 적용한 영상에서 CT Number값의 차이를 비교하였다. 또, 금속 주변에 위치한 조직등가물질의 CT Number값을 비교하였다. 척추에 임플란트 시술을 시행한 환자를 가정하여 Rando 팬텀의 척추 부위에 Titanium 봉을 삽입하여 CT 촬영을 하였다. IMAR Algorithm 적용 전과 후의 영상에서 같은 부위에 ROI 1, ROI 2를 설정하여 CT Number값을 측정하고, 각각의 영상에 동일한 양성자 치료계획을 세워 세 지점에서 양성자선의 비정(Range)의 차이를 비교하였다. 결 과: CIRS Phantom 평가에서 금속이 없는 경우의 평균 CT number값은 ROI 1에서 -6.5 HU, ROI 2에서 -10.5 HU였다. 금속이 있는 경우 Fe, Ti, W 순으로 ROI 1에서 -148.1, -45.1, -151.7 HU였으며 IMAR Algorithm을 적용 하였을 때는 -0.9, -2.0, -1.9 HU로 증가하였다. ROI 2에서는 금속이 있는 경우 171.8, 63.9, 177.0 HU였으며 IMAR Algorithm 적용 후에는 10.0, 6.7, 8.1 HU로 감소하였다. 조직등가물질의 CT Number값은 가장 멀리 위치한 폐를 제외하고 모두 원래의 CT Number값에 가깝게 보정이 되었다. Rando Phantom 평가는 금속이 없는 경우와 금속이 있는 경우, IMAR Algorithm을 적용하였을 때 평균 CT Number값은 각각 ROI 1에서 9.9, -202.8, 35.1 HU였으며 ROI 2에서 9.0, 107.1, 29 HU였다. 치료계획에서 금속이 없을 때와 양성자선의 Range의 차이는 IMAR Algorithm을 적용하였을 때 1번 지점에서 평균 0.26 cm 감소하였으며 2번 지점에서 평균 0.20 cm 감소하였다. 3번 지점에서는 평균 0.12 cm 감소하였다. 결 론: IMAR Algorithm을 적용함으로써 CT Number값은 금속이 없을 때의 원래의 값에 가깝게 보정되었다. 또, 양성자 치료계획의 Beam Profile에서 IMAR Algorithm 적용 후 비정의 차이가 0.01에서 최대 3.6 mm 줄어들었다. Artifact가 존재하지 않는 영상과 비교하여 약간의 차이는 존재하지만 양성자의 비정에 따른 선량의 급격한 변화를 고려한다면 금속이 있는 환자에게 IMAR Algorithm의 적용은 유용할 것으로 사료된다.

Purpose: To evaluate the accuracy of the Iterative Metal Artifact Reduction (IMAR) algorithm in correcting CT (computed tomography) images distorted due to a metal artifact and to evaluate the usefulness when proton therapy plan was plan using the images on which IMAR algorithm was applied. Materials and Methods: We used a CT simulator to capture the images when metal was not inserted in the CIRS model 062 Phantom and when metal was inserted in it and Artifact occurred. We compared the differences in the CT numbers from the images without metal, with a metal artifact, and with IMAR algorithm by setting ROI 1 and ROI 2 at the same position in the phantom. In addition, CT numbers of the tissue equivalents located near the metal were compared. For the evaluation of Rando Phantom, CT was taken by inserting a titanium rod into the spinal region of the Rando phantom modelling a patient who underwent spinal implant surgery. In addition, the same proton therapy plan was established for each image, and the differences in Range at three sites were compared. Results: In the evaluation of CIRS Phantom, the CT numbers were -6.5 HU at ROI 1 and -10.5 HU at ROI 2 in the absence of metal. In the presence of metal, Fe, Ti, and W were -148.1, -45.1 and -151.7 HU at ROI 1, respectively, and when the IMAR algorithm was applied, it increased to -0.9, -2.0, -1.9 HU. In the presence of metal, they were 171.8, 63.9 and 177.0 HU at ROI 2 and after the application of IMAR algorithm they decreased to 10.0 6,7 and 8.1 HU. The CT numbers of the tissue equivalents were corrected close to the original CT numbers except those in the lung located farthest. In the evaluation of the Rando Phantom, the mean CT numbers were 9.9, -202.8, and 35.1 HU at ROI 1, and 9.0, 107.1, and 29 HU at ROI 2 in the absence, presence of metal, and in the application of IMAR algorithm. The difference between the absence of metal and the range of proton beam in the therapy was reduced on the average by 0.26 cm at point 1, 0.20 cm at point 2, and 0.12 cm at point 3 when the IMAR algorithm was applied. Conclusion: By applying the IMAR algorithm, the CT numbers were corrected close to the original ones obtained in the absence of metal. In the beam profile of the proton therapy, the difference in Range after applying the IMAR algorithm was reduced by 0.01 to 3.6 mm. There were slight differences as compared to the images absence of metal but it was thought that the application of the IMAR algorithm could result in less error compared with the conventional therapy.