• Publications of The Korean Astronomical Society
• /
• v.28 no.1
• /
• pp.7-13
• /
• 2013

We present a multi-dimensional reduction method of the surveyed cube database obtained using a single- dish radio telescope in Taeduk Radio Astronomy Observatory (TRAO). The multibeam receiver system installed at the 14 m telescope in TRAO was not optimized at the initial stage, though it became more stabilized in the following season. We conducted a Galactic Plane survey using the multibeam receiver system. We show that the noise level of the first part of the survey was higher than expected, and a special reduction process seemed to be definitely required. Along with a brief review of classical methods, a multi-dimensional method of reduction is introduced; It is found that the 'background' task within IRAF (Image Reduction and Analysis Facility) can be applied to all three directions of the cube database. Various statistics of reduction results is tested using several IRAF tasks. The rms value of raw survey data is 0.241 K, and after primitive baseline subtraction and elimination of bad channel sections, the rms value turned out to be 0.210 K. After the one-dimensional reduction using 'background' task, the rms value is estimated to be 0.176 K. The average rms of the final reduced image is 0.137 K. Thus, the image quality is found to be improved about 43% using the new reduction method.

• Journal of Mechanical Science and Technology
• /
• v.18 no.7
• /
• pp.1107-1120
• /
• 2004

This study proposes a new scheme for the sampled-data representation of nonlinear systems with time-delayed multi-input. The proposed scheme is based on the Taylor-series expansion and zero-order hold assumption. The mathematical structure of a new discretization scheme is explored. On the basis of this structure, the sampled-data representation of nonlinear systems including time-delay is derived. The new scheme is applied to nonlinear systems with two inputs and then the delayed multi-input general equation is derived. The resulting time-discretization provides a finite-dimensional representation of nonlinear control systems with time-delay enabling existing controller design techniques to be applied to them. In order to evaluate the tracking performance of the proposed scheme, an algorithm is tested for some of the examples including maneuvering of an automobile and a 2-DOF mechanical system.

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.1-12
• /
• 2003

Recently, there have been many indexing schemes for multimedia data such as image, video data. But recent database applications, for example data mining and multimedia database, are required to support multi-user environment. In order for indexing schemes to be useful in multi-user environment, a concurrency control algorithm is required to handle it. So we propose a concurrency control algorithm that can be applied to CBF (cell-based filtering method), which uses the signature of the cell for alleviating the dimensional curse problem. In addition, we extend the SHORE storage system of Wisconsin university in order to handle high-dimensional data. This extended SHORE storage system provides conventional storage manager functions, guarantees the integrity of high-dimensional data and is flexible to the large scale of feature vectors for preventing the usage of large main memory. Finally, we implement the web-based image retrieval system by using the extended SHORE storage system. The key feature of this system is platform-independent access to the high-dimensional data as well as functionality of efficient content-based queries. Lastly. We evaluate an average response time of point query, range query and k-nearest query in terms of the number of threads.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.375-378
• /
• 2005

The multi-view video is a collection of multiple videos capturing the same scene at different viewpoints. The multi-view video can be used in various applications, including free viewpoint TV and three-dimensional TV. Since the data size of the multi-view video linearly increases as the number of cameras, it is necessary to compress multi-view video data for efficient storage and transmission. The multi-view video can be coded using the concept of the layered depth image (LDI). In this paper, we describe a procedure to generate LDI from the natural multi-view video and present a method to encode multi-view video using the concept of LDI.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.2
• /
• pp.237-245
• /
• 2003

MDS(multi-dimensional scaling) for preference data is a graphical tool which usually figures out how consumers recognize, evaluate certain products. This article is mainly concerned with an optimal scaling for MDS when target configuration is available. Rotation of axis and SUR(seemingly unrelated regression) methods are employed to get a new configuration which is obtained as close to the target as we can. Methodologies developed here are also illustrated via a real data set.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.10
• /
• pp.827-832
• /
• 2013

