• Title/Summary/Keyword: Bit Recognition Rate

Search Result 36, Processing Time 0.027 seconds

Color Space Mapping and Medium Access Control Techniques in Visible Light Communication (가시광통신을 위한 색채공간매핑과 MAC 기법 연구)

  • Rahman, Mohammad Shaifur;Kim, Byung-Yeon;Bang, Min-Suk;Park, Young-Il;Kim, Ki-Doo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.4
    • /
    • pp.99-107
    • /
    • 2009
  • Visible Light Communication (VLC) is a promising wireless communication technology. It offers huge, worldwide available and free bandwidth without electro-magnetic interference, which makes it very attractive for RF-sensitive operating environments. We propose colored LED-based VLC system for hospital use which includes voice recognition system for operating the medical equipments. New Mr hlation Scheme based on the Light Color Space is suggested to overcome the effect of noise generated by background light. Different color space constellations for different symbol sizes are also suggested which would give better bit error rate performance. Finally, Slotted ALOHA or TDMA medium access control protocols are suggested for multi-user operations.

  • PDF

An Improved Reconstruction Algorithm of Convolutional Codes Based on Channel Error Rate Estimation (채널 오류율 추정에 기반을 둔 길쌈부호의 개선된 재구성 알고리즘)

  • Seong, Jinwoo;Chung, Habong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.5
    • /
    • pp.951-958
    • /
    • 2017
  • In an attack context, the adversary wants to retrieve the message from the intercepted noisy bit stream without any prior knowledge of the channel codes used. The process of finding out the code parameters such as code length, dimension, and generator, for this purpose, is called the blind recognition of channel codes or the reconstruction of channel codes. In this paper, we suggest an improved algorithm of the blind recovery of rate k/n convolutional encoders in a noisy environment. The suggested algorithm improves the existing algorithm by Marazin, et. al. by evaluating the threshold value through the estimation of the channel error probability of the BSC. By applying the soft decision method by Shaojing, et. al., we considerably enhance the success rate of the channel reconstruction.

Development of Automatic Sorting System for Black Plastics Using Laser Induced Breakdown Spectroscopy (LIBS) (LIBS를 이용한 흑색 플라스틱의 자동선별 시스템 개발)

  • Park, Eun Kyu;Jung, Bam Bit;Choi, Woo Zin;Oh, Sung Kwun
    • Resources Recycling
    • /
    • v.26 no.6
    • /
    • pp.73-83
    • /
    • 2017
  • Used small household appliances have a wide variety of product types and component materials, and contain high percentage of black plastics. However, they are not being recycled efficiently as conventional sensors such as near-infrared ray (NIR), etc. are not able to detect black plastic by types. In the present study, an automatic sorting system was developed based on laser-induced breakdown spectroscopy (LIBS) to promote the recycling of waste plastics. The system we developed mainly consists of sample feeder, automatic position recognition system, LIBS device, separator and control unit. By applying laser pulse on the target sample, characteristic spectral data can be obtained and analyzed by using CCD detectors. The obtained data was then treated by using a classifier, which was developed based on artificial intelligent algorithm. The separation tests on waste plastics also were carried out by using a lab-scale automatic sorting system and the test results will be discussed. The classification rate of the radial basis neural network (RBFNNs) classifier developed in this study was about > 97%. The recognition rate of the black plastic by types with the automatic sorting system was more than 94.0% and the sorting efficiency was more than 80.0%. Automatic sorting system based on LIBS technology is in its infant stage and it has a high potential for utilization in and outside Korea due to its excellent economic efficiency.

