• Nuclear Engineering and Technology
• /
• v.54 no.9
• /
• pp.3422-3428
• /
• 2022

The prompt gamma imaging (PGI) technique is considered as one of the most promising approaches to estimate the range of proton beam in the patient and unlock the full potential of proton therapy. In the PGI technique, a dedicated algorithm is required to estimate the range of the proton beam from the prompt gamma (PG) distribution acquired by a PGI system. In the present study, a new range estimation algorithm was developed for a multi-slit prompt-gamma camera, one of PGI systems, to estimate the range of proton beam with high accuracy. The performance of the developed algorithm was evaluated by Monte Carlo simulations for various beam/phantom combinations. Our results generally show that the developed algorithm is very robust, showing very high accuracy and precision for all the cases considered in the present study. The range estimation accuracy of the developed algorithm was 0.5-1.7 mm, which is approximately 1% of beam range, for 1×10⁹ protons. Even for the typical number of protons for a spot (1×10⁸), the range estimation accuracy of the developed algorithm was 2.1-4.6 mm and smaller than the range uncertainties and typical safety margin, while that of the existing algorithm was 2.5-9.6 mm.

• ETRI Journal
• /
• v.43 no.1
• /
• pp.120-132
• /
• 2021

A frequency diverse array (FDA) multiple-input multiple-output (MIMO) radar employs a small frequency increment across transmit elements to produce an angle-range-dependent beampattern for target angle and range detection. The joint angle and range estimation problem is a trilinear model. The traditional trilinear alternating least square (TALS) algorithm involves high computational load due to excessive iterations. We propose a fast-convergence trilinear decomposition (FC-TD) algorithm to jointly estimate FDA-MIMO radar target angle and range. We first use a propagator method to obtain coarse angle and range estimates in the data domain. Next, the coarse estimates are used as initialized parameters instead of the traditional TALS algorithm random initialization to reduce iterations and accelerate convergence. Finally, fine angle and range estimates are derived and automatically paired. Compared to the traditional TALS algorithm, the proposed FC-TD algorithm has lower computational complexity with no estimation performance degradation. Moreover, Cramer-Rao bounds are presented and simulation results are provided to validate the proposed FC-TD algorithm effectiveness.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2044-2047
• /
• 2003

In this paper, we propose efficient motion vector refinement algorithm for frame-rate reduction transcoding. The proposed algorithm is to set the search range for motion refinement based on the incoming motion vector. The algorithm calculates the importance of motion vector of the skipped frame and then selects two motion vector to set search range. Through this process, we determine the accuracy of incoming motion vector and set the search range lot refinement adaptively by means of the accuracy. In experiments, we show efficiency of our algorithm to reduce the search points for refinement.

• Korean Journal of Remote Sensing
• /
• v.23 no.4
• /
• pp.247-256
• /
• 2007

In this paper we introduced GB-SAR focusing algorithms for image formation and suggested an optimized solution. We compared the characteristics, advantages, and limitations of the Deramp-FFT (DF) algorithm and the Range-Doppler (RD) algorithm in terms of their image formation principles, memory usage and processing time. We found that DF algorithm is efficient in memory and processing time but can not focus the near range. The RD algorithm can focus the entire range but, considering the refinement on the rail length, it has much redundancy in memory and processing time. In conclusion, we optimized the GB-SAR focusing by using the DF algorithm for a far-range case and the RD algorithm for a near-range case separately.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.1
• /
• pp.33-42
• /
• 2013

This paper presents a multihop range-free localization algorithm to estimate the physical location of a normal node with local connectivity information in anisotropic sensor networks. In the proposed algorithm, a normal node captures the detour degree of the shortest path connecting an anchor pair and itself by comparing the measured hop count and the expected hop count, and the node estimates the distances to the anchors based on the detour degree. The normal node repeats this procedure with all anchor combinations and pinpoints its location using the obtained distance estimates. The proposed algorithm requires fewer anchors and less communication overhead compared to existing range-free algorithms. We showed the superiority of the proposed algorithm over existing range-free algorithms through MATLA simulations.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.4
• /
• pp.639-642
• /
• 2012

