• Korean Journal of Optics and Photonics
• /
• v.10 no.1
• /
• pp.32-39
• /
• 1999

In this paper, we made CGH patterns that had continuous amplitude distribution binary coded patterns with two different methods, and analyzed those patterns by using LCSLM (liquid crystal spatial light modulator). The error diffusion algorithm and direct quantization method were used as the binarization methods. The parameters of overall average brightness, mean square error, and diffraction efficiency were used in the comparison of reconstruction characteristics. The LCSLM which we used in this experiment was a binary reflective ferroelectric liquid crystal spatial light modulator addressed electrically with 256$\times$256 pixels, 87% fill factor and 15$\mu$m pixel pitch.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.5 no.2
• /
• pp.58-69
• /
• 1995

In this paper GFI (Generalized Fuzzy Isodata) and FI (Fuzzy Isodata) algorithms are studied and applied to the tire tread pattern classification problem. GFI algorithm which repeatedly grouping the partitioned cluster depending on the fuzzy partition matrix is general form of GI algorithm. In the constructing the binary tree using GFI algorithm cluster validity, namely, whether partitioned cluster is feasible or not is checked and construction of the binary tree is obtained by FDH clustering algorithm. These algorithms show the good performance in selecting the prototypes of each patterns and classifying patterns. Directions of edge in the preprocessed image of tire tread pattern are selected as features of pattern. These features are thought to have useful information which well represents the characteristics of patterns.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5522-5536
• /
• 2017

In this paper, a video based smoke detection method using dynamic texture feature extraction with volume local binary patterns is studied. Block based method was used to distinguish smoke frames in high definition videos obtained by experiments firstly. Then we propose a method that directly extracts dynamic texture features based on irregular motion regions to reduce adverse impacts of block size and motion area ratio threshold. Several general volume local binary patterns were used to extract dynamic texture, including LBPTOP, VLBP, CLBPTOP and CVLBP, to study the effect of the number of sample points, frame interval and modes of the operator on smoke detection. Support vector machine was used as the classifier for dynamic texture features. The results show that dynamic texture is a reliable clue for video based smoke detection. It is generally conducive to reducing the false alarm rate by increasing the dimension of the feature vector. However, it does not always contribute to the improvement of the detection rate. Additionally, it is found that the feature computing time is not directly related to the vector dimension in our experiments, which is important for the realization of real-time detection.

• The Bulletin of The Korean Astronomical Society
• /
• v.37 no.2
• /
• pp.109.2-109.2
• /
• 2012

Current microlensing follow-up observations focus on high-magnification events because of the high efficiency of planet detection. However, central perturbations of high-magnification events caused by a planet can also be produced by a very close or a very wide binary companion, and the two kinds of central perturbations are not generally distinguished without time consuming detailed modeling (a planet-binary degeneracy). Hence, it is important to resolve the planet-binary degeneracy that occurs in high-magnification events. In this paper, we investigate caustic-crossing high-magnification events caused by a planet and a wide binary companion. From this study, we find that because of the different magnification excess patterns inside the central caustics induced by the planet and the binary companion, the light curves of the caustic-crossing planetary-lensing events exhibit a feature that is discriminated from those of the caustic-crossing binary-lensing events, and the feature can be used to immediately distinguish between the planetary and binary companions.

• Journal of Oriental Neuropsychiatry
• /
• v.16 no.2
• /
• pp.65-72
• /
• 2005

Objectives : This study is for discovering the clinical Features of the sleep in ordinary symptoms based on the Sasang Constitution. The result of this study could be helpful to understand and to identify the patients as Soyangin in contrast with the other constitutions -Soeumin, Taeumin and Taeyangin. Methods : There were 1,229 patients(700 female), who answered the questionnaire about their ordinary sleeping patterns. They had been diagnosed, including their clinical Sasang Constitution, by the Sasang Constitution specialist at Bundang Oriental Hospital of Dongguk University. By applying the binary logistic regression analysis, we can measure the characteristics and the influence of ordinary sleeping patterns to the dependent variable(Sasang Constitution). Results : As a result of the binary logistic analysis on the observed questionnaire, we found the characteristics of the ordinary sleeping patterns on Soyangin in contrast with the other constitutions. Firstly, Soyangin has a tendency that he wouldn't dreams more, when he sleeps in contrast with the others. Secondly, Soyangin has a tendency that he wouldn't sleep longer than 6-7hours. Thirthly, Soyangin has a tendency that he will sleep well in contrast with the others. Conclusion : This study will be used to identify patients as Soyangin in contrast with the others-Soemin, Taeumin and Taeyangin.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.6
• /
• pp.102-110
• /
• 1996

