• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.8
• /
• pp.1792-1801
• /
• 2003

In these days, image mosaic is getting interest in the field of advertisement, tourism, game, medical imaging, and so on with the development of internet technology and the performance of personal computers. The main problem of mage mosaic is searching corresponding points correctly in the overlapped area between images. However, previous methods requires a lot of CPU times and data processing for finding corresponding points. And they need repeated recording with a revolution of 360 degree around objects or background. This paper presents a new image mosaic method which generates a panorama image from a video sequence recorded by a general video camera. Our method finds the corresponding points between two successive images by using a new direction oriented 3­step block matching methods. Experimental results show that the suggested method is more efficient than the methods based on existing block matching algorithm, such as full search and K­step search algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.635-638
• /
• 2005

The purpose of video segmentation is to segment video sequence into shots where each shot represents a sequence of frames having the same contents, and then select key frames from each shot for indexing. There are two types of shot changes, abrupt and gradual. The major problem of shot change detection lies on the difficulty of specifying the correct threshold, which determines the performance of shot change detection. As to the clustering approach, the right number of clusters is hard to be found. Different clustering may lead to completely different results. In this thesis, we propose a video segmentation method using a color-X$^2$ intensity histogram-based fuzzy c-means clustering algorithm.

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

This paper describes a marine watch system on a ship, which is aided by an image processing method. The system detects other ships through a navigational image sequence to prevent oversights, and it measures their bearings to maintain their movements. The proposed method is described, the detection techniques and measurement of bearings techniques are derived, and the results have been reported. The image is divided into small regions on the basis of the brightness value and then labeled. Each region is considered as a template. A template is assumed to be a ship. Then, the template is compared with frames in the original image after a selected time. A moving vector of the regions is calculated using an Excel table. Ships are detected using the characteristics of the moving vector. The video camera captures 30 frames per second. We segmented one frame into approximately 5000 regions; from these, approximately 100 regions are presumed to be ships and considered to be templates. Each template was compared with frames captured at 0.33 s or 0.66 s. In order to improve the accuracy, this interval was changed on the basis of the magnification of the video camera. Ships’ bearings also need to be determined. The proposed method can measure the ships’ bearings on the basis of three parameters: (1) the course of the own ship, (2) arrangement between the camera and hull, and (3) coordinates of the ships detected from the image. The course of the own ship can be obtained by using a gyrocompass. The camera axis is calibrated along a particular direction using a stable position on a bridge. The field of view of the video camera is measured from the size of a known structure on the hull in the image. Thus, ships’ bearings can be calculated using these parameters.

• Journal of Satellite, Information and Communications
• /
• v.9 no.4
• /
• pp.77-81
• /
• 2014

This paper propose a method to detect moving object and locating in real time from video sequence. first the proposed method extract moving object by differencing two consecutive frames from the video sequence. If the interval between captured two frames is long, it cause to generate fake moving object as tail of the real moving object. secondly this paper proposed method to overcome this problem by using doppler effects and HSV color model. finally the object segmentation and locating is done by combining the result that obtained from steps above. The proposed method has 99.2% of detection rate in practical and also this method is comparatively speed than other similar methods those proposed in past. Since the complexity of the algorithm is directly affects to the speed of the system, the proposed method can be used as low complexity algorithm for real time moving object detection.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.1
• /
• pp.402-410
• /
• 2013

In this paper, we propose a new fast block matching algorithm for block matching using the temporal and spatially correlation of the video sequence and local statistics of neighboring motion vectors. Since the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(sum of absolute difference) value by the predicted motion vectors of neighboring blocks around the same block of the previous frame and the current frame and the predictor candidate point on each division region by binary-tree structure. Experimental results show that the proposed algorithm has the capability to dramatically reduce the search points and computing cost for motion estimation, comparing to fast FS(full search) motion estimation and other fast motion estimation.

• KIPS Transactions on Software and Data Engineering
• /
• v.10 no.5
• /
• pp.195-200
• /
• 2021

