• 대한수학회보
• /
• 제52권6호
• /
• pp.2011-2023
• /
• 2015

This paper determines the structures of one-homogeneous weight codes over finite chain rings and studies the algebraic properties of these codes. We present explicit constructions of one-homogeneous weight codes over finite chain rings. By taking advantage of the distance-preserving Gray map defined in [7] from the finite chain ring to its residue field, we obtain a family of optimal one-Hamming weight codes over the residue field. Further, we propose a generalized method that also includes the examples of optimal codes obtained by Shi et al. in [17].

• 대한전기학회논문지:시스템및제어부문D
• /
• 제49권8호
• /
• pp.491-494
• /
• 2000

A scheme is proposed for measuring similarities between the binary pulse signals in the pulse-code modulation using the Integra-Normalizer. The Integra-Normalizer provides a better interpretation of the relationship between the pulse signals by removing redundant codes, which maps all possible observed signals to one of the codes to be received with relative similarities between each pair of compared signals. The proposed method provides better error tolerance than L2 metric, such as Hamming distance, since the distances between pulse signals are measured not useful for the time-delay detection in the pulse-code modulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권12호
• /
• pp.3149-3165
• /
• 2013

Content based image retrieval is increasingly gaining popularity among image repository systems as images are a big source of digital communication and information sharing. Identification of image content is done through feature extraction which is the key operation for a successful content based image retrieval system. In this paper content based image retrieval system has been developed by adopting a strategy of combining multiple features of shape, color and relevance feedback. Shape is served as a primary operation to identify images whereas color and relevance feedback have been used as supporting features to make the system more efficient and accurate. Shape features are estimated through second derivative, least square polynomial and shapes coding methods. Color is estimated through max-min mean of neighborhood intensities. A new technique has been introduced for relevance feedback without bothering the user.

• 대한산업공학회지
• /
• 제19권4호
• /
• pp.41-48
• /
• 1993

Prime advantage of flexible manufacturing systems(FMS) is a flexibility. Flexibility is expected to prolong the service life of a manufacturing facility and enable it to respond quickly and economically to dynamic market change. The FMS loading decision is concerned with the allocation of operations and tools to machines subject to technological and capacity constraints of the system. Modern FMS loading problem has the multiple objectives such as processing cost, time and work load balance. We propose multi-objectives which could be used to formulate the loading/routeing problem and sequencing decision which should be adopted for each part type in order to maximize the machine flexibility by Hamming distance matrix based on Incidance matrix. Finally, a numerical example is provided to illustrate the proposed model.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(1)
• /
• pp.323-326
• /
• 2002

In this paper, we study the improved bounds on the performance of low-density parity-check (LDPC) codes over binary-input additive white Gaussian noise (AWGN) channels with belief propagation (BP) decoding in log domain. We define an extended Gallager ensemble based on a new method of constructing parity check matrix and make use of this way to improve upper bound of LDPC codes. At the same time, many simulation results are presented in this paper. These results indicate the extended Gallager ensembles based on Hamming codes have typical minimum distance ratio, which is very close to the asymptotic Gilbert Varshamov bound and the superior performance which is better than the original Gallager ensembles.

• 전기전자학회논문지
• /
• 제17권1호
• /
• pp.51-56
• /
• 2013

본 논문에서는 ORB 알고리즘을 기반으로 하는 다중객체 인식 구현을 위하여 개선된 매칭 기법을 제안한다. 객체 인식 알고리즘으로 잘 알려진 SURF 알고리즘은 객체인식에 강인하지만 연산량이 많아 실시간으로 구현하기에는 어려운 단점이 있다. 따라서 ORB 알고리즘을 활용하여 객체를 인식하였고, 실시간 다중객체인식을 위해 매칭 단계를 개선하여 속도를 약 70% 향상 시켰다.

• 전기전자학회논문지
• /
• 제17권2호
• /
• pp.202-207
• /
• 2013

본 논문은 기존의 FAST와 BRIEF 알고리즘을 Zynq-7000 Soc Platform에서 하드웨어로 구현했다. 대표적으로 SIFT 나 SURF 알고리즘을 사용하여 특징점 기반 하드웨어 가속기로 구현 하지만, 하드웨어 비용과 내부 메모리가 많이 필요하다. 제안하는 FAST & BRIEF 가속기는 기존의 SIFT 나 SURF 가속기 보다 내부 메모리 사용량을 약 57%, 하드웨어 비용을 약 70% 정도 감소하고, 수행 시간은 Clock 당 0.17 Pixel를 처리한다.

• International Journal of Advanced Culture Technology
• /
• 제5권1호
• /
• pp.76-82
• /
• 2017

An image hash, a discriminative and robust summary of an image, should be robust against quality-preserving signal processing steps, while being pairwise independent for perceptually different inputs. In order to improve the hash matching performance, this paper proposes a probabilistic dissimilarity matching. Instead of extracting the binary hash from the query image, we compute the probability that the intermediate hash vector of the query image belongs to each quantization bin, which is referred to as soft quantization binning. The probability is used as a weight in comparing the binary hash of the query with that stored in a database. A performance evaluation over sets of image distortions shows that the proposed probabilistic matching method effectively improves the hash matching performance as compared with the conventional Hamming distance.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2011년도 추계학술대회
• /
• pp.892-895
• /
• 2011

SoC(System-On-Chip)을 테스트 하는 동안 소모하는 전력소모는 SoC내의 IP 코어가 증가됨에 따라 매우 중요한 요소가 되었다. 본 논문에서는 Scan Latch Reordering과 Clock Gating 기법을 적용하여 scan-in 전력소모를 줄이는 알고리즘을 제안한다. Scan vector들의 해밍거리를 최소로 하는 새로운 Scan Latch Reordering을 적용하였으며 Gated scan 셀을 사용하여 저전력을 구현하였다. ISCAS 89 벤치마크 회로에 적용하여 실험한 결과 모든 회로에 대하여 향상된 전력소모를 보였다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2003년도 춘계학술발표논문집 (상)
• /
• pp.591-594
• /
• 2003

본 논문에서는 hopfield 신경망을 사용한 다양한 부분적인 패턴 복원에 관하여 연구하였다. 여섯 개의 $32{\times}32$ 비트맵 훈련패턴들은 한글자음 ㄱ, ㅁ, ㅂ, ㅇ, ㅊ, ㅍ, 그리고 남자와 여자 이미지로 구성되어 있다. 그리고 부분패턴들의 크기, 범위, 방향의 효과를 알아보기 위해서 훈련패턴에서 여덟 가지 형태의 테스트 패턴을 만든다. 한글 자음의 경우 유사 패턴이 많기 때문에 완전히 복원되지 못하였으나, 400회 정도 수렵된 후에는 테스트패턴들이 견본패턴과 비슷한 모양으로 복원되었다. 이 유사도를 측정하기 위해 해밍거리 (Hamming distance)를 이용하였다. 유사도를 측정하여 해밍거리가 가장 적은 것으로 본래의 이미지들 복원하였다.