• Title/Summary/Keyword: 물체 윤곽정보

Search Result 85, Processing Time 0.04 seconds

Multiple Texture Image Recognition with Unsupervised Block-based Clustering (비교사 블록-기반 군집에 의한 다중 텍스쳐 영상 인식)

  • Lee, Woo-Beom;Kim, Wook-Hyun
    • The KIPS Transactions:PartB
    • /
    • v.9B no.3
    • /
    • pp.327-336
    • /
    • 2002
  • Texture analysis is an important technique in many image understanding areas, such as perception of surface, object, shape and depth. But the previous works are intend to the issue of only texture segment, that is not capable of acquiring recognition information. No unsupervised method is basased on the recognition of texture in image. we propose a novel approach for efficient texture image analysis that uses unsupervised learning schemes for the texture recognition. The self-organization neural network for multiple texture image identification is based on block-based clustering and merging. The texture features used are the angle and magnitude in orientation-field that might be different from the sample textures. In order to show the performance of the proposed system, After we have attempted to build a various texture images. The final segmentation is achieved by using efficient edge detection algorithm applying to block-based dilation. The experimental results show that the performance of the system Is very successful.

Improvement of Disparity Map using Loopy Belief Propagation based on Color and Edge (Disparity 보정을 위한 컬러와 윤곽선 기반 루피 신뢰도 전파 기법)

  • Kim, Eun Kyeong;Cho, Hyunhak;Lee, Hansoo;Wibowo, Suryo Adhi;Kim, Sungshin
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.25 no.5
    • /
    • pp.502-508
    • /
    • 2015
  • Stereo images have an advantage of calculating depth(distance) values which can not analyze from 2-D images. However, depth information obtained by stereo images has due to following reasons: it can be obtained by computation process; mismatching occurs when stereo matching is processing in occlusion which has an effect on accuracy of calculating depth information. Also, if global method is used for stereo matching, it needs a lot of computation. Therefore, this paper proposes the method obtaining disparity map which can reduce computation time and has higher accuracy than established method. Edge extraction which is image segmentation based on feature is used for improving accuracy and reducing computation time. Color K-Means method which is image segmentation based on color estimates correlation of objects in an image. And it extracts region of interest for applying Loopy Belief Propagation(LBP). For this, disparity map can be compensated by considering correlation of objects in the image. And it can reduce computation time because of calculating region of interest not all pixels. As a result, disparity map has more accurate and the proposed method reduces computation time.

Real-time Disparity Acquisition Algorithm from Stereoscopic Image and its Hardware Implementation (스테레오 영상으로부터의 실시간 변이정보 획득 알고리듬 및 하드웨어 구현)

  • Shin, Wan-Soo;Choi, Hyun-Jun;Seo, Young-Ho;Kim, Dong-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.11C
    • /
    • pp.1029-1039
    • /
    • 2009
  • In this paper, the existing disparity aquisition algorithms were analyzed, on the bases of which a disparity generation technique that is superior in accuracy to the generation time was proposed. Basically it uses a pixel-by-pixel motion estimation technique. It has a merit of possibility of a high-speed operation. But the motion estimation technique has a disadvantage of lower accuracy because it depends on the similarity of the matching window regardless of the distribution characteristics of the texture in an image. Therefore, an enhanced technique to increase the accuracy of the disparity is required. This paper introduced a variable-sized window matching technique for this requirement. By the proposed technique, high accuracies could be obtained at the homogeneous regions and the object edges. A hardware to generate disparity image was designed, which was optimized to the processing speed so that a high throughput is possible. The hardware was designed by Verilog-HDL and synthesized using Hynix $0.35{\mu}m$ CMOS cell library. The designed hardware was operated stably at 120MHz using Cadence NC-VerilogTM and could process 15 frames per second at this clock frequency.

A Object-Based Image Retrieval Using Feature Analysis and Fractal Dimension (특징 분석과 프랙탈 차원을 이용한 객체 기반 영상검색)

  • 이정봉;박장춘
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.2
    • /
    • pp.173-186
    • /
    • 2004
  • This paper proposed the content-based retrieval system as a method for performing image retrieval through the effective feature extraction of the object of significant meaning based on the characteristics of man's visual system. To allow the object region of interest to be primarily detected, the region, being comparatively large size, greatly different from the background color and located in the middle of the image, was judged as the major object with a meaning. To get the original features of the image, the cumulative sum of tile declination difference vector the segment of the object contour had and the signature of the bipartite object were extracted and used in the form of being applied to the rotation of the object and the change of the size after partition of the total length of the object contour of the image into the normalized segment. Starting with this form feature, it was possible to make a retrieval robust to any change in translation, rotation and scaling by combining information on the texture sample, color and eccentricity and measuring the degree of similarity. It responded less sensitively to the phenomenon of distortion of the object feature due to the partial change or damage of the region. Also, the method of imposing a different weight of similarity on the image feature based on the relationship of complexity between measured objects using the fractal dimension by the Boxing-Counting Dimension minimized the wrong retrieval and showed more efficient retrieval rate.

  • PDF

Multi-spectral Flash Imaging using Region-based Weight Map (영역기반 가중치 맵을 이용한 멀티스팩트럼 플래시 영상 획득)

  • Choi, Bong-Seok;Kim, Dae-Chul;Lee, Cheol-Hee;Ha, Yeong-Ho
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.9
    • /
    • pp.127-135
    • /
    • 2013
  • In order to acquire images in low-light environments, it is usually necessary to adopt long exposure times or resort to flash lights. However, flashes often induce color distortion, cause the red-eye effect and can be disturbing to subjects. On the other hand, long-exposure shots are susceptible to subject-motion, as well as motion-blur due to camera shake when performed hand-held. A recently introduced technique to overcome the limitations of traditional low-light photography is that of multi-spectral flash. Multi-spectral flash images are a combination of UV/IR and visible spectrum information. The general idea is that of retrieving details from the UV/IR spectrum and color from the visible spectrum. However, multi-spectral flash images themselves are subject to color distortion and noise. This works presents a method to compute multi-spectral flash images so that noise can be reduced and color accuracy improved. The proposed approach is a previously seen optimization method, improved by the introduction of a weight map used to discriminate uniform regions from detail regions. The weight map is generated by applying canny edge operator and it is applied to the optimization process for discriminating the weights in uniform region and edge. Accordingly, the weight of color information is increased in the uniform region and the detail region of weight is decreased in detail region. Therefore, the proposed method can be enhancing color reproduction and removing artifacts. The performance of the proposed method has been objectively evaluated using long-exposure shots as reference.