• 방송공학회논문지
• /
• 제17권2호
• /
• pp.388-399
• /
• 2012

본 논문에서는 지역 특징 추출 방법 중 하나인 SURF를 개선시켜 모바일 환경에 적합한 특징 추출 및 정합 방법에 대하여 기술한다. 모바일 환경에서 최적의 성능을 내기 위해 크게 세 가지 방법을 제안한다. 첫 번째는 SURF 기술자의 차원을 축소시키는 방법이다. 기존의 64차원과 여러 차원의 기술자들의 성능을 비교 분석한다. 두 번째로 고속 헤시안 검출기에서 헤시안 행렬의 대각합을 통해 계산되는 라플라시안 부호를 사용하여 정합 성능을 높인다. 즉, 부호가 같으면 같은 특성의 특징점으로 여겨 정합하고 그렇지 않으면 정합하지 않는다. 세 번째는 특징점간의 거리 측정 시 사용하는 거리 비율을 실험하고, 실험을 통해 얻어진 거리 비율을 사용하여 정합의 성능을 높였다. 마지막으로, 기존의 시스템과 제안한 시스템의 성능을 비교하여 제안한 시스템의 성능 향상을 검증하고, 제안한 시스템이 비교적 정합률의 성능 저하 없이 응답속도를 크게 개선함을 보였다.

• 한국지리정보학회지
• /
• 제10권4호
• /
• pp.1-13
• /
• 2007

GLCM(Gray Level Co-occurrence Matrix)의 질감 특징 정보 여섯 종류를 이용해서 위성영상을 변환한 후 두개의 주성분을 누적한 영상을 만들어 전 처리 과정을 거쳐서 모서리 검출과 영역 검출을 수행하였다. 실험 결과 두개의 주성분 변환 누적 영상의 고유 값은 94.6%로 여섯 종류 질감에 대한 대부분의 정보를 가지고 있으며, 이를 해색 한 가지 만을 이용한 적조영역 및 주성분을 모두 가지고 있는 영상의 적조영역과 비교했을 때 가장 우수한 결과를 나타내었다. 또한 적조영역과 맑은 해역에 대한 유클리디언 거리 측정으로 유클리디언 공간을 생성하고 이를 이용하여 자동으로 입력되는 원격탐사 영상의 임의 해역에 대해 적조영역을 식별하였다.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2007년도 추계학술대회논문집
• /
• pp.311-317
• /
• 2007

The reduction of the Vehicle interior noise has been the main interest of NVH engineers. The driver's perception on the vehicle noise is affected largely by psychoacoustic characteristic of the noise as well as the SPL. The previous methods to evaluation of the SQ about vehicle interior noise are linear regression analysis of subjective SQ metrics by statistics and the estimation of the subjective SQ values by neural network. But these are so depended on jury test very much that they result in many difficulties. So, to reduce jury test weight, we suggested a new method using Mahalanobis distance for SQ evaluation. And, optimal characteristic values influenced on the result of the SQ evaluation were derived by signal to noise ratio(SN ratio) of the Taguchi method. Finally, the new method to evaluate SQ is constructed using Mahalanobis-Taguchi system(MTS). Furthermore, the MTS method for SQ evaluation was compared by the result of SQ grade table at the previous study and their virtues and faults introduced.

• 한국발생생물학회지:발생과생식
• /
• 제23권3호
• /
• pp.297-304
• /
• 2019

The higher fragment sizes (>2,100 bp) are not observed in the two C. spp. populations. The six oligonucleotides primers OPA-11, OPB-09, OPB-14, OPB-20, OPC-14, and OPC-18 were used to generate the unique shared loci to each tonguesole population and shared loci by the two tonguesole populations. The hierarchical polar dendrogram indicates two main clusters: Gunsan (GUNSAN 01-GUNSAN 11) and the Atlantic (ATLANTIC 12-ATLANTIC 22) from two geographic populations of tonguesoles. The shortest genetic distance displaying significant molecular difference was between individuals' GUNSAN no. 02-GUNSAN no. 01 (genetic distance=0.038). In the long run, individual no. 02 of the ATLANTIC tonguesole was most distantly related to GUNSAN no. 06 (genetic distance=0.958). These results demonstrate that the Gunsan tonguesole population is genetically different from the Atlantic tonguesole population. The potential of PCR analysis to identify diagnostic markers for the identification of two tonguesole populations has been demonstrated. As a rule, using various oligonucleotides primers, this PCR method has been applied to identify polymorphic/specific markers particular to species and geographical population, as well as genetic diversity/polymorphism in diverse species of organisms.

