• Title/Summary/Keyword: 이진화 코드

Search Result 93, Processing Time 0.023 seconds

Speaker-Adaptive Speech Synthesis based on Fuzzy Vector Quantizer Mapping and Neural Networks (퍼지 벡터 양자화기 사상화와 신경망에 의한 화자적응 음성합성)

  • Lee, Jin-Yi;Lee, Gwang-Hyeong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.1
    • /
    • pp.149-160
    • /
    • 1997
  • This paper is concerned with the problem of speaker-adaptive speech synthes is method using a mapped codebook designed by fuzzy mapping on FLVQ (Fuzzy Learning Vector Quantization). The FLVQ is used to design both input and reference speaker's codebook. This algorithm is incorporated fuzzy membership function into the LVQ(learning vector quantization) networks. Unlike the LVQ algorithm, this algorithm minimizes the network output errors which are the differences of clas s membership target and actual membership values, and results to minimize the distances between training patterns and competing neurons. Speaker Adaptation in speech synthesis is performed as follow;input speaker's codebook is mapped a reference speaker's codebook in fuzzy concepts. The Fuzzy VQ mapping replaces a codevector preserving its fuzzy membership function. The codevector correspondence histogram is obtained by accumulating the vector correspondence along the DTW optimal path. We use the Fuzzy VQ mapping to design a mapped codebook. The mapped codebook is defined as a linear combination of reference speaker's vectors using each fuzzy histogram as a weighting function with membership values. In adaptive-speech synthesis stage, input speech is fuzzy vector-quantized by the mapped codcbook, and then FCM arithmetic is used to synthesize speech adapted to input speaker. The speaker adaption experiments are carried out using speech of males in their thirties as input speaker's speech, and a female in her twenties as reference speaker's speech. Speeches used in experiments are sentences /anyoung hasim nika/ and /good morning/. As a results of experiments, we obtained a synthesized speech adapted to input speaker.

  • PDF

석탄가스화 복합발전 플랜트에서의 폐열회수보일러 설계에 따른 증기터빈 시스템 성능변화

  • 이진욱;김대규;조병화
    • Proceedings of the Korea Society for Energy Engineering kosee Conference
    • /
    • 1993.11a
    • /
    • pp.13-21
    • /
    • 1993
  • 석탄가스화 복합발전 플랜트의 부속공정인 중기터빈 시스템에 대한 공정 전산해석을 상용 공정해석 소프트웨어인 ASPEN 코드를 이용하여 수행하였다. 폐열회수보일러에서 생성되는 고압증기 조건을 2400psig로 채택하였으며, 폐열회수보일러의 열교환기 배열 및 생성증기의 조건에 따른 증기터빈 시스템의 성능변화를 고찰하였다. 페열회수보일러에서의 열교환기 배열, 생성중기 조건 및 공급수 예열 방법에 따라 증기터빈 시스템의 성능이 변화하게 되므로 이의 정확한 이해를 통하여 증기터빈 시스템의 최적화를 도모할 수 있다.

  • PDF

ART2 기반 RBF 네트워크와 얼굴 인증을 이용한 주민등록증 인식

  • ;Lee, Jae-Eon;Kim, Kwang-Baek
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2005.11a
    • /
    • pp.526-535
    • /
    • 2005
  • 우리나라의 주민등록증은 주소지, 주민등록 변호, 얼굴사진, 지문 등 개개인의 방대한 정보를 가진다. 현재의 플라스틱 주민등록증은 위조 및 변조가 쉽고 날로 전문화 되어가고 있다. 따라서 육안으로 위조 및 변조 사실을 쉽게 확인하기가 어려워 사회적으로 많은 문제를 일으키고 있다. 이에 본 논문에서는 주민등록증 영상을 자동 인식할 수 있는 개선된 ART2 기반 RBF 네트워크와 얼굴인증을 이용한 주민등록증 자동 인식 방법을 제안한다. 제안된 방법은 주민등록증 영상에서 주민등록번호와 발행일을 추출하기 위하여 영상을 소벨마스크와 미디언 필터링을 적용한 후에 수평 스미어링을 적용하여 주민등록번호와 발행일 영역을 검출한다. 그리고 4 방향 윤곽선 추적 알고리즘으로 개별 문자를 추출하기 위한 전 단계로 주민등록증 영상에 대해 고주파 필터링을 적용하여 주민등록증 영상 전체를 이진화 한다. 이진화된 주민등록영상에서 COM 마스크를 적용하여 주민등록번호와 발행일 코드를 복원하고 검출된 각 영역에 대해 4 방향 윤곽선 추적 알고리즘으로 개별 문자를 추출한다. 추출된 개별 문자는 개선된 ART2 기반 RBF 네트워크를 제안하여 인식에 적용한다. 제안된 ART2 기반 RBF 네트워크는 학습 성능을 개선하기 위하여 중간충과 출력층의 학습에 퍼지 제어 기법을 적용하여 학습률을 동적으로 조정한다. 얼굴인증은 템플릿 매칭 알고리즘을 이용하여 얼굴 템플릿 데이터베이스를 구축하고 주민등록증애서 추출된 얼굴영역과의 유사도를 측정하여 주민등록증 얼굴 영역의 위조여부를 판별한다.

  • PDF

