• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.610-617
• /
• 2003

Similarity matching in video database is of growing importance in many new applications such as video clustering and digital video libraries. In order to provide efficient access to relevant data in large databases, there have been many research efforts in video indexing with diverse spatial and temporal features. however, most of the previous works relied on sequential matching methods or memory-based inverted file techniques, thus making them unsuitable for a large volume of video databases. In order to resolve this problem, this paper proposes an effective and scalable indexing technique using a trie, originally proposed for string matching, as an index structure. For building an index, we convert each frame into a symbol sequence using a window order heuristic and build a disk-resident trie from a set of symbol sequences. For query processing, we perform a depth-first search on the trie and execute a temporal segmentation. To verify the superiority of our approach, we perform several experiments with real and synthetic data sets. The results reveal that our approach consistently outperforms the sequential scan method, and the performance gain is maintained even with a large volume of video databases.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.600-619
• /
• 2006

According to recent technical advances on sensors and mobile devices, processing of data streams generated by the devices is becoming an important research issue. The data stream of real values obtained at continuous time points is called streaming time-series. Due to the unique features of streaming time-series that are different from those of traditional time-series, similarity matching problem on the streaming time-series should be solved in a new way. In this paper, we propose an efficient algorithm for streaming time- series matching problem that supports normalization transform. While the existing algorithms compare streaming time-series without any transform, the algorithm proposed in the paper compares them after they are normalization-transformed. The normalization transform is useful for finding time-series that have similar fluctuation trends even though they consist of distant element values. The major contributions of this paper are as follows. (1) By using a theorem presented in the context of subsequence matching that supports normalization transform[4], we propose a simple algorithm for solving the problem. (2) For improving search performance, we extend the simple algorithm to use $k\;({\geq}\;1)$ indexes. (3) For a given k, for achieving optimal search performance of the extended algorithm, we present an approximation method for choosing k window sizes to construct k indexes. (4) Based on the notion of continuity[8] on streaming time-series, we further extend our algorithm so that it can simultaneously obtain the search results for $m\;({\geq}\;1)$ time points from present $t_0$ to a time point $(t_0+m-1)$ in the near future by retrieving the index only once. (5) Through a series of experiments, we compare search performances of the algorithms proposed in this paper, and show their performance trends according to k and m values. To the best of our knowledge, since there has been no algorithm that solves the same problem presented in this paper, we compare search performances of our algorithms with the sequential scan algorithm. The experiment result showed that our algorithms outperformed the sequential scan algorithm by up to 13.2 times. The performances of our algorithms should be more improved, as k is increased.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.10
• /
• pp.1551-1560
• /
• 1997

This study is devoted to the detection of the 3-dimensional point obstacles on the plane by using accumulated scan line images. The proposed accumulating only one scan line allow to process image at real time. And the change of motion of the feature in image is small because of the short time between image frames, so it does not take much time to track features. To obtain recursive optimal obstacles position and robot motion along to the motion of camera, Kalman filter algorithm is used. After using Kalman filter in case of the fixed environment, 3-dimensional obstacles point map is obtained. The position and motion of moving obstacles can also be obtained by pre-segmentation. Finally, to solve the stereo ambiguity problem from multiple matches, the camera motion is actively used to discard mis-matched features. To get relative distance of obstacles from camera, parallel stereo camera setup is used. In order to evaluate the proposed algorithm, experiments are carried out by a small test vehicle.

• Korean Journal of Construction Engineering and Management
• /
• v.22 no.3
• /
• pp.40-51
• /
• 2021

MLS (Mobile Laser Scanning) which is a scanning method done by moving the LiDAR (Light Detection and Ranging) is widely employed to capture indoor PCD (Point Cloud Data) for floor plan generation in the AEC (Architecture, Engineering, and Construction) industry. The movement and rotation of LiDAR in the scanning phase cause deformation (i.e. skew) of PCD and impose a significant impact on quality of output. Thus, a de-skewing method is required to increase the accuracy of geometric representation. De-skewing methods which use position and pose information of LiDAR collected by IMU (Inertial Measurement Unit) have been mainly developed to refine the PCD. However, the existing methods have limitations on de-skewing PCD without IMU. In this study, a novel algorithm for de-skewing 2D PCD captured from MLS without IMU is presented. The algorithm de-skews PCD using scan matching between points captured from adjacent scan positions. Based on the comparison of the deskewed floor plan with the benchmark derived from TLS (Terrestrial Laser Scanning), the performance of proposed algorithm is verified by reducing the average mismatched area 49.82%. The result of this study shows that the accurate floor plan is generated by the de-skewing algorithm without IMU.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.42-55
• /
• 2006

