• Journal of Plant Biotechnology
• /
• v.4 no.2
• /
• pp.45-52
• /
• 2002

A lot of SSRs (simple sequence repeats) in peach and pear from enriched genomic libraries and in peach from a cDNA library were developed. These SSRs were applied to other related species, giving phenograms of 52 Prunes and 60 pear accessions. Apple SSRs could also be successfully used in Pyrus spp. Thirteen morphological traits were characterized on the basis of the linkage map obtained from an $F_2$ population of peach. This map was compiled with those morphological markers and 83 DNA markers, including SSR markers used as anchor loci, to compare different peach maps. Molecular markers tightly linked to new root-knot nematode resistance genes were also found. A linkage map including disease related genes, pear scab resistance and black spot susceptibility, in the Japanese pear Kinchaku were constructed using 118 RAPD markers. Another linkage map, of the European pear Bartlett, was also constructed with 226 markers, including 49 SSRs from pear, apple, peach and cherry. Maps of other Japanese pear cultivars, i.e., Kousui and Housui, were also constructed. These maps were the first results of pear species.

• Korean Journal of Computational Design and Engineering
• /
• v.19 no.1
• /
• pp.61-67
• /
• 2014

This paper proposes a procedure enabling the extraction of view-dependent triangular approximations from a height map. In general, procedures to approximate a height map use tree hierarchies. These methods, however, have a limitation in terms of accuracy, because they depend on tree hierarchy than terrain features. To overcome the difficult, we apply the simplification method for triangular meshes to a height map. The proposed procedure maintains full decimation procedure to support multiresolution. The maintenance of decimation procedure results in creation of the groups (trees), each of which consists of vertices that can be merged into one vertex (root node). As the groups have tolerance which is determined by some tests, they support the generation of view-dependent arbitrary triangular meshes.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.1
• /
• pp.81-91
• /
• 1994

A DCT map and new cldebook design algorithm based on a two-dimension discrete cosine transform (2D-DCT) is presented for coder of image vector quantizer. We divide the image into smaller subblocks, then, using 2D DCT, separate it into blocks which are hard to code but it bears most of the visual information and easy to code but little visual information, and DCT map is made. According to this map, the significant features of training image are extracted by using the 2D DCT. A codebook is generated by partitioning the training set into a binary tree based on tree-structure. Each training vector at a nonterminal node of the binary tree is directed to one of the two descendants by comparing a single feature associated with that node to a threshold. Compared with the pairwise neighbor (PPN) and classified VQ(CVQ) algorithm, about 'Lenna' and 'Boat' image, the new algorithm results in a reduction in computation time and shows better picture quality with 0.45 dB and 0.33dB differences as to PNN, 0.05dB and 0.1dB differences as to CVQ respectively.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.3 s.303
• /
• pp.73-80
• /
• 2005

Recently there have been many efforts to support searching and browsing based on the visual content of image and multimedia data. Most existing approaches to content-based image retrieval rely on query by example or user based low-level features such as color, shape, texture. But these methods of query are not easy to use and restrict. In this paper we propose a method for automatic color object extraction and labelling to support multiple queries of content-based image retrieval system. These approaches simplify the regions within images using single colorizing algorithm and extract color object using proposed Color and Spatial based Binary tree map(CSB tree map). And by searching over a large of number of processed regions, a index for the database is created by using proposed labelling method. This allows very fast indexing of the image by color contents of the images and spatial attributes. Futhermore, information about the labelled regions, such as the color set, size, and location, enables variable multiple queries that combine both color content and spatial relationships of regions. We proved our proposed system to be high performance through experiment comparable with another algorithm using 'Washington' image database.

• Molecules and Cells
• /
• v.20 no.2
• /
• pp.201-209
• /
• 2005

We have constructed an AFLP-based linkage map of Japanese red pine (Pinus densiflora Siebold et Zucc.) using haploid DNA samples of 96 megagametophytes from a single maternal tree, selection clone Kyungbuk 4. Twenty-eight primer pairs generated a total of 5,780 AFLP fragments. Five hundreds and thirteen fragments were verified as genetic markers with two alleles by their Mendelian segregation. At the linkage criteria LOD 4.0 and maximum recombination fraction 0.25(${\theta}$), a total of 152 markers constituted 25 framework maps for 19 major linkage groups. The maps spanned a total length of 2,341 cM with an average framework marker spacing of 18.4 cM. The estimated genome size was 2,662 cM. With an assumption of equal marker density, 82.2% of the estimated genome would be within 10 cM of one of the 230 linked markers, and 68.1% would be within 10 cM of one of the 152 framework markers. We evaluated map completeness in terms of LOD value, marker density, genome length, and map coverage. The resulting map will provide crucial information for future genomic studies of the Japanese red pine, in particular for QTL mapping of economically important breeding target traits.