Data Acquisition System Using the Second Binary Code (2차원 부호를 이용한 정보 획득 시스템)

  • Kim, In-Kyeom
    • The Journal of Information Technology
    • /
    • v.6 no.1
    • /
    • pp.71-84
    • /
    • 2003
  • In this paper, it is presented the efficient system for data recognition using the proposed binary code images. The proposed algorithm finds the position of binary image. Through the process of the block region classification, it is classified each block with the edge region using the value of gray level only. Each block region is divided horizontal and vertical edge region. If horizontal edge region blocks are classified over six blocks in any region, the proposed algorithm should search the vertical edge region in the start point of the horizontal edge region. If vertical edge region blocks were found over ten blocks in vertical region, the code image would found. Practical code region is acquired from the rate of the total edge region that is computed from the binary image that is processed with the average value. In case of the wrong rate, it is restarted the code search in the point after start point and the total process is followed. It has a short time than the before process time because it had classified block information. The block processing is faster thant the total process. The proposed system acquires the image from the digital camera and makes binary image from the acquired image. Finally, the proposed system extracts various characters from the binary image.

  • PDF

A Study on Transport Robot for Autonomous Driving to a Destination Based on QR Code in an Indoor Environment (실내 환경에서 QR 코드 기반 목적지 자율주행을 위한 운반 로봇에 관한 연구)

  • Se-Jun Park
    • Journal of Platform Technology
    • /
    • v.11 no.2
    • /
    • pp.26-38
    • /
    • 2023
  • This paper is a study on a transport robot capable of autonomously driving to a destination using a QR code in an indoor environment. The transport robot was designed and manufactured by attaching a lidar sensor so that the robot can maintain a certain distance during movement by detecting the distance between the camera for recognizing the QR code and the left and right walls. For the location information of the delivery robot, the QR code image was enlarged with Lanczos resampling interpolation, then binarized with Otsu Algorithm, and detection and analysis were performed using the Zbar library. The QR code recognition experiment was performed while changing the size of the QR code and the traveling speed of the transport robot while the camera position of the transport robot and the height of the QR code were fixed at 192cm. When the QR code size was 9cm × 9cm The recognition rate was 99.7% and almost 100% when the traveling speed of the transport robot was less than about 0.5m/s. Based on the QR code recognition rate, an experiment was conducted on the case where the destination is only going straight and the destination is going straight and turning in the absence of obstacles for autonomous driving to the destination. When the destination was only going straight, it was possible to reach the destination quickly because there was little need for position correction. However, when the destination included a turn, the time to arrive at the destination was relatively delayed due to the need for position correction. As a result of the experiment, it was found that the delivery robot arrived at the destination relatively accurately, although a slight positional error occurred while driving, and the applicability of the QR code-based destination self-driving delivery robot was confirmed.

  • PDF

Analysis of Cross-Correlation of Extended Non-Linear Binary Sequences (확장된 비선형 이진수열의 상호상관관계 분석)

  • Choi, Un-Sook;Cho, Sung-Jin;Kwon, Sook-Hi
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.2
    • /
    • pp.263-269
    • /
    • 2012
  • Code-Division Multiple-Access(CDMA) allows several users simultaneous access to a common channel by assigning a distinct pseudonoise sequence called spectrum code to each user. Each user in a CDMA system uses a assigned spectrum code to modulate their signal. Choosing the codes used to modulate the signal is very important in the performance of CDMA systems. The best performance will occur when there is good separation between the signal of a desired user and the signals of other users. The receiver synchronizes the code to recover the data. The use of an independent code allows multiple users to access the same frequency band at the same time. In this paper we propose a generalized model of non-linear binary sequence using trace function and analyze cross-correlation of these sequences. These sequences with low correlation, large linear span and large family size, in a direct-sequence spread spectrum communication system, help to minimize multiple access interference, increase security degree of system and enlarge user number.

