• Title/Summary/Keyword: ROI Mask

Search Result 22, Processing Time 0.024 seconds

An Eefficient ROI Code Block Discrimination Algorithm for Dynamic ROI Coding (동적 관심영역 코딩을 위한 효율적인 관심영역 코드블록 판별 알고리듬)

  • Kang, Ki-Jun;Ahn, Byeong-Tae
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.1
    • /
    • pp.13-22
    • /
    • 2008
  • This paper proposes an efficient ROI code block discrimination algorithm for dynamic ROI coding. The proposed algorithm calculates the girth of the ROI only with some mask information in consideration of the characteristics of the shape of the ROI for reducing a ROI code block discrimination time, and this proposed algorithm discriminates whether there is a ROI code block by the girth and the critical value of the ROI. Also, this discrimination algorithm is capable of treating the coefficients of the background within a ROI code block preferentially and controlling a loss by controlling the threshold value of the ROI. In order to demonstrate the utility of the proposed method, this paper conducted a comparative experiment of the proposed method with the existing methods. As a result of this experiment, it was confirmed that the proposed method was superior to the conventional methods in terms of quality and speed.

  • PDF

A Fine Dust Measurement Technique using K-means and Sobel-mask Edge Detection Method (K-means와 Sobel-mask 윤곽선 검출 기법을 이용한 미세먼지 측정 방법)

  • Lee, Won-Hyeung;Seo, Ju-Wan;Kim, Ki-Yeon;Lin, Chi-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.2
    • /
    • pp.97-101
    • /
    • 2022
  • In this paper, we propose a method of measuring Fine dust in images using K-means and Sobel-mask based edge detection techniques using CCTV. The proposed algorithm collects images using a CCTV camera and designates an image range through a region of interest. When clustering is completed by applying the K-means algorithm, outline is detected through Sobel-mask, edge strength is measured, and the concentration of fine dust is determined based on the measured data. The proposed method extracts the contour of the mountain range using the characteristics of Sobel-mask, which has an advantage in diagonal measurement, and shows the difference in detection according to the concentration of fine dust as an experimental result.

Virtual core point detection and ROI extraction for finger vein recognition (지정맥 인식을 위한 가상 코어점 검출 및 ROI 추출)

  • Lee, Ju-Won;Lee, Byeong-Ro
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.10 no.3
    • /
    • pp.249-255
    • /
    • 2017
  • The finger vein recognition technology is a method to acquire a finger vein image by illuminating infrared light to the finger and to authenticate a person through processes such as feature extraction and matching. In order to recognize a finger vein, a 2D mask-based two-dimensional convolution method can be used to detect a finger edge but it takes too much computation time when it is applied to a low cost micro-processor or micro-controller. To solve this problem and improve the recognition rate, this study proposed an extraction method for the region of interest based on virtual core points and moving average filtering based on the threshold and absolute value of difference between pixels without using 2D convolution and 2D masks. To evaluate the performance of the proposed method, 600 finger vein images were used to compare the edge extraction speed and accuracy of ROI extraction between the proposed method and existing methods. The comparison result showed that a processing speed of the proposed method was at least twice faster than those of the existing methods and the accuracy of ROI extraction was 6% higher than those of the existing methods. From the results, the proposed method is expected to have high processing speed and high recognition rate when it is applied to inexpensive microprocessors.

Automatic Extraction and Coding of Multi-ROI (다중 관심영역의 자동 추출 및 부호화 방법)

  • Seo, Yeong-Geon;Hong, Do-Soon;Park, Jae-Heung
    • Journal of Digital Contents Society
    • /
    • v.12 no.1
    • /
    • pp.1-9
    • /
    • 2011
  • JPEG2000 offers the technique which compresses the interested regions with higher quality than the background. It is called by an ROI(Region-of-Interest) coding method. In this paper, we use images including the human faces, which are processed uppermost and compressed with high quality. The proposed method consists of 2 steps. The first step extracts some faces and the second one is ROI coding. To extract the faces, the method cuts or scale-downs some regions with $20{\times}20$ window pixels for all the pixels of the image, and after preprocessing, recognizes the faces using neural networks. Each extracted region is identified by ROI mask and then ROI-coded using Maxshift method. After then, the image is compressed and saved using EBCOT. The existing methods searched the ROI by edge distributions. On the contrary, the proposed method uses human intellect. And the experiment shows that the method is sufficiently useful with images having several human faces.

