• 한국정보통신학회논문지
• /
• 제18권7호
• /
• pp.1663-1670
• /
• 2014

초경량 비디오 부호화기에 대한 이론적인 근거를 제공하는 분산 비디오 부호화기법에 대한 연구가 활발히 진행되어 왔다. 그러나 기존에 많이 연구되어온 분산 비디오 부호화기법은 기존의 국제 표준의 비디오 부호화기에 비해 성능이 우수하지 못한 특징을 갖는다. 이러한 성능 제한을 극복하기 위해 복호기에서 보조정보를 생성하는 과정에서 얻어지는 정보를 이용하여 피드백하는 채널 분리형 분산 비디오 부호화기법에 대한 연구가 수행되었다. 본 논문에서는 복호기에서 보조정보를 생성하는 과정에서 적응적 가중치 기반의 움직임 보상 보간을 수행하고, 보상된 블록의 움직임 벡터 및 정합 특성을 분석하여 채널 분리하는 방법을 도입함으로써 효과적으로 채널을 구성 방안을 제안한다. 다수의 실험을 통하여 제안한 방법은 기존방식에 비해 낮은 비트율에서 우수한 성능을 보임과 동시에 일정한 화질을 제공할 수 있음을 보인다.

• 대한전자공학회논문지SP
• /
• 제38권1호
• /
• pp.54-68
• /
• 2001

본 논문은 2D 영상에서 겹쳐진 물체를 분리하기 위한 새로운 기법을 제안한다. 제안된 알고리즘은 겹쳐진 물체를 분리하는 보편적인 기법으로서의 매칭 알고리즘이 가지는 계산상의 부담을 줄이고자 하였다. 영상에서의 물체의 표현은 attributed graph를 사용하며, 각 node와 arc는 물체의 면과 면간의 관계에 각각 대응시킨다 또한, 각 arc는 그 parameter로서 관계계수를 가지며 이는 arc를 중심으로 양 끝에 존재하는 임의의 node의 상대 node에 대한 가려짐 상태에 의해 정의된다. 각 node는 이웃 node와의 관계에 의해 다양한 패턴으로 분류되며, 제안된 패턴을 이용하여 node들의 homogeneity를 검사한다. 끝으로, Homogeneity를 만족하는 node들을 하나의 집합(node set)으로 grouping함으로써, 가려진 물체와 가리는 물체를 분리하게 된다. 본 논문에서 제안한 알고리즘은 임의의 형태로 놓여있는 겹쳐진 물체를 효율적으로 분리하고 있으며, 매칭단계 이전에 물체를 분리함으로써 매칭에 필요한 시간부담을 크게 줄일 수 있음을 실험을 통해 보여주고 있다.

• 한국인쇄학회지
• /
• 제2권1호
• /
• pp.1-21
• /
• 1984

Reproduced colors which are half-tone dot printed at the rate of 10, 20, 30, 100% half-tone dot area by each process ink-cyan, magenta and yellow ant at the rate of 10, 20, 30, 100% by the mean color mixing of black, cyan, magenta and yellow, are colorimetric analyzed by make use of the 1931 CIE XYZ system of color specification and matching the Munsell color system. With increased half-tone areas, 1. Yellow has ideal reflectance curve, but magneta has nonideal reflectance curve. 2. Yellow and cyan have almost standard dominant wavelengths but magenta has complementary wavelengths. 3. Yellow has higher excitation purities in primary colors, but low excitation purities in secondary and third colors. 4. Value function is decreased and generally the range of value function in chromaticity diafgram is extented. 5. The properties of black and CMY printed materials have not equality, therefore black process ink is necessery in half-tone printing process.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1992년도 하계학술대회 논문집 A
• /
• pp.282-284
• /
• 1992

In this paper, we deal with design method of two-degree-of-freedom control system which desired property of robustness and tracking can be achieved simultaneously, Controller is designed by means of model matching method and H$\infty$ weighted sensitivity minimization design method. Satisfactory result of design example is obtained by simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권5호
• /
• pp.2171-2185
• /
• 2020

