• 한국멀티미디어학회논문지
• /
• 제25권10호
• /
• pp.1375-1385
• /
• 2022

In this paper, we propose a semi-supervised domain adaptation solution to deal with practical face recognition (FR) scenarios where a single face image for each target identity (to be recognized) is only available in the training phase. Main goal of the proposed method is to reduce the discrepancy between the target and the source domain face images, which ultimately improves FR performances. The proposed method is based on the Domain Adatation network (DAN) using an MMD loss function to reduce the discrepancy between domains. In order to train more effectively, we develop a novel loss function learning strategy in which MMD loss and cross-entropy loss functions are adopted by using different weights according to the progress of each epoch during the learning. The proposed weight adoptation focuses on the training of the source domain in the initial learning phase to learn facial feature information such as eyes, nose, and mouth. After the initial learning is completed, the resulting feature information is used to training a deep network using the target domain images. To evaluate the effectiveness of the proposed method, FR performances were evaluated with pretrained model trained only with CASIA-webface (source images) and fine-tuned model trained only with FERET's gallery (target images) under the same FR scenarios. The experimental results showed that the proposed semi-supervised domain adaptation can be improved by 24.78% compared to the pre-trained model and 28.42% compared to the fine-tuned model. In addition, the proposed method outperformed other state-of-the-arts domain adaptation approaches by 9.41%.

• Journal of Information Processing Systems
• /
• 제15권6호
• /
• pp.1472-1488
• /
• 2019

Critical elements in the China's Lunar Exploration reside in that the lunar rover travels over the surrounding undetermined environment and it conducts scientific exploration under the ground control via teleoperation system. Such an interplanetary transportation mission teleoperation system belongs to the ground application system in deep space mission, which performs terrain reconstruction, visual positioning, path planning, and rover motion control by receiving telemetry data. It plays a vital role in the whole lunar exploration operation and its so-called trustworthy evidence must be assessed before and during its implementation. Taking ISO standards and China's national military standards as trustworthy evidence source, the net assessment model and net assessment method of teleoperation system are established in this paper. The multi-dimensional net assessment model covering the life cycle of software is defined by extracting the trustworthy evidences from trustworthy evidence source. The qualitative decisions are converted to quantitative weights through the net assessment method (NAM) combined with fuzzy analytic hierarchy process (FAHP) and entropy weight method (EWM) to determine the weight of the evidence elements in the net assessment model. The paper employs the teleoperation system for interplanetary transportation as a case study. The experimental result drawn shows the validity and rationality of net assessment model and method. In the final part of this paper, the untrustworthy elements of the teleoperation system are discovered and an improvement scheme is established upon the "net result". The work completed in this paper has been applied in the development of the teleoperation system of China's Chang'e-3 (CE-3) "Jade Rabbit-1" and Chang'e-4 (CE-4) "Jade Rabbit-2" rover successfully. Besides, it will be implemented in China's Chang'e-5 (CE-5) mission in 2019. What's more, it will be promoted in the Mars exploration mission in 2020. Therefore it is valuable to the development process improvement of aerospace information system.

• 전자공학회논문지CI
• /
• 제46권2호
• /
• pp.36-43
• /
• 2009

본 논문에서는 모바일 ad-hoc 무선 센서 네트워크에서 ARQ 기반 전송을 사용하는 협력도움 라우팅 프로토콜(CRARQ)을 제안한다. 제안된 CRARQ의 주요한 목적은 데이터 전송의 효율과 신뢰성을 함께 향상시키기 위함이다. 제안된 CRARQ의 주요한 특징 및 기여도는 다음과 같다. 첫째, CRARQ는 어떤 요구기반 개념을 사용하여 소스와 목적지 사이에 경로를 설정한다. 둘째, CRARQ는 설정된 경로를 따라서 엔트로피 기반 전략을 사용하여 안정된 릴레이를 선택한다. 셋째, 소스와 목적지 사이에 데이터 전송의 신뢰성을 향상시키기 위해서 ARQ 기술기반 협력전송 방법을 사용한다. 마지막으로 제안된 CRARQ의 이론적인 분석 모델을 제안 설명한다. 제안된 라우팅 프로토콜의 성능평가는 시뮬레이션과 이론적인 분석을 통하여 이루어진다. 시뮬레이션과 이론적인 분석 결과는 페킷전송 효율(PDR) 및 Outage Probability에 대한 CRARQ의 향상된 성능을 보여준다.

