• The Journal of the Convergence on Culture Technology
• /
• v.4 no.4
• /
• pp.355-360
• /
• 2018

We propose a method to connect partial image in whole image to partial image in whole image of other internet site. For this study, we have developed four partial image generation methods and retrieval methods. A method of 'image segmentation' that cuts out only partial images that want to provide information from the whole image, a method of 'creating an image block' that finds outermost points of a cut-out partial image, a method of 'Stamp transformation of outer points', which connects outer points and registers them as the most similar image stamp, and a retrieval method that connects image stamps with other image stamps are developed. We suggested a image search UI that can use image stamps in various ways.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.295-298
• /
• 2002

This paper presents a fast block-matching algorithm to improve the conventional Three-Step Search (TSS) based method. The proposed Comparison Fast Block Matching Algorithm (CFBMA) begins with DAB for adaptive search range to choose searching method, and searches a part of search window that has high possibility of motion vector like other partial search algorithms. The CFBMA also considers the opposite direction to reduce local minimum, which is ignored in almost conventional based partial search algorithms. CFBMA uses the summation half-stop technique to reduce the computational load. Experimental results show that the proposed algorithm achieves the high computational complexity compression effect and very close or better image quality compared with TSS, SES, NTSS based partial search algorithms.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.2 s.332
• /
• pp.83-88
• /
• 2005

We propose the design method for the VLSI architecture of FNNPDS combined PDS(partial distance search) and FNNS(fast nearest neighbor search), which are used to fast encoding in vector quantization, and obtain the results that FNNPDS(fast nearest neighbor partial distance search) is faster method than the conventional methods by simulation. In simulations, we investigate timing diagrams described searching time of the nearest codevector for an input vector, and compare the average clock cycles per input vector for Lena and Peppers images. According to the result of simulations, the number of the clock cycle of FNNPDS was reduced to $79.2\%\~11.7\%$ as compared with the number using the conventional techniques.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2287-2290
• /
• 2003

In this paper, an image vector quantization method is proposed not only to improve the compression ratio but also to reduce the computation cost. The proposed method could save the computation cost of codebook generation and encoding by using the modified LBG algorithm of Partial Search Partial Distortion (PSPD) in wavelet domain, by which the code book was constructed together with the partial codebook search, the partial code vector elements, and the interruption criterion. We have designed and implemented the vector quantizer to verify the improvement in reducing compression ratio in encoding processing and reducing the computation cost.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.12
• /
• pp.8455-8461
• /
• 2015

In this paper, we propose new search algorithms using SVD(Singular Value Decomposition) for fast search of Raman spectrum. In the proposed algorithms, small number of the eigen vectors obtained by SVD are chosen in accordance with their respective significance to achieve computation reduction. By introducing pilot test, we exclude large number of data from search and then, we apply partial distance search(PDS) for further computation reduction. We prepared 14,032 kinds of chemical Raman spectrum as the library for comparisons. Experiments were carried out with 7 methods, that is Full Search, PDS, 1DMPS modified MPS for applying to 1-dimensional space data with PDS(1DMPS+PDS), 1DMPS with PDS by using descending sorted variance of data(1DMPS Sort with Variance+PDS), 250-dimensional components of the SVD with PDS(250SVD+PDS) and proposed algorithms, PSP and PSSP. For exact comparison of computations, we compared the number of multiplications and additions required for each method. According to the experiments, PSSP algorithm shows 64.8% computation reduction when compared with 250SVD+PDS while PSP shows 157% computation reduction.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.5
• /
• pp.25-32
• /
• 2011

In this paper, we propose a subspace search-based detector (SSD) with low-complexity to achieve near optimal performance for multiple-input multiple-output systems. As an effective solution to reduce the prohibitive computational complexity of the optimal maximum likelihood detector, a partial candidate symbol vector is generated through a partitioned search space but not the entire search space. In addition, based on a partial candidate symbol vector, an ensemble candidate symbol vector generation considering the whole search space is introduced to produce a near optimal solution. As a result, the proposed SSD achieves near-maximum-likelihood performance while having a significantly reduced computational complexity.

• ETRI Journal
• /
• v.45 no.3
• /
• pp.418-432
• /
• 2023

In this work, we proposed a low-complexity hybrid layered tabu-likelihood ascent search (LTLAS) algorithm for large multiple-input multiple-output (MIMO) system. The conventional layered tabu search (LTS) approach involves many partial reactive tabu searches (RTSs), and each RTS requires an initialization and searching phase. In the proposed algorithm, we restricted the upper limit of the number of RTS operations. Once RTS operations exceed the limit, RTS will be replaced by low-complexity likelihood ascent search (LAS) operations. The block-based detection approach is considered to maintain a higher signal-to-noise ratio (SNR) detection performance. An efficient precomputation technique is derived, which can suppress redundant computations. The simulation results show that the bit error rate (BER) performance of the proposed detection method is close to the conventional LTS method. The complexity analysis shows that the proposed method has significantly lower computational complexity than conventional methods. Also, the proposed method can reduce almost 50% of real operations to achieve a BER of 10^-3.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.65-68
• /
• 2000

This paper describes an approach for extracting invariant features using a view-based representation and recognizing an object with a high speed search method in FLIR. In this paper, we use a reformulated eigenspace technique based on robust estimation for extracting features which are robust for outlier such as noise and clutter. After extracting feature, we recognize an object using a partial distance search method for calculating Euclidean distance. The experimental results show that the proposed method achieves the improvement of recognition rate compared with standard PCA.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.27 no.3
• /
• pp.200-205
• /
• 2022

This paper presents an improved maximum power point tracking method that can fast track the global maximum power point (GMPP) for a photovoltaic system under partial shading conditions. The proposed method combines the advantages of the maximum power trapezium (MPT) method and the search-skip-judge method to minimize the tracking voltage intervals. Thus, the proposed method can quickly track the GMPP by skipping unnecessary tracking voltage intervals. The superiority of the proposed method is verified through simulation results in the MATLAB/Simulink and experimental real-time operation results with the hardware-in-the-loop simulation. The simulation and experimental results demonstrated that the proposed method has a faster tracking time than the MPT method under various partial shading conditions.

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

When there are numerous wireless communication systems co-existing in the limited available frequency resource, an unexpected time delay can be caused during the system switching. So, in order to reduce this time delay, a mode selection method is required. In this paper, we propose a mode selection method to minimize the time delay for multi-system wireless communication systems. For the sake of efficiency, the mode selection method is designed by analyzing the preamble characteristics of different standards. Instead of performing a full search, we propose the preamble partial search to reduce the time delay to a minimum. Simulated with Matlab in an additive white Gaussian noise(AWGN) environment with a signal to noise ratio(SNR) of 10dB and bit error rate(BER) of $10^{-6}$, we evaluated and showed the performance improvement gained by using our proposed mode selection method.