A Technique Getting Fast Masks Using Rough Division in Dynamic ROI Coding of JPEG2000 (JPEG2000의 동적 ROI 코딩에서 개략적인 분할을 이용한 빠른 마스크 생성 기법)

  • Park, Jae-Heung;Lee, Jum-Sook;Seo, Yeong-Geon;Hong, Do-Soon;Kim, Hyun-Joo
    • The KIPS Transactions:PartB
    • /
    • v.17B no.6
    • /
    • pp.421-428
    • /
    • 2010
  • It takes a long time for the users to view a whole image from the image server under the low-bandwidth internet environments or in case of a big sized image. In this case, as there needs a technique that preferentially transfers a part of image, JPEG2000 offers a ROI(Region-of-Interest) coding. In ROI coding, the users see the thumbnail of image from the server and specifies some regions that they want to see first. And then if an information about the regions are informed to the server, the server preferentially transfers the regions of the image. The existing methods requested a huge time to compute the mask information, but this thesis approximately computes the regions and reduces the creating time of the ROI masks. If each code block is a mixed block which ROI and background are mixed, the proper boundary points should be acquired. Searching the edges of the block, getting the two points on the edge, to get the boundary point inside the code block, the method searches a mid point between the two edge points. The proposed method doesn't have a big difference compared to the existing methods in quality, but the processing time is more speedy than the ones.

Design and Implementation of Region Of Interest Coding using Mask (마스크 방식의 관심 영역 부호 설계와 구현)

  • 이제명;이호석;흥성수;김수희
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10b
    • /
    • pp.634-636
    • /
    • 2003
  • 본 논문은 마스크 방식의 관심 영역(ROI, Region Of Interest) 부호 설계와 구현에 대하여 제시한다. 관심 영역에 대한 정지 영상 압축 알고리즘은 웨이블릿 변환과 사용자가 지정한 관심 영역을 결합하여 설계하였다. 즉, 사용자가 지정한 관심 영역을 이용하여 관심 영역 마스크를 생성한다. 양자화 과정에서 웨이블릿 계수들을 각 레벨과 서브밴드로 구분하고 생성된 관심 영역 마스크 정보를 이용하여 양자화 과정을 처리하여 부호화한다. 관심 영역에 대하여서는 높은 영상 품질과 그리고 전체 영상에 대하여서는 높은 압축을 동시에 실현시킬 수 있는 마스크 방식의 관심 영역 부호화 알고리즘을 설계하고 구현하였다.

  • PDF

Fast Lane Departure Warning System Based on Sub-Block Lane Detection (서브 블록 차선 검출에 기반을 둔 고속 차선이탈 경보 시스템)

  • Kim, Hye-Jin;Lee, Dong-Hee;Park, Kyeong-Won;Kang, Dong-Wook
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2011.11a
    • /
    • pp.273-275
    • /
    • 2011
  • 본 논문에서는 허프변환 및 HSV 색변환을 이용한 효율적인 차선검출의 최적화 알고리즘을 제안한다. 차선 검출의 고속화를 위해 차선과 카메라의 위치를 감안하여 고정된 관심영역(ROI_LB)을 정하고 검출 영역을 감소시킨다. 정해진 관심영역 내에서 허프변환을 적용해 차선을 검출하고 이를 위해 Sobel Mask와 Threshold를 사용한다. 또한, HSV 색 공간을 이용하여 황색 선과 백색 선을 구별해내며 차선 이동 시에 "MOVEMENT"이라는 문자열을, 중앙선을 넘어가면 "DANGEROUS"이라는 문자열을 출력한다. 제안하는 방법의 실험 결과는 복잡한 도로 동영상에서 효과적으로 차선을 인식하고 색 구별을 하였으며 제안 방법의 유효성을 검증하기 위해 다양한 실제 차선 패턴을 대상으로 한 실험결과를 제시한다.

  • PDF

