• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1879-1882
• /
• 2003

본 논문은 확률적 확산 기법 및 확률모델을 이용하여 스테레오 영상간의 대응점을 추정하고, 영상의 배경으로부터 객체를 추출해 내는 연구를 다루고 있다. 스테레오 영상의 정합 및 객체 추출을 위하여 시차, 세그먼트, 라인, 및 오클루젼 필드를 Markov random field 모델로 정의하고, 확률적 에너지 최소화 방법을 이용하여 최적의 시차 필드 및 객체추출을 수행한다. 본 논문에서는 우선 이러한 다양한 필드간의 MRF 모델링 기법을 제안하고, 각 필드에 대한 에너지 함수를 정의한다. 그리고, 확률적 확산 기법을 이용하여 각 필드에 대하여 정의된 에너지 함수를 최소화함으로써, 최적의 시차필드 및 객체추출 결과를 구한다.

• The Journal of the Acoustical Society of Korea
• /
• v.32 no.5
• /
• pp.415-422
• /
• 2013

This paper proposes a robust binary audio fingerprinting method by minimizing hinge-loss function. In the proposed method, the type of fingerprints is binary, which is conducive in reducing the size of fingerprint DB. In general, the binarization of features for fingerprinting deteriorates the performance of fingerprinting system, such as robustness and discriminability. Thus it is necessary to minimize such performance loss. Since the similarity between two audio clips is represented by a hinge-like function, we propose a method to derive a binary fingerprinting by minimizing a hinge-loss function. The derived hinge-loss function is minimized by using the minimal loss hashing. Experiments over thousands of songs demonstrate that the identification performance of binary fingerprinting can be improved by minimizing the proposed hinge loss function.

• Journal of Korean Society of Steel Construction
• /
• v.18 no.2
• /
• pp.213-223
• /
• 2006

Conventional truss optimization approaches, while often sophisticated and computationally intensive, have been applied to simple, minimum weight-cost models. These approaches do not perform well when applied to real-world trusses, which have costmodels that are complex and which often involve multiple objectives. Thus, this paper describes the optimization strategies that a clustering technique, which identifies members that are likely to have the same product type, uses for the optimal design of truss structures with real- world cost functions that consider the costs on the weight of the truss, the number of products in the design, the number of joints in the structures, and the costs required in the site.At first, the clustering technique is applied to identify the members and to generate a proper initial solution. A simple taboo search technique is then used, which attempts to generate the optimal solution by starting with the solution from the previous technique. For example, the proposed approach is a plied to a typical problem and to a problem similar to relative performances. The results show that this algorithm generates not only better-quality solutions but also more efficient ones

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.14 no.3
• /
• pp.381-390
• /
• 2001

In this paper, a new improved crack analysis technique by Element-Free Galerkin(EFG) method is proposed, in which the singularity and the discontinuity of the crack successfully described by adding enrichment terms containing a singular basis function to the standard EFG approximation and a discontinuity function implemented in constructing the shape function across the crack surface. The standard EFG method requires considerable addition of nodes or modification of the model. In addition, the proposed method significantly decreases the size of system of equation compared to the previous enriched EFG method by using localized enrichment region near the crack tip. Numerical example show the improvement and th effectiveness of the previous method.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.7
• /
• pp.21-28
• /
• 2017

