• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.1
• /
• pp.55-68
• /
• 2012

In this paper, we propose a novel method to solve the problem of excessive segmentation out of the method of segmenting regions from an image using Homogeneity Threshold($H_T$). The algorithm of the previous image segmentation based on $H_T$ was carried out region growth by using only the center pixel of selected window. Therefore it was caused resulting in excessive segmented regions. However, before carrying region growth, the proposed method first of all finds out whether the selected window is homogeneity or not. Subsequently, if the selected window is homogeneity it carries out region growth using the total pixels of selected window. But if the selected window is not homogeneity, it carries out region growth using only the center pixel of selected window. So, the method can reduce remarkably the number of excessive segmented regions of image segmentation based on $H_T$. In order to show the validity of the proposed method, we carried out multiple experiments to compare the proposed method with previous method in same environment and conditions. As the results, the proposed method can reduce the number of segmented regions above 40% and doesn't make any difference in the quality of visual image when we compare with previous method. Especially, when we compare the image united with regions of descending order by size of segmented regions in experimentation with the previous method, even though the united image has regions more than 1,000, we can't recognize what the image means. However, in the proposed method, even though image is united by segmented regions less than 10, we can recognize what the image is. For these reason, we expect that the proposed method will be utilized in various fields, such as the extraction of objects, the retrieval of informations from the image, research for anatomy, biology, image visualization, and animation and so on.

• Journal of Korea Port Economic Association
• /
• v.26 no.3
• /
• pp.165-174
• /
• 2010

DEA converts multiple inputs and outputs of a decision unit into a single measure of performance, generally mentioned as relative efficiency. DEA has been applied successfully as a performance evaluation tool in many fields including manufacturing, banks, pharmacies, and hospitals to name a few. This paper applies the input-oriented DEA model, DEA/Window analysis, and Malmquist indices to the 9 regions in Korea to measure the efficiency and productivity. The empirical results show the following findings. First, the super efficiency indicate that efficiency of Group 2 is greater than Group 1. Second, Malmquist indices show that productivity of Group 2 is less than Group 1. Third, DEA/Window of Group2 show that Chungnam is most stable, while Jeonnam is most unstable.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.1
• /
• pp.123-128
• /
• 2018

In this paper, we propose a multi-vehicle object detection algorithm using feature point matching that tracks efficient vehicle objects. The proposed algorithm extracts the feature points of the vehicle using the FAST algorithm for efficient vehicle object tracking. And True if the feature points are included in the image segmented into the 5X5 region. If the feature point is not included, it is processed as False and the corresponding area is blacked to remove unnecessary object information excluding the vehicle object. Then, the post processed area is set as the maximum search window size of the vehicle. And A minimum search window using the outermost feature points of the vehicle is set. By using the set search window, we compensate the disadvantages of the search window size of mean-shift algorithm and track vehicle object. In order to evaluate the performance of the proposed method, SIFT and SURF algorithms are compared and tested. The result is about four times faster than the SIFT algorithm. And it has the advantage of detecting more efficiently than the process of SUFR algorithm.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.9
• /
• pp.9-17
• /
• 1999

In this paper, we present a mathematical modeling and perform a performance analysis of double-dwell serial search algorithm, which has a search window concept, for pilot channel in DS-CDMA(Direct Sequence Code Division Multiple Access). We derive a code detection function, a false alarm function, a code miss function, and a mean code acquisition time for the performance analysis. We calculate the mean code acquisition time of the mathematical model in IS-95 forward link and compare it with that of the conventional search methods. The performance of the code acquisition system is also evaluated to investigate the effect of dwell times and search window size. The JTC channel model, which is a PCS channel model in North America, is used for the analysis. The numerical result shows that the mean code acquisition time of the double-dwell serial search algorithm with a search window is reduced by about 17%~25% than those of the conventional ones.

• Investigative Magnetic Resonance Imaging
• /
• v.19 no.4
• /
• pp.212-217
• /
• 2015

Purpose: For a single time-point hyperpolarized $^{13}C$ magnetic resonance spectroscopy imaging (MRSI) of animal models, scan-time window after injecting substrates is critical in terms of signal-to-noise ratio (SNR) of downstream metabolites. Pre-scans of time-resolved magnetic resonance spectroscopy (MRS) can be performed to determine the scan-time window. In this study, based on two-site exchange model, protocol-specific simulation approaches were developed for $^{13}C$ MRSI and the optimal scan-time window was determined to maximize the SNR of downstream metabolites. Materials and Methods: The arterial input function and conversion rate constant from injected substrates (pyruvate) to downstream metabolite (lactate) were precalibrated, based on pre-scans of time-resolved MRS. MRSI was simulated using two-site exchange model with considerations of scan parameters of MRSI. Optimal scan-time window for mapping lactate was chosen from simulated lactate intensity maps. The performance was validated by multiple in vivo experiments of BALB/C nude mice with MDA-MB-231 breast tumor cells. As a comparison, MRSI were performed with other scan-time windows simply chosen from the lactate signal intensities of pre-scan time-resolved MRS. Results: The optimal scan timing for our animal models was determined by simulation, and was found to be 15 s after injection of the pyruvate. Compared to the simple approach, we observed that the lactate peak signal to noise ratio (PSNR) was increased by 230%. Conclusion: Optimal scan timing to measure downstream metabolites using hyperpolarized $^{13}C$ MRSI can be determined by the proposed protocol-specific simulation approaches.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.310-323
• /
• 2004