• 한국정보처리학회논문지
• /
• 제2권5호
• /
• pp.677-690
• /
• 1995

본 논문에서는 블럭정렬과 선두 이동법에 의해 처리된 계열을 VF(Variable to Fixed)형 산술부호로 압축하는 방법을 제시한다. 길이 N으로 분해된 부분열을 1기호씩 순회시킨 후 사전식 순서로 정렬한다. 순회정렬된 부분열은 국소적으로 유사기호가 밀 집되기 때문에 이 성질을 활용하기 위하여 선두 이동법을 적용한다. 이와 같이 전처리 된 계열에 대해 오류전파를 1 부호어 이내로 제한할 수 있는 VF형 산술부호 로 엔트 로피 부호화한다. VF형 산술부호의 효율은 고정 크기의 부호어 집합을 어떻게 분할하 는가가 관건이다. 제안하는 VFAC(VF Arithmetic Code)는 새로 설정되는 정보원 기호에 대하여 완전분할을 이루게 하고, 반복적인 그레이 변환을 이용하여 발생기호의 확률을 효과적으로 나타낸다. 제안 방식의 성능을 컴퓨터 시뮬레이션을 통하여 엔트로피, 압 축율 및 처리속도의 측면에서 기존의 방식과 비교 분석한다.

• 대한기계학회논문집
• /
• 제19권4호
• /
• pp.1134-1147
• /
• 1995

POD (proper orthogonal decomposition) is applied to turbulent leading-edge separation bubble to extract coherent structures. A two-dimensional leading-edge separation bubble is simulated by discrete-vortex method, where a time-dependent source forcing is incorporated. Based on the wealth of numerical data, POD is applied in a range of the forcing amplitude ( $A_{o}$ = 0, 0.5, 1.0 and 1.5) and forcing frequency (0 .leq. $f_{F}$H/ $U_{\infty}$.leq. 0.3). It is demonstrated that the structures of POD have noticeable changes with local forcings. In an effort to investigate the mechanism of decreasing reattachment length, dynamic behaviors of the expansion coefficients and contributions of the eigenfunctions of POD are scrutinized. As the forcing amplitude increases, the large-scale vortex structures are formed near the forcing amplitude increases, the large-scale vortex structures are formed near the separation point and the flow structures become more organized and more regular, accompanying with the reduction of reattachment length. By further inverstigation of POD global entropy, it is seen that the reattachment length is closely linked to the degree of organization of the flow structures.es.s.

• 전자공학회논문지B
• /
• 제31B권11호
• /
• pp.78-87
• /
• 1994

본 논문에서는 확률분포함수의 구조적인 차이를 이용하여, DCT계수를 효율적으로 부호화하는 새로운 접근에 대하여 논의하였다. 신호원 모델에 따라 신호를 분리함으로써 신호의 엔트로피를 감소시킬 수 있음을 해석적으로 증명하였으며, (줄길이, 레벨) 심볼들을 그 심복의 인덱스에 따라 적응적으로 부호화함으로써 평균부호길이가 감소함을 실험을 통하여 보였다.

• 대한기계학회논문집
• /
• 제18권12호
• /
• pp.3287-3296
• /
• 1994