De-interlacing and Block Code Generation For Outsole Model Recognition In Moving Picture (동영상에서 신발 밑창 모델 인식을 위한 인터레이스 제거 및 블록 코드 생성 기법)

  • Kim Cheol-Ki
    • Journal of Intelligence and Information Systems
    • /
    • v.12 no.1
    • /
    • pp.33-41
    • /
    • 2006
  • This paper presents a method that automatically recognizes products into model type, which it flows with the conveyor belt. The specific interlaced image are occurred by moving image when we use the NTSC based camera. It is impossible to process interlaced images, so a suitable post-processing is required. For the purpose of this processing, after it remove interlaced images using de-interlacing method, it leads rectangle region of object by thresholding. And then, after rectangle region is separated into several blocks through edge detection, we calculate pixel numbers per each block, re-classify using its average, and classify products into model type. Through experiments, we know that the proposed method represent high classification ratio.

  • PDF

Recognition of Resident Registration Card using ART-1 based Self-Organizing Supervised Learning Algorithm And Face Recognition (ART-1 기반 자가 생성 지도 학습 알고리즘과 얼굴 인증을 이용한 주민등록증 인식)

  • Shin Tae-Sung;Park Choong-Shik;Moon Yong-Eun;Kim Kwang-Baek
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.313-318
    • /
    • 2006
  • 본 논문에서는 ART-1 기반 자가 생성 지도학습 알고리즘과 얼굴 인증을 이용한 주민등록증 인식방법을 제안한다. 본 논문에서는 주민등록증 영상에서 주민등록번호와 발행일을 추출하기 위해, 획득된 주민등록증의 영상에서 Sobel Mask와 Median Filter를 이용하여 윤곽선을 추출하고 잡음을 제거한 후, 수평 스미어링을 적용하여 주민등록번호와 발행일 영역을 각각 추출한다. 그리고 고주파 필터링을 적용하여 추출된 영역을 이진화하고 4방향 윤곽선 추적 알고리즘을 적용하여 개별 코드를 추출한다. 추출된 개별 코드는 ART-1 기반 자가 생성 지도학습 알고리즘을 적용하여 인식한다. 얼굴 인증은 Template Matching 방법을 적용하여 Face Template Database를 구축하고, 획득된 주민등록증의 얼굴 영역과의 유사도를 측정하여 주민등록증의 사진 위조 여부를 판별한다. 제안된 주민등록증 인식 방법의 성능을 평가하기 위해 10개의 주민등록증을 대상으로 실험하였고 원본 주민등록증 영상에서 사진과 얼굴 부분을 위조한 주민등록증에 대해 얼굴 인증 실험을 하였다. 실험을 통해 제안된 방법이 주민등록번호 인식 및 얼굴 인증에 있어서 우수한 성능이 있음을 확인하였다.

  • PDF

Efficient Design of BCD-EXCESS 3 Code Converter Using Quantum-Dot Cellular Automata (QCA를 이용한 효율적인 BCD-3초과 코드 변환기 설계)

  • You, Young-Won;Jeon, Jun-Cheol
    • Journal of Advanced Navigation Technology
    • /
    • v.17 no.6
    • /
    • pp.700-704
    • /
    • 2013
  • Quantum-dot cellular automata(QCA) is a new technology and it is an one of the alternative high performance over existing complementary metal-oxide semi-conductor(CMOS). QCA is nanoscale device and ultra-low power consumption compared with transistor-based technologies, and various circuits using QCA technology have been proposed. Binary-coded decimal(BCD), which represents decimal digits in binary, is mainly used in electronic circuits and Microprocessor, and it is comfortable in conversion operation but many data loss. In this paper, we present an BCD-EXCESS 3 Code converter which can be efficiently used for subtraction and half adjust. The proposed scheme has efficiently designed considering space and time complexities and minimization of noise, and it has been simulated and confirmed.

A Hashing Method Using PCA-based Clustering (PCA 기반 군집화를 이용한 해슁 기법)

  • Park, Cheong Hee
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.6
    • /
    • pp.215-218
    • /
    • 2014
  • In hashing-based methods for approximate nearest neighbors(ANN) search, by mapping data points to k-bit binary codes, nearest neighbors are searched in a binary embedding space. In this paper, we present a hashing method using a PCA-based clustering method, Principal Direction Divisive Partitioning(PDDP). PDDP is a clustering method which repeatedly partitions the cluster with the largest variance into two clusters by using the first principal direction. The proposed hashing method utilizes the first principal direction as a projective direction for binary coding. Experimental results demonstrate that the proposed method is competitive compared with other hashing methods.