• Korean Journal of Remote Sensing
• /
• v.21 no.5
• /
• pp.433-443
• /
• 2005

This paper show that, without installation of expensive VR (Virtual Reality) program, the sharing information is possible through posting three-dimensional road structures on the web, and avoiding the conventional top-down decision making method, fast bottom-up communication is possible base on the Virtual GIS (Geographic Information System). In this paper, using Viewpoint Scene Builder, internet-based software, the transformation was conducted to give pertinent type for web posting. In order to use the completed route at the scene builder, the output with ASCII Export is required, and ASE (ASCII Scene Export) contains the property information including the coordinate and frame of mesh vertex. Through in advance recognition of the problems regarding route design and petition due to environmental rights infringement, the time and cost due to design alteration can be reduced. It's difficult to provide VR based on the internet because file that embodied with internet GIS was complicated and its capacity comes to scores of mega-bites. But, this study provides VR with internet according to a basis by simplification of files.

• Journal of Korea Multimedia Society
• /
• v.18 no.12
• /
• pp.1492-1500
• /
• 2015

In recent crime scene, there is the captured crime scene video at least one. So video files recorded on storage media often provide important evidence. Criminals often attempt to destroy storage saved crime scene video. For this reason recovery of a damaged or deleted video file is important to resolve criminal cases in aspects of digital forensic. In the recent, there is a study to recover video file based on video frames, but it is very poor time efficiency when the connecting video frames. This paper proposed advanced frame-based recovery technique of a damaged video files using time information. We suggest a new connecting algorithm to connect video frames using recorded time information in front of video frame. We also evaluate performance in aspects of time and experiment result shows that proposed method improves performance.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.311-311
• /
• 2000

We propose a DP-based formulation for matching line patterns by defining a robust and stable geometric representation that is based on the conceptual organizations. Usually, the endpoint proximity and collinearity of image lines, as two main conceptual organization groups, are useful cues to match the model shape in the scene. As the endpoint proximity, we detect junctions from image lines. We then search for junction groups by using geometric constraint between the junctions. A junction chain similar to the model chain is searched in the scene, based on a local comparison. A Dynamic Programming-based search algorithm reduces the time complexity for the search of the model chain in the scene. Our system can find a reasonable matching, although there exist severely distorted objects in the scene. We demonstrate the feasibility of the DP-based matching method using both synthetic and real images.

• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.269-272
• /
• 2007

The shortcut shot detection based on MPEG compressed video bitstream is presented in this paper. The detection algorithm is used the video picture frame from MPEG compressed video directly not to be decompressed the original image. For shortcut detection, I and P frame of MPEG video bitstream are classified. The changing scene cuts at I pictures are detected by the decompressed DC image and scene cuts at P picture frame by monitoring the percentage of intra-macroblocks per P picture are detected. Experimental results using test video bitstream QVGA results in average 92% detection rate, searching time is taken around 4.5 times faster in comparison with changing scene shot detection algorithm which is decompressed the compressed bitstream.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2003.07a
• /
• pp.451-462
• /
• 2003

At the paper the method of 3D holographic moving image reconstruction is discused. The main idea of this method is based on the substitution of optically created static hologram by equal diffraction array created by acoustical (AO) field which formed by bulk sound waves. Such sound field can be considered as dynamic optical hologram, which is electrically controlled. At the certain moment of time when the whole hologram already formed, the reference optical beam illuminates it, and due to acoustooptical interaction the original optical image is reconstructed. As the acoustically created dynamic optical hologram is electronically controlled, it can be used for moving 3-dimentional scene reconstruction in real time. The architecture of holographic display for moving scene reconstruction is presented at this paper. The calculated variant of such display laboratory model is. given and discussed. The mathematical simulation of step by step images recording and reconstruction is given. The pictures of calculated reconstructed images are presented. The prospects, application areas, shortcomings and main problems are discussed.

• Journal of Information Display
• /
• v.4 no.3
• /
• pp.29-34
• /
• 2003

