• Korean Journal of Computational Design and Engineering
• /
• v.5 no.2
• /
• pp.103-112
• /
• 2000

CAD databases are the core element to the management of product information. A key to the successful use of the databases is a rational method of query to and retrieval from the databases. Although it is parts geometry that users eager to retrieve from the CAD databases, no system yet supports geometry-based query. This paper aims at developing a new method of assessing geometric similarity which can serve as the basis of geometric query for CAD database. The proposed method uses ASVP (Alternating Sums of Volumes with Partitioning) decomposition that is a volumetric representation of a part obtained from its boundary representation. A measure of geometric similarity between two solid models is defined on their ASVP tree representations. The measure can take into account overall shapes of parte, shapes of features and their locations. Several properties that a similarity measure needs to satisfy are discussed. The geometric query developed in this paper can be used in a wide range of applications using CAD databases, which include similarity-based design retrieval, variant process planning, and components selection from part library. An experiment has been carried out to demonstrate the effectiveness of the method, and the results are presented.

• KIISE Transactions on Computing Practices
• /
• v.21 no.7
• /
• pp.452-457
• /
• 2015

In this paper, we propose a spatial query processor, SQUERY, which can derive rich query results through spatial reasoning on the initial knowledge base, as well as, process both qualitative and quantitative queries about the topological and directional relationships between spatial objects. In order to derive richer query results, the query processor expands the knowledge base by applying forward spatial reasoning into the initial knowledge base in a preprocessing step. The proposed query processor uses not only qualitative spatial knowledge describing topological/directional relationship between spatial objects, but also utilizes quantitative spatial knowledge including geometric data of individual spatial objects through geometric computation. The results of an experiment with the OSM(Open Street Map) spatial knowledge base demonstrates the high performance of our spatial query processing system.

• International Journal of CAD/CAM
• /
• v.7 no.1
• /
• pp.113-120
• /
• 2007

Sketch based query plays an important role in shape matching for 3D shape retrieval system. Some researchers suggest the sketch based query interfaces. It is more effective to capture the needs of users rather than query by example. In this paper, we propose a new 2D sketch based query interface with coarse filters for shape matching. Coarse filtering enables to eliminate unfavorable shapes from shapes in DB. For the purpose of coarse filtering, we use two filters with the topological and geometric patterns. For the validity of our method, we show the experimental results.

• The Journal of Korean Association of Computer Education
• /
• v.8 no.5
• /
• pp.109-118
• /
• 2005

In this paper, we present a music retrieval system that compares the geometric structure of a melody specified by a user with those in a music database. The system finds matches between a query melody and melodies in the database by analyzing both structural and contextual features. The retrieval method is based on the geometric hashing algorithm which consists of two steps; the preprocessing step and the recognition step. During the preprocessing step, we divide a melody into several fragments and analyze the pitch and duration of each note of the fragments to find a structural feature. To find a contextual feature, we find a main chord for each fragment. During the recognition step, we divide the query melody specified by a user into several fragments and search through all fragments in the database that are structurally and contextually similar to the melody. A vote is cast for each of the fragments and the music whose total votes are the maximum is the music that contains a matching melody against the query melody. Using our approach, we can find similar melodies in a music database quickly. We can also apply the method to detect plagiarism in music.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.11a
• /
• pp.528-529
• /
• 2023

Due to vast points and irregular structure, labeling full points in large-scale point clouds is highly tedious and time-consuming. To resolve this issue, we propose a novel point-based transformer network in weakly-supervised semantic segmentation, which only needs 0.1% point annotations. Our network introduces general local features, representing global factors from different neighborhoods based on their order positions. Then, we share query point weights to local features through point attention to reinforce impacts, which are essential in determining sparse point labels. Geometric encoding is introduced to balance query point impact and remind point position during training. As a result, one point in specific local areas can obtain global features from corresponding ones in other neighborhoods and reinforce from its query points. Experimental results on benchmark large-scale point clouds demonstrate our proposed network's state-of-the-art performance.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.3 no.1
• /
• pp.47-52
• /
• 2010