• Journal of Electrical Engineering and Technology
• /
• 제1권2호
• /
• pp.170-176
• /
• 2006

This paper proposes a topological locating algorithm to determine the location of the power quality event source. This algorithm makes use of the information on the topology of the monitored network and on the direction of PQ events. As a result, the bus incidence matrix is modified using monitor location and the direction matrix is constructed. With this information, the algorithm determines the suspected locations of the PQ events. To reduce suspicious areas, it utilizes event cause and related equipment. In case of line fault event, it calculates the distance from the monitor to the location of event source. The overall algorithm is applied to the IEEE test feeder and accurately identifies the event source location.

• ETRI Journal
• /
• 제29권3호
• /
• pp.381-389
• /
• 2007

In this paper we propose a graph-theoretic method based on linear congruence for constructing low-density parity check (LDPC) codes. In this method, we design a connection graph with three kinds of special paths to ensure that the Tanner graph of the parity check matrix mapped from the connection graph is without short cycles. The new construction method results in a class of (3, ${\rho}$)-regular quasi-cyclic LDPC codes with a girth of 12. Based on the structure of the parity check matrix, the lower bound on the minimum distance of the codes is found. The simulation studies of several proposed LDPC codes demonstrate powerful bit-error-rate performance with iterative decoding in additive white Gaussian noise channels.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권3호
• /
• pp.1193-1209
• /
• 2015

Network coding is promising to maximize network throughput and improve the resilience to random network failures in various networking systems. In this paper, the problem of providing efficient confidentiality for practical network coding system against a global eavesdropper (with full eavesdropping capabilities to the network) is considered. By exploiting a novel combination between the construction technique of systematic Maximum Distance Separable (MDS) erasure coding and traditional cryptographic approach, two efficient schemes are proposed that can achieve the maximum possible rate and minimum encryption overhead respectively on top of any communication network or underlying linear network code. Every generation is first subjected to an encoding by a particular matrix generated by two (or three) Vandermonde matrices, and then parts of coded vectors (or secret symbols) are encrypted before transmitting. The proposed schemes are characterized by tunable and measurable degrees of security and also shown to be of low overhead in computation and bandwidth.

• 한국지능시스템학회논문지
• /
• 제12권4호
• /
• pp.300-305
• /
• 2002

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

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2007년도 추계학술대회논문집
• /
• pp.1415-1418
• /
• 2007

When a high voltage COS fuse becomes a short circuit by the over current, the impulse noise over 150 dB(A) with the strong pulse jet is radiated from the COS fuse of an electric transformer. For the purpose of the impulse noise reduction, in this study, a reactive type silencer with perforated panels are considered. The transmission loss of the silencer are calculated by transfer matrix method. The effect of the porosity, the distance between panels, and the number of perforated panel on the sound transmission loss is investigated and discussed.

• 대한산업공학회지
• /
• 제19권3호
• /
• pp.37-49
• /
• 1993

In this paper, the TSP(traveling salesman problem) which its costs(distance) between nodes are defined with Max($\bar{x}$, $\bar{y}$) has been dealt. In order to find a satisfactory solution for this kind of problem, we generate weighted matrix, and then develope a new heuristic problem solving method using the weighted matrix. Also we analyze the effectiveness of the newly developed heuristic method comparing it with other heuristic algorithm already exists for Euclidean TSP. Finally, we apply a new developed algorithm to real Max($\bar{x}$,$\bar{y}$) TSP such as PCB inserting.