• Title/Summary/Keyword: Binary sequences

Search Result 155, Processing Time 0.032 seconds

Real-time Moving Object Tracking from a Moving Camera (이동 카메라 영상에서 이동물체의 실시간 추적)

  • Chun, Quan;Lee, Ju-Shin
    • The KIPS Transactions:PartB
    • /
    • v.9B no.4
    • /
    • pp.465-470
    • /
    • 2002
  • This paper presents a new model based method for tracking moving object from a moving camera. In the proposed method, binary model is derived from detected object regions and Hausdorff distance between the model and edge image is used as its similarity measure to overcome the target's shape changes. Also, a novel search algorithm and some optimization methods are proposed to enable realtime processing. The experimental results on our test sequences demonstrate the high efficiency and accuracy of our approach.

Analysis for Time Offset of PN Sequence in CDMA System (CDMA 시스팀에서의 PN 부호 시간차 측정 기법)

  • 전정식;한영열
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.5
    • /
    • pp.971-980
    • /
    • 1994
  • The need increased capacity in the cellular system has resulted in the adoption of digital technology with CDMA as the channel access method. It has been recognized that the distinction of the base station is important for its performance in CDMA, since the same spreading sequences are used by the all base stations. Time offset of the pseudo-random noise binary code are used to distinguish signals received at a mobile station from different base station. But the start of the zero offset PN sequence is chosen arbitrary without the background of the systematic and mathematical elaboration. This paper proposes a mothed that define the start of the zero offset PN sequence mathematically. This paper also discusses a method that can easily calculate the time offset of the received spreading sequence with respect to the zero offset PN sequence.

  • PDF

Design of MuIti-Weight 2-Dimensional Optical Orthogonal Codes (다중 부호 무게를 가진 2차원 광 직교 부호의 설계)

  • Piao, Yong-Chun;Shin, Dong-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1C
    • /
    • pp.1-5
    • /
    • 2008
  • Optical code division multiple access(OCDMA) systems make the active users to share the bandwidth by simply assigning distinct optical orthogonal codeword to each active user. An optical orthogonal code(OOC) is a collection of binary sequences with good correlation properties which are important factors of determining the capacity of OCDMA systems. Recently, 2-D OOC construction method is frequently researched which is able to support more users than 1-D OOC. In this paper, a combinatorial construction of simple multi-weight 2-D OOC with autocorrelation 0 and crosscorrelation 1 is proposed and the bound on the size of these codes is derived.

Vision-based Predictive Model on Particulates via Deep Learning

  • Kim, SungHwan;Kim, Songi
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.5
    • /
    • pp.2107-2115
    • /
    • 2018
  • Over recent years, high-concentration of particulate matters (e.g., a.k.a. fine dust) in South Korea has increasingly evoked considerable concerns about public health. It is intractable to track and report $PM_{10}$ measurements to the public on a real-time basis. Even worse, such records merely amount to averaged particulate concentration at particular regions. Under this circumstance, people are prone to being at risk at rapidly dispersing air pollution. To address this challenge, we attempt to build a predictive model via deep learning to the concentration of particulates ($PM_{10}$). The proposed method learns a binary decision rule on the basis of video sequences to predict whether the level of particulates ($PM_{10}$) in real time is harmful (>$80{\mu}g/m^3$) or not. To our best knowledge, no vision-based $PM_{10}$ measurement method has been proposed in atmosphere research. In experimental studies, the proposed model is found to outperform other existing algorithms in virtue of convolutional deep learning networks. In this regard, we suppose this vision based-predictive model has lucrative potentials to handle with upcoming challenges related to particulate measurement.

Research on Camouflaged Encryption Scheme Based on Hadamard Matrix and Ghost Imaging Algorithm

  • Leihong, Zhang;Yang, Wang;Hualong, Ye;Runchu, Xu;Dawei, Zhang
    • Current Optics and Photonics
    • /
    • v.5 no.6
    • /
    • pp.686-698
    • /
    • 2021
  • A camouflaged encryption scheme based on Hadamard matrix and ghost imaging is proposed. In the process of the encryption, an orthogonal matrix is used as the projection pattern of ghost imaging to improve the definition of the reconstructed images. The ciphertext of the secret image is constrained to the camouflaged image. The key of the camouflaged image is obtained by the method of sparse decomposition by principal component orthogonal basis and the constrained ciphertext. The information of the secret image is hidden into the information of the camouflaged image which can improve the security of the system. In the decryption process, the authorized user needs to extract the key of the secret image according to the obtained random sequences. The real encrypted information can be obtained. Otherwise, the obtained image is the camouflaged image. In order to verify the feasibility, security and robustness of the encryption system, binary images and gray-scale images are selected for simulation and experiment. The results show that the proposed encryption system simplifies the calculation process, and also improves the definition of the reconstructed images and the security of the encryption system.

