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

This paper is studied the improvement of performance for moving picture encoder using H.263. This is used the new motion vector search algorithm using a relation with neighborhood search point and is applied the integer DCT for the encoder. The integer DCT behaves DCT by the addition operation of the integer using WHT and a integer lifting than conventional DCT that needs the multiplication operation of a floating point number. Therefore, the integer Dn can reduce the operation amount than basis DCT with having an equal PSNR. The new motion vector search algorithm is showed almost similar PSNR as reducing the operation amount than the conventional motion vector search algorithm. To experiment a compatibility of the integer DCT and the conventional DCT, according to result compare case that uses a method only and case that uses the alternate two methods of the integer DCT or the conventional DCT to H.263 encoder and decoder, case that uses the alternate two methods is showed doing not deteriorate PSNR-and being each other compatible visually than case that uses an equal method only.

• Architectural research
• /
• v.15 no.4
• /
• pp.207-214
• /
• 2013

A form-finding technique is proposed for three-dimensional spatial structures. Two-step discrete finite element (FE) mesh generator based on computer aided geometric design (CAGD) is introduced and used to control the shape of three-dimensional spatial structures. Mathematical programming technique is adopted to search new forms (or shapes) of spatial structures. For this purpose, the strain energy is introduced as the objective function to be minimized and the initial volume (or the initial weight) is considered as constraint function. Numerical examples are carried out to test the capability of the proposed form-finding techniques and provided as benchmark tests.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.5 no.2
• /
• pp.87-97
• /
• 1999

This study is concerned with developing a hybrid heuristic algorithm for solving the redundancy optimization problem which is very important in system safety, This study develops a HH(Hybrid Heuristic) method combined with two strategies to alleviate the risks of being trapped at a local optimum. One of them is to construct the populations of the initial solutions randomly. The other is the additional search with SA(Simulated Annealing) method in final step. Computational results indicate that HH performs consistently better than the KY method proposed in Kim[8]. Therefore, the proposed HH is believed to an attractive to other heuristic methods.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.9
• /
• pp.1420-1427
• /
• 1989

A new block matching algorithm that improved the existing block matching algorithm in terms of image quality is proposed in this paper. The subblock of image including the vertical edge of object is subdivided into new two subblocks, and the moving vector found. The result of computer simulation shows on real image that the image quality by the algorithm becomes higher than that of the three step search algorithm by 1.1dB.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.2052-2067
• /
• 2011

Complementary trees are two spanning trees rooted at the sink node satisfying that any source node's two paths to the sink node on the two trees are node-disjoint. Complementary trees routing strategy is a special node-disjoint multi-path routing approach. Several complementary trees routing algorithms have been proposed, in which path discovery methods based on depth first search (DFS) or Dijkstra's algorithm are used to find a path for augmentation in each round of path augmentation step. In this paper, a novel path discovery method based on multi-tree-growing (MTG) is presented for the first time to our knowledge. Based on this path discovery method, a complementary trees routing algorithm is developed with objectives of low average path length on both spanning trees and low complexity. Measures are employed in our complementary trees routing algorithm to add a path with nodes near to the sink node in each round of path augmentation step. The simulation results demonstrate that our complementary trees routing algorithm can achieve low average path length on both spanning trees with low running time, suitable for wireless sensor networks in industrial scenarios.

• Journal of Korea Multimedia Society
• /
• v.22 no.6
• /
• pp.639-645
• /
• 2019

This paper proposes a salient chromagram components extraction method based on the temporal discrete cosine transform of a chromagram block to improve cover song retrieval accuracy. The proposed salient chromagram emphasizes tonal contents of music, which are well-preserved between an original song and its cover version, while reducing the effects of timbre difference. We apply the proposed salient chromagram extraction method as a preprocessing step for the Fourier-transform based cover song matching. Experiments on two cover song datasets confirm that the proposed salient chromagram improves the cover song search accuracy.

• Journal of Communications and Networks
• /
• v.2 no.1
• /
• pp.58-68
• /
• 2000

In this paper we introduce the correlation-aided distributed sample acquisition (CDSA) scheme for fast cell search in IMT-2000 W-CDMA cellular system. The proposed scheme incorporates the state symbol correlation process into the comparison-correction based synchronization process of the original DSA scheme to enable fast acquisition even under very poor channel environment. for its realization, each mobile station (MS) has to store in its memory a set of state sample sequences. which are determined by the long-period scrambling sequences used in the system and the sampling interval of the state samples. CDSA based cell search is carried out in two stages : First, the MS first acquires the slot timing by using the primary synch code (PSC) and then identifies the igniter code which conveys the state samples of the current cell . Secondly. the MS identifies the scrambling code and frame timing by taking the comparison-correction based synchronization approach and, if the identification is not done satisfactorily within preset time. it initiates the state symbol correlation process which correlates the received symbol sequence with the pre-stored state sample sequences for a successful identification. As the state symbol SNR is relatively high. the state symbol correlation process enables reliable synchronization even in very low chip-SNR environment. Simulation results show that the proposed CDSA scheme outperforms the 3GPP 3-step approach, requiring the signal power of about 7 dB less for achieving the same acquisition time performance in low-SNR environments. Furthermore, it turns out very robust in the typical synchronization environment where large frequency offset exists.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.214-217
• /
• 2000

Many researches have been performed for human recognition and coding schemes recently. For this situation, we propose an automatic facial feature extraction algorithm. There are two main steps: the face region evaluation from original background image such as office, and the facial feature extraction from the evaluated face region. In the face evaluation, Genetic Algorithm is adopted to search face region in background easily such as office and household in the first step, and Template Matching Method is used to extract the facial feature in the second step. We can extract facial feature more fast and exact by using over the proposed Algorithm.

• Tribology and Lubricants
• /
• v.11 no.2
• /
• pp.15-23
• /
• 1995

A zero-load slider is composed of two outside rails which produce a lift force pushing up the slider from the disk surface and a wide reverse step region which produces a suction force attracting the slider to the disk surface. In this paper, the flying characteristics of zero-load sliders are obtained by using an optimization technique. In the pressure calculation module, the FIFD scheme is used to solve the modified Reynolds equation. The BFGS method and a line search algorithm is employed to predict the static flying attitude. To investigate the effect of the geometric- parameters of zero-load sliders on the flying characteristics, recess depth, front step width, rail width, and taper height are varied and the corresponding flying attitudes are obtained. Simulation results demonstrate that recess depth and rail width have significant influences on the flying characteristics.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.8
• /
• pp.1426-1435
• /
• 2003

Design goal is to find the one that has the highest probability of success and the smallest variation. A robustness index has been proposed to satisfy these conditions. The two-step optimization process of the target problem requires a scaling factor. The search process of a scaling factor is replaced with the making of the decoupled design between the mean and the standard deviation. The decoupled design matrix is formed from the sensitivity or the sum of squares. After establishing the design matrix, the robust design process has a new three-step one. The first is ″reduce variability,″ the second is ″make the candidate designs that satisfy constraints and move the mean on the target,″ and the final is ″select the best robust design using the proposed robustness index.″ The robust design process is verified by three examples and the results using the robustness index are compared with those of other indices.