• Title/Summary/Keyword: binary processing

Search Result 726, Processing Time 0.028 seconds

Performance Test for the Long Distance Sprayer by an Image Processing (영상처리를 이용한 광역방제기 팬의 성능실험)

  • Min, B.R.;Kim, D.W.;Seo, K.W.;Hong, J.T.;Kim, W.;Choi, J.H.;Lee, D.W.
    • Journal of Animal Environmental Science
    • /
    • v.14 no.3
    • /
    • pp.159-166
    • /
    • 2008
  • This research was carried out to test and analyze capacity of the long distance sprayer fan in large livestock farmhouses. Long distance sprayer was manufactured to be able to spray a lot of water, which was a solvent for agricultural chemicals and black dye with the maximum spraying distance of 140 m and the effective spraying distance of 100 m. The spraying quantity and the distance were measured the intensity values of images within A4 papers, which absorbed the agricultural chemicals by spraying by binary image processing. These A4 papers were fixed upon the height of 1 m from soil ground at regular 10 m interval. After the A4 papers were collected and analyzed the intensity values of gray level. Gray level was ranged from 0 to 255, where 0 was black and 255 was white. A4 paper was fallen down from the stick at 10 m distance, because there were too large amount of sprayed water with black dye. Also, the paper showed low gray level at distance 30 m because of dropping lots of black water. The intensity value of gray level was showed almost less than 200 on the A4 papers between the distance 20 m and 100 m, which meant equality of spraying quantity. Additionally, it was possible to spay agricultural chemicals of until 180 m. Throughout this research, long distance sprayer could apply for preventing hoof-and-mouth disease in large livestock farmhouses.

  • PDF

Structural Properties of MO-SiO$_2$(M=Zn, Sn, In, Ag, Ni) by Sol-Gel Method (졸겔법으로 제조된 MO-$SiO_2$(M=Zn,Sn,In,Ag,Ni)의 구조특성)

  • Sin, Yong-Uk;Kim, Sang-U
    • Korean Journal of Materials Research
    • /
    • v.11 no.7
    • /
    • pp.603-608
    • /
    • 2001
  • $MO-SiO_2$ (M = Zn, Sn, In, Ag, Ni) binary silica gels were synthesized by sol-gel method and their structural change with the kind of metal ions was characterized by XRD, FT- IR and $^{29}$Si-NMR. Although X-ray analysis showed partial recrystallization of $AgNO_3$ in $Ag-SiO_2$gel, crystalline phase formed by the bonding between metal ion and the silica matrix didn't appear in all $MO-SiO_2$ gels. The FT-IR analysis showed that Zn, Sn and in partially formed Si-O-M bonding in silica matrix and made an shift of absorption peak to by Si-O-Si symmetrical vibration. In addition, $^{29}Si-NMR$ studies showed that Zn, Sn and In didn't affect sol-gel process of silica and were linked with non-bridging oxygen of the linear silica structure, which formed imperfect network because of low temperature sol-gel process. Ag and Ni make a role of catalysis on sol-gel process, resulting in densifying the silica network structure.

  • PDF

The Research of Shape Recognition Algorithm for Image Processing of Cucumber Harvest Robot (오이수확로봇의 영상처리를 위한 형상인식 알고리즘에 관한 연구)

  • Min, Byeong-Ro;Lim, Ki-Taek;Lee, Dae-Weon
    • Journal of Bio-Environment Control
    • /
    • v.20 no.2
    • /
    • pp.63-71
    • /
    • 2011
  • Pattern recognition of a cucumber were conducted to detect directly the binary images by using thresholding method, which have the threshold level at the optimum intensity value. By restricting conditions of learning pattern, output patterns could be extracted from the same and similar input patterns by the algorithm. The algorithm of pattern recognition was developed to determine the position of the cucumber from a real image within working condition. The algorithm, designed and developed for this project, learned two, three or four learning pattern, and each learning pattern applied it to twenty sample patterns. The restored success rate of output pattern to sample pattern form two, three or four learning pattern was 65.0%, 45.0%, 12.5% respectively. The more number of learning pattern had, the more number of different out pattern detected when it was conversed. Detection of feature pattern of cucumber was processed by using auto scanning with real image of 30 by 30 pixel. The computing times required to execute the processing time of cucumber recognition took 0.5 to 1 second. Also, five real images tested, false pattern to the learning pattern is found that it has an elimination rate which is range from 96 to 98%. Some output patterns was recognized as a cucumber by the algorithm with the conditions. the rate of false recognition was range from 0.1 to 4.2%.