We propose a single Index approach for subsequence matching that supports moving average transform of arbitrary order in time-series databases. Using the single index approach, we can reduce both storage space overhead and index maintenance overhead. Moving average transform is known to reduce the effect of noise and has been used in many areas such as econometrics since it is useful in finding overall trends. However, the previous research results have a problem of occurring index overhead both in storage space and in update maintenance since tile methods build several indexes to support arbitrary orders. In this paper, we first propose the concept of poly-order moving average transform, which uses a set of order values rather than one order value, by extending the original definition of moving average transform. That is, the poly-order transform makes a set of transformed windows from each original window since it transforms each window not for just one order value but for a set of order values. We then present theorems to formally prove the correctness of the poly-order transform based subsequence matching methods. Moreover, we propose two different subsequence matching methods supporting moving average transform of arbitrary order by applying the poly-order transform to the previous subsequence matching methods. Experimental results show that, for all the cases, the proposed methods improve performance significantly over the sequential scan. For real stock data, the proposed methods improve average performance by 22.4${\~}$33.8 times over the sequential scan. And, when comparing with the cases of building each index for all moving average orders, the proposed methods reduce the storage space required for indexes significantly by sacrificing only a little performance degradation(when we use 7 orders, the methods reduce the space by up to 1/7.0 while the performance degradation is only $9\%{\~}42\%$ on the average). In addition to the superiority in performance, index space, and index maintenance, the proposed methods have an advantage of being generalized to many sorts of other transforms including moving average transform. Therefore, we believe that our work can be widely and practically used in many sort of transform based subsequence matching methods.

• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.145-150
• /
• 2008

This thesis explores the problem of reconstructing a three-dimensional(3D) scene given a set of images or image sequences of the scene. It describes efficient methods for the 3D reconstruction of static and dynamic scenes from stereo images, stereo image sequences, and images captured from multiple viewpoints. Novel methods for image-based and volumetric modelling approaches to 3D reconstruction are presented, with an emphasis on the development of efficient algorithm which produce high quality and accurate reconstructions. For image-based 3D reconstruction a novel energy minimisation scheme, Iterated Dynamic Programming, is presented for the efficient computation of strong local minima of discontinuity preserving energyy functions. Coupled with a novel morphological decomposition method and subregioning schemes for the efficient computation of a narrowband matching cost volume. the minimisation framework is applied to solve problems in stereo matching, stereo-temporal reconstruction, motion estimation, 2D image registration and 3D image registration. This thesis establishes Iterated Dynamic Programming as an efficient and effective energy minimisation scheme suitable for computer vision problems which involve finding correspondences across images. For 3D reconstruction from multiple view images with arbitrary camera placement, a novel volumetric modelling technique, Embedded Voxel Colouring, is presented that efficiently embeds all reconstructions of a 3D scene into a single output in a single scan of the volumetric space under exact visibility. An adaptive thresholding framework is also introduced for the computation of the optimal set of thresholds to obtain high quality 3D reconstructions. This thesis establishes the Embedded Voxel Colouring framework as a fast, efficient and effective method for 3D reconstruction from multiple view images.

• Progress in Medical Physics
• /
• v.9 no.1
• /
• pp.47-53
• /
• 1998

