• Korean Journal of Remote Sensing
• /
• v.26 no.5
• /
• pp.593-603
• /
• 2010

Most spatial data acquisition systems employing a set of frame cameras may have suffered from their small fields of view and poor base-distance ratio. These limitations can be significantly reduced by employing an omni-directional camera that is capable of acquiring images in every direction. Bundle Block Adjustment (BBA) is one of the existing georeferencing methods to determine the exterior orientation parameters of two or more images. In this study, by extending the concept of the traditional BBA method, we attempt to develop a mathematical model of BBA for omni-directional images. The proposed mathematical model includes three main parts; observation equations based on the collinearity equations newly derived for omni-directional images, stochastic constraints imposed from GPS/INS data and GCPs. We also report the experimental results from the application of our proposed BBA to the real data obtained mainly in urban areas. With the different combinations of the constraints, we applied four different types of mathematical models. With the type where only GCPs are used as the constraints, the proposed BBA can provide the most accurate results, ${\pm}5cm$ of RMSE in the estimated ground point coordinates. In future, we plan to perform more sophisticated lens calibration for the omni-directional camera to improve the georeferencing accuracy of omni-directional images. These georeferenced omni-directional images can be effectively utilized for city modelling, particularly autonomous texture mapping for realistic street view.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.1
• /
• pp.79-98
• /
• 1999

There have been a number of empirical studios on the effectiveness of Judgmental adjustment to statistical forecasts Generally the results have been mixed. This study examined the impact of the reliability and the source of the additionally presented reference forecast upon the revision process in a longitudinal time series forecasting task with forecast support systems. A 2-between(reliability ＆ source). 2-within(seasonality ＆ block) factorial experiment was conducted with post-graduate students using real time series. Judgmental adjustment was found to improve the accuracy of initial eyeballing irrespective of the reliability of an additionally presented forecast. But it did not outperform the dampened reference forecast. No effect was found of the way the source of the reference forecast was framed. Overall the subjects anchored heavily on their Initial forecast and relied too little on the reference forecast irrespective of its reliability. Moreover they did not improve at the task over time, despite immediate outcome feedback.

• Journal of Korean Institute of Industrial Engineers
• /
• v.39 no.6
• /
• pp.577-586
• /
• 2013

In a shipyard, it is hard to predict block movement due to the uncertainty caused during the long period of shipbuilding operations. For this reason, block movement is rarely scheduled, while main operations such as assembly, outfitting and painting are scheduled properly. Nonetheless, the high operating costs of block movement compel task managers to attempt its management. To resolve this dilemma, this paper proposes a new block movement analysis framework consisting of the following operations: understanding the entire process, log clustering to obtain manageable processes, discovering the process model and detecting exceptional processes. The proposed framework applies fuzzy mining and trace clustering among the process mining technologies to find main process and define process models easily. We also propose additional methodologies including adjustment of the semantic expression level for process instances to obtain an interpretable process model, definition of each cluster's process model, detection of exceptional processes, and others. The effectiveness of the proposed framework was verified in a case study using real-world event logs generated from the Block Process Monitoring System (BPMS).

• Journal of Korean Society for Geospatial Information Science
• /
• v.10 no.3 s.21
• /
• pp.29-40
• /
• 2002

In photogrammetry, the accuracy is analyzed by using the coordinate of the targeted position determined by the geometric principle, thus, the reliability depends on the accuracy of the coordinate of the targeted position. Thereby, geographic surveying is essential to perform such tasks, and it requires approximately $30{\sim}50%$ of total cost and times to produce a finalized map. The main purpose of this study is to determine the configuration of the disposition of minimum datum points and their configuration, which were determined by surveying values available through using the structure of block model based on the aerotriangulation. ortho projection image was produce and digital topographic map was achieved by the optima model(CASE7). We also performed comparative analysis about the result of local datum point and the accuracy of overlapping based on the surveying results. Consequently, it is possible to analyze the unknown position accurately with the optimal model., CASE 7, which is the minimum datum points configuration required to block adjustment. Furthermore, this optimal model, which provides the minimum datum points, results costs and time saving effects compared to the previous methodology.

• The KIPS Transactions:PartB
• /
• v.19B no.1
• /
• pp.1-8
• /
• 2012

