• Journal of the Korea Society for Simulation
• /
• v.23 no.1
• /
• pp.33-42
• /
• 2014

In this paper we analyzed the search patterns for the anti-submarine warfare (ASW) surface ships cooperating with ASW helicopters. For this purpose, we modeled evasive motion of a submarine with a probabilistic method. And maneuvers and search actions of ships and helicopters participating in the anti-submarine search mission are designed. And for each simulation scenario, the case where a ship and a helicopter searches a submarine independently according to its optimized search pattern is compared with the case where the search platforms participate in the ASW mission cooperatively. Based on the simulation results, we proposed the reconfigured search patterns that help cooperative ASW surface ships increase the total cumulative detection probability (CDP).

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.812-815
• /
• 2009

This paper discusses a searching method for special markers attached with persons in a surveillance video stream. The marker is a small plate with infrared LEDs, which is called a spatiotemporal marker because it shows a 2-D sequential pattern synchronized with video frames. The search is based on the motion vectors which is the same as one in video compression. The experiments using prototype markers show that the proposed method is practical. Though the method is applicable to a video stream independently, it can decrease total computation cost if motion vector analyses of a video compression and the proposed method is unified.

• Journal of Korea Water Resources Association
• /
• v.39 no.7 s.168
• /
• pp.593-603
• /
• 2006

The basin response to storm is regarded as nonlinearity inherently. In addition, the consistent nonlinearity of hydrologic system response to rainfall has been very tough and cumbersome to be treated analytically. The thing is that such nonlinear models have been avoided because of computational difficulties in identifying the model parameters from recorded data. The parameters of nonlinear system considered as dynamic effects in the conceptual model are optimized as the sum of errors between the observed and computed runoff is minimized. For obtaining the optimal parameters of functions, the historical data for the Bocheong watershed in the Geum river basin were tested by applying the numerical methods, such as quasi-linearization technique, Runge-Kutta procedure, and pattern-search method. The estimated runoff carried through from the storage function with dynamic effects was compared with the one of 1st-order differential equation model expressing just nonlinearity, and also done with Nash model. It was found that the 2nd-order model yields a better prediction of the hydrograph from each storm than the 1st-order model. However, the 2nd-order model was shown to be equivalent to Nash model when it comes to results. As a result, the parameters of nonlinear 2nd-order differential equation model performed from the present study provided not only a considerable physical meaning but also a applicability to Korean watersheds.

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

In Block Matching Algorithm (BMA), a search pattern has a very important affect on the search time and the output quality. In this paper, we propose the HDS( Half Diamond Search) pattern based on the cross center-biased distribution property of a motion vector. At lust, the 4 points in the above, below, left, and right around the search center is calculated to decide the point of the MBD (Minimum Block Distortion). And an above point of the MBD is checked to calculate the SAD. If the SAD is less than the previous MBD, this process is repeated. Otherwise, the left and right points of MBD are calculated to decide the points that have the MBD between two points. These processes are repeated to the predicted direction for motion estimation. Experiments show that the speedup improvement of the proposed algorithm can be up to 23% while maintaining similar image quality.

• Journal of Information Processing Systems
• /
• v.14 no.4
• /
• pp.851-876
• /
• 2018

Dynamic time warping (DTW) is the main algorithms for time series alignment. However, it is unsuitable for quasi-periodic time series. In the current situation, except the recently published the shape exchange algorithm (SEA) method and its derivatives, no other technique is able to handle alignment of this type of very complex time series. In this work, we propose a novel algorithm that combines the advantages of the SEA and the DTW methods. Our main contribution consists in the elevation of the DTW power of alignment from the lowest level (Class A, non-periodic time series) to the highest level (Class C, multiple-periods time series containing different number of periods each), according to the recent classification of time series alignment methods proposed by Boucheham (Int J Mach Learn Cybern, vol. 4, no. 5, pp. 537-550, 2013). The new method (quasi-periodic dynamic time warping [QP-DTW]) was compared to both SEA and DTW methods on electrocardiogram (ECG) time series, selected from the Massachusetts Institute of Technology - Beth Israel Hospital (MIT-BIH) public database and from the PTB Diagnostic ECG Database. Results show that the proposed algorithm is more effective than DTW and SEA in terms of alignment accuracy on both qualitative and quantitative levels. Therefore, QP-DTW would potentially be more suitable for many applications related to time series (e.g., data mining, pattern recognition, search/retrieval, motif discovery, classification, etc.).

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.7
• /
• pp.1144-1150
• /
• 2016

