• 방송공학회논문지
• /
• 제12권6호
• /
• pp.624-629
• /
• 2007

While single view video coding uses the temporal prediction scheme, multi-view video coding (MVC) applies both temporal and inter-view prediction schemes. Thus, the key problem of MVC is how to reduce the inter-view redundancy efficiently, because various existing video coding schemes have already provided solutions to reduce the temporal correlation. In this paper, we propose a global disparity compensation scheme which increases the inter-view correlation and a new inter-view prediction structure based on the global disparity compensation. By experiment, we demonstrate that the proposed global disparity compensation scheme is less sensitive to change of the search range. In addition, the new Inter-view prediction structure achieved about $0.1{\sim}0.3dB$ quality improvement compared to the reference software.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.1263-1266
• /
• 1998

In this paper, we propose an optimal feature extraction method for normally distributed multiclass data. We search the whole feature space to find a set of features that give the smallest classification error for the Gaussian ML classifier. Initially, we start with an arbitrary feature vector. Assuming that the feature vector is used for classification, we compute the classification error. Then we move the feature vector slightly and compute the classification error with this vector. Finally we update the feature vector such that the classification error decreases most rapidly. This procedure is done by taking gradient. Alternatively, the initial vector can be those found by conventional feature extraction algorithms. We propose two search methods, sequential search and global search. Experiment results show that the proposed method compares favorably with the conventional feature extraction methods.

• 대한기계학회논문집A
• /
• 제22권4호
• /
• pp.811-825
• /
• 1998

An approximate line search is presented for dynamic response optimization with Augmented Lagrange Multiplier(ALM) method. This study empolys the approximate a augmented Lagrangian, which can improve the efficiency of the ALM method, while maintaining the global convergence of the ALM method. Although the approximate augmented Lagragian is composed of only the linearized cost and constraint functions, the quality of this approximation should be good since an approximate penalty term is found to have almost second-order accuracy near the optimum. Typical unconstrained optimization algorithms such as quasi-Newton and conjugate gradient methods are directly used to find exact search directions and a golden section method followed by a cubic polynomial approximation is empolyed for approximate line search since the approximate augmented Lagrangian is a nonlinear function of design variable vector. The numberical performance of the proposed approach is investigated by solving three typical dynamic response optimization problems and comparing the results with those in the literature. This comparison shows that the suggested approach is robust and efficient.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2007년도 한국지능정보시스템학회
• /
• pp.229-238
• /
• 2007

This study was intended to point out the limit of existing digital content-centered studies, or approaches from the viewpoint of the supplier and in the aspect of business profit model and find ways to assess the quality of digital content, considering the characteristics of digital content. For this, the study is to apply value innovation strategy to digital content assessment, to analyze the applicability, and to propose a new and practical framework for digital content assessment method. To this end, this study selected the global No. 1 search service provider Google and local portal site Naver search service. The study on assessment factors by value innovation strategy was based on existing literature, while user-value elements in that respect were confined to information quality, interactivity, communication, interactive storytelling, and usability. This study objectified the relation with the value innovation strategic analysis, through qualitative and quantitative analyses on value elements of search service users.

• 정보관리학회지
• /
• 제12권1호
• /
• pp.143-161
• /
• 1995

온라인 탐색전략을 탐색이라는 문제해결을 위한 보다 근본적인 문제해결접근방안이라고 정의할 때, 탐색전략은 간략탐색, 블럭절정전략, 패싯수정전략, 점진분할전략, 인용문헌확대탐색등의 범주로 구분할 수 있다. 각 탐색전략에 관한 비판적인 고찰과 함께 실제탐색환경하에서의 적용을 통해 각 전략의 응용성을 고찰하였다. 특히 재현율탐색이나 정확률탐색등의 탐색목적에 융통성있게 대응할 수 있는 탐색전략을 제안하고 있다.

• 전기학회논문지
• /
• 제59권5호
• /
• pp.866-870
• /
• 2010

This paper presents a application of Harmony Search (HS) algorithm for optimal placement of distributed generations(DGs) in distribution systems. In optimization procedure, the HS algorithm denotes the searching ability for the global optimal solution with simple coding of the iteration procedure, and shows the fast convergence characteristics for getting solutions. The HS algorithm is tested on 9 buses and 69 buses distribution systems, and the results prove its effectiveness to determine appropriate placement points of DGs and reducing amount of active power without the occurrence of any mis-determination in selection of its capacity.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
• /
• pp.609-614
• /
• 1989

A collision avoidance algorithm based on a heuristic graph search and subgoals is presented. The joint angle space is quantized into cells. The evaluation function for a heuristic search is defined by the sum of the distance between the links of a manipulator and middle planes among the obstables and the distance between the end-effector and the subgoals on desired trajectory. These subgoals reduce the combinatorial explosion in the search space. This method enables us to avoid a dead-lock in searching. Its effectiveness has been verified by simulation studies.

• 대한기계학회논문집A
• /
• 제24권5호
• /
• pp.1193-1202
• /
• 2000

The paper describes the use of genetic algorithms (GA's) to the minimum weight design of stiffened composite panels for buckling constraints. The proposed design problem is characterized by mixture of continuous and discrete design variables corresponding to panel elements and stacking sequence of laminates, respectively. Design space is multimodal and non-convex, thereby introducing the need for global search strategies. Advanced strategies in GA's such as directed crossover, multistage search and separated crossover are adopted to improve search ability and to save computational resource requirements. The paper explores the effectiveness of genetic algorithms and their advanced strategies in designing stiffened composite panels under various uniaxial compressive load conditions and the linrlit on stacking sequence of laminates.

• 한국군사과학기술학회지
• /
• 제13권1호
• /
• pp.1-8
• /
• 2010

This paper presents global and optimal solution for weapon assignment problems using the Munkres assignment algorithm. We propose a new modeling method of weapon assignment problems concerning some constraints of weapon systems. In this paper, we compares the Munkres weapon assignment algorithm with two other algorithms employing a search tree model in terms of computational complexity and performance. One is an optimal algorithm using exhausted search and the other is a greedy algorithm which selects the first search result as a solution. The experiment results show that the Munkres weapon assignment algorithm has better performance and less computational complexity in comparison with the two other algorithms.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1995년도 하계학술대회 논문집 B
• /
• pp.1006-1010
• /
• 1995

This paper describes Sexual Reproduction Genetic Algorithm(SRGA) for function optimization. In SRGA, each individual utilize a diploid chromosome structure. Sex cells(gametes) are produced through artificial meiosis in which crossover and mutation occur. The proposed method has two selection operators, one, individual selection which selects the individual to fertilize, and the other, gamete selection which makes zygote for offspring production. We consider the effects of multi-selection and diploidy on search performance. SRGA improves local and global search(exploitation and exploration) and show optimum tracking performance in nonstationary environments. Gray coding is incorporated to transforming the search space and Genic uniform distribution method is proposed to alleviate the problem of premature convergence.