• Title/Summary/Keyword: Candidate Image

Search Result 575, Processing Time 0.031 seconds

Content-Based Image Retrieval using Scale-Space Theory (Scale-Space 이론에 기초한 내용 기반 영상 검색)

  • 오정범;문영식
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.1
    • /
    • pp.150-150
    • /
    • 1999
  • In this paper, a content-based image retrieval scheme based on scale-space theory is proposed. The existing methods using scale-space theory consider all scales for image retrieval,thereby requiring a lot of computation. To overcome this problem, the proposed algorithm utilizes amodified histogram intersection method to select candidate images from database. The relative scalebetween a query image and a candidate image is calculated by the ratio of histograms. Feature pointsare extracted from the candidates using a corner detection algorithm. The feature vector for eachfeature point is composed of RGB color components and differential invariants. For computing thesimilarity between a query image and a candidate image, the euclidean distance measure is used. Theproposed image retrieval method has been applied to various images and the performance improvementover the existing methods has been verified.

Caption Extraction in News Video Sequence using Frequency Characteristic

  • Youglae Bae;Chun, Byung-Tae;Seyoon Jeong
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.835-838
    • /
    • 2000
  • Popular methods for extracting a text region in video images are in general based on analysis of a whole image such as merge and split method, and comparison of two frames. Thus, they take long computing time due to the use of a whole image. Therefore, this paper suggests the faster method of extracting a text region without processing a whole image. The proposed method uses line sampling methods, FFT and neural networks in order to extract texts in real time. In general, text areas are found in the higher frequency domain, thus, can be characterized using FFT The candidate text areas can be thus found by applying the higher frequency characteristics to neural network. Therefore, the final text area is extracted by verifying the candidate areas. Experimental results show a perfect candidate extraction rate and about 92% text extraction rate. The strength of the proposed algorithm is its simplicity, real-time processing by not processing the entire image, and fast skipping of the images that do not contain a text.

  • PDF

Smoke Detection Method of Color Image Using Object Block Ternary Pattern (물체 블록의 삼진 패턴을 이용한 컬러 영상의 연기 검출 방법)

  • Lee, Yong-Hun;Kim, Won-Ho
    • Journal of Satellite, Information and Communications
    • /
    • v.9 no.4
    • /
    • pp.1-6
    • /
    • 2014
  • Color image processing based on smoke detection is suitable detecting target to early detection of fire smoke. A method for detecting the smoke is processed in the pre-processing movement and color. And Next, characteristics of smoke such as diffusion, texture, shape, and directionality are used to post-processing. In this paper, propose the detection method of density distribution characteristic in characteristics of smoke. the generate a candidate regions by color thresholding image in Detecting the movement of smoke to the 10Frame interval and accumulated while 1second image. then check whether the pattern of the smoke by candidate regions to applying OBTP(Object Block Ternary Pattern). every processing is Block-based processing, moving detection is decided the candidate regions of the moving object by applying an adaptive threshold to frame difference image. The decided candidate region accumulates one second and apply the threshold condition of the smoke color. make the ternary pattern compare the center block value with block value of 16 position in each candidate region of the smoke, and determine the smoke by compare the candidate ternary pattern and smoke ternary pattern.

Real-Time Rotation-Invariant Face Detection Using Combined Depth Estimation and Ellipse Fitting

  • Kim, Daehee;Lee, Seungwon;Kim, Dongmin
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.1 no.2
    • /
    • pp.73-77
    • /
    • 2012
  • This paper reports a combined depth- and model-based face detection and tracking approach. The proposed algorithm consists of four functional modules; i) color-based candidate region extraction, ii) generation of the depth histogram for handling occlusion, iii) rotation-invariant face region detection using ellipse fitting, and iv) face tracking based on motion prediction. This technique solved the occlusion problem under complicated environment by detecting the face candidate region based on the depth-based histogram and skin colors. The angle of rotation was estimated by the ellipse fitting method in the detected candidate regions. The face region was finally determined by inversely rotating the candidate regions by the estimated angle using Haar-like features that were robustly trained robustly by the frontal face.

  • PDF

Post Processing to Reduce Wrong Matches in Stereo Matching

  • Park, Hee-Ju;Lee, Suk-Bae
    • Korean Journal of Geomatics
    • /
    • v.1 no.1
    • /
    • pp.43-49
    • /
    • 2001
  • Although many kinds of stereo matching method have been developed in the field of computer vision and photogrammetry, wrong matches are not easy to avoid. This paper presents a new method to reduce wrong matches after matching, and experimental results are reported. The main idea is to analyze the histogram of the image attribute differences between each pair of image patches matched. Typical image attributes of image patch are the mean and the standard deviation of gray value for each image patch, but there could be other kinds of image attributes. Another idea is to check relative position among potential matches. This paper proposes to use Gaussian blunder filter to detect the suspicious pair of candidate match in relative position among neighboring candidate matches. If the suspicious candidate matches in image attribute difference or relative position are suppressed, then many wrong matches are removed, but minimizing the suppression of good matches. The proposed method is easy to implement, and also has potential to be applied as post processing after image matching for many kinds of matching methods such as area based matching, feature matching, relaxation matching, dynamic programming, and multi-channel image matching. Results show that the proposed method produces fewer wrong matches than before.

  • PDF

