• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1471-1481
• /
• 1998

In this paper, we propose a new digital image stabilization scheme based on the bit-plane matching. In the proposed algorithm, the conventional motion estimation algorithms are applied to the binary images extracted from the bit-plane images. It is shown that the computational complexity of the proposed algorithm can be significantly reduced by replacing the arithmetic calculations with the binary Boolean functions, while the accuracy of motion estimation is maintained. Furthermore, an adaptive algorithm for selecting a bit-plane in consideration of changes in external illumination can provide the robustness of the proposed algorithm. We compared the proposed algorithm with existing algorithms using root mean square error (RMSE) on the basis of the brute-force method, and proved experimentally that the proposed method detects the camera motion more accurately than existing algorithms. In addition, the proposed algorithm performs digital image stabilization with less computation.

• Journal of Korean Society for Atmospheric Environment
• /
• v.27 no.6
• /
• pp.772-790
• /
• 2011

In this paper, we use the HDDM (High-order Decoupled Direct Method)-driven ozone sensitivity to predict change in ozone concentrations in response to domain-wide $NO_x$(Oxides of Nitrogen) and VOC (Volatile Organic Compound) emission controls over the Seoul Metropolitan Area during June 11~19, 2007. In order to validate the applicability of HDDM to $NO_x$ and VOC control scenarios, the HDDM results are compared to Brute Force Method (BFM). For VOC controls, NME (Normalized Mean Error) between BFM and HDDM remains less than 2% until the domain-wide VOC emissions are reduced by 80%. The NME for a 40% reduction in the domain-wide $NO_x$ emissions is less than 5% but increases abruptly after further reductions in the $NO_x$ emissions (i.e., 80% reduction). The results indicates that it may be inaccurate to use ozone sensitivity coefficients estimated at a given base emission condition in predicting ozone after $NO_x$ reductions larger than ~50% of the domain total in the SMA. Therefore, HDDM application on piecewise emissions is desirable to predict ozone response to emission controls with accuracy (i.e., truck emissions rather than the domain total). For computational efficiency, HDDM shows approximately 30% faster than the BFM sensitivity approach.

• Journal of Environmental Science International
• /
• v.20 no.11
• /
• pp.1465-1481
• /
• 2011

The accuracy of ozone sensitivity coefficients estimated with HDDM (High-order Decoupled Direct Method) can vary depending on the $NO_x$ (Nitrogen Oxides) and VOC (Volatile Organic Compound) conditions. In order to evaluate the applicability of HDDM over the Seoul Metropolitan Area (SMA) during a high ozone episode in 2007 June, we compare BFM (Brute Force Method) and HDDM in terms of the $1^{st}$-order ozone sensitivity coefficient to explain ozone change in response to changes in NOx and VOC emissions, and the $2^{nd}$-order ozone sensitivity coefficient to represent nonlinear response of ozone to the emission changes. BFM and HDDM estimate comparable ozone sensitivity coefficients, exhibiting similar spatial and temporal variations over the SMAduring the episode. NME (Normalized Mean Error) between BFM and HDDM for the episode average $1^{st}$- and $2^{nd}$-order ozone sensitivity coefficients to NOx and VOC emissions are less than 3% and 9%, respectively. For the daily comparison, NME for the $1^{st}$- and $2^{nd}$-order ozone sensitivity coefficients are less than 4% ($R^2$ > 0.96) and 15% ($R^2$ > 0.90), respectively. Under the emission conditions used in this study, two methods show negative episode average $1^{st}$-order ozone sensitivity coefficient to $NO_x$ emissions over the core SMA. The $2^{nd}$-order ozone sensitivity coefficient to $NO_x$ emissions leads ozone to respond muchnonlinear to the reduction in $NO_x$ emissions over Seoul. Nonlinear ozone response to reduction in VOC emissions is mitigated due to the $2^{nd}$-order ozone sensitivity coefficient which is much smaller than the $1^{st}$-order ozone sensitivity coefficient to the emissions in the magnitude.

• Proceedings of the KIEE Conference
• /
• 1987.11a
• /
• pp.398-400
• /
• 1987

