• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.6
• /
• pp.91-98
• /
• 2011

This paper proposes an efficient and accurate vision based recognition and tracking framework for texture free objects. We approached this problem with a two phased algorithm: detection phase and tracking phase. In the detection phase, the algorithm extracts shape context descriptors that used for classifying objects into predetermined interesting targets. Later on, the matching result is further refined by a minimization technique. In the tracking phase, we resorted to meanshift tracking algorithm based on Bhattacharyya coefficient measurement. In summary, the contributions of our methods for the underwater robot vision are four folds: 1) Our method can deal with camera motion and scale changes of objects in underwater environment; 2) It is inexpensive vision based recognition algorithm; 3) The advantage of shape based method compared to a distinct feature point based method (SIFT) in the underwater environment with possible turbidity variation; 4) We made a quantitative comparison of our method with a few other well-known methods. The result is quite promising for the map based underwater SLAM task which is the goal of our research.

• Journal of Intelligence and Information Systems
• /
• v.18 no.3
• /
• pp.1-12
• /
• 2012

There are many trees in a roadside, parks or facilities for landscape. Although we are easily seeing a tree in around, it would be difficult to classify it and to get some information about it, such as its name, species and surroundings of the tree. To find them, you have to find the illustrated books for plants or search for them on internet. The important components of a tree are leaf, flower, bark, and so on. Generally we can classify the tree by its leaves. A leaf has the inherited features of the shape, vein, and so on. The shape is important role to decide what the tree is. And texture included in vein is also efficient feature to classify them. This paper evaluates the performance of a leaf classification system using both shape and texture features. We use Fourier descriptors for shape features, and both gray-level co-occurrence matrices and wavelets for texture features, and used combinations of such features for evaluation of images from the Flavia dataset. We compared the recognition rates and the precision-recall performances of these features. Various experiments showed that a combination of shape and texture gave better results for performance. The best came from the case of a combination of features of shape and texture with a flipped contour for a Fourier descriptor.

• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.73-83
• /
• 2009

In this paper we propose an object similarity matching method based on shape characteristics of an object in an image. The proposed method extracts edge points from edges of objects and generates a log polar histogram with respect to each edge point to represent the relative placement of extracted points. It performs the matching in such a way that it compares polar histograms of two edge points sequentially along with edges of objects, and uses a well-known k-NN(nearest neighbor) approach to retrieve similar objects from a database. To verify the proposed method, we've compared it to an existing Shape-Context method. Experimental results reveal that our method is more accurate in object matching than the existing method, showing that when k=5, the precision of our method is 0.75-0.90 while that of the existing one is 0.37, and when k=10, the precision of our method is 0.61-0.80 while that of the existing one is 0.31. In the experiment of rotational transformation, our method is also more robust compared to the existing one, showing that the precision of our method is 0.69 while that of the existing one is 0.30.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.505-507
• /
• 2021

Image recognition technology is a technology that recognizes an image object by using the generated feature descriptor and generates object feature points and feature descriptors that can compensate for the shape of the object to be recognized based on artificial intelligence technology, environmental changes around the object, and the deterioration of recognition ability by object rotation. The purpose of the present invention is to implement a power management framework required to increase profits and minimize damage to livestock farmers by preventing accidents that may occur due to the improvement of efficiency of the use of livestock house power and overloading of electricity by integrating and managing a power fire management device installed for analyzing a complex environment of power consumption and fire occurrence in a smart safety livestock house, and to develop and disseminate a safe and optimized intelligent smart safety livestock house.

• Proceedings of the Plant Resources Society of Korea Conference
• /
• 2018.10a
• /
• pp.75-75
• /
• 2018

Watermelons, Citrullus species(Cucurbitaceae), are native to Africa and have been cultivated since ancient times. T he fruit flesh of wild watermelon is watery, but typically hard-textured, pale-colored and bland or bitter. The familiar sweet dessert watermelons, C. lanatus, featuring non-bitter, tender, well colored flesh, have a narrow genetic base, suggesting that they are originated from a series of selection events in a single ancestral population. In this study, considered as sweet dissert watermelon, genetic resources, C. lanatus, comprising of traditional cultivars and local accessions were collected from 18 different countries in four continents. A total of 60 accessions were characterized morphologically according to RDA genebank descriptors combined with Japan and China, list for 11 qualitative characteristics, leaf length, leaf width, petiole length, petiole diameter-source, stalk end length, stalk diameter, fruit length, fruit diameter, rind thickness, flesh sugar content($^{\circ}brix$), fruit weight-sink, and 6 sink related characters, leaf margin incision-source, fruit shape, fruit skin ground color, fruit skin stain color, fruit skin stain pattern and flesh color-sink, were also investigated. Even though the relatedness between some morphological traits and fruit weight or fruit sweetness showed no significance, the accessions investigated have a great deal of variation for most of the morphological traits. Additionally, the accessions which showed good performance in flesh color and fruit shape (IT271048) and high sugar content of flesh (IT274119, IT290118) above 14brix, were investigated in this experiment. The accessions, which have the information on specific traits including the selected accessions could be introduced, distributed and investigated for further use.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.379-390
• /
• 2008

