In past several years many image contents are distributed via internet. But illegal copy problem are rise up. Multimedia fingerprint techniques are tools for resist illegal copy. However today collusion attack such as average attack is appeared. Collusion attack is efficient method for breaking copyright protection scheme of image fingerprint. This paper presented an image fingerprint scheme to resistant collusion attack which is average attack especially. Proposed image fingerprint scheme is applied seam carving technique. Experimental results show that proposed image fingerprint scheme was good performance.

The opportunity of process the image increases, the research on generating the image like the painting became on important in recent years. Generally individual image blog shape contents open to the public chance is increase. In the painting, the drawing in ink and wash has the feature with a framing of the outline of the Iras key of G and an especially light color.Generally, it is a technique for coloring in the watercolor with a high transparency after it sketches with the pencil etc. and the brush. The outline of the image is extracted to reproduce this technique, and the stroke of the brush is reproduced. Coloring segments the area according to the inclination, and smoothes the inside.

When noise data is included, the clustering method based on code vectors considering attractive and repulsive force can not precisely classify data. In this paper, we propose the clustering method based on code vectors considering attractive and repulsive force which can precisely classify data even when noise data is included.

For the estimation of block-motion vectors, common techniques use uniform pixel-decimation patterns to select pixels to evaluate block-matching criterion, while other techniques use adaptive pixel patterns and have achieved better efficiency. However, these adaptive techniques still require an initial division of a block into a set of uniform regions, and therefore, are locally adaptive in essence. Our proposed scheme, which does not fix any regions at the beginning and selects pixels only when they have the features important in determining a match, shows an improvement in performance over the existing adaptive schemes. Our results suggest the usefulness of this method in block-motion estimation for low-bit-rate video coding, particularly in video phone and video conferencing.

Block-matching algorithms, such as TSS and DSWA/IS, are widely used for motion estimation in low-bit-rate video coding. The assumption behind these algorithms is that when the matching block moves away from the optimal block, the difference between them increases monotonically. Unfortunately, this assumption is often invalid, and therefore leads to a high possibility for the result to be trapped to local minima. In this research, we propose a new multiple-candidate search scheme, Hilbert scanning search algorithm (HSSA), in which the assumption of global monotonicity is not necessary and the local monotonicity can be effectively explored with binary search around each candidate. In HSSA, the number of initial candidates and a threshold to control the selection of candidates from one stage to the next can be adjusted to meet the required search accuracy and/or speed. With properly chosen parameters, the HSSA converges to their optimal results faster and with better accuracy than the conventional block-matching algorithms.

The paper proposes a system for recognizing numeric strings from topographical maps, which is composed of an automatic recognition stage and an interactive recognition stage. In this method, uncertain numeric strings extracted through the automatic recognition stage based on topographical map features only are confirmed and corrected by the interactive recognition stage. Therefore one can obtain highly precise recognition results. The method was applied to numeric string recognition from a map image which includes 102 strings made up of 249 numerals. As a result, 95.1% of 102 numeric strings were correctly recognized.

The paper proposes a method for extracting slant characters from complicated background figures efficiently and rapidly. In this method, slant character candidates are extracted using the black pixel density features, that is, matching rate of two different sized circular templates, which are inscribing and circumscribing a target character, with an original image. In order to estimate performance of the proposed method, the method was applied to 41 topographic map images (512/spl times/512 pixels) involving 1032 slant characters. As a result, the average number of character candidates per character was reduced to about 41 candidates, and 94.3% of 1032 slant characters were extracted correctly.

It is difficult to recognize character strings from maps, which involve various figures. The authors describe a method for recognizing character strings from these topographical maps. The method consists of a bottom-up process and a top-down process. First, in the bottom-up process, character candidates are extracted from a map. Second, in the top-down process, these character candidates are grouped into strings using linguistic knowledge of strings. Through the top-down process, character strings are recognized correctly and efficiently from low precise character candidates extracted through the bottom-up process. The method was applied to 13 maps (512/spl times/512 pixels) involving 98 strings. As a result, 95% of 98 strings were extracted correctly.>

This paper describes custom designed VLSI coder and decoder, which transmit time division multiplexed (TDM) color signals at 32 Mbit/sec. Two-dimensional intraframe DPCM prediction, variable word length coding, and data buffer to smooth the data rate are devised on one coder chip. Reverse function are devised on one decoder chip. Test sequence is investigated for logic design purposes. Several techniques, e.g., double phased clock and prediction loop modification are employed to simplify the configuration and to ensure the operation rate of video processing.

Various interframe coding methods have been devised to reduce the cost of television signal transmission. Some degradation still remains, however, because prediction efficiency is lowered in uncovered background areas which appear behind moving objects. This paper proposes an uncovered background predictive coding algorithm, which increases prediction efficiency. Prediction efficiency is evaluated by using a simple signal model and real television signals. Experimental results show that the information generation rate is reduced to 78 percent as compared to that of previous frame predictive coding when the displacement is 10 pels/frame.

This paper describes the interframe coding system (TRIDEC 1.5) used for NTSC color television signal transmission at a 1.5 Mbit/s rate. TRIDEC 1.5 is developed with the intention of making video teleconferencing service more economical. The system utilizes the following highly efficient coding techniques: 1) interframe combinational difference coding 2) temporal subsample coding 3) noise reduction 4) demand refreshing to protect against channel errors, which makes periodic forced refreshing unnecessary. In addition, new coding parameter control methods have been devised to prevent buffer memory overflow. The subjective evaluation test results make it clear that the encoded picture quality is good enough for teleconferencing use.

An interframe coding system is described which is capable of transmitting both 4-MHz videotelephone signals and NTSC color TV signals at an average rate of 6.312 Mbits/s. The coding system takes as much advantage as possible of in-frame correlation, in addition to interframe correlation, by coding pel-to-pel difference of interframe difference (combinational difference). Variable-length word coding is effectively used to reduce the number of bits to be transmitted. In order to prevent buffer overflow, luminance and spatial resolutions are controlled. To control luminance resolution, interframe difference is multiplied by a coefficient\alpha \leq 1, so that value approaches zero when violent motion causes the buffer to fill. Though multiplication with small α results in temporal resolution reduction in moving areas, quality degradation is not too marked. Spatial resolution control is achieved by using subsample and subline coding modes.