In this paper, we introduce a new approach for real-time 3D face pose discrimination based on active IR illumination from a monocular view of the camera. Under the IR illumination, the pupils appear bright. We develop algorithms for efficient and robust detection and tracking pupils in real time. Based on the geometric distortions of pupils under different face orientations, an eigen eye feature space is built based on training data that captures the relationship between 3D face orientation and the geometric features of the pupils. The 3D face pose for an input query image is subsequently classified using the eigen eye feature space. From the experiment, we obtained the range of results of discrimination from the subjects which close to the camera are from 94,67%, minimum from 100%, maximum.

• The Journal of the Korea Contents Association
• /
• v.4 no.3
• /
• pp.107-113
• /
• 2004

This paper improved the performance of the face recognition system using the PCA/LDA hybrid method based on the facial geometric feature and the Wavelet transform. Because the previous PCA/LDA methods have measured the similarity according to the formal dispersion, they could not reflect facial boundaries exactly In order to recover this defect, this paper proposed the method using the distance between eyes and mouth. If the difference of the measured distances on the query and the training images is over the given threshold, then the method reorders the candidate images according to energy feature vectors of eyes, a nose, and a chin. To evaluate the performance of the proposed method the computer simulations have been performed with four hundred facial images in the ORL database. The results showed that our method improves about 4％ recognition rate over the previous PCA/LDA method.

• Spatial Information Research
• /
• v.3 no.2
• /
• pp.191-204
• /
• 1995

The data model is a system model which abstracts the spatial and nonspatial fea¬tures of the real world. A system defines through its data model a framework for the inner rep¬resentation of and connections with the outside world. The spatial query language is one of the most efficent framework for defining connection with outside world in the GIS. Existing GIS uses a spatial data model based on relational data model. Therefore, it has some difficulties in data abstraction and representing complex objects through inheritance. In this paper, we pro-pose an object oriented data model-Topological Object Model(TOM). TOM combines object model in ODMG and the planer topological object. Based on this model, we present an object-oriented spatial query language-OQL/Geo. OQL/Geo extends OQL in ODMG and represents TOM effectively. It also provides several operators such as geometric, topological and visible ope-rators. Moreover, it represents with diverse flexivility the request for complex spatial analysis and presentation of query results.

• The KIPS Transactions:PartD
• /
• v.10D no.2
• /
• pp.283-292
• /
• 2003

One-dimensional time-series data have been studied in various database applications such as data mining and data warehousing. However, in the current complex business environment, multidimensional data sequences (MDS') become increasingly important in addition to one-dimensional time-series data. For example, a video stream can be modeled as an MDS in the multidimensional space with respect to color and texture attributes. In this paper, we propose the effective similarity measures on which the similar pattern retrieval is based. An MDS is partitioned into segments, each of which is represented by various geometric and semantic features. The similarity measures are defined on the basis of these segments. Using the measures, irrelevant segments are pruned from a database with respect to a given query. Both data sequences and query sequences are partitioned into segments, and the query processing is based upon the comparison of the features between data and query segments, instead of scanning all data elements of entire sequences.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1753-1762
• /
• 1996

Since the number of spatial objects go easily into millions, they are stored on a secondary storage. In order to speed up accessing the geometric objects, we investigate spatial database system. The spatial objects are organized and accessed by spatial access methods(SAMs). But, SAMs are not able to organize polygons directly The most popular approach for handing polygon in SAMs is to use MBR apporximaotion as a geometric key. MBR provides a fast but inaccurate answers to approximation-based query processing. The performance of approximation-based spatial query processing depends on which type of approximation is chosen for the spatial objects. A suitable approximation is crucial for reducing the size of the candidate set. The better the approxmation quality, the fewer accesses to the exact object are necessary. In this paper, I proposed a new multicontainer approximation named Slice decomposition. The performance of proposed method is compared with other method.