Due to the development of video sharing platforms, the amount of video uploads is exploding. Such videos often include various types of music, among which cover songs are included. In order to protect the copyright of music, an algorithm to find the original song of the cover song is essential. However, it is not easy to find the original song because the cover song is a modification of the composition, speed and overall structure of the original song. So far, there is no known effective algorithm for searching the original song of the cover song. In this paper, we propose an algorithm for searching the original song of the cover song using the inflection points of the melody line. Inflection points represent the characteristic points of change in the melody sequence. The proposed algorithm compares the original song and the cover song using the sequence of inflection points for the representative phrase of the original song. Since the characteristics of the representative phrase are used, even if the cover song is a song made by modifying the overall composition of the song, the algorithm's search performance is excellent. Also, since the proposed algorithm uses only the features of the inflection point sequence, the memory usage is very low. The efficiency of the algorithm was verified through performance evaluation.

• Journal of IKEEE
• /
• v.5 no.2 s.9
• /
• pp.221-231
• /
• 2001

In this paper, we propose an efficient requantization method for INTRA frames in heterogeneous transcoding from MPEG-1 to MPEG-4 simple profile. The quantizer for MPEG-1 INTRA MB usually uses a quantization weighting matrix while the quantizer for MPEG-4 simple profile doesn't. As a result, the quantization step sizes of the two quantizers may not be the same even for the same quantization parameter. Due to this mismatch in the quantization step site, the transcoded MPEG-4 sequence suffers from serious quality degradation and the number of bits produced by transcoding increases from the original MPEG-1 video sequence. To solve these problems, we propose an efficient method to find a near-optimum reconstruction level in the transcoder. We also present a PDF (probability distribution function) estimation method for the original DCT coefficients of MPEG-1 video sequence, which is required for the proposed requantization. Experimental results show that the proposed method gives $0.3{\sim}0.6dB$ improvement in PSNR over the conventional method, even at the reduced bit-rate about $5{\sim}7%$ from the conventional method.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.2
• /
• pp.411-418
• /
• 2018

This paper presents a novel three-dimensional (3D) object encryption scheme by combining the use of the virtual optics and the chaotic sequence. A virtual 3D object is digitally produced using a two-dimensional (2D) elemental image array (EIA) created with a virtual pinhole array. Then, through a logistic mapping of chaotic sequence, a final encrypted video can be produced. Such method converts the value of a pixel which is the basic information of an image. Therefore, it gives an improved encryption result compared to other existing methods. Through computational experiments, we were able to verify our method's feasibility and effectiveness.

• Journal of Korea Multimedia Society
• /
• v.11 no.3
• /
• pp.315-322
• /
• 2008

Searching a location of the copied video in video database, signatures should be robust to video reediting, channel noise, time variation of frame rate. Several kinds of signatures has been proposed. Ordinal signature, one of them, is difficult to describe the spatial characteristics of frame due to the site of fixed window, $N{\times}N$, which is compute the average gray value. In this paper, I studied an algorithm of sequence matching in video copy detection for the copyright protection, employing the R-tree index method for retrieval and suggesting a robust ordinal signatures for the original video clips and the same signatures of the pirated video. Robust ordinal has a 2-dimensional vector structures that has a strong to the noise and the variation of the frame rate. Also, it express as MBR form in search space of R-tree. Moreover, I focus on building a video copy detection method into which content publishers register their valuable digital content. The video copy detection algorithms compares the web content to the registered content and notifies the content owners of illegal copies. Experimental results show the proposed method is improve the video matching rate and it has a characteristics of signature suitable to the large video databases.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.42-53
• /
• 2000

Efficient implementation of pre-filtering has been an important issue in video sequence coding, because it can remove camera noise and improve coding efficiency dramatically This paper introduces a novel pre-filtering scheme that is performed inside a video encoder The proposed pre-filtering is based on the approximated generalized Wiener filtering and two-dimensional discrete cosine transform (DCT) factorization. and is achieved by scaling the DCT coefficients of original image blocks for intra block coding and those of motion-compensated error blocks for inter block coding, respectively Even though the pre-filtering operation is embedded in a video encoder, its additional computational complexity is marginal compared to the encoding process, and the overall architecture of the conventional video encoder is maintained In spite of its simplicity, the proposed pre-filtering scheme provides good filtering and coding performance for noisy video sequences.