For the numerical computation of three-dimensional compressible flow field within a blade row in a centrifugal compressor, a quasi 3-dimensional solver which combines a reversible B-B flow and an irreversible H-S flow using finite element methods was developed. In a reversible B-B flow, the governing coordinates are modified in order to be applied to any type of turbomachinery, and two kinds of stream functions are introduced in order to make the Kutta condition exactly satisfied. In an irreversible H-S flow, the changes of entropy in the irreversible governing equations are determined not by empirical source but by the theoretical treatment of dissipation forces. The dissipation forces are obtained from the distribution of shear stresses in the flow passage which are given from the wall shear stresses using the exponential functions. A more accurate quasi-3-dimensional solver is established where the effect of body forces is involved in the non-axisymmetric H-S flow. Some numerical results obtained from authors' previous studies for axial flow machines assure that the present method is able to predict well as long as the flow is subsonic and not under strong viscous effect.

• 한국멀티미디어학회논문지
• /
• 제20권12호
• /
• pp.1992-1999
• /
• 2017

This study proposes a decorative typeface which is produced through the concept of trigonometric functions in an open-source programming language known as Processing. First, the theoretical background of Processing and trigonometric functions as well as previous research in this area are analyzed. Second, basic modules of 'V', 'I', 'O', and 'M' were created for use as the final alphabet typeface with the concept of a trigonometric function. Third, a decorative parabolic curve that encircles the base module was created. Finally, the modules created on Processing were edited in Adobe Illustrator to create a typeface set with characters from A to Z. Various artworks using Programming can produce an infinite number of different versions by modifying only some of the variables and codes, and this method can include multimedia features such as text, images, videos, interactive art and various forms of content and media. Therefore, with regard to expression, the possibilities are endless. In this study, I attempt to expand the field of visual culture using programming and computational methodologies. In contrast to the digital typeface production method, which relies on existing graphic tools, this study is meaningful because it expands the range of use of decorative typefaces.

• 한국통신학회논문지
• /
• 제19권1호
• /
• pp.111-119
• /
• 1994

본 논문에서는 차분변화에 이은 Run-length 부호화와 RDH(Run-length Dynamic Huffman Codding)에 의한 가역 부호화 방식을 제안하였다. 단계적 전송 기능을 부가하기 위하여 비트 플랜을 사용하였으며, 시스템 구성의 간결성을 위해야 단일 주사 방식의 Run-length 부호에 기초한 부호와 방식을 적용하였다. 특히, 하위 비트열에 대한 압축률을 개선하기 위해 가변형의 RDHC가 유효함을 보였으며, 컴퓨터 시뮬레이션에 의해 그 성능을 비교.분석 하였다. 그 결과 2차 차분변환후 VFRL(Variable to Fixed Run-Length) 부호화가 무변환, 그레이변환 및 1차 차분변환 방법에 비해 평균 1.271, 0.77 및 0.629 [bit/pixel]씩 향상되었다. 또한, 2차 차분변환에 이은 RDHC의 결과는 VFRL, Dynamic Huffman, Arthmetic 및 LZE부호화 보다 0.76, 0.37, 0.22 및 0.68[bit/pixel]씩 향상되어 비교적 간단한 시스템의 구성으로 각종 유니버샬 부호에 비해 높은 압축 효과를 얻었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권4호
• /
• pp.1442-1462
• /
• 2014

Packet classification is a key technology of the Internet for routers to classify the arriving packets into different flows according to the predefined rulesets. Previous packet classification algorithms have mainly focused on search speed and memory usage, while overlooking update performance. In this paper, we propose PreCuts, which can drastically improve the update speed. According to the characteristics of IP field, we implement three heuristics to build a 3-layer decision tree. In the first layer, we group the rules with the same highest byte of source and destination IP addresses. For the second layer, we cluster the rules which share the same IP prefix length. Finally, we use the heuristic of information entropy-based bit partition to choose some specific bits of IP prefix to split the ruleset into subsets. The heuristics of PreCuts will not introduce rule duplication and incremental update will not reduce the time and space performance. Using ClassBench, it is shown that compared with BRPS and EffiCuts, the proposed algorithm not only improves the time and space performance, but also greatly increases the update speed.