At the paper the method of 3D holographic moving image reconstruction is discused. The main idea of this method is based on the substitution of optically created static hologram by equal diffraction array created by acoustical (AO) field which formed by bulk sound waves. Such sound field can be considered as dynamic optical hologram, which is electrically controlled. At the certain moment of time when the whole hologram already formed, the reference optical beam illuminates it, and due to acoustooptical interaction the original optical image is reconstructed. As the acoustically created dynamic optical hologram is electronically controlled, it can be used for moving 3-dimentional scene reconstruction in real time. The architecture of holographic display for moving scene reconstruction is presented at this paper. The calculated variant of such display laboratory model is given and discussed. The mathematical simulation of step by step images recording and reconstruction is given. The pictures of calculated reconstructed images are presented. The prospects, application areas, shortcomings and main problems are discussed.

• The KIPS Transactions:PartB
• /
• v.12B no.5 s.101
• /
• pp.617-630
• /
• 2005

General scene change detection determines the changes of a scene by using feature comparison of two continuous images that are above the fixed threshold. But existing algerian detects scene change that was used in comparing the features of two images continuously, it usually takes a lot of time in decrypting the image data and false-detection problem occurs when there is an object motion or a change of illumination. In this paper, macroblock were used to extract the information directly from the MPEG compression area and suggests algorithm that will detect scene changes more effectively. Existing algorithm have shown numerous arithmetic problems that were improved in the proposed algorithm. The existing algorithm cannot detect the changes of a scene after analyzing the relationship of the previousand futureimages while the algorithm being proposed can detect the changes of a scene continuously and resolves the problem of false-detection. To this end, the data used in general were tested to prove that this algerian would be able to detect the scene changes faster and more correctly than the existing ones. The performance of the suggested algorithm was analyzed basedontheresultsoftheexperiment. .

• Biomedical Science Letters
• /
• v.16 no.3
• /
• pp.197-200
• /
• 2010

All citizens over 17 year old living in Korea have to be fingerprinted to obtain a certificate of resident registration. For this reason, human identification through fingerprints has been used actively in crime scene investigation. The fingerprint is so unique that it is one of the most certain ways to identify oneself and it can differentiate between genetically identical twins. Fingerprints gained in crime scene indicate a direction of criminal investigation in conjecturing a suspect. Fingerprints help a reunion of family got scattered for a long time and make it possible to get a personal identification for missing person who met with natural calamity. We developed a new fingerprinting method using safranine O, so as to develop fingerprints on the adhesive tapes and non-porous papers in various physical environments. Results were compared to the preexisting fingerprinting method, the minutiae numbers of fingerprints were greatly increased in our newly developed safranine O fingerprinting method. This newly developed safranine O method showed a quantity and quality comparable to the preexisting fingerprinting method routinely used in these days. In our hands, the safranine O fingerprinting method is another easy and obvious choice when the forensic case sample is available for fingerprints on the adhesive tapes and non-porous papers.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.293-302
• /
• 2002

Gradual scene change detection is known as more difficult problem then abrupt scene change detection on video data analysis for contents based retrieval. In this paper, we present a new method for scene change detection far both abrupt and gradual change using the variable dynamic threshold arid cut frame difference (CFD). For this, We present the characteristics arid mathematical models of gradual transitions anti then, how can be detected by the CFD. And also we present new scene change detection algorithm based on cut frame difference. By the experimental result using real world video data indicate that the proposed method detect various scene changes both abrupt and gradual change efficiently without time-consuming computation and any dependency on a kind of gradual change effects.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.11
• /
• pp.77-86
• /
• 2013

In this paper, we propose a fast video retargeting method which preserves the contents of a video and converts the image size. Since the conventional Seam Carving which is the well-known content-aware image retargeting technique uses the dynamic programming method, the repetitive update procedure of the accumulation energy is absolutely needed to obtain seam. The energy update procedure cannot avoid the processing time delay because of many operations by the image full-searching. By applying the proposed method, frames which have similar features in video are classified into a scene, and the first frame of a scene is resized by the modified Seam Carving where multiple seams are extracted from candidate seams to reduce the repetitive update procedure. After resizing the first frame of a scene, all continuous frames of the same scene are resized with reference to the seam information stored in the previous frame without the calculation of the accumulation energy. Therefore, although the fast processing is possible with reducing complexity and without analyzing all frames of scene, the quality of an image can be analogously maintained with an existing method. The experimental results show that the proposed method can preserve the contents of an image and can be practically applied to retarget the image on real time.