In this paper, we extend the multiple time scale control framework to window-based congestion control, in particular, TCP This is performed by interfacing TCP with a large tine scale control nodule which adjusts the aggressiveness of bandwidth consumption behavior exhibited by TCP as a function of "large time scale" network state. i.e., conformation that exceeds the horizon of the feedback loop as determined by RTT Our contribution is threefold. First, we define a modular extension of TCP-a function call with a simple interface-that applies to various flavors of TCP-e.g., Tahoe, Reno, Vegas and show that it significantly improves performance. Second, we show that multiple time scale TCP endows the underlying feedback control with preactivity by bridging the uncertainty gap associated with reactive controls which is exacerbated by the high delay-bandwidth product in broadband wide area networks. Third, we investigate the influence of three traffic control dimensions-tracking ability, connection duration, and fairness-on performance. Performance evaluation of multiple time scale TCP is facilitated by a simulation bench-mark environment which is based on physical modeling of self-similar traffic.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.67-74
• /
• 2008

This paper proposes two peak-windowing algorithms for peak-to-average power reduction(PAPR) of orthogonal frequency division multiple access(OFDMA) downlink systems. The Proposed algorithms mitigate the effect of excessive suppression due to successive peaks or relatively high peaks of the signal. First, multi-stage peak windowing algorithm is proposed, which exploits multiple threshold of target PAPR in order to step down the peaks gradually. Secondary, variable-length peak windowing algorithm is proposed, which adapts the window length with respect to the existence of successive peaks within a half of window length. Therefore, the proposed method reduces the distortion of signal amplitude caused by window overlapping. The proposed algorithms outperform the conventional peak windowing with the aid of window-length adaptation or sequential peak power reduction. Simulation results show the efficiency of the proposed algorithms over OFDMA downlink systems, especially WiBro systems.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.563-577
• /
• 2006

A stream processor uses resource sharing method for efficient of limited resource in multiple continuous queries. The previous methods process aggregate queries to consist the level structure. So insert operation needs to reconstruct cost of the level structure. Also a search operation needs to search cost of aggregation information in each size of sliding windows. Therefore this paper uses linear structure for optimization of sliding window aggregations. The method comprises of making decision, generation and deletion of panes in sequence. The decision phase determines optimum pane size for holding accurate aggregate information. The generation phase stores aggregate information of data per pane from stream buffer. At the deletion phase, panes are deleted that are no longer used. The proposed method uses resources less than the method where level structures were used as data structures as it uses linear data format. The input cost of aggregate information is saved by calculating only pane size of data though numerous stream data is arrived, and the search cost of aggregate information is also saved by linear searching though those sliding window size is different each other. In experiment, the proposed method has low usage of memory and the speed of query processing is increased.

• Journal of Korea Multimedia Society
• /
• v.16 no.2
• /
• pp.198-205
• /
• 2013

In this paper, the performance of multicore processor architecture is analyzed which utilizes out-of-order superscalar processor core using multiple basic block execution. Using SPEC 2000 benchmarks as input, the trace-driven simulation has been performed for the out-of-order superscalar processor with the window size from 32 to 64 and the number of cores between 1 and 16, exploiting multiple basic block execution from 1 to 4 extensively. As a result, the multicore out-of-order superscalar processor with 4 basic block execution achieves 22.0 % average performance increase over the same architecture with the single basic block execution.

• Journal of Auto-vehicle Safety Association
• /
• v.14 no.2
• /
• pp.26-38
• /
• 2022

This paper proposes multiple RLS and actuator performance index-based adaptive actuator fault-tolerant control and detection algorithms for longitudinal autonomous driving. The proposed algorithm computes the desired acceleration using feedback law for longitudinal autonomous driving. When actuator fault or performance degradation exists, it is designed that the desired acceleration is adjusted with the calculated feedback gains based on multiple RLS and gradient descent method for fault-tolerant control. In order to define the performance index, the error between the desired and actual accelerations is used. The window-based weighted error standard deviation is computed with the design parameters. Fault level decision algorithm that can represent three fault levels such as normal, warning, emergency levels is proposed in this study. Performance evaluation under various driving scenarios with actuator fault was conducted based on co-simulation of Matlab/Simulink and commercial software (CarMaker).