• Title/Summary/Keyword: binary processing

Search Result 729, Processing Time 0.029 seconds

Fast Device Discovery for Remote Device Management in Lighting Control Networks

  • Choi, Sang-Il;Lee, Sanghun;Koh, Seok-Joo;Lim, Sang-Kyu;Kim, Insu;Kang, Tae-Gyu
    • Journal of Information Processing Systems
    • /
    • v.11 no.1
    • /
    • pp.125-133
    • /
    • 2015
  • The Remote Device Management (RDM) protocol is used to manage the devices in the lighting control networks. RDM provides bi-directional communications between a controller and many lighting devices over the DMX512-A network. In RDM, using a simple binary search scheme, which is based on the 48-bit unique ID (UID) of each device, discovers the lighting devices. However, the existing binary search scheme tends to require a large delay in the device discovery process. In this paper, we propose a novel partition-based discovery scheme for fast device discovery in RDM. In the proposed scheme, all devices are divided into several partitions as per the device UID, and the controller performs device discovery for each partition by configuring a response timer that each device will use. From numerical simulations, we can see that there is an optimal number of partitions to minimize the device discovery time for a given number of devices in the proposed scheme, and also that the proposed partition-based scheme can reduce the device discovery time, as compared to the existing binary search scheme.

Evaluation of Histograms Local Features and Dimensionality Reduction for 3D Face Verification

  • Ammar, Chouchane;Mebarka, Belahcene;Abdelmalik, Ouamane;Salah, Bourennane
    • Journal of Information Processing Systems
    • /
    • v.12 no.3
    • /
    • pp.468-488
    • /
    • 2016
  • The paper proposes a novel framework for 3D face verification using dimensionality reduction based on highly distinctive local features in the presence of illumination and expression variations. The histograms of efficient local descriptors are used to represent distinctively the facial images. For this purpose, different local descriptors are evaluated, Local Binary Patterns (LBP), Three-Patch Local Binary Patterns (TPLBP), Four-Patch Local Binary Patterns (FPLBP), Binarized Statistical Image Features (BSIF) and Local Phase Quantization (LPQ). Furthermore, experiments on the combinations of the four local descriptors at feature level using simply histograms concatenation are provided. The performance of the proposed approach is evaluated with different dimensionality reduction algorithms: Principal Component Analysis (PCA), Orthogonal Locality Preserving Projection (OLPP) and the combined PCA+EFM (Enhanced Fisher linear discriminate Model). Finally, multi-class Support Vector Machine (SVM) is used as a classifier to carry out the verification between imposters and customers. The proposed method has been tested on CASIA-3D face database and the experimental results show that our method achieves a high verification performance.

A Study of an Image Retrieval Method using Binary Subimage (이진 부분영상을 이용한 영상 검색 기법에 관한 연구)

  • 정순영;최민규;남재열
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.2 no.1
    • /
    • pp.28-37
    • /
    • 2001
  • An image retrieval method combining shape information of 2-dimension color histograms with color information of HSI color histograms is proposed in this paper. In addition, the proposed method can find location information of image through the comparison of similarity among subimages. The suggested retrieval method applies the location information to shape and color information and can retrieve region information which is hard to distinguish in the binary image. Some simulation results show that it works very well in the behalf of precision/recall graph compare with conventional method which uses color histogram. Especially, the proposed method brought well effects such as rotations and transitions of the objects in an image was found.

  • PDF

An Improved Secure Semi-fragile Watermarking Based on LBP and Arnold Transform

  • Zhang, Heng;Wang, Chengyou;Zhou, Xiao
    • Journal of Information Processing Systems
    • /
    • v.13 no.5
    • /
    • pp.1382-1396
    • /
    • 2017
  • In this paper, we analyze a recently proposed semi-fragile watermarking scheme based on local binary pattern (LBP) operators, and note that it has a fundamental flaw in the design. In this work, a binary watermark is embedded into image blocks by modifying the neighborhood pixels according to the LBP pattern. However, different image blocks might have the same LBP pattern, which can lead to false detection in watermark extraction process. In other words, one can modify the host image intentionally without affecting its watermark message. In addition, there is no encryption process before watermark embedding, which brings another potential security problem. To illustrate its weakness, two special copy-paste attacks are proposed in this paper, and several experiments are conducted to prove the effectiveness of these attacks. To solve these problems, an improved semi-fragile watermarking based on LBP operators is presented. In watermark embedding process, the central pixel value of each block is taken into account and Arnold transform is adopted to guarantee the security of watermark. Experimental results show that the improved watermarking scheme can overcome the above defects and locate the tampered region effectively.

A New Interior-Filling Algorithm Based on Binary Boundary Coding (이진 경계 코드를 이용한 새로운 영역채움 알고리듬)

  • 심재창;조석제;하영호
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.11
    • /
    • pp.1867-1871
    • /
    • 1989
  • One of the most common problems in pattern recognition and image processing is filling the interior of a region when its contour is given. The existing algorithms of the filling are parity check technique, seeding technique, and technique based on chain coding the boundaries. In this paper, a very simple but effective technique for filling the interior of bounded region is proposed. This algorithm is based on the information of binary-coded boundary direction and covers some of the drawbacks reported in the earlier relevant works.

  • PDF