A new design scheme of a binary decision tree is proposed. In this scheme a binary decision tree is constructed by using genetic algorithm and FCM algorithm. At each node optimal or near-optimal feature subset is selected which optimizes fitness function in genetic algorithm. The fitness function is inversely proportional to classification error, balance between cluster, number of feature used. The binary strings in genetic algorithm determine the feature subset and classification results - error, balance - form fuzzy partition matrix affect reproduction of next genratin. The proposed design scheme is applied to the tire tread patterns and handwriteen alphabetic characters. Experimental results show the usefulness of the proposed scheme.

• The Korean Journal of Applied Statistics
• /
• v.29 no.3
• /
• pp.539-547
• /
• 2016

We discussed how to handle missing binary data clinical trials. Patterns of occurring missing data are discussed and introduce missing binary data imputation methods that include the modified method. A simulation is performed by modifying actual data for each method. The condition of this simulation is controlled by a response rate and a missing value rate. We list the simulation results for each method and discussed them at the end of this paper.

• Journal of the Semiconductor & Display Technology
• /
• v.8 no.2
• /
• pp.23-29
• /
• 2009

To increase the data capacity of one-dimensional symbology, 2D barcodes have been proposed a decade ago. In this paper, a new 2D barcode detection algorithm based on Local Binary Pattern is presented. To locate 2D barcode symbols, a texture analysis scheme based on the Local Binary Pattern is adopted, and a gray-scale projection with sub-pixel operation is utilized to separate the symbol precisely from the input image. Finally, the segmented symbol is normalized using the inverse perspective transformation for the decoding process. The proposed method ensures high performances under various lighting/printing conditions and strong perspective deformations. Experiments show that our method is very robust and efficient in detecting the symbol area for the various types of 2D barcodes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4429-4447
• /
• 2018

Local binary descriptors are well-suited for many real-time and/or large-scale computer vision applications, while their low computational complexity is usually accompanied by the limitation of performance. In this paper, we propose a new optimization framework, RLDB (Robust-LDB), to improve a typical region-based binary descriptor LDB (local difference binary) and maintain its computational simplicity. RLDB extends the multi-feature strategy of LDB and applies a more complete region-comparing configuration. A cascade bit selection method is utilized to select the more representative patterns from massive comparison pairs and an online learning strategy further optimizes descriptor for each specific patch separately. They both incorporate LDP (linear discriminant projections) principle to jointly guarantee the robustness and distinctiveness of the features from various scales. Experimental results demonstrate that this integrated learning framework significantly enhances LDB. The improved descriptor achieves a performance comparable to floating-point descriptors on many benchmarks and retains a high computing speed similar to most binary descriptors, which better satisfies the demands of applications.

• Journal of Korea Multimedia Society
• /
• v.17 no.9
• /
• pp.1070-1075
• /
• 2014

Due to a number of illegal copied videos, many video content markets have been threatened. Since this copied videos have intercepted the profits of the content holders, content developers lose the will to generate new contents. Therefore, video copy detection approaches have been developed to protect the copyrights of video contents. However, many illegal uploader who generate copied videos used video transformations to avoid video copy detection systems. Among of the video transformations, rotation and flipping did not distorted the quality of video contents. Thus, these two video transformations were adopt to generate copied video. In order to detect rotated or flipping copy videos, rotation and flipping robust region binary pattern (RFR) recently was proposed. But, this RFR has a weakness according to rotated angles. Therefore, in order to overcome this problem, multi region binary patterns are proposed in this paper. The proposed method has the similar performance with the original RFR. But, it showed much higher efficiency for memory spaces.