Analysis of junction between T-DNA and plant genome in insect resistance GM Chinese cabbage (해충저항성 GM 배추에서 T-DNA와 식물체 게놈의 인접 부위 분석)

  • Lim, Sun-Hyung;Park, Seung-Hye;Kim, Jung-Hwan;Kim, Na-Young;Won, So-Youn;Lee, Si-Myung;Shin, Kong-Sik;Woo, Hee-Jong;Kim, Dong-Hern;Cho, Hyun-Suk
    • Journal of Plant Biotechnology
    • /
    • v.35 no.2
    • /
    • pp.101-108
    • /
    • 2008
  • The Agrobacterium-mediated transformation has been successfully used method to introduce foreign genes into some monocotyledonous as well as a large number of dicotyledonous plants genome, We developed transgenic Chinese cabbage plants with insect-resistance gene, modified CryIAc, by Agrobacterium-transformation and confirmed transgene copy number by Southern blot analysis. We confirmed that twenty-nine out of 46 transgenic Chinese cabbage plants have single copy of CryIAc. To obtain the sequences information on the transferred DNA (T-DNA) integration into plant genome, we analyzed left border (LB) flanking sequences by genome walking (GW) PCR method. Out of 46 transgenic Chinese cabbage plants examined, 37 carried the vector backbone sequences. This result indicates that the transfer of the vector backbone from the binary vectors resulted mainly from inefficient termination of LB site. Analysis of T-DNA LB flanking region of 9 transgenic Chinese cabbage plants without vector backbone revealed that all LB ends were not conserved and nucleotides up to 36bp from the LB cleavage site were deleted.

Object Tracking Based on Exactly Reweighted Online Total-Error-Rate Minimization (정확히 재가중되는 온라인 전체 에러율 최소화 기반의 객체 추적)

  • JANG, Se-In;PARK, Choong-Shik
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.4
    • /
    • pp.53-65
    • /
    • 2019
  • Object tracking is one of important steps to achieve video-based surveillance systems. Object tracking is considered as an essential task similar to object detection and recognition. In order to perform object tracking, various machine learning methods (e.g., least-squares, perceptron and support vector machine) can be applied for different designs of tracking systems. In general, generative methods (e.g., principal component analysis) were utilized due to its simplicity and effectiveness. However, the generative methods were only focused on modeling the target object. Due to this limitation, discriminative methods (e.g., binary classification) were adopted to distinguish the target object and the background. Among the machine learning methods for binary classification, total error rate minimization can be used as one of successful machine learning methods for binary classification. The total error rate minimization can achieve a global minimum due to a quadratic approximation to a step function while other methods (e.g., support vector machine) seek local minima using nonlinear functions (e.g., hinge loss function). Due to this quadratic approximation, the total error rate minimization could obtain appropriate properties in solving optimization problems for binary classification. However, this total error rate minimization was based on a batch mode setting. The batch mode setting can be limited to several applications under offline learning. Due to limited computing resources, offline learning could not handle large scale data sets. Compared to offline learning, online learning can update its solution without storing all training samples in learning process. Due to increment of large scale data sets, online learning becomes one of essential properties for various applications. Since object tracking needs to handle data samples in real time, online learning based total error rate minimization methods are necessary to efficiently address object tracking problems. Due to the need of the online learning, an online learning based total error rate minimization method was developed. However, an approximately reweighted technique was developed. Although the approximation technique is utilized, this online version of the total error rate minimization could achieve good performances in biometric applications. However, this method is assumed that the total error rate minimization can be asymptotically achieved when only the number of training samples is infinite. Although there is the assumption to achieve the total error rate minimization, the approximation issue can continuously accumulate learning errors according to increment of training samples. Due to this reason, the approximated online learning solution can then lead a wrong solution. The wrong solution can make significant errors when it is applied to surveillance systems. In this paper, we propose an exactly reweighted technique to recursively update the solution of the total error rate minimization in online learning manner. Compared to the approximately reweighted online total error rate minimization, an exactly reweighted online total error rate minimization is achieved. The proposed exact online learning method based on the total error rate minimization is then applied to object tracking problems. In our object tracking system, particle filtering is adopted. In particle filtering, our observation model is consisted of both generative and discriminative methods to leverage the advantages between generative and discriminative properties. In our experiments, our proposed object tracking system achieves promising performances on 8 public video sequences over competing object tracking systems. The paired t-test is also reported to evaluate its quality of the results. Our proposed online learning method can be extended under the deep learning architecture which can cover the shallow and deep networks. Moreover, online learning methods, that need the exact reweighting process, can use our proposed reweighting technique. In addition to object tracking, the proposed online learning method can be easily applied to object detection and recognition. Therefore, our proposed methods can contribute to online learning community and object tracking, detection and recognition communities.