Robust ROI Watermarking Scheme Based on Visual Cryptography: Application on Mammograms

  • Benyoussef, Meryem;Mabtoul, Samira;El Marraki, Mohamed;Aboutajdine, Driss
    • Journal of Information Processing Systems
    • /
    • v.11 no.4
    • /
    • pp.495-508
    • /
    • 2015
  • In this paper, a novel robust medical images watermarking scheme is proposed. In traditional methods, the added watermark may alter the host medical image in an irreversible manner and may mask subtle details. Consequently, we propose a method for medical image copyright protection that may remedy this problem by embedding the watermark without modifying the original host image. The proposed method is based on the visual cryptography concept and the dominant blocks of wavelet coefficients. The logic in using the blocks dominants map is that local features, such as contours or edges, are unique to each image. The experimental results show that the proposed method can withstand several image processing attacks such as cropping, filtering, compression, etc.

Improved Sliding Shapes for Instance Segmentation of Amodal 3D Object

  • Lin, Jinhua;Yao, Yu;Wang, Yanjie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.11
    • /
    • pp.5555-5567
    • /
    • 2018
  • State-of-art instance segmentation networks are successful at generating 2D segmentation mask for region proposals with highest classification score, yet 3D object segmentation task is limited to geocentric embedding or detector of Sliding Shapes. To this end, we propose an amodal 3D instance segmentation network called A3IS-CNN, which extends the detector of Deep Sliding Shapes to amodal 3D instance segmentation by adding a new branch of 3D ConvNet called A3IS-branch. The A3IS-branch which takes 3D amodal ROI as input and 3D semantic instances as output is a fully convolution network(FCN) sharing convolutional layers with existing 3d RPN which takes 3D scene as input and 3D amodal proposals as output. For two branches share computation with each other, our 3D instance segmentation network adds only a small overhead of 0.25 fps to Deep Sliding Shapes, trading off accurate detection and point-to-point segmentation of instances. Experiments show that our 3D instance segmentation network achieves at least 10% to 50% improvement over the state-of-art network in running time, and outperforms the state-of-art 3D detectors by at least 16.1 AP.

Development of an Image Processing Algorithm for Paprika Recognition and Coordinate Information Acquisition using Stereo Vision (스테레오 영상을 이용한 파프리카 인식 및 좌표 정보 획득 영상처리 알고리즘 개발)

  • Hwa, Ji-Ho;Song, Eui-Han;Lee, Min-Young;Lee, Bong-Ki;Lee, Dae-Weon
    • Journal of Bio-Environment Control
    • /
    • v.24 no.3
    • /
    • pp.210-216
    • /
    • 2015
  • Purpose of this study was a development of an image processing algorithm to recognize paprika and acquire it's 3D coordinates from stereo images to precisely control an end-effector of a paprika auto harvester. First, H and S threshold was set using HSI histogram analyze for extracting ROI(region of interest) from raw paprika cultivation images. Next, fundamental matrix of a stereo camera system was calculated to process matching between extracted ROI of corresponding images. Epipolar lines were acquired using F matrix, and $11{\times}11$ mask was used to compare pixels on the line. Distance between extracted corresponding points were calibrated using 3D coordinates of a calibration board. Non linear regression analyze was used to prove relation between each pixel disparity of corresponding points and depth(Z). Finally, the program could calculate horizontal(X), vertical(Y) directional coordinates using stereo camera's geometry. Horizontal directional coordinate's average error was 5.3mm, vertical was 18.8mm, depth was 5.4mm. Most of the error was occurred at 400~450mm of depth and distorted regions of image.