• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.269-280
• /
• 2004

The Pyramid-Technique is based on mapping n-dimensional space data into one-dimensional data and expresses it as a B+-tree. By solving the problem of search time complexity the pyramid technique also prevents the effect of "phenomenon of dimensional curse" which is caused by treatment of hypercube range query in n-dimensional data space. The SPY-TEC applies the space division strategy in pyramid method and uses spherical range query suitable for similarity search so that Improves the search performance. However, nearest neighbor query is more efficient than range query because it is difficult to specify range in similarity search. Previously proposed index methods perform well only in the specific distribution of data. In this paper, we propose an efficient searching technique for nearest neighbor object using PdR-Tree suggested to improve the search performance for high dimensional data such as multimedia data. Test results, which uses simulation data with various distribution as well as real data, demonstrate that PdR-Tree surpasses both the Pyramid-Technique and SPY-TEC in views of search performance.rformance.

• 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 Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.6
• /
• pp.1425-1429
• /
• 1996

A conventional sequence search algorithm for PRI analysis occurs the harmonic problem under missing pulses. An improved PRI analysis algorithm is proposedto remedy the harmonic problem. After dividing an overall PRI range into subbands withoug harmonic, a sequence search is done into forward and backward in time. The proposed algorithm increases the preformance compared with that of conventional sequence search algorithm.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.5
• /
• pp.323-330
• /
• 2004

In this paper, we propose a design method of PID controller using an improved Tabu Search. Tabu Search is improved by neighbor solution creation using Gaussian random distribution and generalized Hermite Biehler Theorem for stable bounds. The range of admissible proportional gains are determined first in closed form. Next the optimal PID gains are selected by improved Tabu Search. The results of Computer simulations represent that the proposed Tabu Search algorithm shows a fast convergence speed and a good control performance.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.3
• /
• pp.74-79
• /
• 2008

In an H.264/AVC video encoder, the motion estimation at fractional pixel accuracy improves a coding efficiency and image quality. However, it requires additional computation overheads for fractional search and interpolation, and thus, reducing the computation complexity of fractional search becomes more important. This paper proposes fast fractional search algorithms by combining the SASR(Simplified Adaptive Search Range) and the MSDSP(Mixed Small Diamond Search Pattern) with the predicted fractional motion vector. Compared with the full search and the prediction-based directional fractional pixel search, the proposed algorithms can reduce up to 93.2% and 81% of fractional search points, respectively with the maximum PSNR lost less than 0.04dB. Therefore, the proposed fast search algorithms are quite suitable for mobile applications requiring low power and complexity.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.803-804
• /
• 2008

In this paper, we propose an edge dependent interpolation (EDI) method based on adaptive search range. The proposed EDI method uses the vector matching to determine the edge direction, and the vector matching process is terminated when the previous sum of absolute difference (SAD) is smaller than the next one. The adaptive search range method enables the EDI algorithm to estimate edge direction more accurately and to reduce the computational complexity. The experimental results show that the proposed method produces better performance than conventional algorithms.

• Journal of Korea Multimedia Society
• /
• v.21 no.1
• /
• pp.18-25
• /
• 2018

In High Efficiency Video Coding (HEVC), integer motion estimation (IME) requires a large amount of computational complexity because HEVC adopts the high flexible and hierarchical coding structures. In order to reduce the computational complexity of IME, this paper proposes the search range reduction algorithm, which takes advantage of motion vectors similarity between different layers. It needs only a few modification for HEVC reference software. Based on the experimental results, the proposed algorithm reduces the processing time of IME by 28.1% on average, whereas its the $Bj{\emptyset}ntegaard$ delta bitrate (BD-BR) increase is 0.15% which is negligible.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2C
• /
• pp.141-146
• /
• 2003

In this paper, we propose an adaptive search range decision algorithm for motion vector estimation in video coding. The performance of general motion estimation method in video coding mechanism is evaluated with respect to the motion vector accuracy and the complexity, which is trade-off. The proposed algorithm that plays as a role of pre-processing for motion vector estimation determines the motion search range by the local statistics of motion vector of neighboring blocks, resulting in more than 60(%) reduction of the computational cost without the loss of visual quality. Experimental results show the capability of the proposed algorithm.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.294-297
• /
• 2005

Time series are comprehensively appeared and developed in many applications, ranging from science and technology to business and entertainrilent. Similarity search under time warping has attracted much interest between the time series in the large sequence databases. DTW (Dynamic Time Warping) is a robust distance measure and is superior to Euclidean distance for time series, allowing similarity matching although one of the sequences can elastic shift along the time axis. Nevertheless, it is more unfortunate that DTW has a quadratic time. Simultaneously the false dismissals are come forth since DTW distance does not satisfy the triangular inequality. In this paper, we propose an efficient range query algorithmbased on a new similarity search method under time warping. When our range query applies for this method, it can remove the significant non-qualify time series as early as possible before computing the accuracy DTW distance. Hence, it speeds up the calculation time and reduces the number of scanning the time series. Guaranteeing no false dismissals, the lower bounding function is advised that consistently underestimate the DTW distance and satisfy the triangular inequality. Through the experimental result, our range query algorithm outperforms the existing others.

• Journal of Information Technology Services
• /
• v.15 no.1
• /
• pp.19-37
• /
• 2016

Advance of the Internet environment is applied not only to information search but also to the area of consumption behavior. Current research analyzes online use behavior and online information search of consumers in terms of users' perception. With the result of the research, it is noticed that promotion focus brings broader variation of information use behavior, and utilitarian value has a beneficial impact on the online exploratory information search. In addition, it is revealed that the more exploratory the information search is, the wider the range of online shopping information search is. Finally, people who have utilitarian shopping value showed more exploratory behavior in online search, especially for the search of informational products, than those who have hedonic shopping value. Present research is believed to improve practical influence of consumers' personality on online use behavior when customers purchase search products online. As a result, it would contribute to consumer research and marketing held online.