Nuclear Medicine Images have comparatively poor spatial resolution, making it difficult to relate the functional information which they contain to precise anatomical structures. Anatomical structures useful in the interpretation of SPECT /PET Images were radiolabelled. PET/SPECT Images Provide functional information, whereas MRI mainly demonstrate morphology and anatomical. Fusion or Image Registration improves the information obtained by correlating images from various modalities. Brain Scan were studied on one or more occations using MRI and SPECT. The data were aligned using a point pair methods and surface matching. SPECT and MR Images was tested using a three dimensional water fillable Hoffman Brain Phantom with small marker and PET and MR Image was tested using a patient data. Registration of SPECT and MR Images is feasible and allows more accurate anatomic assessment of sites of abnormal uptake in radiolabeled studies. Point based registration was accurate and easily implemented three dimensional registration of multimodality data set for fusion of clinical anatomic and functional imaging modalities. Accuracy of a surface matching algorithm and homologous feature pair matching for three dimensional image registration of Single Photon Emission Computed Tomography Emission Computed Tomography (SPECT), Positron Emission Tomography (PET) and Magnetic Resonance Images(MRD was tested using a three dimensional water fill able brain phantom and Patients data. Transformation parameter for translation and scaling were determined by homologous feature point pair to match each SPECT and PET scan with MR images.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.1
• /
• pp.131-147
• /
• 2020

RFID (Radio Frequency Identification) identifies a specific object by radio signals. As the tag provides a unique ID for the purpose of identification, RFID technology effectively solves the ambiguity and occlusion problem that challenges the laser or camera-based approach. This paper proposes an approach to track a moving object based on the integration of RFID and laser ranging information using a particle filter. To be precise, we split laser scan points into different clusters which contain the potential moving objects and calculate the radial velocity of each cluster. The velocity information is compared with the radial velocity estimated from RFID phase difference. In order to achieve the positioning of the moving object, we select a number of K best matching clusters to update the weights of the particle filter. To further improve the positioning accuracy, we incorporate RFID signal strength information into the particle filter using a pre-trained sensor model. The proposed approach is tested on a SCITOS service robot under different types of tags and various human velocities. The results show that fusion of signal strength and laser ranging information has significantly increased the positioning accuracy when compared to radial velocity matching-based or signal strength-based approaches. The proposed approach provides a solution for human machine interaction and object tracking, which has potential applications in many fields for example supermarkets, libraries, shopping malls, and exhibitions.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.9 no.2
• /
• pp.93-102
• /
• 1991

This study aims to develop techniques for generating Digital Elevation Model(DEM) from SPOT Computer Compatible Tape(CCT) data, so as to present an effective way of generation of DEM for large area. As the first phase of extracting ground heights from SPOT stereo digital data, the bundle adjustment technique was used to determine the satellite exterior orientation parameters. Because SPOT data has the characteristics of multiple perspective projection, exterior orientation Parameters were modelled as a function of scan lines. In the second phase, a normalized cross correlation matching technique was applied to search for the conjugate pixels ill stereo pairs. The preliminary study showed that the matching window size of 13$\times$13 was adequate. After image coordinates of the conjugate pixels were determined by the matching technique, the ground coordinates of the corresponding pixels were calculated by the space intersection method. Then DEM was generated by interpolations. In addtion an algorithm for the elimination of abnormal elevation was developed and applied. The algorithm was very effective to improve the accuracy of the generated DEM.

• The Journal of Korean Society for Radiation Therapy
• /
• v.24 no.1
• /
• pp.39-43
• /
• 2012

Purpose: In hospital image-guided radiation therapy in patients with bladder cancer to enhance the reproducibility of the appropriate amount, depending on the patient's condition, and image-guided injection of saline system (On-Board Imager system, OBI, VARIAN, USA) three of the Cone-Beam CT dimensional matching (3D-3D matching) to be the treatment. In this study, the treatment of patients with bladder cancer at Cone-Beam CT image obtained through the analysis of the bones based matching and matching based on the bladder to learn about the differences, the bladder's volume change injected saline solution by looking at the bladder for the treatment of patients with a more appropriate image matching is to assess how the discussion. Materials and Methods: At our hospital from January 2009 to April 2010 admitted for radiation therapy patients, 7 patients with bladder cancer using a Folly catheter of residual urine in the bladder after removing the amount determined according to individual patient enough to inject saline CT-Sim was designed after the treatment plan. After that, using OBI before treatment to confirm position with Cone-Beam CT scan was physician in charge of matching was performed in all patients. CBCT images using a total of 45 bones, bladder, based on image matching and image matching based on the difference were analyzed. In addition, changes in bladder volume of Eclipse (version 8.0, VARIAN, USA) persuaded through. Results: Bones, one based image matching based on the bladder and re-matching the X axis is the difference between the average $3{\pm}2mm$, Y axis, $1.8{\pm}1.3mm$, Z-axis travel distance is $2.3{\pm}1.7mm$ and the overall $4.8{\pm}2.0mm$, respectively. The volume of the bladder compared to the baseline showed a difference of $4.03{\pm}3.97%$. Conclusion: Anatomical location and nature of the bladder due to internal movement of the bones, even after matching with the image of the bladder occurred in different locations. In addition, the volume of saline-filled bladder showed up the difference between the 4.03 percent, but matched in both images to be included in the planned volumes were able to confirm. Thus, after injection of saline into the bladder base by providing a more accurate image matching will be able to conduct therapy.