• Proceedings of the KSR Conference
• /
• 2005.11a
• /
• pp.623-629
• /
• 2005

A technical road map is one of critical research methods which include mid/long term strategies and objectives. There are many of projects conducted using this road map. A technical tree is used at the step of planning of the projects. This research was aimed at reviewing previous systems for conducting researches for and a basis required for improving railway safety in the future by finding out inconsistency arising from physical WBS, which is methodology of defining in existing railway technical trees. In the process of this research, we considered differences between systems safety and prevention as well as natures of them using the established technical tree, and set up plans for improving technical tree to secure railway safety as an integrated system.

• The Journal of Korea Robotics Society
• /
• v.7 no.2
• /
• pp.150-159
• /
• 2012

In this paper, we propose a cost-aware Rapidly-exploring Random Tree (RRT) path planning algorithm for mobile robots. A mobile robot is presented with a cost map of the field of interest and assigned to move from one location to another. As a robot moves, the robot is penalized by the cost at its current location according to the cost map. The overall cost of the robot is determined by the trajectory of the robot. The goal of the proposed cost-aware RRT algorithm is to find a trajectory with the minimal cost. The cost map of the field can represent environmental parameters, such as temperature, humidity, chemical concentration, wireless signal strength, and stealthiness. For example, if the cost map represents packet drop rates at different locations, the minimum cost path between two locations is the path with the best possible communication, which is desirable when a robot operates under the environment with weak wireless signals. The proposed cost-aware RRT algorithm extends the basic RRT algorithm by considering the cost map when extending a motion segment. We show that the proposed algorithm gives an outstanding performance compared to the basic RRT method. We also demonstrate that the use of rejection sampling can give better results through extensive simulation.

• The Journal of Korea Robotics Society
• /
• v.18 no.4
• /
• pp.487-495
• /
• 2023

This paper presents a method for autonomous exploration of indoor environments using a 2-dimensional Light Detection And Ranging (LiDAR) scanner. The proposed frontier-based exploration method considers navigability from the current robot position to extracted frontier targets. An approach to constructing the point cloud grid map that accurately reflects the occupancy probability of glass obstacles is proposed, enabling identification of safe frontier grids on the safety grid map calculated from the point cloud grid map. Navigability, indicating whether the robot can successfully navigate to each frontier target, is calculated by applying the skeletonization-informed rapidly exploring random tree algorithm to the safety grid map. While conventional exploration approaches have focused on frontier detection and target position/direction decision, the proposed method discusses a safe navigation approach for the overall exploration process until the completion of mapping. Real-world experiments have been conducted to verify that the proposed method leads the robot to avoid glass obstacles and safely navigate the entire environment, constructing the point cloud map and calculating the navigability with low computing time deviation.

• Journal of Korean Society of Forest Science
• /
• v.110 no.3
• /
• pp.355-368
• /
• 2021

This study aims to identify appropriate tree species and crops for agroforestry target sites in North Korea based on ecological geography and site properties. To this end, an ecological geographic map (13 regions and 4 zones) of North Korea was made using satellite images and North Korean academic journal articles. The target agroforestry sites were selected and mapped according to 18 site conditions depending on 3 site characteristics, and the sites were divided into short-term and long-term target sites depending on the agroforestry management period. Finally, optimal combinations of 30 tree species and 19 crops were selected by overlapping the ecological geographic map and agroforestry target site map. For regions within the same zone, tree species and crops were almost similar; however, compared to regions in other zones, they differed. This is likely because the geographical climatic characteristics reflected in the ecological geographic map vary greatly from zone to zone. These results will be used to propose a combination of suitable tree species and crops that takes into account both management purposes and management types for inter-Korean forest cooperation in the agroforestry sector.

• Journal of Korea Multimedia Society
• /
• v.15 no.6
• /
• pp.794-804
• /
• 2012

For the geometric computations on the protein molecules, the proximity queries, such as computing the minimum distance from an arbitrary point to the molecule or detecting the collision between a point and the molecule, are essential. For the proximity queries, the efficiency of the computation time can be different according to the data structure used for the molecule. In this paper, we present the data structures and algorithms for applying proximity queries to a molecule with GPU acceleration. We present two data structures, a voxel map and a sphere tree, where the molecule is represented as a set of spheres, and corresponding algorithms. Moreover, we show that the performance of presented data structures are improved from 3 to 633 times compared to the previous data structure for the molecules containing 1,000~15,000 atoms.