• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.655-664
• /
• 2001

The continuous data such as video streams and voice analog signals can be modeled as multidimensional data sequences(MDS's) in the feature space, In this paper, we investigate the clustering technique for multidimensional data sequence, Each sequence is represented by a small number by hyper rectangular clusters for subsequent storage and similarity search processing. We present a linear clustering algorithm that guarantees a predefined level of clustering quality and show its effectiveness via experiments on various video data sets.

• The Bulletin of The Korean Astronomical Society
• /
• v.37 no.2
• /
• pp.99.2-99.2
• /
• 2012

We updated the far-ultraviolet (FUV) spectral images of the entire Vela supernova remnant (SNR) using newly processed FIMS/SPEAR data. In the present study, we compare the newly produced FUV images with the X-ray and $H{\alpha}$ images, and examine how the Vela SNR evolves and interacts with the ambient medium on a global scale. The comparison with X-ray images has revealed a FUV filamentary feature corresponding with the boundary of the northeast-southwest asymmetry of the X-ray shell. The relatively low O IV] ${\lambda}1404$ to O III] ${\lambda}{\lambda}1661$, 1666 ratio estimated on the FUV filament is compatible with the previous proposal that the observed asymmetry of the Vela SNR could be due to the ${\gamma}2$ Velorum stellar wind bubble (SWB). The southwest FUV features surrounding a faint extended X-ray region are characterized as the region where the Vela SNR is interacting slightly stronger with ambient mediums within the dim X-ray southwest section. From a comparison with the $H{\alpha}$ image, we identify a ring-like $H{\alpha}$ feature overlapped with an extended hot X-ray feature of similar size and two local peaks of C IV ${\lambda}{\lambda}1548$, 1551 emission. Their morphologies are consistent with the expected shape when the $H{\alpha}$ ring is in direct contact with the near or far side of the Vela SNR. We suggest that the B3V-type star HD 76161 found at the center of the $H{\alpha}$ ring would be the exciting source of the H II region.

• The Bulletin of The Korean Astronomical Society
• /
• v.37 no.2
• /
• pp.125.1-125.1
• /
• 2012

The wave number 4 (wave-4) and wave number 3 (wave-3) longitudinal structures in the thermospheric neutral mass density are understood as tidal structures driven by diurnal eastward-propagating zonal wave number 3 (DE3) and wave number 2 (DE2) tides, respectively. However, those structures have been identified using data from limited time periods, and the consistency and recurrence of those structures have not yet been examined using long-term observation data. We examine the persistence of those structures by analyzing the neutral mass density data for the years 2001-2008 taken by the CHAllenging Minisatellite Payload (CHAMP) satellite. During years of low solar activity, the amplitude of the wave-4 structure is pronounced during August and September, and the wave-4 phase shows a consistent eastward phase progression of $90^{\circ}$ within 24 h local time in different months and years. During years of high solar activity, the wave-4 amplitude is small and does not show a distinctive annual pattern, but the tendency of the eastward phase shift at a rate of $90^{\circ}$/24 h exists. Thus the DE3 signature in the wave-4 structure is considered as a persistent feature. The wave-3 structure is a weak feature in most months and years. The amplitude and phase of the wave-3 structure do not show a notable solar cycle dependence. Among the contributing tidal modes to the wave-3 structure, the DE2 amplitude is most pronounced. This result may suggest that the DE2 signature, although it is a weak signature, is a perceivable persistent feature in the thermosphere.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.2
• /
• pp.93-100
• /
• 2014

3D object recognition using only 2D images is a difficult work because each images are generated different to according to the view direction of cameras. Because SIFT algorithm defines the local features of the projected images, recognition result is particularly limited in case of input images with strong perspective transformation. In this paper, we propose the object recognition method that improves SIFT algorithm by using several sequential images captured from rotating 3D object around a rotation axis. We use the geometric relationship between adjacent images and merge several images into a generated feature space during recognizing object. To clarify effectiveness of the proposed algorithm, we keep constantly the camera position and illumination conditions. This method can recognize the appearance of 3D objects that previous approach can not recognize with usually SIFT algorithm.

• Journal of Information Processing Systems
• /
• v.17 no.5
• /
• pp.1020-1033
• /
• 2021

Nowadays, online or mobile social network services (SNS) are very popular and widely spread in our society and daily lives to instantly share, disseminate, and search information. In particular, SNS such as YouTube, Flickr, Facebook, and Amazon allow users to upload billions of images or videos and also provide a number of multimedia information to users. Information retrieval in multimedia-rich SNS is very useful but challenging task. Content-based media retrieval (CBMR) is the process of obtaining the relevant image or video objects for a given query from a collection of information sources. However, CBMR suffers from the dimensionality curse due to inherent high dimensionality features of media data. This paper investigates the effectiveness of the kernel trick in CBMR, specifically, the kernel principal component analysis (KPCA) for dimensionality reduction. KPCA is a nonlinear extension of linear principal component analysis (LPCA) to discovering nonlinear embeddings using the kernel trick. The fundamental idea of KPCA is mapping the input data into a highdimensional feature space through a nonlinear kernel function and then computing the principal components on that mapped space. This paper investigates the potential of KPCA in CBMR for feature extraction or dimensionality reduction. Using the Gaussian kernel in our experiments, we compute the principal components of an image dataset in the transformed space and then we use them as new feature dimensions for the image dataset. Moreover, KPCA can be applied to other many domains including CBMR, where LPCA has been used to extract features and where the nonlinear extension would be effective. Our results from extensive experiments demonstrate that the potential of KPCA is very encouraging compared with LPCA in CBMR.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.2
• /
• pp.143-149
• /
• 2019