The Recognition of Occluded 2-D Objects Using the String Matching and Hash Retrieval Algorithm (스트링 매칭과 해시 검색을 이용한 겹쳐진 이차원 물체의 인식)

  • Kim, Kwan-Dong;Lee, Ji-Yong;Lee, Byeong-Gon;Ahn, Jae-Hyeong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.7
    • /
    • pp.1923-1932
    • /
    • 1998
  • This paper deals with a 2-D objects recognition algorithm. And in this paper, we present an algorithm which can reduce the computation time in model retrieval by means of hashing technique instead of using the binary~tree method. In this paper, we treat an object boundary as a string of structural units and use an attributed string matching algorithm to compute similarity measure between two strings. We select from the privileged strings a privileged string wIth mmimal eccentricity. This privileged string is treated as the reference string. And thell we wllstructed hash table using the distance between privileged string and the reference string as a key value. Once the database of all model strings is built, the recognition proceeds by segmenting the scene into a polygonal approximation. The distance between privileged string extracted from the scene and the reference string is used for model hypothesis rerieval from the table. As a result of the computer simulation, the proposed method can recognize objects only computing, the distance 2-3tiems, while previous method should compute the distance 8-10 times for model retrieval.

  • PDF

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.

A selective sparse coding based fast super-resolution method for a side-scan sonar image (선택적 sparse coding 기반 측면주사 소나 영상의 고속 초해상도 복원 알고리즘)

  • Park, Jaihyun;Yang, Cheoljong;Ku, Bonwha;Lee, Seungho;Kim, Seongil;Ko, Hanseok
    • The Journal of the Acoustical Society of Korea
    • /
    • v.37 no.1
    • /
    • pp.12-20
    • /
    • 2018
  • Efforts have been made to reconstruct low-resolution underwater images to high-resolution ones by using the image SR (Super-Resolution) method, all to improve efficiency when acquiring side-scan sonar images. As side-scan sonar images are similar with the optical images with respect to exploiting 2-dimensional signals, conventional image restoration methods for optical images can be considered as a solution. One of the most typical super-resolution methods for optical image is a sparse coding and there are studies for verifying applicability of sparse coding method for underwater images by analyzing sparsity of underwater images. Sparse coding is a method that obtains recovered signal from input signal by linear combination of dictionary and sparse coefficients. However, it requires huge computational load to accurately estimate sparse coefficients. In this study, a sparse coding based underwater image super-resolution method is applied while a selective reconstruction method for object region is suggested to reduce the processing time. For this method, this paper proposes an edge detection and object and non object region classification method for underwater images and combine it with sparse coding based image super-resolution method. Effectiveness of the proposed method is verified by reducing the processing time for image reconstruction over 32 % while preserving same level of PSNR (Peak Signal-to-Noise Ratio) compared with conventional method.

Information Hiding Technique in Smart Phone for the Implementation of GIS Web-Map Service (GIS 웹 맵 서비스 구현을 위한 스마트 폰에서의 정보은닉 기법)

  • Kim, Jin-Ho;Seo, Yong-Su;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.5
    • /
    • pp.710-721
    • /
    • 2010
  • Recently, for the advancement of embedded technology about mobile device, a new kind of service, mash-up is appeared. It is service or application combining multimedia content making tool or device and web-GIS(geographic information system) service in the mobile environment. This service can be ease to use for casual user and can apply in various ways. So, It is served in web 2.0 environment actively. But, in the mashup service, because generated multimedia contents linked with web map are new type of multimedia contents which include user's migration routes in the space such as GPS coordinates. Thus, there are no protection ways for intellectual property created by GIS web-map service users and user's privacy. In this paper, we proposed a location and user information hiding scheme for GIS web-map service. This scheme embeds location and user information into a picture that is taken by camera module on the mobile phone. It is not only protecting way for user's privacy but is also tracing way against illegal photographer who is peeping person through hidden camera. And than, we also realized proposed scheme on the mobile smart phone. For minimizing margin of error about location coordinate value against contents manipulating attacks, GPS information is embedded into chrominance signal of contents considering weight of each digit about binary type of GPS coordinate value. And for tracing illegal photographer, user information such as serial number of mobile phone, phone number and photographing date is embedded into frequency spectrum of contents luminance signal. In the experimental results, we confirmed that the error of extracted information against various image processing attacks is within reliable tolerance. And after file format translation attack, we extracted embedded information from the attacked contents without no damage. Using similarity between extracted one and original templete, we also extracted whole information from damaged chrominance signal of contents by various image processing attacks.

