• Title/Summary/Keyword: Barcode

Search Result 346, Processing Time 0.162 seconds

Algorithm of Converged Corner Detection-based Segmentation in the Data Matrix Barcode (코너 검출 기반의 융합형 Data Matrix 바코드 분할 알고리즘)

  • Han, Hee-June;Lee, Jong-Yun
    • Journal of the Korea Convergence Society
    • /
    • v.6 no.1
    • /
    • pp.7-16
    • /
    • 2015
  • A segmentation process extracts an interesting area of barcode in an image and gives a crucial impart on the performance of barcode verifier. Previous segmentation methods occurs some issues as follows. First, it is very hard to determine a threshold of length in Hough Line transform because it is sensitive. Second, Morphology transform delays the process when you conduct dilation and erosion operations during the image extraction. Therefore, we proposes a novel Converged Harris Corner detection-based segmentation method to detect an interesting area of barcode in Data Matrix. In order to evaluate the performance of proposed method, we conduct experiments by a dataset of barcode in accordance with size and location in an image. In result, our method solves the problems of delay and surrounding environments, threshold setting, and extracts the barcode area 100% from test images.

A Morphology Technique-Based Boundary Detection in a Two-Dimensional QR Code (2차원 QR코드에서 모폴로지 기반의 경계선 검출 방법)

  • Park, Kwang Wook;Lee, Jong Yun
    • Journal of Digital Convergence
    • /
    • v.13 no.2
    • /
    • pp.159-175
    • /
    • 2015
  • The two-dimensional QR code has advantages such as directional nature, enough data storage capacity, ability of error correction, and ability of data restoration. There are two major issues like speed and correctiveness of recognition in the two-dimensional QR code. Therefore, this paper proposes a morphology-based algorithm of detecting the interest region of a barcode. Our research contents can be summarized as follows. First, the interest region of a barcode image was detected by close operations in morphology. Second, after that, the boundary of the barcode are detected by intersecting four cross line outside in a code. Three, the projected image is then rectified into a two-dimensional barcode in a square shape by the reverse-perspective transform. In result, it shows that our detection and recognition rates for the barcode image is also 97.20% and 94.80%, respectively and that outperforms than previous methods in various illumination and distorted image environments.

Molecular Identification of Pooideae, Poaceae in Korea (국내 농경지에 발생하는 포아풀아과 잡초의 분자생물학적 동정)

  • Lee, Jeongran;Kim, Chang-Seok;Lee, In-Yong
    • Weed & Turfgrass Science
    • /
    • v.4 no.1
    • /
    • pp.18-25
    • /
    • 2015
  • A universal DNA barcoding for agricultural noxious weeds is a powerful technique for species identification without morphological knowledge, by using short sections of DNA from a specific region of the genome. Two standard barcode markers, chloroplast rbcL and matK, and a supplementary nuclear ribosomal Internal Transcribed Spacer (ITS) region were used to examine the effectiveness of the markers for Pooideae barcoding using 163 individuals of 29 taxa across 16 genera of Korean Pooideae. The rbcL and ITS revealed a good level of amplification and sequencing success while matK did not. Barcode gaps were 78.6% for rbcL, 96.2% for matK, and 91.7% for ITS, respectively. Resolving powers were 89.3% for rbcL, 92.3% for matK, and 79.1% for ITS. The matK obtained the best both barcode gap and resolving power. However, it should be considered not to employ matK for Pooideae barcode because of low rate of PCR amplification and sequencing success. As a single DNA marker, rbcL and ITS were reasonable for Pooideae barcode. Barcode gap and resolving power were increased when ITS was incorporated into the rbcL. The barcode sequences were deposited to the National Center for Biotechnology Information (NCBI) database for public use.

Topological Mapping and Navigation in Indoor Environment with Invisible Barcode (바코드가 있는 가정환경에서의 위상학적 지도형성 및 자율주행)

  • Huh, Jin-Wook;Chung, Woong-Sik;Chung, Wan-Kyun
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.30 no.9 s.252
    • /
    • pp.1124-1133
    • /
    • 2006
  • This paper addresses the localization and navigation problem using invisible two dimensional barcodes on the floor. Compared with other methods using natural/artificial landmark, the proposed localization method has great advantages in cost and appearance, since the location of the robot is perfectly known using the barcode information after the mapping is finished. We also propose a navigation algorithm which uses the topological structure. For the topological information, we define nodes and edges which are suitable for indoor navigation, especially for large area having multiple rooms, many walls and many static obstacles. The proposed algorithm also has an advantage that errors occurred in each node are mutually independent and can be compensated exactly after some navigation using barcode. Simulation and experimental results. were performed to verify the algorithm in the barcode environment, and the result showed an excellent performance. After mapping, it is also possible to solve the kidnapped case and generate paths using topological information.