Optical coherence tomography(OCT) can provide real-time and non-invasive subsurface imaging with ultra-high resolution of micrometer scale. However, conventional OCT systems generally have a limited imaging depth range within a depth of only 1-2 mm. To overcome the limitation, we have proposed an active surface tracking algorithm used in common-path Fourier-domain OCT system in order to extend the imaging depth range. The surface tracking algorithm based on the threshold and Savitzky-Golay filter of A-scan data was applied to real-time tracking. The algorithm has controlled a moving stage according to the sample's surface variance in real time. An OCT image obtained by the algorithm clearly show an extended imaging depth range. Consequently, the proposed algorithm demonstrated the potential for improving the conventional OCT systems with limitary depth range.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.267-268
• /
• 2007

A dynamic range compression algorithm using Markov random field (MRF) modeling to display high dynamic range (HDR) images on low dynamic range (LDR) devices is proposed in this work. The proposed algorithm separates foreground objects from the background using the edge information, and then compresses the color differences across the edges based on the MRF modeling. By minimizing a cost function using belief propagation, the proposed algorithm can provide an effective LDR image. Simulation results show that the proposed algorithm provides good results.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.2
• /
• pp.52-62
• /
• 1997

To reconstruct the complete 3-D shape of an object, seveal range images form different viewpoints should be merged into a single model. The process of extraction of the transformation parameters between multiple range views is calle dregistration. In this paper, we propose a new algorithm to find the transformation parameters between multiple range views. Th eproposed algorithm consists of two step: initial estimation and iteratively update the transformation. To guess the initial transformation, we modify the principal axes by considering the projection effect, due to the difference fo viewpoints. Then, the following process is iterated: in order to extract the exact transformation parameters between the range views: For every point of the common region, find the nearest point among the neighborhood of the current corresponding point whose correspondency is defined by the reverse calibration of the range finder. Then, update the transformation to satisfy the new correspondencies. In order to evaluate the performance the proposed registration algorithm, some experiments are performed on real range data, acquired by space encoding range finder. The experimental results show that the proposed initial estimation accelerate the following iterative registration step.

• Journal of Ocean Engineering and Technology
• /
• v.8 no.1
• /
• pp.62-70
• /
• 1994

In order to estimate the detection range of a active SONAR system, the SONAR equation is commonly used. In this paper, an algorithm to calculate detection range in active SONAR system as function of SONAR depth and target depth is presented. For given SONAR parameters and environment, the transmission loss and background level are found, signal excess is computed. Using log-normal distribution, signal excess is converted to detection probability at each range. Then, the detection range is obtained by integrating the detection probability as function of range for each depth. The proposed algorithm have been applied to the case of omni-directional source with center frequency 30Hz for summer and winter sound profiles. It is found that the optimal search depth is the source depth since the detection range increase at source depth where the signal excess is maximized.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.179-188
• /
• 2001

We analyze the property of candidate node set in the network graph, and propose an algorithm to decrease shortest path-finding computation time by using multiple dynamic-range queue(MDRQ) structure. This MDRQ structure is newly created for effective management of the candidate node set. The MDRQ algorithm is the shortest path-finding algorithm that varies range and size of queue to be used in managing candidate node set, in considering the properties that distribution of candidate node set is constant and size of candidate node set rapidly change. This algorithm belongs to label-correcting algorithm class. Nevertheless, because re-entering of candidate node can be decreased, the shortest path-finding computation time is noticeably decreased. Through the experiment, the MDRQ algorithm is same or superior to the other label-correcting algorithms in the graph which re-entering of candidate node didn’t frequently happened. Moreover the MDRQ algorithm is superior to the other label-correcting algorithms and is about 20 percent superior to the other label-setting algorithms in the graph which re-entering of candidate node frequently happened.