• Title/Summary/Keyword: Binary Method

Search Result 1,974, Processing Time 0.121 seconds

Encryption and decryption of binary data with 2-step phase-shifting digital interferometry (2-step 위상 천이 디지털 간섭계를 이용한 이진 데이터 암호화 및 복호화)

  • Byeon, Hyeon-Jung;Gil, Sang-Geun;Ha, Seung-Ho
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 2006.02a
    • /
    • pp.335-336
    • /
    • 2006
  • We propose a method of encryption and decryption of binary data using 2-step phase-shifting digital interferometry. This technique reduces the number of interferograms in the phase-shifting interferometry. The binary data has been expressed with random code and random phase. We remove the dc-term of the phase-shifting digital interferogram to restore the original binary data. Simulation results shows that the proposed technique can be used for binary data encryption and decryption.

  • PDF

Increase of Binary CDMA transmission range by using Clustering technique (Clustering을 통한 Binary CDMA 전송거리 확보)

  • Choi, Hyeon-Seok;Ji, Choong-Won;Kim, Jung-Sun
    • 한국HCI학회:학술대회논문집
    • /
    • 2008.02a
    • /
    • pp.679-682
    • /
    • 2008
  • High interest for the wireless network is going on the research to apply the related technologies in one's real life. Among these wireless network technologies, local area wireless network, Binary CDMA(Code Division Multiple Access), is the method transferring the data by using RF band based on 2.4Ghz. Binary CDMA has longer transmission distance than Bluetooth. Also, it is of benefit to an inexpensive price because the circuit is simple as compared with being similar to the performance of the existing CDMA. Though Binary CDMA has these benefits, one problem is a frequency overlap, and anther problem is to generate the sections with the shorter distance. To solve these problems, We propose the clustering method that can cover wide area.

  • PDF

Viscosities of LaCl3-CsCl Binary Melts (LaCl3-CsCl 2성분계 용융염의 점도)

  • Kim, Kiho
    • Journal of the Korean institute of surface engineering
    • /
    • v.46 no.2
    • /
    • pp.87-92
    • /
    • 2013
  • Viscosities of $LaCl_3$-CsCl binary melts were measured by the capillary method over the range of their liquidus temperatures to about 1200 K. The cell constant were determined by using pure water. The results obtained are summerized as follows: Viscosities of melted $LaCl_3$ were decreased with the content of CsCl for all over the composition range of binary melts. Composition versus viscosity relation for the binary melt showed a non-linear relationship from the additivity line and the deviations showed a maximum value at about 60 mol% CsCl. This suggest the existence of the complex ion of $LaCl_4{^-}$ in the melt. Activation energy for the viscous flow of the binary melts decreased monotonously with the increasing content of CsCl after a few increasement till 40 mol% CsCl. All of these results were the resemble with the viscosities of $LaCl_3$-NaCl binary melts.

Efficient Object-based Image Retrieval Method using Color Features from Salient Regions

  • An, Jaehyun;Lee, Sang Hwa;Cho, Nam Ik
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.6 no.4
    • /
    • pp.229-236
    • /
    • 2017
  • This paper presents an efficient object-based color image-retrieval algorithm that is suitable for the classification and retrieval of images from small to mid-scale datasets, such as images in PCs, tablets, phones, and cameras. The proposed method first finds salient regions by using regional feature vectors, and also finds several dominant colors in each region. Then, each salient region is partitioned into small sub-blocks, which are assigned 1 or 0 with respect to the number of pixels corresponding to a dominant color in the sub-block. This gives a binary map for the dominant color, and this process is repeated for the predefined number of dominant colors. Finally, we have several binary maps, each of which corresponds to a dominant color in a salient region. Hence, the binary maps represent the spatial distribution of the dominant colors in the salient region, and the union (OR operation) of the maps can describe the approximate shapes of salient objects. Also proposed in this paper is a matching method that uses these binary maps and which needs very few computations, because most operations are binary. Experiments on widely used color image databases show that the proposed method performs better than state-of-the-art and previous color-based methods.

A New Construction of Quaternary LCZ Sequence Set Using Binary LCZ Sequence Set (이진 낮은 상관 구역 수열군을 이용한 새로운 4진 낮은 상관 수열군의 생성법)

  • Jang, Ji-Woong;Kim, Sang-Hyo;Lim, Dae-Woon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1C
    • /
    • pp.9-14
    • /
    • 2009
  • In this paper, using the binary (N,M,L,1) low correlation zone(LCZ) sequence set with specific property, we propose the construction method of a quaternary LCZ sequence set with parameters (2N,2M,L,2). The binary LCZ sequence using this method must have period $N{\equiv}3$ mod 4, balance property, and specific correlation property. The proposed method is modified from the construction method of binary LCZ sequence set by using binary LCZ sequence with specific condition proposed by Kim, Jang, No, and Chung[4].

