• Title/Summary/Keyword: Information input algorithm

Search Result 2,444, Processing Time 0.036 seconds

Enhanced Spatial Modulation of Indoor Visible Light Communication

  • Shan, Ye;Li, Ming;Jin, Minglu
    • Journal of information and communication convergence engineering
    • /
    • v.13 no.1
    • /
    • pp.1-6
    • /
    • 2015
  • In this study, we consider visible light communication in an indoor line-of-sight environment. It has been proved that among the multiple input multiple output (MIMO) techniques, spatial modulation (SM) performs better than repetition coding (RC) and spatial multiplexing (SMP). On the basis of a combination of SM and pulse amplitude modulation (PAM), here, we propose an enhanced SM algorithm to improve the bit error rate. Traditional SM activates only one light-emitting diode (LED) at one time, and the proposed enhanced SM activates two LEDs at one time and reduces the intensity levels of PAM by half. Under the condition of a highly correlated channel, power imbalance is used to improve the algorithm performance. The comparison between the two schemes is implemented at the same signal-to-noise ratio. The simulation results illustrate that the enhanced SM outperforms the traditional SM in both highly correlated and lowly correlated channels. Furthermore, the proposed enhanced SM scheme can increase the transmission rate in most cases.

Facial Region Segmentation using Watershed Algorithm based on Depth Information (깊이정보 기반 Watershed 알고리즘을 이용한 얼굴영역 분할)

  • Kim, Jang-Won
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.4 no.4
    • /
    • pp.225-230
    • /
    • 2011
  • In this paper, we propose the segmentation method for detecting the facial region by using watershed based on depth information and merge algorithm. The method consists of three steps: watershed segmentation, seed region detection, and merge. The input color image is segmented into the small uniform regions by watershed. The facial region can be detected by merging the uniform regions with chromaticity and edge constraints. The problem in the existing method using only chromaticity or edge can solved by the proposed method. The computer simulation is performed to evaluate the performance of the proposed method. The simulation results shows that the proposed method is superior to segmentation facial region.

A Study on Tracking Algorithm for Moving Object Using Partial Boundary Line Information (부분 외곽선 정보를 이용한 이동물체의 추척 알고리즘)

  • Jo, Yeong-Seok;Lee, Ju-Sin
    • The KIPS Transactions:PartB
    • /
    • v.8B no.5
    • /
    • pp.539-548
    • /
    • 2001
  • In this paper, we propose that fast tracking algorithm for moving object is separated from background, using partial boundary line information. After detecting boundary line from input image, we track moving object by using the algorithm which takes boundary line information as feature of moving object. we extract moving vector on the imput image which has environmental variation, using high-performance BMA, and we extract moving object on the basis of moving vector. Next, we extract boundary line on the moving object as an initial feature-vector generating step for the moving object. Among those boundary lines, we consider a part of the boundary line in every direction as feature vector. And then, as a step for the moving object, we extract moving vector from feature vector generated under the information of the boundary line of the moving object on the previous frame, and we perform tracking moving object from the current frame. As a result, we show that the proposed algorithm using feature vector generated by each directional boundary line is simple tracking operation cost compared with the previous active contour tracking algorithm that changes processing time by boundary line size of moving object. The simulation for proposed algorithm shows that BMA operation is reduced about 39% in real image and tracking error is less than 2 pixel when the size of feature vector is [$10{\times}5$] using the information of each direction boundary line. Also the proposed algorithm just needs 200 times of search operation bout processing cost is varies by the size of boundary line on the previous algorithm.

  • PDF

Object Extraction Technique using Extension Search Algorithm based on Bidirectional Stereo Matching (양방향 스테레오 정합 기반 확장탐색 알고리즘을 이용한 물체추출 기법)

  • Choi, Young-Seok;Kim, Seung-Geun;Kang, Hyun-Soo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.2
    • /
    • pp.1-9
    • /
    • 2008
  • In this paper, to extract object regions in stereo image, we propose an enhanced algorithm that extracts objects combining both of brightness information and disparity information. The approach that extracts objects using both has been studied by Ping and Chaohui. In their algorithm, the segmentation for an input image is carried out using the brightness, and integration of segmented regions in consideration of disparity information within the previously segmented regions. In the regions where the brightness values between object regions and background regions are similar, however, the segmented regions probably include both of object regions and background regions. It may cause incorrect object extraction in the merging process executed in the unit of the segmented region. To solve this problem, in proposed method, we adopt the merging process which is performed in pixel unit. In addition, we perform the bi-directional stereo matching process to enhance reliability of the disparity information and supplement the disparity information resulted from a single directional matching process. Further searching for disparity is decided by edge information of the input image. The proposed method gives good performance in the object extraction since we find the disparity information that is not extracted in the traditional methods. Finally, we evaluate our method by experiments for the pictures acquired from a real stereoscopic camera.

Development of the Weather Detection Algorithm using CCTV Images and Temperature, Humidity (CCTV 영상과 온·습도 정보를 이용한 기후검출 알고리즘 개발)

  • Park, Beung-Raul;Lim, Jong-Tea
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.2
    • /
    • pp.209-217
    • /
    • 2007
  • This paper proposed to a detection scheme of weather information that is a part of CCTV Images Weather Detection System using CCTV images and Temperature, Humidity. The previous Partial Weather Detection System uses how to acquire weather information using images on the Road. In the system the contrast and RGB Values using clear images are gained. This information is distributed a input images to cloud, rain, snow and fog images. That is, this information is compared the snow and the fog images for acquisition more correctness information us ing difference images and binary images. Currently, We use to environment sense system, but we suggest a new Weather Detection Algorithm to detect weather information using CCTV images. Our algorithm is designed simply and systematically to detect and separate special characteristics of images from CCTV images. and using temperature & humidity in formation. This algorithm, there is more complex to implement than how to use DB with high overhead of time and space in the previous system. But our algorithm can be implement with low cost' and can be use the system in real work right away. Also, our algorithm can detect the exact information of weather with adding in formation including temperature, humidity, date, and time. At last, this paper s how the usefulness of our algorithm.

  • PDF