Angle Invariant and Noise Robust Barcode Detection System (기울기와 노이즈에 강인한 바코드 검출 시스템)

  • Park, Dongjin;Jun, Kyungkoo
    • Journal of KIISE
    • /
    • v.42 no.7
    • /
    • pp.868-877
    • /
    • 2015
  • The barcode area extraction from images has been extensively studied, and existing methods exploit frequency characteristics or depend on the Hough transform (HT). However, the slantedness of the images and noise affects the performance of these approaches. Moreover, it is difficult to deal with the case where an image contains multiple barcodes. We therefore propose a barcode detection algorithm that is robust under such unfavorable conditions. The pre-processing step implements a probabilistic Hough transform to determine the areas that contain barcodes with a high probability, regardless of the slantedness, noise, and the number of instances. Then, a frequency component analysis extracts the barcodes. We successfully implemented the proposed system and performed a series of barcode extraction tests.

DNA Barcode Examination of Bryozoa (Class: Gymnolaemata) in Korean Seawater

  • Lee, Hyun-Jung;Kwan, Ye-Seul;Kong, So-Ra;Min, Bum-Sik;Seo, Ji-Eun;Won, Yong-Jin
    • Animal Systematics, Evolution and Diversity
    • /
    • v.27 no.2
    • /
    • pp.159-163
    • /
    • 2011
  • DNA barcoding of Bryozoa or "moss animals" has hardly advanced and lacks reference sequences for correct species identification. To date only a small number of cytochrome c oxidase subunit I (COI) sequences from 82 bryozoan species have been deposited in the National Center for Biotechnology Information (NCBI) GenBank and Barcode of Life Data Systems (BOLD). We here report COI data from 53 individual samples of 29 bryozoan species collected from Korean seawater. To our knowledge this is the single largest gathering of COI barcode data of bryozoans to date. The average genetic divergence was estimated as 23.3% among species of the same genus, 25% among genera of the same family, and 1.7% at intraspecific level with a few rare exceptions having a large difference, indicating a possibility of presence of cryptic species. Our data show that COI is a very appropriate marker for species identification of bryozoans, but does not provide enough phylogenetic information at higher taxonomic ranks. Greater effort involving larger taxon sampling for the barcode analyses is needed for bryozoan taxonomy.

The Performance Analysis of Digital Watermarking based on Merging Techniques

  • Ariunzaya, Batgerel;Chu, Hyung-Suk;An, Chong-Koo
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.12 no.3
    • /
    • pp.176-180
    • /
    • 2011
  • Even though algorithms for watermark embedding and extraction step are important issue for digital watermarking, watermark selection and post-processing can give us an opportunity to improve our algorithms and achieve higher performance. For this reason, we summarized the possibilities of improvements for digital watermarking by referring to the watermark merging techniques rather than embedding and extraction algorithms in this paper. We chose Cox's function as main embedding and extraction algorithm, and multiple barcode watermarks as a watermark. Each bit of the multiple copies of barcode watermark was embedded into a gray-scale image with Cox's embedding function. After extracting the numbers of watermark, we applied the watermark merging techniques; including the simple merging, N-step iterated merging, recover merging and combination of iterated-recover merging. Main consequence of our paper was the fact of finding out how multiple barcode watermarks and merging techniques can give us opportunities to improve the performance of algorithm.

A System Realization of the 2D Barcode Electrothermal Printer for Scanner Recognition (스케너 인식에 강한 2차원 바코드 인쇄시스템의 구현)

  • 김영빈;윤호군;류광렬
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.05a
    • /
    • pp.183-186
    • /
    • 2003
  • The system realization of 2D barcode electrothermal printer for the adapted scanner recognition is presented. The 2D barcode leads the horizontal and vertical definition to recognize the scanner being an important part in system. The high definition electrothermal printer of 300dpi resolution used power historic control technique to vertical and horizontal coordinate is realized. The result of experiment is that the system enhances the quality of print image to require recognizing 20 barcode.

  • PDF

Detection of Junctions via Accumulation of Connectivity-based Weight in Image Space : Applications for Locating 2D Barcode (영상 공간에서의 연결성 기반 가중치 누적을 통한 코너점 검출: 이차원 바코드 검출에의 응용)

  • Kim, Jeong-Tae;Song, Jin-Young
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.10
    • /
    • pp.1865-1867
    • /
    • 2007
  • We propse a novel corner detection algorithm for locating 2D Data Matrix barcode in an image. The proposed method accumulates weight for each cross point defined by every combination of edge points in the image, and detects the corner point of the barcode L-pattern by determining the location of the highest accumulated weight. By designing the weight considering the connectivity of two lines around the cross point, we were able to detect the corner of L-pattern even for the cases that the lines of L-patterns are short. In the experiments, the proposed method showed improved performance compared with the conventional Hough transform based method in terms of detectability and computation time.