Using the transmission line model, we have developed a formalism which is fairly accurate and convenient for analyzing the dispersion characteristics of rectangular dielectric waveguides for integrated optics. The fields in open half space regions are expressed as a Fourier integral form. Including all the TE and TM polarized discrete modes in slab waveguide region, our calculation shows that the discrepancies between the previous vectorial wave analysis using one discrete mode and the brute-force numerical analysis for the rectangular dielectric waveguides can be fully reduced with this method.

• Communications of the Korean Mathematical Society
• /
• v.28 no.4
• /
• pp.833-850
• /
• 2013

We present an algorithm for computing the Hausdorff distance between two parametric curves in $\mathbb{R}^n$, or more generally between two sets of parametric curves in $\mathbb{R}^n$. During repeated subdivision of the parameter space, we prune subintervals that cannot contain an optimal point. Typically, our algorithm costs O(logM) operations, compared with O(M) operations for a direct, brute-force method, to achieve an accuracy of $O(M^{-1})$.

• Journal of the Korea Computer Graphics Society
• /
• v.28 no.2
• /
• pp.21-28
• /
• 2022

ASTC is one of the standard texture formats supported in OpenGL ES 3.2 and Vulkan 1.0 (and later versions), and it has been increasingly used on mobile platforms (Android and iOS). ASTC's most important feature is the block size configuration, thereby providing a trade-off between compression quality and rates. With the higher number of textures, however, it is difficult to manually determine the optimal block sizes of each texture. To solve the problem, we present a new approach based on PSNR values to automatically determine the ASTC block size. A brute-force approach, which compresses a texture on all block sizes and compares the PSNR values of the compressed textures, can increase the compression time by up to 14 times. In contrast, our three-step approach minimizes the compression-time overhead. According to our experiments on a texture set including 64 various textures, our method determined the block sizes from 4×4 to 12×12 and reduced the size of compressed files by 68%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.4
• /
• pp.867-875
• /
• 2014

Rapid development of internet service is enabling internet banking services in anywhere and anytime. However, service access through internet can be exposed to adversary easily. To prevent, current service providers execute authentication process with user's identification and password. However, majority of users use short and simple password and do not periodically change their password. As a result of this, user's password could be exposed to attacker's brute force attack. In this paper, we presented enhanced password system which guarantee higher security even though users do not change their current password. The method uses additional secret information to replace real password periodically without replacement of real password.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.545-548
• /
• 2005

Recently, the computing environment of P2P come out to solve the excessive load of the server in the computing environment of the client/server. Currently, operated computing environment of P2P is mainly spreading out P2P system of read name or anonymity base about a publisher, sender and receiver of the file. But, to the current file protection there is three problem. The first problem is to a host become attack target. The second is to received file loose attack of Brute Force. The third is to define target of attack of DOS. To solve the this problem. it divide file into block unit. Each block is safely scattered peers. This paper propose the distribution P2P system of file division. Both proposing system solve the this problem and promote efficiency of file application.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.2
• /
• pp.9-14
• /
• 2022

This paper presents a subset sum problem (SSP) algorithm which takes the time complexity of O(nlogn). The SSP can be classified into either super-increasing sequence or random sequence depending on the element of Set S. Additive algorithm that runs in O(nlogn) has already been proposed to and utilized for the super-increasing sequence SSP, but exhaustive Brute-Force method with time complexity of O(n2ⁿ) remains as the only viable algorithm for the random sequence SSP, which is thus considered NP-complete. The proposed subtractive algorithm basically selects a subset S comprised of values lower than target value t, then sets the subset sum less the target value as the Residual r, only to remove from S the maximum value among those lower than t. When tested on various super-increasing and random sequence SSPs, the algorithm has obtained optimal solutions running less than the cardinality of S. It can therefore be used as a general algorithm for the SSP.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.3E
• /
• pp.69-73
• /
• 2007

This paper presents an efficient algorithm to retrieve similar music files from a large archive of digital music database. Users are able to navigate and discover new music files which sound similar to a given query music file by searching for the archive. Since most of the methods for finding similar music files from a large database requires on computing the distance between a given query music file and every music file in the database, they are very time-consuming procedures. By measuring the acoustic distance between the pre-classified music files with the same type of emotion, the proposed method significantly speeds up the search process and increases the precision in comparison with the brute-force method.