• International Journal of Contents
• /
• v.10 no.3
• /
• pp.9-16
• /
• 2014

Depth-image-based rendering is generally used in real-time 2D-to-3D conversion for 3DTV. However, inaccurate depth maps cause flickering issues between image frames in a video sequence, resulting in eye fatigue while viewing 3DTV. To resolve this flickering issue, we propose a new 2D-to-3D conversion scheme based on fast and robust depth-map generation from a 2D video sequence. The proposed depth-map generation algorithm divides an input video sequence into several cuts using a color histogram. The initial depth of each cut is assigned based on a hypothesized depth-gradient model. The initial depth map of the current frame is refined using color and motion information. Thereafter, the depth map of the next frame is updated using the difference image to reduce depth flickering. The experimental results confirm that the proposed scheme performs real-time 2D-to-3D conversions effectively and reduces human eye fatigue.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.2
• /
• pp.29-36
• /
• 2003

This paper proposes a new 3D image transmission technique using digital watermarking for compatibility with conventional 2D digital TV. To transmit 3D images effectively, generally, we use image sequence transmission using temporal-spatial redundancy between stereo images. It is difficult for users with conventional digital TV to watch the transmitted 3D image sequence because of effectivity of 3D image compression. To improve such problem, in this paper, we perceive the concealment of new information of digital watermarking and conceal information of the other stereo image into three channels of the reference image. So we can watch the image with 3D TV as well as conventional digital TV when it is decoded.

• Journal of Korea Multimedia Society
• /
• v.12 no.6
• /
• pp.785-793
• /
• 2009

This paper proposes a signature using dominant singular values for video sequence matching. By considering the input image as matrix A, a partition procedure is first performed to separate the matrix into non-overlapping sub-images of a fixed size. The SVD(Singular Value Decomposition) process decomposes matrix A into a singular value-singular vector factorization. As a result, singular values are obtained for each sub-image, then k dominant singular values which are sufficient to discriminate between different images and are robust to image size variation, are chosen and normalized as the signature for each block in an image frame for matching between the reference video clip and the query one. Experimental results show that the proposed video signature has a better performance than ordinal signature in ROC curve.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.605-608
• /
• 1999

In this paper, we proposed several scene analysis algorithms. These algorithms using image difference and histogram operate on the sequence of DC coefficient which is extracted from Motion JPEG or MPEG without full-frame decompression. Since DC sequence has the most information of full frame while it has reduced data. Experimental results show less than 1/64 of full frame analysing complexity and exactly analyze scene changes and extract key frames.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.7
• /
• pp.1661-1666
• /
• 2010

Due to light condition or shadow around camera, acquired image sequence is often degraded by intensity fluctuation. This artifact is called luminance flicker. As the luminance flicker corrupts the performance of motion estimation or object detection, it should be corrected before further processing. In this paper, we analyze the flicker generation model and propose the new algorithm for flicker reduction. The proposed algorithm considers gain and offset parameter separately, and stabilizes the luminance fluctuation based on these parameters. We show the performance of the proposed method by testing on the sequence with artificially added luminance flicker and real sequence with object motion.

• Journal of Korean Society for Geospatial Information Science
• /
• v.18 no.2
• /
• pp.93-97
• /
• 2010

This paper presents the improved KLT(Kanade-Lucas-Tomasi) of registration of Image sequence captured by camera mounted on unmanned helicopter assuming without camera attitude information. It consists of following procedures for the proposed image registration. The initial interested points are detected by characteristic curve matching via dynamic programming which has been used for detecting and tracking corner points thorough image sequence. Outliers of tracked points are then removed by using Random Sample And Consensus(RANSAC) robust estimation and all remained corner points are classified as inliers by homography algorithm. The rectified images are then resampled by bilinear interpolation. Experiment shows that our method can make the suitable registration of image sequence with large motion.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.2
• /
• pp.41-47
• /
• 2001

In this paper, I propose a detection algorithm that can reliably separate moving objects from noisy background in the image sequence received from a camera at the fixed position. The proposed algorithm consists of four processes: generation of the difference image between the input image and the reference image. multilevel quantization of the difference image, and multistage merging in the quantized image, detection of the moving object using a back propagation in a neural network. The test results show that the proposed algorithm can detect moving objects very effectively in noisy environment.

• Journal of Ginseng Research
• /
• v.32 no.4
• /
• pp.332-336
• /
• 2008

Red ginseng is classified according to outer form and the quality of internal tissue, and red ginseng below third grade can't be sold. Also there are many differences in price according to grade. So if inferior Red ginseng is sold, economic loss and claim take place. This research is done conducted to investigate the possibility of the non-destruction internal tissue investigation of red ginseng. It is observed and compared that MR image after getting MR image agrees with real cutting side in 10-13% water content of red ginseng. The MR image can be obtained to see the internal section of red ginseng with equal condition of time, temperature and slice thickness in spin echo pulse sequence. The MR signal of red ginseng is very weak, because it contains low water density. So it takes about 30 minutes with the measurement of single point image (SPI). But the suitable time to distinguish internal tissues is about 9 seconds in TE (Echo Time) 2.23 ms, TR (Repetition Time) 150ms. The image to discriminate internal tissues in 9 seconds can be obtained when slice thickness is 10 mm with changes of 3, 5, 10 mm. The image obtained after 30 minutes' boiling of 55 degrees has clearer image than that of normal temperature. It is thought that MR signal is stronger through active motion of water particles as temperature increases. With this method MR image of red ginseng can be obtained and characteristics of internal tissues can be observed in such a short time.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.501-512
• /
• 2003

This paper proposes an indexing technique for fast retrieval of similar image subsequences using the multi-dimensional time warping distance. The time warping distance is a more suitable similarity measure than Lp distance in many applications where sequences may be of different lengths and/or different sampling rates. Our indexing scheme employs a disk-based suffix tree as an index structure and uses a lower-bound distance function to filter out dissimilar subsequences without false dismissals. It applies the normaliration for an easier control of relative weighting of feature dimensions and the discretization to compress the index tree. Experiments on medical and synthetic image sequences verify that the proposed method significantly outperforms the naive method and scales well in a large volume of image sequence databases.

• Journal of Broadcast Engineering
• /
• v.26 no.7
• /
• pp.838-843
• /
• 2021

This paper presents an algorithm for effective retrieval of score information to an input score image. The originality of the proposed algorithm is that it is designed to be robust to recognition errors by an OMR (Optical Music Recognition), while existing methods such as pitch histogram requires error induced OMR result be corrected before retrieval process. This approach helps people to retrieve score without training on music score for error correction. OMR takes a score image as input, recognizes musical symbols, and produces structural symbolic notation of the score as output, for example, in MusicXML format. Among the musical symbols on a score, it is observed that filled noteheads are rarely detected with errors with its simple black filled round shape for OMR processing. Barlines that separate measures also strong to OMR errors with its long uniform length vertical line characteristic. The proposed algorithm consists of a descriptor for a score and a similarity measure between a query score and a reference score. The descriptor is based on note-count, the number of filled noteheads in a measure. Each part of a score is represented by a sequence of note-count numbers. The descriptor is an n-gram sequence of the note-count sequence. Simulation results show that the proposed algorithm works successfully to a certain degree in score image-based retrieval for an erroneous OMR output.