Holographic data storage system is affected by two dimensional intersymbol interference and inter-page interference. Especially, for multi-level holographic data storage system, since one pixel contains more than 1 bit, the system is more vulnerable to the error. In this paper, we propose a 2/3 modulation code for 4-level holographic data storage system. The proposed modulation code with error correcting capability could be compensated these interferences. Also, in this paper, we proposed a Viterbi decoder for 2/3 modulation code. The proposed Viterbi decoder eliminates unnecessary calculation. As a result, proposed 2/3 modulation code and Viterbi decoder has shown better performance than conventional one.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.133-137
• /
• 2005

In this paper, we investigate visual and quantitative analysis of different tastes in the liquids using multi-array chemical sensor (MACS) based on the ion-selective electrodes (ISEs), which is so called the electronic tongue (E-Tongue) system. We apply the Fuzzy C-means (FCM) algorithm combined with Principal Component Analysis (PCA), which can be used to reduce multi-dimensional data to two- or three-dimensional data, to classify visually data patterns detected by E-Tongue system. The proposed technique can be determined the cluster centers and membership grade of patterns through the unsupervised way. The membership grade of an unknown pattern, which does not shown previously, can be visually and analytically determined. Throughout the experimental trails, the E-tongue system combined with the proposed algorithms is demonstrated robust performance for visual and quantitative analysis for different tastes in the liquids.

• The Journal of the Korea Contents Association
• /
• v.6 no.1
• /
• pp.14-22
• /
• 2006

The multimedia visualizational spreadsheet environment is shown to be extremely effective in supporting the organized visualization of multi-dimensional data sets. In this paper, we designed the visualization model that consists of the configurational 2D arrangement of spreadsheet elements at run time and each spreadsheet element has a novel framestack. As the feature, it supports 3D data structure of each element on the proposed model. It enables the visualization spreadsheet 1) to effectively manage, organize, and compactly encapsulate multi-dimensional data sets, 2) to reconfigure cell-structures dynamically according to client request, and 3) to rapidly process interactive user interface. Using several experiments with scientific users, the model has been demonstrated to be a highly interactive visual browsing tool for 2D and 3D graphics and rendering in each frame.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.1
• /
• pp.7-18
• /
• 2012

It has been studied to support data having multiple properties, called Skyline Query. The skyline query is not exploring data having all properties but only meaningful data, when we retrieve informations in large data base. The skyline query can be used to provide some information about various environments and situations in sensor network. However, the legacy skyline query has a problem that increases the number of comparisons as the number of sensors are increasing in multi-dimensional data. Also important values are often omitted. Therefore, we propose a new method to reduce the complexity of comparison where the large number of sensors are placed. To reduce the complexity, we transfer a CMF(Category Based Member Function) which can identify preference of specific data when interest query from sync-node is transferred to sub-node. To show the validity of our method, we analyzed the performance by simulations. As a result, it showed that the time complexity was reduced when we retrieved information in multiple sensing data and omitted values are detected by great dominance Skyline.

• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.319-332
• /
• 2008

Data cube, which is multi-dimensional data model, have been successfully applied in many cases of multi-dimensional data analysis, and is still being researched to be applied in data stream analysis. Data stream is being generated in real-time, incessant, immense, and volatile manner. The distribution characteristics of data arc changing rapidly due to those characteristics, so the primary rule of handling data stream is to check once and dispose it. For those characteristics, users are more interested in high support attribute values observed rather than the entire attribute values over data streams. This paper propose dynamic data cube for applying data cube to data stream environment. Dynamic data cube specify user's interested area by the support ratio of attribute value, and dynamically manage the attribute values by grouping each other. By doing this it reduce the memory usage and process time. And it can efficiently shows or emphasize user's interested area by increasing the granularity for attributes that have higher support. We perform experiments to verify how efficiently dynamic data cube works in limited memory usage.