A Circuit design for generating binary logarithms for possible signal processing using programmable variable - rate up/down counter (Programmable variable-rate up/down counter를 사용한 신호처리가 가능한 Binary logarithms 발생을 위한 회로설계)

  • 이지영
    • The Journal of the Acoustical Society of Korea
    • /
    • v.5 no.3
    • /
    • pp.13-20
    • /
    • 1986
  • 본 논문은 신호처리가 가능한 2진 로가리즘 상수를 발생시키기 위한 programmable variable-rate up/down 계수기의 설계를 기술한다. 2진수에 대한 밑수가 2인 로가리즘 계승의 적용은 결 과적으로 오차가 발생한다. log\sub 2\(1+χ)-χ에 의해 정의된 것처럼 log\sub 2\(1+χ)에서의 오차는 직선의 집합으로 갖게된다. 계수기 rate는 직선의 기울기에 비례한다. 그러므로 신호처리가 가능한 2진 로가리즘 상수는 programmable 계수기를 사용함으로써 쉽게 발생될 수 있다.

  • PDF

Single Somatic Embryogenesis from Transformant with Proteinase II Gene in Panax ginseng C.A. Meyer

  • Yang, Deok-Chun;Kim, Se-Young;Rho, Yeong-Deok;Kim, Moo-Sung
    • Plant Resources
    • /
    • v.6 no.3
    • /
    • pp.205-210
    • /
    • 2003
  • Ginseng(Panax ginseng C.A. Meyer) is a perennial herbaceous plant which grows very slowly. It takes about 3 to 4 years from seeding to collecting the ripe seeds and the ginseng propagation is very difficult. and so, it is very difficult to breed ginseng plant. Ginseng tissue culture was started from at 1960, and ginseng commercial product by in vitro callus culture was saled, however upto now, regenerants were not planted to soil normally. Recently, plant genetic engineering to produce transgenic plants by introducing useful genes has been advanced greatly. In a present paper, transformation of ginseng plants was achieved by co-cultivation with Agrobacterium harboring the binary vector coding Proteinase-II gene, which confer resistant or tolerant to insect pests, The binary vector for transformation was constructed with disarmed Ti-plasmid and with double 35S promoter. The NPT II gene and introduced genes of the transgenic ginseng plants were successfully identified by the PCR. Especially the transgenic ginseng plants were regenerated using new techniques such as repetitive single somatic embryogenesis.

  • PDF

A Study on the Multi-function Processor Unit Implementation for Binary Image Processing (이진영상처리를 위한 다기능 프로세서 장치구현에 관한 연구)

  • 기재조;허윤석;이대영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.7
    • /
    • pp.970-979
    • /
    • 1993
  • In this paper, a multi-function processor unit is implemented for binary image processing. This unit consists of a set of address generatior, window pipeline register, look up table, control unit, and two local memories .The merits of multi-function processor unit are more simpler than basic SAP and improved disposal speed. A simple software selection give the various choices of image sizes and it can process the function of smoothing, thinning, feature extraction, and edge detection, selectively or sequentially.

  • PDF

An Efficient Bit-Level Lossless Grayscale Image Compression Based on Adaptive Source Mapping

  • Al-Dmour, Ayman;Abuhelaleh, Mohammed;Musa, Ahmed;Al-Shalabi, Hasan
    • Journal of Information Processing Systems
    • /
    • v.12 no.2
    • /
    • pp.322-331
    • /
    • 2016
  • Image compression is an essential technique for saving time and storage space for the gigantic amount of data generated by images. This paper introduces an adaptive source-mapping scheme that greatly improves bit-level lossless grayscale image compression. In the proposed mapping scheme, the frequency of occurrence of each symbol in the original image is computed. According to their corresponding frequencies, these symbols are sorted in descending order. Based on this order, each symbol is replaced by an 8-bit weighted fixed-length code. This replacement will generate an equivalent binary source with an increased length of successive identical symbols (0s or 1s). Different experiments using Lempel-Ziv lossless image compression algorithms have been conducted on the generated binary source. Results show that the newly proposed mapping scheme achieves some dramatic improvements in regards to compression ratios.

Dorsal Hand Vein Identification Based on Binary Particle Swarm Optimization

  • Benziane, Sarah Hachemi;Benyettou, Abdelkader
    • Journal of Information Processing Systems
    • /
    • v.13 no.2
    • /
    • pp.268-284
    • /
    • 2017
  • The dorsal hand vein biometric system developed has a main objective and specific targets; to get an electronic signature using a secure signature device. In this paper, we present our signature device with its different aims; respectively: The extraction of the dorsal veins from the images that were acquired through an infrared device. For each identification, we need the representation of the veins in the form of shape descriptors, which are invariant to translation, rotation and scaling; this extracted descriptor vector is the input of the matching step. The optimization decision system settings match the choice of threshold that allows accepting/rejecting a person, and selection of the most relevant descriptors, to minimize both FAR and FRR errors. The final decision for identification based descriptors selected by the PSO hybrid binary give a FAR =0% and FRR=0% as results.