Design and Analysis of Code Sequence Generating Algorithms using Almost Perfect Nonlinear Functions (APN 함수를 이용한 부호계열 발생 알고리즘 설계 빛 분석)

  • Lee, Jeong-Jae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.11 no.1
    • /
    • pp.47-52
    • /
    • 2010
  • For cryptographic systems, nonlinearity is crucial since most linear systems are easily decipherable. C.Bracken, Z.Zhaetc., propose the APN(Almost Perfect Nonlinear) functions with the properties similar to those of the bent functions with perfect nonlinearity. We design two kinds of new code sequence generating algorithms using the above APN functions. And we find that the out of phase ${\tau}\;{\neq}\;0$, autocorrelation functions, $R_{ii}(\tau)$ and the crosscorrelation functions, $R_{ik}(\tau)$ of the binary code sequences generated by two new algorithms over GF(2), have three values of {-1, $-1-2^{n/2}$, $-1+2^{n/2}$}. We also find that the out of phase ${\tau}\;{\neq}\;0$, autocorrelation functions, $R_{p,ii}(\tau)$ and the crosscorrelation functions, $R_{p,ik}(\tau)$ of the nonbinary code sequences generated by the modified algorithms over GF(p), $p\;{\geq}\;3$, have also three values of {$-1+p^{n-1}$, $-1-p^{(n-1)/2}+p^{n-1}$, $-1+p^{(n-1)/2}p^{n-1}$}. We show that these code sequences have the characteristics of the correlation functions similar to those of Gold code sequences.

Watermarking Using Multiresolution Wavelet Transform and Image Fusion (다중 해상도 웨이블릿 변환과 영상 융합을 이용한 워터마킹)

  • Kim Dong-Hyun;Jun Kye-Suk;Lee Dae-Young
    • The KIPS Transactions:PartB
    • /
    • v.12B no.7 s.103
    • /
    • pp.729-736
    • /
    • 2005
  • In this paper. the proposed method for the digital watermarking is based on the multiresolution wavelet transform. The 1-level Discrete Wavelet Transform(DWT) coefficients of a $2N_{wx}{\times}2N_{wy}$ binary logo image used as a watermarks. The LL band and middle frequency band of the host image that the 3-level DWT has been performed are divided into $N_{wx}{\times}N_{wy}$ size and we use large coefficients at the divided blocks to make threshold. we set the thresholds that completely insert the watermark in each frequency of the host image. The thresholds in each frequency of the host image differ each other. The watermarks where is the same positions are added to the larger coefficients than threshold in the blocks at LL band and middle frequency band in order to prevent the quality deterioration of the host image. The watermarks are inserted in LL band and middle frequency band of the host image. In order to be invisibility of the watermark, the Human Visual System(HVS) is applied to the watermark. We prove the proper embedding method by experiment. We rapidly detect the watermark using this watermarking method. And because the small size watermarks are inserted by HVS, the results confirm the superiority of the proposed method on invisibility and robustness.

Image Compression Using DCT Map FSVQ and Single - side Distribution Huffman Tree (DCT 맵 FSVQ와 단방향 분포 허프만 트리를 이용한 영상 압축)

  • Cho, Seong-Hwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.10
    • /
    • pp.2615-2628
    • /
    • 1997
  • In this paper, a new codebook design algorithm is proposed. It uses a DCT map based on two-dimensional discrete cosine of transform (2D DCT) and finite state vector quantizer (FSVQ) when the vector quantizer is designed for image transmission. We make the map by dividing input image according to edge quantity, then by the map, the significant features of training image are extracted by using the 2D DCT. A master codebook of FSVQ is generated by partitioning the training set using binary tree based on tree-structure. The state codebook is constructed from the master codebook, and then the index of input image is searched at not master codebook but state codebook. And, because the coding of index is important part for high speed digital transmission, it converts fixed length codes to variable length codes in terms of entropy coding rule. The huffman coding assigns transmission codes to codes of codebook. This paper proposes single-side growing huffman tree to speed up huffman code generation process of huffman tree. Compared with the pairwise nearest neighbor (PNN) and classified VQ (CVQ) algorithm, about Einstein and Bridge image, the new algorithm shows better picture quality with 2.04 dB and 2.48 dB differences as to PNN, 1.75 dB and 0.99 dB differences as to CVQ respectively.

  • PDF