A Practical Approximate Sub-Sequence Search Method for DNA Sequence Databases (DNA 시퀀스 데이타베이스를 위한 실용적인 유사 서브 시퀀스 검색 기법)

  • Won, Jung-Im;Hong, Sang-Kyoon;Yoon, Jee-Hee;Park, Sang-Hyun;Kim, Sang-Wook
    • Journal of KIISE:Databases
    • /
    • v.34 no.2
    • /
    • pp.119-132
    • /
    • 2007
  • In molecular biology, approximate subsequence search is one of the most important operations. In this paper, we propose an accurate and efficient method for approximate subsequence search in large DNA databases. The proposed method basically adopts a binary trie as its primary structure and stores all the window subsequences extracted from a DNA sequence. For approximate subsequence search, it traverses the binary trie in a breadth-first fashion and retrieves all the matched subsequences from the traversed path within the trie by a dynamic programming technique. However, the proposed method stores only window subsequences of the pre-determined length, and thus suffers from large post-processing time in case of long query sequences. To overcome this problem, we divide a query sequence into shorter pieces, perform searching for those subsequences, and then merge their results. To verify the superiority of the proposed method, we conducted performance evaluation via a series of experiments. The results reveal that the proposed method, which requires smaller storage space, achieves 4 to 17 times improvement in performance over the suffix tree based method. Even when the length of a query sequence is large, our method is more than an order of magnitude faster than the suffix tree based method and the Smith-Waterman algorithm.

Effect of Manganese Content on the Magnetic Susceptibility of Ferrous-Manganese Alloys: Correlation between Microstructure on X-Ray Diffraction and Size of the Low-Intensity Area on MRI

  • Youn, Sung Won;Kim, Moon Jung;Yi, Seounghoon;Ahn, Hyun Jin;Park, Kwan Kyu;Lee, Jongmin;Lee, Young-Cheol
    • Investigative Magnetic Resonance Imaging
    • /
    • v.19 no.2
    • /
    • pp.76-87
    • /
    • 2015
  • Purpose: There is an ongoing search for a stent material that produces a reduced susceptibility artifact. This study evaluated the effect of manganese (Mn) content on the MRI susceptibility artifact of ferrous-manganese (Fe-Mn) alloys, and investigated the correlation between MRI findings and measurements of Fe-Mn microstructure on X-ray diffraction (XRD). Materials and Methods: Fe-Mn binary alloys were prepared with Mn contents varying from 10% to 35% by weight (i.e., 10%, 15%, 20%, 25%, 30%, and 35%; designated as Fe-10Mn, Fe-15Mn, Fe-20Mn, Fe-25Mn, Fe-30Mn, and Fe-35Mn, respectively), and their microstructure was evaluated using XRD. Three-dimensional spoiled gradient echo sequences of cylindrical specimens were obtained in parallel and perpendicular to the static magnetic field (B0). In addition, T1-weighted spin echo, T2-weighted fast spin echo, and $T2^*$weighted gradient echo images were obtained. The size of the low-intensity area on MRI was measured for each of the Fe-Mn binary alloys prepared. Results: Three phases of ${\alpha}^{\prime}$-martensite, ${\gamma}$-austenite, and ${\varepsilon}$-martensite were seen on XRD, and their composition changed from ${\alpha}^{\prime}$-martensite to ${\gamma}$-austenite and/or ${\varepsilon}$-martensite, with increasing Mn content. The Fe-10Mn and Fe-15Mn specimens comprised ${\alpha}^{\prime}$-martensite, the Fe-20Mn and Fe-25Mn specimens comprised ${\gamma}+{\varepsilon}$ phases, and the Fe-30Mn and Fe-35Mn specimens exhibited a single ${\gamma}$ phase. The size of the low-intensity areas of Fe-Mn on MRI decreased relative to its microstructure on XRD with increasing Mn content. Conclusion: Based on these findings, proper conditioning of the Mn content in Fe-Mn alloys will improve its visibility on MR angiography, and a Mn content of more than 25% is recommended to reduce the magnetic susceptibility artifacts on MRI. A reduced artifact of Fe-Mn alloys on MRI is closely related to the paramagnetic constitution of ${\gamma}$-austenite and/or ${\varepsilon}$-martensite.

Design of a computationally efficient frame synchronization scheme for wireless LAN systems (무선랜 시스템을 위한 계산이 간단한 초기 동기부 설계)

  • Cho, Jun-Beom;Lee, Jong-Hyup;Han, Jin_Woo;You, Yeon-Sang;Oh, Hyok-Jun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.64-72
    • /
    • 2012
  • Synchronization including timing recovery, frequency offset compensation, and frame synchronization is most important signal processing block in all wireless/wired communication systems. In most communication systems, synchronization schemes based on training sequences or preambles are used. WLAN standards of 802.11a/g/n released by IEEE are based on OFDM systems. OFDM systems are known to be much more sensitive to frequency and timing synchronization errors than single carrier systems. A loss of orthogonality between the multiplexed subcarriers can result in severe performance degradations. The starting position of the frame and the beginning of the symbol and training symbol can be estimated using correlation methods. Correlation processing functionality is usually complex because of large number of multipliers in implementation especially when the reference signal is non-binary. In this paper, a simple correlation based synchronization scheme is proposed for IEEE 802.11a/g/n systems. Existing property of a periodicity in the training symbols are exploited. Simulation and implementation results show that the proposed method has much smaller complexity without any performance degradation than the existing schemes.