• Journal of Korea Multimedia Society
• /
• v.17 no.1
• /
• pp.26-33
• /
• 2014

Video retrieval and indexing are performed by comparing feature similarities between key frames in shot after detecting a scene change and extracting key frames from the shot. Typical image features such as color, shape, and texture are used in content-based video and image retrieval. Many approaches for integrating these features have been studied. However, the issue of these approaches is how to appropriately assign weighting of key frame features at query time. Therefore, we propose a new video retrieval method using adaptively weighted image features. We performed computer simulations in test databases which consist of various kinds of key frames. The experimental results show that the proposed method has better performance than previous works in respect to several performance evaluations such as precision vs. recall, retrieval efficiency, and ranking measure.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.7
• /
• pp.1672-1686
• /
• 2013

In this paper, we propose a hybrid super-resolution algorithm robust to cut-change. Existing single-frame based super-resolution algorithms are usually fast, but quantity of information for interpolation is limited. Although the existing multi-frame based super-resolution algorithms generally robust to this problem, the performance of algorithm strongly depends on motions of input video. Furthemore at boundary of cut, applying of the algorithm is limited. In the proposed method, we detect a define boundary of cut using cut-detection algorithm. Then we adaptively apply a single-frame based super-resolution method to detected cut. Additionally, we propose algorithms of normalizing motion vector and analyzing pattern of edge to solve various problems of existing super-resolution algorithms. The experimental results show that the proposed algorithm has better performance than other conventional interpolation methods.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.1
• /
• pp.67-74
• /
• 2002

A study on image searching and management techniques is actively developed by user requirements for multimedia information that are existing as images, audios, texts data from various information processing devices. If we can automatically detect and segment changing scenes from real-time image sequences, we can improve an effectiveness of image searching systems. In this paper, we propose cut detection techniques based on image color distribution and we evaluated its performance on various real-time image sequences. Results of experiments show that the proposed method are robust on various image patterns than color histogram method using statistical informations of images. Also, these methods can be used for cut detection on real-time image sequences.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1713-1720
• /
• 1999

This paper presents a new key frame extraction technique, for scene change detection, using the proposed AHIM (Accumulative Histogram Intersection Measure) from the DC image constructed by DCT DC coefficients in the compressed video sequence that is video compression standard such as MPEG. For fast content-based browsing and video retrieval in a video database, we also provide a novel coarse-to-fine video indexing scheme. In the extracted key frame, we perform the region segmentation as a preprocessing. First, the segmented image is projected with the horizontal direction, then we transform the result into a histogram, which is saved as a database index. In the second step, we calculate the moments and change them into a distance value. From the simulation results, the proposed method clearly shows the validity and superiority in respect of computation time and memory space, and that in conjunction with other techniques for indexing, such as color, can provide a powerful framework for image indexing and retrieval.

• Journal of Broadcast Engineering
• /
• v.12 no.6
• /
• pp.574-584
• /
• 2007

As the real time multimedia service become more popular, the needs of transmission with low delay and high quality are getting more stronger. Among those video compression technologies, the rate control method dose an important role in getting the effective data transmitting and the high image quality. In this paper, we combined the feature of CBR and VBR coding methods to propose a new bit-rate control method witch allows each frame to generates bits in the defined fluctuation range and applies a scene change detection at a part of frame and also can maintain low-delay and high quality even if the perfect VBR transmission environment is not guaranteed. The experiment result shows the proposed algorithm provides more effective method than TMN8 in real time application.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.413-421
• /
• 2005

As the population of HDTV is growing, among many useful features of modern set top boxes (STBs) or digital video recorders (DVRs), video browsing, visual bookmark, and picture-in-picture capabilities are very frequently required. These features typically employ reduced-size versions of video frames, or thumbnail images. Most thumbnail generation approaches generate DC images directly from a compressed video stream. A discrete cosine transform (DCT) coefficient for which the frequency is zero in both dimensions in a compressed block is called a DC coefficient and is simply used to construct a DC image. If a block has been encoded with field DCT, a few AC coefficients are needed to generate the DC image in addition to a DC coefficient. However, the bit length of a codeword coded with variable length coding (VLC) cannot be determined until the previous VLC codeword has been decoded, thus it is required that all codewords should be fully decoded regardless of their necessary for DC image generation. In this paper, we propose a method especially for fast DC image generation from an I-frame using multiple-symbol lookup table (mLUT). The experimental results show that the method using the mLUT improves the performance greatly by reducing LUT count by 50$\%$.