Practical models for FPGA architectures which include performance- and/or density-enhancing components such as carry chains, wide function multiplexers, and memory/multiplier blocks are being applied to academic FPGA placement tools which used to rely on simple imaginary models. Previously the techniques such as pre-packing and multi-layer density analysis are proposed to remedy issues related to such practical models, and the wire length is effectively minimized during initial analytic placement. Since timing should be optimized rather than wire length, most previous work takes into account the timing constraints. However, instead of the initial analytic placement, the timing-driven techniques are mostly applied to subsequent steps such as placement legalization and iterative improvement. This paper incorporates the timing driven techniques, which check if the placement meets the timing constraints given in the standard SDC format, and minimize the detected violations, with the existing analytic placer which implements pre-packing and multi-layer density analysis. First of all, a static timing analyzer has been used to check the timing of the wire-length minimized placement results. In order to minimize the detected violations, a function to minimize the largest arrival time at end points is added to the objective function of the analytic placer. Since each clock has a different period, the function is proposed to be evaluated for each clock, and added to the objective function. Since this function can unnecessarily reduce the unviolated paths, a new function which calculates and minimizes the largest negative slack at end points is also proposed, and compared. Since the existing legalization which is non-timing driven is used before the timing analysis, any improvement on timing is entirely due to the functions added to the objective function. The experiments on twelve industrial examples show that the minimum arrival time function improves the worst negative slack by 15% on average whereas the minimum worst negative slack function improves the negative slacks by additional 6% on average.

• Journal of KIISE:Software and Applications
• /
• v.31 no.11
• /
• pp.1474-1482
• /
• 2004

In this paper, we propose an approach for extracting and filtering block motion vectors using an adaptive weight function. We first extract motion vectors from a sequence of images by using size-varibale block matching and then process them by adaptive robust estimation to filter out outliers (motion vectors out of concern). The proposed adaptive robust estimation defines a continuous sigmoid weight function. It then adaptively tunes the sigmoid function to its hard-limit as the residual errors between the model and input data are decreased, so that we can effectively separate non-outliers (motion vectors of concern) from outliers with the finally tuned hard-limit of the weight function. The experimental results show that the suggested approach is very effective in filtering block motion vectors.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.38 no.4
• /
• pp.53-62
• /
• 1996

작물의 최대 수확을 위한 관개계획은 작물의 수분장력 스트래스와 삼투스트래스를 최소화 시킬 수 있도록 언제 얼마의 물을 어떤 속도로 공급해 줄 것인가를 결정하는 것이다. 이는 토양, 작물 및 대기의 여러 가지 요소를 측정하여 결정할 수 있다. 관개속도는 주로 토양의 투수계수에 의하여 결정되지만 관개시간과 양은 토양함수량과 경우에 따라서는 토양염도에 의하여 결정된다. Time Domain Reflectometry (TDR)는 한 개의 탐침으로 토양 함수량과 토양염도를 동시에 측정하는 새로운 기법이다. TDR의 측정원리와 상업용 TDR장비에 대하여 자세히 설명하였다. TDR 탐침의 간격, 직경 및 길이의 제한요소를 토양함수량과 전기전도도의 함수로 나타내었다. 토양 columm 및 현장에서의 TDR 전극 삽입과 케이블테스터의 신속한 분리기법과 토양층에 TDR 탐침을 영구히 설치하는 기법에 대하여 자세히 설명하였다.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.5
• /
• pp.262-270
• /
• 2005

In this paper, a new temporal decomposition method is proposed. where not oniy distortion but also entropy are involved in segmentation. The interpolation functions and the target feature vectors are determined by a dynamic Programing technique. where both distortion and entropy are simultaneously minimized. The interpolation functions are built by using a training speech corpus. An iterative method. where segmentation and estimation are iteratively performed. finds the locally optimum Points in the sense of minimizing both distortion and entropy. Simulation results -3how that in terms of both distortion and entropy. the Proposed temporal decomposition method Produced superior results to the conventional split vector-quantization method which is widely employed in the current speech coding methods. According to the results from the subjective listening test, the Proposed method reveals superior Performance in terms of qualify. comparing to the Previous vector quantization method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.05a
• /
• pp.215-218
• /
• 2002

본 논문에서는 타원형 클러스터링을 위한 거리측정 함수로써 변형된 가무시안 커널 함수를 사용하며, 주어진 클러스터링 문제를 각 타원형 클러스터의 체적을 최소화하는 문제로 해석하고 이를 선형행렬 부등식 기법 중 하나인 고유값 문제로 변환하여 최적화하는 새로운 알고리즘을 제안한다.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.478-478
• /
• 2004