• Korean Journal of Computational Design and Engineering
• /
• v.16 no.4
• /
• pp.285-291
• /
• 2011

A pose estimation process from medical images is calculating locations and orientations of objects obtained from Computed Tomography (CT) volume data utilizing X-ray images from two directions. In this process, digitally reconstructed radiograph (DRR) images of spatially transformed objects are generated and compared to X-ray images repeatedly until reasonable transformation matrices of the objects are found. The DRR generation and image comparison take majority of the total time for this pose estimation. In this paper, a fast DRR generation technique based on GPU parallel computing is introduced. A volume ray-casting algorithm is explained with brief vector operations and a parallelization technique of the algorithm using Compute Unified Device Architecture (CUDA) is discussed. This paper also presents the implementation results and time measurements comparing to those from pure-CPU implementation and open source toolkit.

• Proceedings of the Optical Society of Korea Conference
• /
• 2009.02a
• /
• pp.167-168
• /
• 2009

We propose a new computing method for Fourier hologram of 3D objects captured by lens array. Fourier hologram of the two objects which positioned at different distances can be calculated using multiple orthographic view images. The size of the Fourier hologram is in proportion to the number of the orthographic view images. By repeating the orthographic view images, the size of the Fourier hologram can be increased. The principle is verified by numerically reconstructing the hologram which is synthesized from the orthographic images captured optically.

• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.110-116
• /
• 2008

A RFID is an automatic data collection system based on the radio frequency and is the key technology of ubiquitous computing environments. Since the locations of objects attached by RFID tags can be acquired by readers, it is possible to query the locations of tags. To query tags efficiently, the data of RFID tags should be modeled and indexed. However, since the location information of tags, the predicates of queries, are differ from coordinates of moving objects, it is difficult to model tags under the concept of moving objects, In this paper, we propose the location model of tags to represents the trajectories of tags. The location model is composed of the set and graph based approaches.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.2
• /
• pp.110-114
• /
• 2015

This paper reports a novel object-detection technique in video sequences. The proposed algorithm consists of detection of objects in illuminated and occluded videos by using object features and a neural network technique. It consists of two functional modules: region-based object feature extraction and continuous detection of objects in video sequences with region features. This scheme is proposed as an enhancement of the Lowe's scale-invariant feature transform (SIFT) object detection method. This technique solved the high computation time problem of feature generation in the SIFT method. The improvement is achieved by region-based feature classification in the objects to be detected; optimal neural network-based feature reduction is presented in order to reduce the object region feature dataset with winner pixel estimation between the video frames of the video sequence. Simulation results show that the proposed scheme achieves better overall performance than other object detection techniques, and region-based feature detection is faster in comparison to other recent techniques.

• ETRI Journal
• /
• v.29 no.5
• /
• pp.691-693
• /
• 2007

Existing methods to process continuous range queries are not scalable. In particular, as the number of continuous range queries on a large number of moving objects becomes larger, their performance degrades significantly. We propose a novel query indexing method called the projected attribute bit (PAB)-based query index. We project a two-dimensional continuous range query on each axis to get two one-dimensional bit lists. Since the queries are transformed to bit lists and query evaluation is performed by bit operations, the storage cost of indexing and query evaluation time are reduced significantly. Through various experiments, we show that our method outperforms the containment-encoded squares-based indexing method, which is one of the most recently proposed methods.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.43-45
• /
• 2003

Nowadays, with numerous emerging applications (e.g., traffic control, meteorology monitoring, mobile computing, etc.), access methods to process current and future queries for moving objects are becoming increasingly important. Among these methods, the time-parameterized R-tree (TPR-tree) seems likely the most flexible method in one, two, or three-dimensional space. A key point of TPR-tree is that the (conservative) bounding rectangles are expressed by functions of time. In this paper, we propose a new method, which takes into account positions of its moving objects against the rectangle's bounds. In proposed method, the size of bounding rectangle is significantly smaller than the traditional bounding rectangle in many cases. By this approach, we believe that the TPR-tree can improve query performance considerably.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.566-577
• /
• 2005

A ubiquitous computing system could be constructed not only with one computer but with networks of computers (or ether devices with computing power) embedded in everyday objects. For this, dependability must be guaranteed for each single component of a system and for the whole system which might be more than just a sum of its components. This paper proposes an autonomic self-management mechanism that ran operate for 24 hours/day with the minimum human intervention. In addition, we validate the autonomic fault management scheme based on a workload model derived from the system log analysis.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.41-43
• /
• 2011

Cyber-Physical Systems are tight integration of computation, networking and physical objects to sense, monitor, and control the physical world. This paper presents a novel architecture that combines two next generation technologies i.e. cyber-physical systems and Cloud computing to develop a ubiquitous healthcare based infrastructure. Through this infrastructure, patients and elderly people get remote assistance, monitoring of their health conditions and medication while living in proximity of home. Consequently, this leads to major cost savings. However, there are various challenges that need to be overcome before building such systems. These challenges include making system real-time responsive, reliability, stability and privacy. Therefore, in this paper, we propose an architecture that deals with these challenges.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.763-764
• /
• 2006

The rapid growth of Hardware technologies and Network fitted to us Ubiquitous Computing Life[1]. Ubiquitous Computing integrates computation into the environment, rather than having computers which are distinct objects. There are many computational things like a Sensor Network, RFID, GPS, Mobile devices, and so on. Ubiquitous Data Integration and Management are new paradigms. The goals of UDI Service Platform are data protection for the distributed data on pervasive computing devices and data distribution to appropriate users with best distribution policies. To implement the idea we evaluate the logical schema Cyber View that is a management tool.

• Journal of Information Processing Systems
• /
• v.16 no.1
• /
• pp.184-200
• /
• 2020

Similarity searching is a basic issue in information processing because of the large size of formal contexts and their complicated derivation operators. Recently, some researchers have focused on knowledge reduction methods by using granular computing. In this process, suitable information granules are vital to characterizing the quantities of attributes and objects. To address this problem, a novel approach to obtain an entropy-weighted concept lattice with inclusion degree and similarity distance (ECLisd) has been proposed. The approach aims to compute the combined weights by merging the inclusion degree and entropy degree between two concepts. In addition, another method is utilized to measure the hierarchical distance by considering the different degrees of importance of each attribute. Finally, the rationality of the ECLisd is validated via a comparative analysis.