A Study on Fast Iris Detection for Iris Recognition in Mobile Phone (휴대폰에서의 홍채인식을 위한 고속 홍채검출에 관한 연구)

  • Park Hyun-Ae;Park Kang-Ryoung
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.2 s.308
    • /
    • pp.19-29
    • /
    • 2006
  • As the security of personal information is becoming more important in mobile phones, we are starting to apply iris recognition technology to these devices. In conventional iris recognition, magnified iris images are required. For that, it has been necessary to use large magnified zoom & focus lens camera to capture images, but due to the requirement about low size and cost of mobile phones, the zoom & focus lens are difficult to be used. However, with rapid developments and multimedia convergence trends in mobile phones, more and more companies have built mega-pixel cameras into their mobile phones. These devices make it possible to capture a magnified iris image without zoom & focus lens. Although facial images are captured far away from the user using a mega-pixel camera, the captured iris region possesses sufficient pixel information for iris recognition. However, in this case, the eye region should be detected for accurate iris recognition in facial images. So, we propose a new fast iris detection method, which is appropriate for mobile phones based on corneal specular reflection. To detect specular reflection robustly, we propose the theoretical background of estimating the size and brightness of specular reflection based on eye, camera and illuminator models. In addition, we use the successive On/Off scheme of the illuminator to detect the optical/motion blurring and sunlight effect on input image. Experimental results show that total processing time(detecting iris region) is on average 65ms on a Samsung SCH-S2300 (with 150MHz ARM 9 CPU) mobile phone. The rate of correct iris detection is 99% (about indoor images) and 98.5% (about outdoor images).

Fixed-Point Modeling and Performance Analysis of a SIFT Keypoints Localization Algorithm for SoC Hardware Design (SoC 하드웨어 설계를 위한 SIFT 특징점 위치 결정 알고리즘의 고정 소수점 모델링 및 성능 분석)

  • Park, Chan-Ill;Lee, Su-Hyun;Jeong, Yong-Jin
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.6
    • /
    • pp.49-59
    • /
    • 2008
  • SIFT(Scale Invariant Feature Transform) is an algorithm to extract vectors at pixels around keypoints, in which the pixel colors are very different from neighbors, such as vortices and edges of an object. The SIFT algorithm is being actively researched for various image processing applications including 3-D image constructions, and its most computation-intensive stage is a keypoint localization. In this paper, we develope a fixed-point model of the keypoint localization and propose its efficient hardware architecture for embedded applications. The bit-length of key variables are determined based on two performance measures: localization accuracy and error rate. Comparing with the original algorithm (implemented in Matlab), the accuracy and error rate of the proposed fixed point model are 93.57% and 2.72% respectively. In addition, we found that most of missing keypoints appeared at the edges of an object which are not very important in the case of keypoints matching. We estimate that the hardware implementation will give processing speed of $10{\sim}15\;frame/sec$, while its fixed point implementation on Pentium Core2Duo (2.13 GHz) and ARM9 (400 MHz) takes 10 seconds and one hour each to process a frame.

The Noise Robust Algorithm to Detect the Starting Point of Music for Content Based Music Retrieval System (노이즈에 강인한 음악 시작점 검출 알고리즘)

  • Kim, Jung-Soo;Sung, Bo-Kyung;Koo, Kwang-Hyo;Ko, Il-Ju
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.9
    • /
    • pp.95-104
    • /
    • 2009
  • This paper proposes the noise robust algorithm to detect the starting point of music. Detection of starting point of music is necessary to solve computational-waste problem and retrieval-comparison problem with inconsistent input data in music content based retrieval system. In particular, such detection is even more necessary in time sequential retrieval method that compares data in the sequential order of time in contents based music retrieval system. Whereas it has the long point that the retrieval is fast since it executes simple comparison in the order of time, time sequential retrieval method has the short point that data starting time to be compared should be the same. However, digitalized music cannot guarantee the equity of starting time by bit rate conversion. Therefore, this paper ensured that recognition rate shall not decrease even while executing high speed retrieval by applying time sequential retrieval method through detection of music starting point in the pre-processing stage of retrieval. Starting point detection used minimum wave model that can detect effective sound, and for strength against noise, the noises existing in mute sound were swapped. The proposed algorithm was confirmed to produce about 38% more excellent performance than the results to which starting point detection was not applied, and was verified for the strength against noise.