In order to judge that whether the vehicles in different images which are captured by surveillance cameras represent the same vehicle or not, we proposed a novel vehicle face recognition algorithm based on improved Nonnegative Matrix Factorization (NMF), different from traditional vehicle recognition algorithms, there are fewer effective features in vehicle face image than in whole vehicle image in general, which brings certain difficulty to recognition. The innovations mainly include the following two aspects: 1) we proposed a novel idea that the vehicle type can be determined by a few key regions of the vehicle face such as logo, grille and so on; 2) Through adding weight, sparseness and classification property constraints to the NMF model, we can acquire the effective feature bases that represent the key regions of vehicle face image. Experimental results show that the proposed algorithm not only achieve a high correct recognition rate, but also has a strong robustness to some non-cooperative factors such as illumination variation.

• 전자공학회논문지A
• /
• 제31A권7호
• /
• pp.117-124
• /
• 1994

In this pape, we propose a graph-theoretic approach for solving the allocation problem for the synthesis of datapaths based on multiport memories. An efficient algorithm is devised by using the weighted bipartite matching algorithm to assign variables to each port of memory modules. The proposed algorithm assigns program variables into a minimum number of multiport memory modules such that usage of memory elements and interconnection cost can be kept minimal. Experimental results show that the proposed algorithm generates the datapaths with fewer registers in memory modules and less interconnection cost for several benchmarks available from the literatures.

• 한국컴퓨터정보학회논문지
• /
• 제21권7호
• /
• pp.47-52
• /
• 2016

This paper introduces an algorithm to construct an Eulerian cycle for Chinese postman problem. The Eulerian cycle is formed only when all vertices in the graph have an even degree. Among available algorithms to the Eulerian cycle problem, Edmonds-Johnson's stands out as the most efficient of its kind. This algorithm constructs a complete graph composed of shortest path between odd-degree vertices and derives the Eulerian cycle through minimum-weight complete matching method, thus running in $O({\mid}V{\mid}^3)$. On the contrary, the algorithm proposed in this paper selects minimum weight edge from edges incidental to each vertex and derives the minimum spanning tree (MST) so as to finally obtain the shortest-path edge of odd-degree vertices. The algorithm not only runs in simple linear time complexity $O({\mid}V{\mid}log{\mid}V{\mid})$ but also obtains the optimal Eulerian cycle, as the implementation results on 4 different graphs concur.

• 융합신호처리학회논문지
• /
• 제12권4호
• /
• pp.228-236
• /
• 2011

Emotion recognition plays an important role in the research area of human-computer interaction, and it allows a more natural and more human-like communication between humans and computer. Most of previous work on emotion recognition focused on extracting emotions from face, speech or EEG information separately. Therefore, a novel approach is presented in this paper, including face, speech and EEG, to recognize the human emotion. The individual matching scores obtained from face, speech, and EEG are combined using a weighted-summation operation, and the fused-score is utilized to classify the human emotion. In the experiment results, the proposed approach gives an improvement of more than 18.64% when compared to the most successful unimodal approach, and also provides better performance compared to approaches integrating two modalities each other. From these results, we confirmed that the proposed approach achieved a significant performance improvement and the proposed method was very effective.

• 로봇학회논문지
• /
• 제6권3호
• /
• pp.292-300
• /
• 2011

Global positioning system (GPS) is widely used to measure the position of a vehicle. However, the accuracy of the GPS can be severely affected by surrounding environmental conditions. To deal with this problem, the GPS and odometry data can be combined using an extended Kalman filter. For stable navigation of an outdoor mobile robot using the GPS, this paper proposes two methods to evaluate the reliability of the GPS data. The first method is to calculate the standard deviation of the GPS data and reflect it to deal with the uncertainty of the GPS data. The second method is to match the GPS data to the traversability map which can be obtained by classifying outdoor terrain data. By matching of the GPS data with the traversability map, we can determine whether to use the GPS data or not. The experimental results show that the proposed methods can enhance the performance of the GPS-based outdoor localization.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2004년도 춘계학술발표대회
• /
• pp.777-780
• /
• 2004

본 논문은 여러 개체의 생물체 궤적을 효과적으로 추적하기 위해 Hungarian Algorithm을 이용한다. 생물체 궤적 정보와 생물체의 좌표 정보로 Weighted bipartite graph를 구성한다. weight는 궤적 정보와 좌표 정보의 거리, 속도, 각도를 비교하여 계산한다. 구성된 graph를 Hungarian Algorithm로 계산하여 가장 효율적인 matching이 이루어지도록 한다. 실제 생물체를 관찰하고 얻어진 데이터를 이용하여 실험을 하고, 제안한 방법의 효율성을 검증한다.