Due to the increase of the amount of image data, the demand for searching similar images is continuously increasing. Therefore, many researches about the content-based image retrieval (CBIR) are conducted to search similar images effectively. In CBIR, it uses image contents such as color, shape, and texture for more effective retrieval. However, when we apply CBIR to satellite images which are complex and pose the difficulty in using color information, we can have trouble to get a good retrieval result. Since it is difficult to use color information of satellite images, we need image segmentation to use shape information by separating the shape of an object in a satellite image. However, because satellite images are complex, image segmentation is hard and poor image segmentation results in poor retrieval results. In this paper, we propose a new approach to search similar images without image segmentation for satellite images. To do a similarity search without image segmentation, we define a similarity of an image by considering SIFT keypoint descriptors which doesn't require image segmentation. Experimental results show that the proposed approach more effectively searches similar satellite images which are complex and pose the difficulty in using color information.

• Convergence Security Journal
• /
• v.19 no.2
• /
• pp.91-104
• /
• 2019

In this paper, we present a novel local descriptor, Local Prominent Directional Pattern (LPDP), to represent the description of facial images for gender recognition purpose. To achieve a clearly discriminative representation of local shape, presented method encodes a target pixel with the prominent directional variations in local structure from an analysis of statistics encompassed in the histogram of such directional variations. Use of the statistical information comes from the observation that a local neighboring region, having an edge going through it, demonstrate similar gradient directions, and hence, the prominent accumulations, accumulated from such gradient directions provide a solid base to represent the shape of that local structure. Unlike the sole use of gradient direction of a target pixel in existing methods, our coding scheme selects prominent edge directions accumulated from more samples (e.g., surrounding neighboring pixels), which, in turn, minimizes the effect of noise by suppressing the noisy accumulations of single or fewer samples. In this way, the presented encoding strategy provides the more discriminative shape of local structures while ensuring robustness to subtle changes such as local noise. We conduct extensive experiments on gender recognition datasets containing a wide range of challenges such as illumination, expression, age, and pose variations as well as sketch images, and observe the better performance of LPDP descriptor against existing local descriptors.

• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.345-355
• /
• 2008

SIFT is popularly used in computer vision application such as object recognition, motion tracking, and 3D reconstruction among various shape descriptors. However, it is not easy to apply SIFT into the image similarity search as it is since it uses many high dimensional keypoint vectors. In this paper, we present a SIFT based image similarity search method using an edge image pyramid and an interesting region detection. The proposed method extracts keypoints, which is invariant to contrast, scale, and rotation of image, by using the edge image pyramid and removes many unnecessary keypoints from the image by using the hough transform. The proposed hough transform can detect objects of ellipse type so that it can be used to find interesting regions. Experimental results demonstrate that the retrieval performance of the proposed method is about 20% better than that of traditional SIFT in average recall.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.223-230
• /
• 2003

Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R＊-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R＊-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R＊-tree combines SOM and R＊-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R＊-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R＊-tree with that of an SOM and an R＊-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R＊-tree outperforms both the SOM and R＊-tree due to the reduction of the number of nodes required to build R＊-tree and retrieval time cost.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.42 no.5
• /
• pp.640-646
• /
• 1997

To determine variations in leaflet length (LL), leaflet width (LW), leaflet size (LS), and leaflet shape index (LSI), and their association with eight agronomic traits, characterization data of 884 soybean accessions which were grown in the autumn of 1992 in Taiwan were analyzed. LL ranged from 4.3 to 14.7 cm, and LW ranged from 2.8 to 9.7 cm. Also, LS (LL $\times$ LW) ranged from 12.1 to 124.6 $\textrm{cm}^2$. The absolute variation of LL, LW, and LS was not large because of limitation in vegetative growth by short day length. None was classified as a large leaflet based on the International Board for Plant Genetic Resources (IBPGR) descriptors. LSI (LL /LW) ranged from 1.21 to 3.06, and three accessions were classified as narrow leaflet. There were differences in ranges and means of LL, LW, LS, and LSI between and within temperate and tropical accessions. LL, LW, LS, and LSI had highly significant positive correlations with seven agronomic traits and highly significant negative correlation with 100-seed weight except LW for all accessions. There was variation in the closeness of association among leaflet traits, and between and within temperate and tropical accessions. Generally, LL, LW, and LS were more closely associated with days to flowering, plant height at $R_1$ and $R_8$, number of pods per plant; LSI was more closely associated with 100-seed weight than other traits.