• Journal of Korea Multimedia Society
• /
• v.14 no.3
• /
• pp.339-347
• /
• 2011

As the volume visualization has been applied to render medical datasets, there has been a requirement to produce high quality images. Even though nice images can be generated by using previous linear filter, high order filter is required for better images. However, it takes much time for high order resampling, so that, overall rendering time is increased. In this paper, we perform high quality volume visualization using the cardinal interpolation. By enabling the empty space leaping which reduces the number of resampling, we achieve the efficient visualization. In detail, we divide the volume data into small blocks and leap empty blocks by referring the upper and lower bound value for each block. We propose a new method to estimate upper and lower bound value of for each block. As the result, we noticeably accelerated high quality volume visualization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1392-1400
• /
• 1999

In this paper, we propose a two-stage fast full search algorithm for block motion estimation that produces the same performance to that of full search algorithm (FSA) but with remarkable computation reduction. The proposed algorithm uses the search region subsampling and the difference of adjacent pixels in the current block. In the first stage, we subsample the search region by a factor of 9, and then calculate mean absolute error (MAE) at the subsampled search points. And in the second stage, we reduce the search points that need block matching process by using the lower bound of MAE value at each search Point. We Set the lower bound of MAE value for each search point from the MAE values which are calculated at the first stage and the difference of adjacent pixels in the current block. The experimental results show that we can reduce the computational complexity considerably without any degradation of picture quality.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.2
• /
• pp.225-230
• /
• 2017

To generate mechanical movements in one-shot devices such as missiles and space launch vehicles, pyrotechnic mechanical device(PMD) such as pin pullers using pyrotechnic charge has been widely used. Reliability prediction of pin pullers is crucial to successfully execute target missions for the one-shot devices. Because the pin pullers require destructive tests to evaluate their reliability, one would need about 3,000 samples of success to guarantee a reliability of 99.9 % with a confidence level of 95 %. This paper suggests the application of a probit model using the charge amount as a functional parameter for estimation of functional reliability of pin puller. To guarantee target reliability, we propose estimation methods of the lower bound of functional reliability by applying the probit model. Given lower bound of functional reliability, we quantitatively show that the optimum amount of charge increases as the number of samples decreases. Along with a variety of simulations the validity of our new model via real test results is confirmed.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.5
• /
• pp.137-144
• /
• 1989

A new algorithm is presented which efficiently reports minimum width/space violation in a geometric mask pattern. The proposed algorithm solves a sequence of range search problems by employing a plane sweep method. The algorithm runs in O(n log n) time, where n is the number of edges in a mask pattern. Since a lower bound in time conplexity for reporting all minimum width/space violations is ${\Omega}$ (n log n), this algorithm is theoretically optimal within a constant multiplicaive factor. It requires O($n^{0.5}$) space which is very efficient in practice. Moreover, this algorithm, we believe, is easy to implement and practically fast (116.7 seconds for a rectilinear region with 250000 vertices ar VAX 8650.)

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.460-468
• /
• 2009

Multiple-input multiple-output (MIMO) technology applied with orthogonal frequency division multiplexing (OFDM) is considered as the ultimate solution to increase channel capacity without any additional spectral resources. At the receiver side, the challenge resides in designing low complexity detection algorithms capable of separating independent streams sent simultaneously from different antennas. In this paper, we introduce an upper-lower bounded-complexity QRD-M algorithm (ULBC QRD-M). In the proposed algorithm we solve the problem of high extreme complexity of the conventional sphere decoding by fixing the upper bound complexity to that of the conventional QRD-M. On the other hand, ULBC QRD-M intelligently cancels all unnecessary hypotheses to achieve very low computational requirements. Analyses and simulation results show that the proposed algorithm achieves the performance of conventional QRD-M with only 26% of the required computations.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.3
• /
• pp.41-56
• /
• 2000

In this paper, we propose a two-stage fast block matching algorithm using the mean absolute error (MAE) of neighbor search point that can reduce the computational complexity to estimate motion vector while the motion estimation error performance is nearly the same as full search algorithm (FSA) In the proposed method, the lower bound of MAE 6at current search point IS calculated using the MAE of neighbor search point And we reduce the computational complexity by performing the block matching process only at the search point that has to be block matched using the lower bound of MAE The proposed algorithm is composed of two stages The experimental results show that the proposed method drastically reduces the computational complexity while the motion compensated error performance is nearly kept same as that of FSA.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.495-506
• /
• 2001