Direct Mapping based Binary Translation Rule Generator with Considering Retargetability (재목적성을 고려한 직접 매핑 기반의 이진 변환 규칙 생성 도구)

  • Seo, Yongjin;Kim, Hyeon Soo
    • Journal of KIISE:Software and Applications
    • /
    • v.41 no.7
    • /
    • pp.501-517
    • /
    • 2014
  • Binary translation is a restructuring process in order to execute a program targeting a specific device on the other devices. In binary translation, it is very important to generate the translation rules between two devices. There are two methods for generating the translation rules, direct and indirect mapping. The direct mapping is the method for performance, while the indirect mapping is the method for retargetability. This paper suggests a binary translation method based on the direct mapping for the embedded systems. Because, however, the retargetability is also important requirement, we suggest the direct mapping based binary translation with considering the retargetability. In addition, we implement an automatic generation tool for translation rules to prove our concept. Through this method, we can generate the translation rules with considering the performance as well as the retargetability. Furthermore, we can reduce costs for the binary translation.

Speed Estimation of Induction Motor Using Binary Observer (이원관측기를 이용한 유도전동기의 속도추정)

  • 김상욱;나재두;김영석
    • Proceedings of the KIPE Conference
    • /
    • 1997.07a
    • /
    • pp.171-176
    • /
    • 1997
  • This paper presents a design method of the continuous inertial binary observer which includes the rotor flux and speed estimations. The sliding observer based on the variable structure theory ensures the robustness of disturbance and is applied for the method to keep an insensitivity for the variations of parameter. Sliding observer, however, has a high-frequency chattering deteriorating the state estimation performance. To reduce the chattering on the sliding surface in sliding observer and improve the estimation performance, binary observer scheme which has main advantages such as the absence of high-frequency chattering and the finite gains is applied in this paper. Computer simulation results show the effectiveness of binary observer proposed here for the induction motor drives.

  • PDF

A Study on Decision Tree for Multiple Binary Responses

  • Lee, Seong-Keon
    • Communications for Statistical Applications and Methods
    • /
    • v.10 no.3
    • /
    • pp.971-980
    • /
    • 2003
  • The tree method can be extended to multivariate responses, such as repeated measure and longitudinal data, by modifying the split function so as to accommodate multiple responses. Recently, some decision trees for multiple responses have been constructed by Segal (1992) and Zhang (1998). Segal suggested a tree can analyze continuous longitudinal response using Mahalanobis distance for within node homogeneity measures and Zhang suggested a tree can analyze multiple binary responses using generalized entropy criterion which is proportional to maximum likelihood of joint distribution of multiple binary responses. In this paper, we will modify CART procedure and suggest a new tree-based method that can analyze multiple binary responses using similarity measures.

A Joint Transform Correlator Encryption System Based on Binary Encoding for Grayscale Images

  • Peng, Kaifei;Shen, Xueju;Huang, Fuyu;He, Xuan
    • Current Optics and Photonics
    • /
    • v.3 no.6
    • /
    • pp.548-554
    • /
    • 2019
  • A binary encoding method for grayscale images is proposed to address their unsatisfactory decryption results from joint transform correlator (JTC) encryption systems. The method converts the encryption and decryption of grayscale images into that of binary images, and effectively improves decrypted-image quality. In the simulation, we replaced unencoded grayscale images with their binary encoded counterparts in the JTC encryption and decryption processes, then adopted a median filter to suppress saturation noise while keeping other settings unchanged. Accordingly, decrypted-image quality was clearly enhanced as the correlation coefficient (CC) between a decrypted image and its original rose from 0.8237 to 0.9473 initially, and then further to 0.9937, following the above two steps respectively. Finally, optical experimental results confirmed that the proposed encryption system works correctly.

A Study on Fast Matching of Binary Feature Descriptors through Sequential Analysis of Partial Hamming Distances (부분 해밍 거리의 순차적 분석을 통한 이진 특징 기술자의 고속 정합에 관한 연구)

  • Park, Hanhoon;Moon, Kwang-Seok
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.14 no.4
    • /
    • pp.217-221
    • /
    • 2013
  • Recently, researches for methods of generating binary feature descriptors have been actively done. Since matching of binary feature descriptors uses Hamming distance which is based on bit operations, it is much more efficient than that of previous general feature descriptors which uses Euclidean distance based on real number operations. However, since increase in the number of features linearly drops matching speed, in applications such as object tracking where real-time applicability is a must, there has been an increasing demand for methods of further improving the matching speed of binary feature descriptors. In this regard, this paper proposes a method that improves the matching speed greatly while maintaining the matching accuracy by splitting high dimensional binary feature descriptors to several low dimensional ones and sequentially analyzing their partial Hamming distances. To evaluate the efficiency of the proposed method, experiments of comparison with previous matching methods are conducted. In addition, this paper discusses schemes of generating binary feature descriptors for maximizing the performance of the proposed method. Based on the analysis on the performance of several generation schemes, we try to find out the most effective scheme.