Short-term load forecasting is essential to the electricity pricing and stable power system operations. The conventional weekday 24-hour load forecasting algorithms consider the temperature model to forecast maximum load and minimum load. But 24-hour load pattern forecasting models do not consider temperature effects, because hourly temperature forecasts were not present until the latest date. Recently, 3 hour temperature forecast is announced, therefore hourly temperature forecasts can be produced by mathematical techniques such as various interpolation methods. In this paper, a new 24-hour load pattern forecasting method is proposed by using similar day search considering the hourly temperature. The proposed method searches similar day input data based on the anomalous weather features such as continuous temperature drop or rise, which can enhance 24-hour load pattern forecasting performance, because it uses the past days having similar hourly temperature features as input data. In order to verify the effectiveness of the proposed method, it was applied to the case study. The case study results show high accuracy of 24-hour load pattern forecasting.

• International Journal of Computer Science & Network Security
• /
• v.21 no.9
• /
• pp.339-345
• /
• 2021

The rapid development of various applications in networking system, business, medical, education, and other domains that use basic data access operations such as insert, edit, delete and search makes data structure venerable and crucial in providing an efficient method for day to day operations of those numerous applications. One of the major problems of those applications is achieving constant time to search a key from a collection. A number of different methods which attempt to achieve that have been discovered by researchers over the years with different performance behaviors. This work evaluated these methods, and found out that almost all the existing methods have non-constant time for adding and searching a key. In this work, we designed a multi-indexes hashing algorithm that handles a collision in a hash table T efficiently and achieved constant time O(1) for searching and adding a key. Our method employed two-level of hashing which uses pattern extraction h₁(key) and h₂(key). The second hash function h₂(key) is use for handling collision in T. Here, we eliminated the wasted slots in the search space T which is another problem associated with the existing methods.

• Journal of Korea Game Society
• /
• v.17 no.6
• /
• pp.153-164
• /
• 2017

In spherical panoramic images, SURF, a feature description method for planar patterns, does not work correctly due to heavy spherical distortion. Since a plane pattern is distorted in a spherical image, the pattern search and replacement in a spherical panoramic image should be treated differently from the case of the planar image. This paper proposes a planar texture replacement method, which transforms a spherical panoramic image into a cubemap panoramic image, searches a pattern using SURF, replaces a plane pattern, and then converts it into a spherical panoramic image.

• Fashion & Textile Research Journal
• /
• v.13 no.6
• /
• pp.838-847
• /
• 2011

The object of this study is as follows. First, according to the silhouette of clothes, I will search the relationship with the embroidery design. Second, I will investigate the relation of coloration about the clothes color and embroidery color. Third, I will search the relation with the image in clothes and embroidery design characteristic. The data acquisition is selected to the total 447 pictures of embroidery clothing design from the www.style.com, www.samsungdesign.net which are the related information site. The data are limited from S/S season in 2004 till F/W season in 2008 in the Paris, Milano, and New York collection. The analytical method was made through the analyze method and statistical method. First, on the relation with the clothes silhouette and embroidery design, if the satin stitch technique is utilized as the X-shaped or A-line silhouette in the one-piece and dress, the image which is elegant and feminine can be expressed. if the satin stitch technique is utilized as the H-line silhouette in jacket and court, the mannish image can be expressed. Second, the embroidery color showed up as the contrast combination of the monotone when the clothes color was the monochrome. And the embroidery color showed up as the tone in which is bright and sober when clothes color had 2 or 3 or 4. So, if the embroidery color is utilized as the similar color scheme, it will be effective. Third, if the embroidery technique of the one-piece and dress is utilized as the the satin stitch technique and the bloom and leaf motive being stylized pattern is used in the all-over and border pattern, It will be effective to express the romantic/feminine, ethnic/folklore, active, and classic image.

• The KIPS Transactions:PartD
• /
• v.16D no.1
• /
• pp.113-122
• /
• 2009

Since the traditional pattern mining methods only probe unspecified moving patterns that seem to satisfy users' requests among diverse patterns within the limited scopes of time and space, they are not applicable to problems involving the mining of optimal moving patterns, which contain complex time and space constraints, such as 1) searching the optimal path between two specific points, and 2) scheduling a path within the specified time. Therefore, in this paper, we illustrate some problems on mining the optimal moving patterns with complex time and space constraints from a vast set of historical data of numerous moving objects, and suggest a new moving pattern mining method that can be used to search patterns of an optimal moving path as a location-based service. The proposed method, which determines the optimal path(most frequently used path) using pattern frequency retrieved from historical data of moving objects between two specific points, can efficiently carry out pattern mining tasks using by space generalization at the minimum level on the moving object's location attribute in consideration of topological relationship between the object's location and spatial scope. Testing the efficiency of this algorithm was done by comparing the operation processing time with Dijkstra algorithm and $A^*$ algorithm which are generally used for searching the optimal path. As a result, although there were some differences according to heuristic weight on $A^*$ algorithm, it showed that the proposed method is more efficient than the other methods mentioned.