Three-dimensional film images which are recently developed are seen as three-dimensional using the angle, amount, and viewing position of incident light rays. However, if the pixel contrast of the image is low or the patterns are cloudy,... more
Three-dimensional film images which are recently developed are seen as three-dimensional using the angle, amount, and viewing position of incident light rays. However, if the pixel contrast of the image is low or the patterns are cloudy, it does not look three-dimensional, and it is difficult to perform a quality inspection because its detection is not easy. In addition, the inspection method has not yet been developed since it is a recently developed product. To solve this problem, we propose a method to calculate the width of pixels for a specific height from the image histogram of a 3D film image and classify it based on a threshold. The proposed algorithm uses the feature that the widths of pixels by height in the image histogram of the good 3D film image are wider than the image histogram of the bad 3D film image. In the experiment, it was confirmed that the position of the height section of the image histogram has the highest classification accuracy. Through comparison tests w...
Research Interests:
Research Interests:
The procedures of white points detection and localization are practically complex on noisy images. In this paper, we propose an algorithm that detects and localizes white points on 3D film images. The proposed algorithm uses the fast... more
The procedures of white points detection and localization are practically complex on noisy images. In this paper, we propose an algorithm that detects and localizes white points on 3D film images. The proposed algorithm uses the fast Fourier transform to convert the binarized image into real and imaginary parts to obtain the number of white points along the horizontal and vertical. We determine the sorted coordinates of the white points by adding a brute-force solution to the coordinates obtained from the real part of the image. These sorted coordinates are obtained by subtracting the error between the Euclidean distances of the normalized coordinates along the vertical and horizontal direction. The proposed algorithm with and without brute-force achieved an average detection ratio of 0.98 and 0.88 respectively, while the others underperformed. We perform various experiments using the existing algorithms such as template matching, thresholding, and an iterative method to validate th...
Research Interests:
In the fields of low bit rate coding and real time video coding, the three-step search (TSS) algorithm for fast motion estimation has played a key role because of its regularity, reasonable performance, and reduced amount of computation... more
In the fields of low bit rate coding and real time video coding, the three-step search (TSS) algorithm for fast motion estimation has played a key role because of its regularity, reasonable performance, and reduced amount of computation for searching the motion vector. In this work, a new fast TSS algorithm is proposed, which is based on UESA, half-stop method in matching pursuit and gradient-assisted adaptive matching scan for fast motion estimation. The first approach efficiently reduces checking points in the search range with reasonable PSNR performance. Two other algorithms remove unnecessary computations in obtaining the matching error without any degradation of error performance. This work is useful in the applications of software-based real-time video coding and low bit rate video coding.
Research Interests:
When applying PDE algorithm according to the complexity of the image, the problem is how to get complexity of the image. J.N. Kim and et al. proposed one method, which results in significant reduced computation with the same predicted... more
When applying PDE algorithm according to the complexity of the image, the problem is how to get complexity of the image. J.N. Kim and et al. proposed one method, which results in significant reduced computation with the same predicted image quality of the conventional FS [1]. But by localizing the image well, we can get more the reduction of unnecessary computation. In general, image complexity is localized in pieces rather than the whole span of image or some fixed blocks. If we use localization with small subblocks, the PDE algorithm can be represented as shown in Eq. (1). Generally, image complexity is distributed sparsely in small patches rather than globally in whole image. From the viewpoint, we can well classify image complexity by small subblock unit rather than by whole row vector or column one of matching blocks. It is very important in Eq. (1) to detect the image area with larger matching error. That is, by first checking more complex area of matching block, we can get la...
Research Interests:
The transition to digital in the TV broadcasting industry is already gradually being performed while the complete digital switchover seems now possible to be accomplished within the near future. This article describes and analyses this... more
The transition to digital in the TV broadcasting industry is already gradually being performed while the complete digital switchover seems now possible to be accomplished within the near future. This article describes and analyses this phenomenon and the role of MPEG-21 may play in it. MPEG-21 is the ISO/IEC standard currently under development in MPEG (ISO/IEC JTC1/SC29/WG11). Unlike preceding MPEG standards MPEG-21 does not specify a coding format of the content but rather a set of standards to ease transactions of multimedia content and the provision of digital multimedia services in heterogeneous network environments, including broadcast. In this paper, we highlight the role of MPEG-21 in broadcasting, in particular in the deployment of digital TV services.
Research Interests:
Estimation of 3-D objects from 2-D images is inherently performed by either motion or scene features methods as it has been described in different literatures. Structure from motion as a method employed in this study uses calibrated... more
Estimation of 3-D objects from 2-D images is inherently performed by either motion or scene features methods as it has been described in different literatures. Structure from motion as a method employed in this study uses calibrated camera and reconstructed 3-D points from the structure of the scene for reliable and precise estimates. In this study we construct 3-D shapes using color pixels and reconstructed 3-D points to determine observable differences for the constructed 3-D images. The estimation using reconstructed 3-D points indicates that the sphere is recovered by the use of scale factor due to its known size while the one obtained by using color pixels has look similar to the former but different in the scales of the axes.
Research Interests:
Abstract. In this paper, we propose a real-time video watermarking chip and system which is hardware based watermark embedding system of SD/HD (standard definition/high definition) video with STRATIX FPGA device from ALTERA as well as we... more
Abstract. In this paper, we propose a real-time video watermarking chip and system which is hardware based watermark embedding system of SD/HD (standard definition/high definition) video with STRATIX FPGA device from ALTERA as well as we implement the watermark ...
Research Interests:
Research Interests:
The three-step search (TSS) has played a key role in real time video encoding because of its light computational complexity, regularity of search rule, and reasonable performance for reduced computation. Many researches about modified TSS... more
The three-step search (TSS) has played a key role in real time video encoding because of its light computational complexity, regularity of search rule, and reasonable performance for reduced computation. Many researches about modified TSS algorithms have been studied for reducing the amount of computation or improving the quality of the image predicted with obtained motion vector. This paper explains a new concept of hierarchical search in motion estimation for more reduction of computational complexity and better error performance compared with conventional modified TSS algorithms. The structure of the proposed algorithm is similar to that of the conventional TSS algorithm. The proposed algorithm, however, has different precision of search for each step. It will be shown that the proposed algorithm is very efficient in terms of speed up for computation and has improved error performance over the conventional modified TSS algorithms. Our proposed algorithm will be useful in software-based real-time video coding and low bit rate video coding.
Research Interests:
Three-step search (TSS) has been studied for low bit-rate video communications because of significantly reduced computation, simplicity and reasonable performance in the motion estimation. Many other modified TSS algorithms have been... more
Three-step search (TSS) has been studied for low bit-rate video communications because of significantly reduced computation, simplicity and reasonable performance in the motion estimation. Many other modified TSS algorithms have been developed for higher speedup of computation and improved error performance of motion compensation. Among the modified TSS algorithms, new three-step search (NTSS) shows very good error performance with more reduced computation on the average. However, the method can exceed about 30% compared with the computation of TSS for some cases. It can be serious problem in real-time video coding at the worst case. This paper proposes an efficient and adaptive three-step search (EATSS) algorithm with adaptive search strategy considering unequal subsampling and partial distortion elimination (PDE). Proposing search strategy reduces useless checking points of the first step in the NTSS by using initial sum of absolute difference (SAD) and predefined threshold of SAD. Instead of checking 17 candidate points in the first step as the NTSS, our search algorithm starts with 1 or 9 checking points according to the comparison between initial SAD and predefined threshold of SAD. Experimentally, our algorithm shows good performance in terms of PSNR of predicted images and average checking points for each block compared with NTSS and TSS.
Research Interests:
New three-step search (NTSS) algorithm obtains good picture quality in predicted images with more reduced computation on the average. To reduce more the computation while keeping error performance compared with NTSS, this paper proposes a... more
New three-step search (NTSS) algorithm obtains good picture quality in predicted images with more reduced computation on the average. To reduce more the computation while keeping error performance compared with NTSS, this paper proposes a fast NTSS algorithm using unimodal error surface assumption correlation of causal adjacent matching errors, partial distortion elimination (PDE) algorithm and cross search algorithm. Proposing algorithm reduces less important checking points of the first step in the NTSS by using initial sum of absolute difference (SAD) and adaptive threshold of SAD. Instead of checking seventeen candidate points in the first step like the NTSS, our search algorithm starts with nine checking points according to the result of comparison between initial SAD and adaptive threshold of SAD. We get adaptive threshold of SAD according to the causal adjacent SADs. For more computational reduction without any degradation in prediction quality, we employ PDE and cross search algorithm. Therefore, we can apply this algorithm to variety of applications because the threshold is adaptive to the characteristics of each sequence. Experimentally, our algorithm shows good performance in terms of PSNR of predicted images and average-checking points for each block compared with the conventional NTSS and TSS algorithms.
Research Interests:
Research Interests:
Research Interests:
With the advancement of the digital broadcasting and popularity of Internet, there is an increasing demand for digital data. Recently, several studies have been made on the digital watermarking for copyright protection of digital data. We... more
With the advancement of the digital broadcasting and popularity of Internet, there is an increasing demand for digital data. Recently, several studies have been made on the digital watermarking for copyright protection of digital data. We propose a blind video watermarking using minimum modification of motion vectors. Conventional methods based on motion vectors do watermarking using modification of motion vectors. However, change of motion vectors results in the degradation of video quality. Thus, our proposed algorithm minimizes modification of the original motion vectors to avoid degradation of video quality using simple embedded conditions. Besides, our scheme guarantees the amount of embedded watermark data using the adaptive threshold considering the human visual characteristic. In addition, this is compatible with current video compression standards without changing the bitstream. Experimental result shows that the proposed scheme obtains better video quality than other previous algorithms by about .
Research Interests:
Shot change detection is the main technique for automatic temporal segmentation of video. Until now, there were little research reports about real-time shot change detection for applying to hardware terminals with low performance such as... more
Shot change detection is the main technique for automatic temporal segmentation of video. Until now, there were little research reports about real-time shot change detection for applying to hardware terminals with low performance such as PMPs (Portable Multimedia Player) and cellular phones. In this paper, we propose an adaptive real-time shot change detection algorithm using sub-sampling, weighting variance, and an adaptive threshold. We use weighting variance of frame difference for dividing feature extraction at a changed frame. We set an adaptive threshold using the average of variance from the next one of a last shot change frame to the previous one of a current frame. In the experiments, we obtained the detection rate of about 94.4% in overall accuracy. We verified real-time operation of shot change detection by implementing our algorithm on the TVUS HM-900 PMP from the company of Homecast. Therefore, our proposing algorithm will be helpful in searching video data on portable media player such as PMPs and cellular phones.
Research Interests:
in this paper, we propose a real-time encryption method without additional information in digital multimedia broadcasting (DMB) contents using AES (advanced encryption standard) encryption algorithm and implement it on a personal... more
in this paper, we propose a real-time encryption method without additional information in digital multimedia broadcasting (DMB) contents using AES (advanced encryption standard) encryption algorithm and implement it on a personal multimedia player (PMP). As the experimental result, we examined the operation of real time encryption and decryption in PMP with format compliance, while without increment of file size. Additionally, we confirmed that the saved contents in a PMP were not played in other devices without decryption key. Our implemented system can be useful in real-time applications requiring contents protection service such as video on demand, IPTV and digital TV.
Research Interests:
At July 2008, the nationwide DMB (Digital Multimedia Broadcasting) has got started. As DMB device's volume of sales has been over 12 million already, the development of rapidly changing network systems has increased the dangers of... more
At July 2008, the nationwide DMB (Digital Multimedia Broadcasting) has got started. As DMB device's volume of sales has been over 12 million already, the development of rapidly changing network systems has increased the dangers of infringing the copyright of DMB contents. For solving this problem, we suggest that real-time encryption algorithm without additional expenses, and implemented that on PMP. We used the SEED algorithm for encryption. As the experimental result, we confirmed that the real-time encryption and decryption of DMB videos were working well. Also confirmed that recorded contents in PMP were not replayed in other devices, and also the contents recorded by other devices were not played in PMP. Suggested algorithms can be useful in the VOD, IPTV or cable TV.
Research Interests:
In this paper, we propose a fast motion estimation algorithm for video encoding. Conventional fast motion estimation algorithms have a serious problem of low prediction quality in some frames. However, full search based fast algorithms... more
In this paper, we propose a fast motion estimation algorithm for video encoding. Conventional fast motion estimation algorithms have a serious problem of low prediction quality in some frames. However, full search based fast algorithms have low computational reduction ratio. In the paper, we propose an algorithm that significantly reduces unnecessary computations, while keeping prediction quality almost similar to that of the full search. The proposed algorithm uses distribution probability of motion vectors and adaptive search patterns and block matching criteria. By taking different search patterns and error criteria of block matching according to distribution probability of motion vectors, we can reduces only unnecessary computations efficiently. Our algorithm takes only 20~30% in computational amount and has decreased prediction quality about 0~0.02dB compared with the fast full search of the H.264 reference software. Our algorithm will be useful to real-time video coding applications using MPEG-2 or MPEG-4 AVC standards.
Research Interests:
CAS is positively necessary to streaming service such as IPTV and VOD, charging cable TV broadcasting channels, charging satellite broadcasting channels and so on . CAS system must show clean images to authorized users and have... more
CAS is positively necessary to streaming service such as IPTV and VOD, charging cable TV broadcasting channels, charging satellite broadcasting channels and so on . CAS system must show clean images to authorized users and have unauthorized users unable to enjoy the images normally. To make these environments, algorism that costs less additional expenses is needed, encryption is suggested as the method. In this paper, optional encryption of H.264 image was implemented for authorization system. Suggested method is to transcode the contents of various formats, convert into YUV format, compress it using H.264 codec and encrypt the particular part following needs. By the experiment, unauthorized users without encryption key cannot see the images properly, and that when make the intensity of encryption high, playing was possible but recognition of the images was not possible is recognizable. Also, encrypting the image of 300 frames took 71.3 seconds on the average, so being very fast is recognizable, too. Suggested contents are usable to the areas of user authorization and copyright protection in streaming service such as IPTV and VOD.
Research Interests: Computer Science, Cryptography, Encryption, IPTV, Computer Network, and 4 moreCAS, Transcoding, Authorisation, and Codec
As the diffusion rate of DMB (digital multimedia broadcasting) device increases, the protection of DMB contents copyright is gradually needed. In this paper, we implemented the real time encryption in the PMP (portable multimedia player)... more
As the diffusion rate of DMB (digital multimedia broadcasting) device increases, the protection of DMB contents copyright is gradually needed. In this paper, we implemented the real time encryption in the PMP (portable multimedia player) for the copyright protection. We propose that it encrypts stored contents using SEED algorithm when DMB contents are stored into the storage in the PMP. As experimental result, when we confirmed encryption in recorded contents in PMP, it did not replay in other devices. Also, when we confirmed encryption contents which stored by other devices, it did not replay in PMP. Proposed method was used in the fields of VOD or IPTV.
Research Interests:
In this paper, we propose an algorithm that reduces unnecessary computations, while keeping almost same prediction quality as that of the full search algorithm. In the proposed algorithm, we can reduce unnecessary computations efficiently... more
In this paper, we propose an algorithm that reduces unnecessary computations, while keeping almost same prediction quality as that of the full search algorithm. In the proposed algorithm, we can reduce unnecessary computations efficiently by calculating initial matching error point from first partial errors. To do that, we use tighter elimination condition as error criterion than the conventional PDE algorithm. Additionally, we use different search strategy compared with conventional spiral search pattern. By doing that, we can increase the probability that hits minimum error point as soon as possible. Our algorithm decreases the computational amount by about 50% of the conventional PDE algorithm without any degradation of prediction quality.
Research Interests:
Research Interests:
Research Interests:
Research Interests:
ABSTRACT To reduce an amount of computation of full search (FS) algorithm for fast motion estimation, we propose a new and fast matching algorithm without any degradation of predicted images like the conventional FS. The computational... more
ABSTRACT To reduce an amount of computation of full search (FS) algorithm for fast motion estimation, we propose a new and fast matching algorithm without any degradation of predicted images like the conventional FS. The computational reduction without any degradation in predicted image comes from fast kick-off of impossible motion vectors. The fast kick-off of improper motion vectors comes from sequential rejection with derived formula and subblock norms. The sequential rejection of impossible candidates is based on multiple decision boundaries. Our proposed algorithm reduces more the computations than the recent fast full search (FS) motion estimation algorithms.
Research Interests:
Research Interests:
We propose a new and fast multi-resolution motion estimation (MRME) algorithm using optimal matching units and scans for video coding, to significantly reduce the amount of computation in motion estimation. Our proposed algorithm has no... more
We propose a new and fast multi-resolution motion estimation (MRME) algorithm using optimal matching units and scans for video coding, to significantly reduce the amount of computation in motion estimation. Our proposed algorithm has no any degradation of prediction quality compared to the original MRME algorithm. The computational reduction of our algorithm comes from fast elimination of unlikely candidate vectors. We fast eliminate inappropriate motion vectors using gradient magnitude in image data. The experimental results show that our algorithm reduces the computational amount of just 98~95% compared to full search algorithm and 55~80% compared to the original MRME algorithm. Our algorithm will be useful to real-time video coding applications such as MPEG-2 and MPEG-4 AVC.
Research Interests:
In this paper, we propose a real-time video watermarking chip and system which is hardware based watermark embedding system of HD (high definition) video with STRATIX FPGA device from ALTERA. There was little visual artifact due to... more
In this paper, we propose a real-time video watermarking chip and system which is hardware based watermark embedding system of HD (high definition) video with STRATIX FPGA device from ALTERA. There was little visual artifact due to watermarking in subjective quality evaluation between the original video and the watermarked one. Embedded watermark was all extracted after a robustness test called
Research Interests:
In this paper, we implement hardware and software based watermark detection system for hardware based real-time video watermark embedder. We implement a watermark detector with STRATIX FPGA from ALTERA, PCI controller and Microsoft VC# by... more
In this paper, we implement hardware and software based watermark detection system for hardware based real-time video watermark embedder. We implement a watermark detector with STRATIX FPGA from ALTERA, PCI controller and Microsoft VC# by using Wiener filter and similarity technique for watermark detection. The performance of our implemented system is very good in term of visibility and robustness. Our
Research Interests:
Research Interests:
... J. N. Kim and et al ... to-top, left-to-right, and right-to-left [2]. Furthermore, they improved the computational reduction with sorted vectors in the order of image complexity of reference over the adaptive sequential matching scan... more
... J. N. Kim and et al ... to-top, left-to-right, and right-to-left [2]. Furthermore, they improved the computational reduction with sorted vectors in the order of image complexity of reference over the adaptive sequential matching scan [3]. The main concept of the algorithms is fast kick-off of ...
Research Interests:
Full search motion estimation in real-time video coding requires large amount of computations. Reducing computational cost for full search motion estimation is critical research issue for enabling fast real-time video coding such as... more
Full search motion estimation in real-time video coding requires large amount of computations. Reducing computational cost for full search motion estimation is critical research issue for enabling fast real-time video coding such as MPEG-4 advanced video coding. In this paper, we propose a fast partial distortion algorithm using normalized dithering matching scan to get uniform distribution of partial distortion. Our algorithm is based on normalized dithering order matching scan and calibration of threshold error using LOG value for each sub-block continuously for efficient elimination of unlike candidate blocks fast while keeping the same prediction quality compared with the full search algorithm. Our algorithm reduces about 65% of computations for block matching error compared with conventional PDE (partial distortion elimination) algorithm without any prediction quality.
Research Interests:
Research Interests:
Moving ship detection and tracking is the key technology in the intelligence coastal surveillance system. In this paper we present an adaptive and improved method to accurately detect and monitor ships within the area of interest. It is... more
Moving ship detection and tracking is the key technology in the intelligence coastal surveillance system. In this paper we present an adaptive and improved method to accurately detect and monitor ships within the area of interest. It is an advanced version of the previous works done regarding moving ship detection and tracking. The proposed tracking scheme is based on the characteristics of both sea and ship, which include: background information and local position of the ship. We used Morphological "open" operation and frame-subtraction method for background subtraction. The ships are located using the edge information along morphological "thicken", "dilate" and "bridge" operations. The experimental results demonstrate robust and real-time ship detection and tracking over thousands of image frames, and robustness against cluttered background. The detection rate achieved was 98.4%.
Research Interests:
This paper presents a method to accurately detect and monitor ships within the area of interest. It is an advanced version of the previous works done regarding moving ship detection and tracking. The proposed tracking scheme is based on... more
This paper presents a method to accurately detect and monitor ships within the area of interest. It is an advanced version of the previous works done regarding moving ship detection and tracking. The proposed tracking scheme is based on the characteristics of both sea and ship, which includes: background information and local position of the ship. Background subtraction and registration is achieved using morphological ‘Open’ operation and the ships are located using their edge information. The experimental results demonstrate robust and real-time ship detection and tracking with 98.7% detection rate. The proposed algorithm will be useful in coastal surveillance and monitoring applications.
Research Interests:
Image resolution enhancement is one of main techniques for image restoration and reconstruction, it aims at artifact removal and to minimize image quality degradation in result image. In this paper we propose an image resolution... more
Image resolution enhancement is one of main techniques for image restoration and reconstruction, it aims at artifact removal and to minimize image quality degradation in result image. In this paper we propose an image resolution improvement method by error estimation. In the proposed method, we can calculate error information by subsampling-interpolation processing of obtained low resolution image, estimate error for high resolution image from the calculated error. Lastly, we can generate the final high resolution image using estimated error information applied weight factor. By the experiments, we have known that the average PSNR is increased nearby 2.4dB than the conventional algorithms. Also subjective image quality is enhanced several areas such as edges, textures, and characters. The proposed algorithm may be useful for various applications such as image enhancement and enlargement.
Research Interests:
Watermarking and Encryption are commonly technique for data protection. DMB contents are utilized widely without protection procedure. To solve the problems, we propose real-time watermarking and encryption method for DMB contents... more
Watermarking and Encryption are commonly technique for data protection. DMB contents are utilized widely without protection procedure. To solve the problems, we propose real-time watermarking and encryption method for DMB contents protection in this paper. To implement watermarking, we hide key information on a redundant space of program association table (PAT) and program mapped table (PMT) of T-DMB stream and hidden parts is encrypted by a stream encryption cipher. We implements encryption method without additional information in digital multimedia broadcasting (DMB) contents using AES (advanced encryption standard) encryption algorithm. In experimental result, when we implemented a play control on PMP which have built-in DSP device to get 100Mhz processing speed, almost had not a time delay and the hiding information in T-DMB stream was possible to do a play control. Additionally, we confirmed that the saved contents in a PMP were not played in other devices without decryption key. The proposed methods can be useful in real-time applications requiring contents protection service such as video on demand, IPTV and digital TV.
Research Interests:
Shot change detection is the main technique in the video segmentation which is required real-time processing and automatical processing in hardware. In this paper, we propose the SCD model for real-time shot change detection in such as... more
Shot change detection is the main technique in the video segmentation which is required real-time processing and automatical processing in hardware. In this paper, we propose the SCD model for real-time shot change detection in such as PMPs and cellular phones. The real-time SCD model determines shot change detection by comparing the feature value of current frame and a mean feature value on variable reference block. Proposed method can be used independently from the feature value of frame, can set automatic threshold using a mean feature value on variable reference block. We obtained better detection ratio than the conventional methods maximally by precision 0.146, recall 0.083, F1 0.089 in the experiment with the same test sequence. Therefore, our proposing algorithm will be helpful in searching video data on portable media player such as PMPs and cellular phones.
Research Interests:
Image resolution enhancement techniques are required in various multimedia systems for image generation and processing. The main problem is an artifact such as blurring in image resolution enhancement techniques. Specially, cloud image... more
Image resolution enhancement techniques are required in various multimedia systems for image generation and processing. The main problem is an artifact such as blurring in image resolution enhancement techniques. Specially, cloud image have important information which need resolution enhancement technique without image quality degradation. To solve the problem, we propose error estimation and image resolution enhancement algorithm using low level interpolation. The proposed method consists of the following elements: error computation, error estimation, error application. Our experiments obtained the average PSNR 1.11dB which is improved results better than conventional algorithm. Also we can reduce more than 92% computation complexity. The proposed algorithm may be helpful for applications such as satellite image and cloud image.
Research Interests:
Research Interests:
Research Interests:
Full search motion estimation in real-time video coding requires large amount of computations. Reducing computational cost for full search motion estimation is critical research issue for enabling fast real-time video coding such as... more
Full search motion estimation in real-time video coding requires large amount of computations. Reducing computational cost for full search motion estimation is critical research issue for enabling fast real-time video coding such as MPEG-4 advanced video coding. In this paper, we propose a novel fast full search block matching algorithmwhich significantly reduces unnecessary computations without affecting motion prediction quality. The proposed algorithm identifies computational matching order from initial calculation of matching differences. According to the computational order identified, matching errors are calculated based on partial distortion elimination method. The proposed algorithm could reduce about 45% of computational cost for calculating block matching errors compared with the conventional algorithm without degrading any motion prediction quality. The proposed algorithm will be particularly useful for realizing fast real-time video coding applications, such as MPEG-4 advanced video coding, that require large amount of computations.
Research Interests: Mathematics, Computer Science, Computational Complexity Theory, Image Processing, Image Analysis, and 11 moreAlgorithm, Motion estimation, Image compression, Motion compensation, Computation, Search Algorithm, Image recognition, Real Time, Block Matching Algorithm, Information System, and Springer Ebooks
In this paper, we propose a fast motion estimation algorithm to reduce computational load of the FS (full search) algorithm. We reduce only unnecessary computations which doesn't affect predicted images from the motion vector. To do... more
In this paper, we propose a fast motion estimation algorithm to reduce computational load of the FS (full search) algorithm. We reduce only unnecessary computations which doesn't affect predicted images from the motion vector. To do that, we use normalized dithering matching scan to get uniform distribution of partial distortion by which we can reduce only unnecessary computation significantly. Additionally, we remove unlike candidate vectors faster by using multiply of LOG value to threshold of matching error. Additionally, we further reduce unnecessary computation for motion estimation according to distribution of motion vectors. Our algorithm reduces about 60% of computations for block matching error compared with the conventional PDE (partial distortion elimination) algorithm almost without degradation of prediction quality.
Research Interests:
At July 2008, the nationwide DMB (digital multimedia broadcasting) has got started. As DMB device's volume of sales has been over 12 million already, the development of rapidly changing network systems has increased the dangers of... more
At July 2008, the nationwide DMB (digital multimedia broadcasting) has got started. As DMB device's volume of sales has been over 12 million already, the development of rapidly changing network systems has increased the dangers of infringing the copyright of DMB contents. For solving this problem, we suggest that real-time encryption algorithm without additional expenses, and implemented that on PMP. We used the SEED algorithm for encryption. As the experimental result, we confirmed that the real-time encryption and decryption of DMB videos were working well. Also confirmed that recorded contents in PMP were not replayed in other devices, and also the contents recorded by other devices were not played in PMP. Suggested algorithms can be useful in the VOD, IPTV or cable TV.
Research Interests:
Abstract. Shot change detection is the main technique for automatic temporal segmentation of video. Until now, there were little research reports about real-time shot change detection for applying to hardware terminals with low... more
Abstract. Shot change detection is the main technique for automatic temporal segmentation of video. Until now, there were little research reports about real-time shot change detection for applying to hardware terminals with low per-formance such as PMPs (Portable ...
Research Interests:
Research Interests:
Research Interests:
This paper proposes an efficient video watermarking scheme using adaptive threshold and minimum modification of motion vectors. Our proposed algorithm guarantees the amount of embedded watermark data and minimizes modification of original... more
This paper proposes an efficient video watermarking scheme using adaptive threshold and minimum modification of motion vectors. Our proposed algorithm guarantees the amount of embedded watermark data and minimizes modification of original motion vectors to avoid degradation of video quality without reducing payloads. Besides, our algorithm can embed and retrieve watermark data without any increment of bit rate and original
Research Interests:
In this paper, we propose an improved RC6 encryption algorithm that have the same structure of encryption and decryption. So far, conventional RC6 algorithms have difference structure of encryption and decryption. We devise our algorithm... more
In this paper, we propose an improved RC6 encryption algorithm that have the same structure of encryption and decryption. So far, conventional RC6 algorithms have difference structure of encryption and decryption. We devise our algorithm by inserting a symmetric layer using simple rotation and XOR operations, in which the half of whole RC6 rounds uses encryption procedure and the rest