XML makes it possible for data to be exchanged regradless of the data model in which it is represented or the platform on which it is stored, serving as a standard for data exchange format on the internet. Especially, it is natural to send XML data without DTD on the internet when XML is data-centric. Therefore it is needed to extract relational schema to store XML data efficiently, to optimize queries, and to publish data which have been stored in the relational database in the XML format. In this paper, we proposed a method to generate relational database in the XML documents without DTD and store XML data using upper/lower bound schema extraction technique for semistructured data. In extracting a lower bound schema, we especially show an efficient technique for creating relational schema by using simulation with is more advanced than the datalog method.

• Structural Engineering and Mechanics
• /
• v.14 no.2
• /
• pp.171-190
• /
• 2002

Two cases of design are performed for the hyperbolic paraboloid saddle shell (Lin-Scordelis saddle shell) and the hyperbolic cooling tower (Grand Gulf cooling tower) to check the design strength against a consistent design load, therefore to verify the adequacy of the design algorithm. An iterative numerical computational algorithm is developed for combined membrane and flexural forces, which is based on equilibrium consideration for the limit state of reinforcement and cracked concrete. The design algorithm is implemented in a finite element analysis computer program developed by Mahmoud and Gupta. The amount of reinforcement is then determined at the center of each element by an elastic finite element analysis with the design ultimate load. Based on ultimate nonlinear analyses performed with designed saddle shell, the analytically calculated ultimate load exceeded the design ultimate load from 7% to 34% for analyses with various magnitude of tension stiffening. For the cooling tower problem the calculated ultimate load exceeded the design ultimate load from 26% to 63% with similar types of analyses. Since the effective tension stiffening would vary over the life of the shells due to environmental factors, a degree of uncertainty seems inevitable in calculating the actual failure load by means of numerical analysis. Even though the ultimate loads are strongly dependent on the tensile properties of concrete, the calculated ultimate loads are higher than the design ultimate loads for both design cases. For the cases designed, the design algorithm gives a lower bound on the design ultimate load with respect to the lower bound theorem. This shows the adequacy of the design algorithm developed, at least for the shells studied. The presented design algorithm for the combined membrane and flexural forces can be evolved as a general design method for reinforced concrete plates and shells through further studies involving the performance of multiple designs and the analyses of differing shell configurations.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.179-184
• /
• 2006

Rapid and high-precision positioning with a Global Navigation Satellite System (GNSS) is feasible only when very precise carrier-phase observations can be used. There are two kinds of mathematical models for ambiguity resolution. The first one is based on both pseudorange and carrier phase measurements, and the observation equations are of full rank. The second one is only based on carrier phase measurement, which is a rank-defect model. Though the former is more commonly used, the latter has its own advantage, that is, ambiguity resolution will be freed from the effects of pseudorange multipath. Galileo will be operational. One of the important differences between Galileo and current GPS is that Galileo will provide signals in four frequency bands. With more carrier-phase data available, frequency combinations with long equivalent wavelength can be formed, so Galileo will provide more opportunities for fast and reliable ambiguity resolution than current GPS. This paper tries to investigate phase only fast ambiguity resolution performance with four Galileo frequencies for short baseline. Cascading Ambiguity Resolution (CAR) method with selected optimal frequency combinations and LAMBDA method are used and compared. To validate the resolution, two tests are used and compared. The first one is a ratio test. The second one is lower bound success-rate test. The simulation test results show that, with LAMBDA method, whether with ratio test or lower bound success rate validation criteria, ambiguity can be fixed in several seconds, 8 seconds at most even when 1 sigma of carrier phase noise is 12 mm. While with CAR method, at least about half minute is required even when 1 sigma of carrier phase noise is 3 mm. It shows that LAMBDA method performs obviously better than CAR method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.239-246
• /
• 2009

In this study, we analyze the mean waiting time on the nested open queueing network, where the population within each subnetwork is controlled by a semaphore queue. The queueing network can be transformed into a simpler queueing network in terms of customers waiting time. A major characteristic of this model is that the lower layer flow is halted by the state of higher layer. Since this type of queueing network does not have exact solutions for performance measure, the lower bound and upper bound on the mean waiting time are checked by comparing them with the mean waiting time in the transformed nested queueing network. Simulation estimates are obtained assuming Poisson arrivals and other phase-type arrival process, i.e., Erlang and hyper-exponential distributions. The bounds obtained can be applied to get more close approximation using the suitable approach.