Floating holograms are technologies that provide rich 3D stereoscopic images in a wide space such as advertisement, concert. In addition, It is possible to reduce the 3D glasses inconvenience, eye strain, and space distortion, and to enjoy 3D images with excellent realism and existence. Therefore, this paper implements a user gesture recognition system for manipulating a floating hologram characters that can be used in a small space devices. The proposed method detects face region using haar feature-based cascade classifier, and recognizes the user gestures using a user gesture-occurred position information that is acquired from the gesture difference image in real time. And Each classified gesture information is mapped to the character motion in floating hologram for manipulating a character action. In order to evaluate the performance of the proposed user gesture recognition system for manipulating a floating hologram character, we make the floating hologram display devise, and measures the recognition rate of each gesture repeatedly that includes body shaking, walking, hand shaking, and jumping. As a results, the average recognition rate was 88%.

• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.4
• /
• pp.367-371
• /
• 2015

In this paper, a novel localization method for a monocular camera is proposed by using a feature-based probabilistic map. The localization of a camera is generally estimated from 3D-to-2D correspondences between a 3D map and an image plane through the PnP algorithm. In the computer vision communities, an accurate 3D map is generated by optimization using a large number of image dataset for camera pose estimation. In robotics communities, a camera pose is estimated by probabilistic approaches with lack of feature. Thus, it needs an extra system because the camera system cannot estimate a full state of the robot pose. Therefore, we propose an accurate localization method for a monocular camera using a probabilistic approach in the case of an insufficient image dataset without any extra system. In our system, features from a probabilistic map are projected into an image plane using linear approximation. By minimizing Mahalanobis distance between the projected features from the probabilistic map and extracted features from a query image, the accurate pose of the monocular camera is estimated from an initial pose obtained by the PnP algorithm. The proposed algorithm is demonstrated through simulations in a 3D space.

• MALSORI
• /
• v.55
• /
• pp.131-142
• /
• 2005

A mismatch between the training and the test conditions often causes a drastic decrease in the performance of the speech recognition systems. In this paper, non-linear transformation techniques based on histogram equalization in the acoustic feature space are studied for reducing the mismatched condition. The purpose of histogram equalization(HEQ) is to convert the probability distribution of test speech into the probability distribution of training speech. While conventional histogram equalization methods consider only the probability distribution of a test speech, for noise-corrupted test speech, its probability distribution is also distorted. The transformation function obtained by this distorted probability distribution maybe bring about miss-transformation of feature vectors, and this causes the performance of histogram equalization to decrease. Therefore, this paper proposes a new method of calculating noise-removed probability distribution by using assumption that the CDF of noisy speech feature vectors consists of component of speech feature vectors and component of noise feature vectors, and this compensated probability distribution is used in HEQ process. In the AURORA-2 framework, the proposed method reduced the error rate by over $44\%$ in clean training condition compared to the baseline system. For multi training condition, the proposed methods are also better than the baseline system.

• Journal of the Korean Institute of Rural Architecture
• /
• v.14 no.4
• /
• pp.135-142
• /
• 2012

This study is aimed to investigate the dimension feature of the plane about the economic type farming village Korean-style house progressed in the Chonnam province and Longitudinal feature and tries to reveal this feature through the comparing analysis with the traditional house positioned in the Chonnam province. This result is as follows. First, the main feature in plane is the setting up the column interval in front when comparing the house of Happy Village and traditional house. In case house of the Happy Village, after firstly fixed the limited scales, sizes are determined, this is due to control the set up in the post interval in this in range. Second, in the case of the traditional houses, 0.68 ratio of the building height about the side length and 0.19 ratio of the eaves extrusion about the side length are consistent ratio about dimensions. However, there is no consistent ratio or fixed law, the various dimensions show up in case of the house of Happy Village. It will be inevitable that space of the post increases for the convenience of life of the modern people. However, it has to sublate and to disregard as the identity of the morphological shown up in the Korean-style house the more various construction standards will need to be presented.

• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.167-179
• /
• 2001

This paper discusses an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In earlier work, we suggested an efficient method for whole matching under time warping. This method constructs a multidimensional index on a set of feature vectors, which are invariant to time warping, from data sequences. For filtering at feature space, it also applies a lower-bound function, which consistently underestimates the time warping distance as well as satisfies the triangular inequality. In this paper, we incorporate the prefix-querying approach based on sliding windows into the earlier approach. For indexing, we extract a feature vector from every subsequence inside a sliding window and construct a multi-dimensional index using a feature vector as indexing attributes. For query precessing, we perform a series of index searches using the feature vectors of qualifying query prefixes. Our approach provides effective and scalable subsequence matching even with a large volume of a database. We also prove that our approach does not incur false dismissal. To verily the superiority of our method, we perform extensive experiments. The results reseal that our method achieves significant speedup with real-world S&P 500 stock data and with very large synthetic data.