Blind Watermarking by Using Circular Input Method and Binary Image (이진영상과 Circular Input 방식을 이용한 Blind 워터마킹)

  • Kim Tae-Ho;Kim Young-Hee;Jin Kyo-Hong;Ko Bong-Jin;Park Mu-Hun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.8
    • /
    • pp.1407-1413
    • /
    • 2006
  • The field of medical images has been digitalized as the development of computer and the digitalization of the medical instruments. As a result it causes a lot of problems such as an illegal copy related to medical images and property right of the medical images. Therefore, digital watermarking is used for discrimination whether the data are modified or not. It is also used to protect both the property right of medical images and the private life of many patients. The proposed theories, the Non-blind and the Blind method, have two problems. One is needed an original image and the other is using a gaussian watermarking. This paper proposes the new Blind Watermarking using binary images in order to easily recognize the results of watermark. This algorism is described that an watermark of a binary image is wavelet-transformed, and then a transformed watermark is inserted in medium-band of frequency domains of original image by the Circular Input method. This method don't have any loss when image didn't have any attack. As a result Watermark can be perfectly extracted by using this algorithm. And Maximam PSNR value is improved 3.35dB. This algorithm will be improved by using gray level image and color image.

A Parallel Sphere Decoder Algorithm for High-order MIMO System (고차 MIMO 시스템을 위한 저 복잡도 병렬 구형 검출 알고리즘)

  • Koo, Jihun;Kim, Jaehoon;Kim, Yongsuk;Kim, Jaeseok
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.5
    • /
    • pp.11-19
    • /
    • 2014
  • In this paper, a low complexity parallel sphere decoder algorithm is proposed for high-order MIMO system. It reduces the computational complexity compared to the fixed-complexity sphere decoder (FSD) algorithm by static tree-pruning and dynamic tree-pruning using scalable node operators, and offers near-maximum likelihood decoding performance. Moreover, it also offers hardware-friendly node operation algorithm through fixing the variable computational complexity caused by the sequential nature of the conventional SD algorithm. A Monte Carlo simulation shows our proposed algorithm decreases the average number of expanded nodes by 55% with only 6.3% increase of the normalized decoding time compared to a full parallelized FSD algorithm for high-order MIMO communication system with 16 QAM modulation.

The Hybrid LVQ Learning Algorithm for EMG Pattern Recognition (근전도 패턴인식을 위한 혼합형 LVQ 학습 알고리즘)

  • Lee Yong-gu;Choi Woo-Seung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.2 s.34
    • /
    • pp.113-121
    • /
    • 2005
  • In this paper, we design the hybrid learning algorithm of LVQ which is to perform EMG pattern recognition. The proposed hybrid LVQ learning algorithm is the modified Counter Propagation Networks(C.p Net. ) which is use SOM to learn initial reference vectors and out-star learning algorithm to determine the class of the output neurons of LVa. The weights of the proposed C.p. Net. which is between input layer and subclass layer can be learned to determine initial reference vectors by using SOM algorithm and to learn reference vectors by using LVd algorithm, and pattern vectors is classified into subclasses by neurons which is being in the subclass layer, and the weights which is between subclass layer and class layer of C.p. Net. is learned to classify the classified subclass. which is enclosed a class . To classify the pattern vectors of EMG. the proposed algorithm is simulated with ones of the conventional LVQ, and it was a confirmation that the proposed learning method is more successful classification than the conventional LVQ.

  • PDF

ART1-based Fuzzy Supervised Learning Algorithm (ART-1 기반 퍼지 지도 학습 알고리즘)

  • Kim Kwang-Baek;Cho Jae-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.4
    • /
    • pp.883-889
    • /
    • 2005
  • Error backpropagation algorithm of multilayer perceptron may result in local-minima because of the insufficient nodes in the hidden layer, inadequate momentum set-up, and initial weights. In this paper, we proposed the ART-1 based fuzzy supervised learning algorithm which is composed of ART-1 and fuzzy single layer supervised learning algorithm. The Proposed fuzzy supervised learning algorithm using self-generation method applied not only ART-1 to creation of nodes from the input layer to the hidden layer, but also the winer-take-all method, modifying stored patterns according to specific patterns. to adjustment of weights. We have applied the proposed learning method to the problem of recognizing a resident registration number in resident cards. Our experimental result showed that the possibility of local-minima was decreased and the teaming speed and the paralysis were improved more than the conventional error backpropagation algorithm.

Comparison of Algorithm Performance in the Smart Card used as the TETRA terminal encryption module (TETRA 단말기용 스마트카드에서의 알고리즘 성능 비교)

  • Ahn Jae-Hwan;Park Yong-Seok;Jung Chang-Ho;Ahn Joung-Chul
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.183-186
    • /
    • 2006
  • It is studied the implementation possibility of some encryption algorithms which meet the performance requirements in the smart card used in the TETRA system End-to-End Encryption. It is measured the operation time of the algorithm in the smart card which has 32 bit smart card controller made by Samsung Electronics. The algorithms used in the performance comparison are AES, ARIA, 3DES, SEED, IDEA which are the domestic or international standards. The input and output time of the smart card are measured using the smart card protocol analyzer. The pure algorithm operation time is calculated by the repeated algorithm operations. This measurement results can be used as the criteria for the selection of algorithm which will be used in the TETRA End-to-End encryption system. The algorithm which has better performance can be used for the implementation of additional functions in the smart lard, because of the enough time margin.

  • PDF