Mosaic is to make a big image by gathering lots of small materials having various colors. With advance of digital imaging techniques, photomosaic techniques using photos are widely used. In this paper, we presents an automatic photomosaic algorithm based on adaptive tiling and block matching. The proposed algorithm is composed of two processes: photo database generation and photomosaic generation. Photo database is a set of photos (or tiles) used for mosaic, where a tile is divided into $4{\times}4$ regions and the average RGB value of each region is the feature of the tile. Photomosaic generation is composed of 4 steps: feature extraction, adaptive tiling, block matching, and intensity adjustment. In feature extraction, the feature of each block is calculated after the image is splitted into the preset size of blocks. In adaptive tiling, the blocks having similar similarities are merged. Then, the blocks are compared with tiles in photo database by comparing euclidean distance as a similarity measure in block matching. Finally, in intensity adjustment, the intensity of the matched tile is replaced as that of the block to increase the similarity between the tile and the block. Also, a tile redundancy minimization scheme of adjacent blocks is applied to enhance the quality of mosaic photos. In comparison with Andrea mosaic software, the proposed algorithm outperforms in quantitative and qualitative analysis.

• Communications for Statistical Applications and Methods
• /
• v.24 no.1
• /
• pp.1-13
• /
• 2017

This manuscript summarized advances in bootstrap methods for long-range dependent time series data. The stationary linear long-memory process is briefly described, which is a target process for bootstrap methodologies on time-domain and frequency-domain in this review. We illustrate time-domain bootstrap under long-range dependence, moving or non-overlapping block bootstraps, and the autoregressive-sieve bootstrap. In particular, block bootstrap methodologies need an adjustment factor for the distribution estimation of the sample mean in contrast to applications to weak dependent time processes. However, the autoregressive-sieve bootstrap does not need any other modification for application to long-memory. The frequency domain bootstrap for Whittle estimation is provided using parametric spectral density estimates because there is no current nonparametric spectral density estimation method using a kernel function for the linear long-range dependent time process.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.8B
• /
• pp.1109-1118
• /
• 2001

움직임 추정 및 보상 기법은 비디오 코딩 응용 분야에서 일반적으로 많이 사용되는 방법이나 많은 계산량으로 인하여 실시간 움직임 추정이 쉽지 않다. 본 논문에서는 낮은 비트율 비디오 코딩을 위한 전역 탐색 기법의 블록 정합 알고리즘의 복잡도를 줄이기 위하여 탐색 영역을 적응적으로 줄여주는 기법을 제안한다. 제안된 기법은 연속한 비디오 프레임에서 변위된 블록의 차이(displaced block difference)와 블록 구분 정보(block classification information) 등과 같은 상관성을 이용하여 탐색 영역의 범위를 적응적으로 조정한다. 실험을 통하여 제안된 기법이 전역 탐색 영역 기법과 비교하여 계산량에서 1/2의 계산량 이득이 있으며, 비슷한 MSE(mean square error) 성능을 가짐을 보인다.

• Applied Microscopy
• /
• v.46 no.2
• /
• pp.100-104
• /
• 2016

Electron microscopy is currently the only available technique with a spatial resolution sufficient to identify fine neuronal processes and synaptic structures in densely packed neuropil. For large-scale volume reconstruction of neuronal connectivity, serial block-face scanning electron microscopy allows us to acquire thousands of serial images in an automated fashion and reconstruct neural circuits faster by reducing the alignment task. Here we introduce the whole reconstruction procedure of synaptic network in the rat hippocampal CA1 area and discuss technical issues to be resolved for improving image quality and segmentation. Compared to the serial section transmission electron microscopy, serial block-face scanning electron microscopy produced much reliable three-dimensional data sets and accelerated reconstruction by reducing the need of alignment and distortion adjustment. This approach will generate invaluable information on organizational features of our connectomes as well as diverse neurological disorders caused by synaptic impairments.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.261-270
• /
• 2019

In order to protect secret digital documents against vulnerabilities while communicating, steganography algorithms are applied. It protects a digital file from unauthorized access by hiding the entire content. Pixel-value-difference being a method from spatial domain steganography utilizes the difference gap between neighbor pixels to fulfill the same. The proposed approach is a block-wise embedding process where blocks of variable size are chosen from the cover image, therefore, a stream of secret digital contents is hidden. Least significant bit (LSB) substitution method is applied as an adaptive mechanism and optimal pixel adjustment process (OPAP) is used to minimize the error rate. The proposed application succeeds to maintain good hiding capacity and better signal-to-noise ratio when compared against other existing methods. Any means of digital communication specially e-Governance applications could be highly benefited from this approach.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.4
• /
• pp.372-378
• /
• 2010

This paper propose the fast motion estimation algorithm with adaptive search range adjustment using motion activities of temporal and spatial neighbor blocks. The existing fast motion estimation algorithms with adaptive search range adjustment use the maximum motion vector of all blocks in the reference frame. So these algorithms may not control a optimum search range for slow moving block in current frame. The proposed algorithm use the maximum motion vector of neighbor blocks in the reference frame to control a optimum search range for slow moving block. So the proposed algorithm can reduce computation time for motion estimation. The experiment results show that the proposed algorithm can reduce the number of search points about 15% more than Simple Dynamic Search Range(SDSR) algorithm while maintaining almost the same bit-rate and motion estimation error.