• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06b
• /
• pp.92-97
• /
• 1998

For the efficient searching and browsing of digital video, it is essential to extract the internal structure of the video contents. As an example, a news video consists of several sections such as politics, economics, sports and others, and also each section consists of individual topics. With this information in hand, users can ore easily access the required video frames. This paper addresses the problem of automatic shot boundary detection and selection of representative frames (R-frames), which are the essential step in recognizing the internal structure of video contents. In the shot boundary detection, a new algorithm that have dual detectors which are designed specifically for the abrupt boundaries (cuts) and gradually changing bounaries respectively is proposed. Compared to the existing 미algorithms that mostly have tried to detect both types by a single mechanism, the proposed algorithm is proved to be more robust and accurate. Also in the problem of R-frame selection, simple mechanical approaches such as selecting one frame every other second have been adopted. However this approach often selects too many R-frames in static short, while drops important frames in dynamic shots. To improve the selection mechanism, a new R-frame selection algorithm that uses motion information extracted from pixel difference is proposed.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2006.11a
• /
• pp.127-132
• /
• 2006

Quantization in video coding plays an important role in controlling the bit-rate of compressed video bit-streams. It has been used as an important control means to adjust the amount of bit-streams to at]owed bandwidth of delivery networks and storage. Due to the dependent nature of video coding, dependent quantization has been proposed and applied for MPEG-2 video coding to better maintain the quality of reconstructed frame for given constraints of target bit-rate. Since Scalable Video Coding (SVC) being currently standardized exhibits highly dependent coding nature not only between frames but also lower and higher scalability layers where the dependent quantization can be effectively applied, in this paper, we propose a dependent quantization scheme for SVC and compare its performance in visual qualities and bit-rates with the current JSVM reference software for SVC. The proposed technique exploits the frame dependences within each GOP of SVC scalability layers to formulate dependent quantization. We utilize Lagrange optimization, which is widely accepted in R-D (rate-distortion) based optimization, and construct trellis graph to find the optimal cost path in the trellis by minimizing the R-D cost. The optimal cost path in the trellis graph is the optimal set of quantization parameters (QP) for frames within a GOP. In order to reduce the complexity, we employ pruning procedure using monotonicity property in the trellis optimization and cut the frame dependency into one GOP to decrease dependency depth. The optimal Lagrange multiplier that is used for SVC is equal to H.264/AVC which is also used in the mode prediction of the JSVM reference software. The experimental result shows that the dependent quantization outperforms the current JSVM reference software encoder which actually takes a linear increasing QP in temporal scalability layers. The superiority of the dependent quantization is achieved up to 1.25 dB increment in PSNR values and 20% bits saving for the enhancement layer of SVC.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.295-298
• /
• 2003

In this paper, a novel maximum a posterion (MAP) estimation for the channel decoding of H.264 codes in the presence of transmission error is presented. Arithmetic codes with a forbidden symbol and trellis search techniques are employed in order to estimate the best transmitted. And, there has been growing interest of communication, the research about transmission of exact data is increasing. Unlike the case of voice transmission, noise has a fatal effect on the image transmission. The reason is that video coding standards have used the variable length coding. So, only one bit error affects the all video data compressed before resynchronization. For reasons of that, channel needs the channel codec, which is robust to channel error. But, usual channel decoder corrects the error only by channel error probability. So, designing source codec and channel codec, Instead of separating them, it is tried to combine them jointly. And many researches used the information of source redundancy In received data. But, these methods do not match to the video coding standards, because video ceding standards use not only one symbol but also many symbols in same data sequence. In this thesis, We try to design combined source-channel codec that is compatible with video coding standards. This MAP decoder is proposed by adding semantic structure and semantic constraint of video coding standards to the method using redundancy of the MAP decoders proposed previously. Then, We get the better performance than usual channel coder's.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.147-151
• /
• 2008

Since the first HDV(High Definition Video) camcoder, HDR-FX1 with 1080i resolution, had been launched at 2004, the image capture and record with HD resolution have been possible by the various types of camcoder and recorder which can support the HDV format. At a present day, a non-linear editing system, which is composed of only one computer, can capture, edit and export the image with HDV format. The HDV format has the same class of resolution with HD and the same data transfer bit rate of DV(Digital Video). Additionally, the image with HDV format can be recorded in 6mm DV cassette tape. It is possible because the HDV format uses the concept of Long GOP(Gorup of pictures) method for its compression. In this paper, the characteristic feature of HDV format, the essential factors in editing with HDV format and the concept of Long GOP method for its compression have been studied for the way of effective HDV editing.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.147-151
• /
• 2014

With the advent of tiny and inexpensive computer systems like Raspberry Pi, it has become possible to construct an experimental environment of MANETs (Mobile Ad hoc Networks) at a relatively low cost. In this paper, we implement a node of MANETs with a Raspberry Pi equipped with two 802.11 wireless LAN cards and dynamic routing software running on it. In an outdoor MANETs environment with moving mobile nodes automatically rebuilding broken routes, we conducted a real-time video streaming experiment over the MANET. The video stream is transmitted from a node with a video camera installed on it to another node through the route established dynamically. Each node is equipped with a display device, with which the current status of the node can be checked out. We also implemented software that automatically collects data stored in each node and analyzes the performance of the MANETs. Through this experiment, we could evaluate the performance of realistic video streaming service in a MANETs environment.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.453-455
• /
• 2022

Metadata is data that explains attributes and features to the data as structured data. Among them, video metadata refers to data extracted from information constituting the video for accurate content-based search. Recently, as the number of users using video content increases, the number of OTT providers is also increasing, and the role of metadata is becoming more important for OTT providers to recommend a large amount of video content to individual users or to search appropriately. In this paper, a study was conducted on a method of automatically extracting metadata for mood attributes through sound effects of images. In order to classify the sound effect of the video and generate metadata about the attributes of the mood, I would like to propose a method of establishing a terminology dictionary for the mood and extracting information through supervised learning.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2003.10a
• /
• pp.175-180
• /
• 2003

This paper used Non-Metric digital video camera against subject of study, stone cultural assets such as stone pagodas, and examine an error of photographing preliminarily without re-photographing. After that, precise surveying for cultural assets can obtain enough precision of accuracy. Finally, it can be said that study also suggests the efficient and economical measurement when planning to restore prototype of cultural assets in the future and providing specific information on them

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.50-53
• /
• 2000

In this work, the new algorithm that automatically extracts moving object of the video image is presented. In order to extract moving object, it is that velocity vectors correspond to each frame of the video image. Using the estimated velocity vector, the position of the object are determined. the value of the coordination of the object is initialized to the seed, and in the image plane, the moving object is automatically segmented by the region growing method. As the result of an application in sequential images, it is available to extract a moving object.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.171-174
• /
• 2000

In this paper, We try to design combined source-channel coder that is compatible with video coding standards. This MAP decoder is proposed by adding semantic structure and semantic constraint of video coding standards to the method using redundnacy of the MAP decoders proposed previously. Then, We get the better performance than usual channel coder＇s.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.183-186
• /
• 2000

Motion estimation technique has been used to increase video compression rates in motion video applications. One of the important algorithms to implement the motion estimation technique is search algorithm. Among many search algorithms, the H.263 adopted the Nearest Neighbors algorithm for fast search. In this paper, motion estimation block for the Nearest Neighbors algorithm is designed on FPGA and coded using VHDL and simulated under the Xilinx foundation environments. In the experiment results, we verified that the algorithm was properly designed and performed on the Xilinx FPGA(XCV300Q240)