Hyperspectral Image Recognition for Tumor Detection (하이퍼스펙트럴 영상 인식을 통한 종양 검출)

  • 김한열;김인택
    • Proceedings of the IEEK Conference
    • /
    • 2003.07d
    • /
    • pp.1545-1548
    • /
    • 2003
  • This paper presents a method for detecting skin tumors on chicken carcasses using hyperspectral images. It utilizes both fluorescence and reflectance image information in hyperspectral images. A detection system that is built on this concept can increase detection rate and reduce processing time. Chicken carcasses are examined first using band ratio FCM information of fluorescence image and it results in candidate regions for skin tumor. Next classifier selects the real tumor spots using PCA components information of reflectance image from the candidate regions.

  • PDF

Face Detection Using Color Information (색상 정보를 이용한 얼굴 영역 추출)

  • 장선아;유지상
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.6B
    • /
    • pp.1012-1020
    • /
    • 2000
  • In this paper, This paper presents a new algorithm which is used for detecting and extracting human masks from a color still image. The regions where each pixel has a value of skin-color were extracted from the Cb and Cr images, after the tone of the color image is converted to YCbCr from. A morphological filter is used to eliminate noise in the resulting image. By scanning it in horizontal and vertical ways under ways under threshold value, first candidate section is chosen. If it is not a face, secondary candidate section is taken and is divided into two candidate sections. The proposed algorithm is not affected by the variation of illuminations, because it uses only Cb and Cr components in YCbCr color format. Moreover, the face recognition was possible regardless of the degree of shifting face, changed shape, various sizes of the face, and the quality of image.

  • PDF

A motion estimation algorithm with low computational cost using low-resolution quantized image (저해상도 양자화된 이미지를 이용하여 연산량을 줄인 움직임 추정 기법)

  • 이성수;채수익
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.8
    • /
    • pp.81-95
    • /
    • 1996
  • In this paper, we propose a motio estiamtion algorithm using low-resolution quantization to reduce the computation of the full search algorithm. The proposed algorithm consists of the low-resolution search which determins the candidate motion vectors by comparing the low-resolution image and the full-resolution search which determines the motion vector by comparing the full-resolution image on the positions of the candidate motion vectors. The low-resolution image is generated by subtracting each pixel value in the reference block or the search window by the mean of the reference block, and by quantizing it is 2-bit resolution. The candidate motion vectors are determined by counting the number of pixels in the reference block whose quantized codes are unmatched to those in the search window. Simulation results show that the required computational cost of the proposed algorithm is reduced to 1/12 of the full search algorithm while its performance degradation is 0.03~0.12 dB.

  • PDF

A Method for Caption Segmentation using Minimum Spanning Tree

  • Chun, Byung-Tae;Kim, Kyuheon;Lee, Jae-Yeon
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.906-909
    • /
    • 2000
  • Conventional caption extraction methods use the difference between frames or color segmentation methods from the whole image. Because these methods depend heavily on heuristics, we should have a priori knowledge of the captions to be extracted. Also they are difficult to implement. In this paper, we propose a method that uses little heuristics and simplified algorithm. We use topographical features of characters to extract the character points and use KMST(Kruskal minimum spanning tree) to extract the candidate regions for captions. Character regions are determined by testing several conditions and verifying those candidate regions. Experimental results show that the candidate region extraction rate is 100%, and the character region extraction rate is 98.2%. And then we can see the results that caption area in complex images is well extracted.

  • PDF

A Robust Face Detection Method Based on Skin Color and Edges

  • Ghimire, Deepak;Lee, Joonwhoan
    • Journal of Information Processing Systems
    • /
    • v.9 no.1
    • /
    • pp.141-156
    • /
    • 2013
  • In this paper we propose a method to detect human faces in color images. Many existing systems use a window-based classifier that scans the entire image for the presence of the human face and such systems suffers from scale variation, pose variation, illumination changes, etc. Here, we propose a lighting insensitive face detection method based upon the edge and skin tone information of the input color image. First, image enhancement is performed, especially if the image is acquired from an unconstrained illumination condition. Next, skin segmentation in YCbCr and RGB space is conducted. The result of skin segmentation is refined using the skin tone percentage index method. The edges of the input image are combined with the skin tone image to separate all non-face regions from candidate faces. Candidate verification using primitive shape features of the face is applied to decide which of the candidate regions corresponds to a face. The advantage of the proposed method is that it can detect faces that are of different sizes, in different poses, and that are making different expressions under unconstrained illumination conditions.