• Title/Summary/Keyword: Candidate Image

Search Result 576, Processing Time 0.031 seconds

Object-based Image Retrieval for Color Query Image Detection (컬러 질의 영상 검출을 위한 객체 기반 영상 검색)

  • Baek, Young-Hyun;Moon, Sung-Ryong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.3
    • /
    • pp.97-102
    • /
    • 2008
  • In this paper we propose an object-based image retrieval method using spatial color model and feature points registration method for an effective color query detection. The proposed method in other to overcome disadvantages of existing color histogram methods and then this method is use the HMMD model and rough set in order to segment and detect the wanted image parts as a real time without the user's manufacturing in the database image and query image. Here, we select candidate regions in the similarity between the query image and database image. And we use SIFT registration methods in the selected region for object retrieving. The experimental results show that the proposed method is more satisfactory detection radio than conventional method.

Shadow Detection Based Intensity and Cross Entropy for Effective Analysis of Satellite Image (위성 영상의 효과적인 분석을 위한 밝기와 크로스 엔트로피 기반의 그림자 검출)

  • Park, Ki-hong
    • Journal of Advanced Navigation Technology
    • /
    • v.20 no.4
    • /
    • pp.380-385
    • /
    • 2016
  • Shadows are common phenomena observed in natural scenes and often bring a major problem that is affected negatively in colour image analysis. It is important to detect the shadow areas and should be considered in the pre-processing of computer vision. In this paper, the method of shadow detection is proposed using cross entropy and intensity image, and is performed in single image based on the satellite images. After converting the color image to a gray level image, the shadow candidate region has been estimated the optimal threshold value by cross entropy, and then the final shadow region has been detected using intensity image. For the validity of the proposed method, the satellite images is used to experiment. Some experiments are conducted so as to verify the proposed method, and as a result, shadow detection is well performed.

Liver Segmentation and 3D Modeling from Abdominal CT Images

  • Tran, Hong Tai;Oh, A Ran;Na, In Seop;Kim, Soo Hyung
    • Smart Media Journal
    • /
    • v.5 no.1
    • /
    • pp.49-54
    • /
    • 2016
  • Medical image processing is a compulsory process to diagnose many kinds of disease. Therefore, an automatic algorithm for this task is highly demanded as an important part to construct a computer-aided diagnosis system. In this paper, we introduce an automatic method to segment the liver region from 3D abdominal CT images using Otsu method. First, we choose a 2D slice which has most liver information from the whole 3D image. Secondly, on the chosen slice, we enhanced the image based on its intensity using Otsu method with multiple thresholds and use the threshold to enhance the whole 3D image. Then, we apply a liver mask to mark the candidate liver region. After that, we execute the Otsu method again to segment the liver region from the chosen slice and propagate the result to the whole 3D image. Finally, we apply preprocessing on the frontal side of 3D images to crop only the liver region from the image.

Content-based Image Retrieval System (내용기반 영상검색 시스템)

  • Yoo, Hun-Woo;Jang, Dong-Sik;Jung, She-Hwan;Park, Jin-Hyung;Song, Kwang-Seop
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.26 no.4
    • /
    • pp.363-375
    • /
    • 2000
  • In this paper we propose a content-based image retrieval method that can search large image databases efficiently by color, texture, and shape content. Quantized RGB histograms and the dominant triple (hue, saturation, and value), which are extracted from quantized HSV joint histogram in the local image region, are used for representing global/local color information in the image. Entropy and maximum entry from co-occurrence matrices are used for texture information and edge angle histogram is used for representing shape information. Relevance feedback approach, which has coupled proposed features, is used for obtaining better retrieval accuracy. Simulation results illustrate the above method provides 77.5 percent precision rate without relevance feedback and increased precision rate using relevance feedback for overall queries. We also present a new indexing method that supports fast retrieval in large image databases. Tree structures constructed by k-means algorithm, along with the idea of triangle inequality, eliminate candidate images for similarity calculation between query image and each database image. We find that the proposed method reduces calculation up to average 92.9 percent of the images from direct comparison.

  • PDF

Updating Smartphone's Exterior Orientation Parameters by Image-based Localization Method Using Geo-tagged Image Datasets and 3D Point Cloud as References

  • Wang, Ying Hsuan;Hong, Seunghwan;Bae, Junsu;Choi, Yoonjo;Sohn, Hong-Gyoo
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.37 no.5
    • /
    • pp.331-341
    • /
    • 2019
  • With the popularity of sensor-rich environments, smartphones have become one of the major platforms for obtaining and sharing information. Since it is difficult to utilize GNSS (Global Navigation Satellite System) inside the area with many buildings, the localization of smartphone in this case is considered as a challenging task. To resolve problem of localization using smartphone a four step image-based localization method and procedure is proposed. To improve the localization accuracy of smartphone datasets, MMS (Mobile Mapping System) and Google Street View were utilized. In our approach first, the searching for candidate matching image is performed by the query image of smartphone's using GNSS observation. Second, the SURF (Speed-Up Robust Features) image matching between the smartphone image and reference dataset is done and the wrong matching points are eliminated. Third, the geometric transformation is performed using the matching points with 2D affine transformation. Finally, the smartphone location and attitude estimation are done by PnP (Perspective-n-Point) algorithm. The location of smartphone GNSS observation is improved from the original 10.204m to a mean error of 3.575m. The attitude estimation is lower than 25 degrees from the 92.4% of the adjsuted images with an average of 5.1973 degrees.

A Gender and The Beauty Showed in Politician's Facial Appearance as an Element of Winning in the Election Process (정치인의 외모에 나타난 선거승리의 요인으로써 아름다움(美)과 성(性))

  • Park, Sun-Young
    • Journal of Digital Convergence
    • /
    • v.14 no.2
    • /
    • pp.397-414
    • /
    • 2016
  • There will be coming soon a sequence of the so-called election season in Korea. That is the 20th session of general elections and the 19th presidential election which are taking place one after another. When we talk about presidential candidate, we may realize that the choice were relied upon candidate's facial appearance and speech, voice, dress, and so on. One poll showed that capacity and policy were ranked high and figure and image were ranked next by asking "what is the most important factor when you vote for the president?" This study looked into the candidate's face of a newly elected public office through the election voting. I studied how the factors of sex and beauty may affect on the election results. I analyse survey of candidate's photo on the election leaflets. Analyzed result said that candidate's competency and trust have strong relations in the voting choice rather than beauty even if it is statistically significant. I also find that both beauty and competency are positively interrelated.

Edge Detection using Cost Minimization Method (비용 최소화 방법을 이용한 모서리 감지)

  • Lee, Dong-Woo;Lee, Seong-Hoon
    • Journal of Internet of Things and Convergence
    • /
    • v.8 no.1
    • /
    • pp.59-64
    • /
    • 2022
  • Existing edge discovery techniques only found edges of defined shapes based on precise definitions of edges. Therefore, there are many limitations in finding edges for images of complex and diverse shapes that exist in the real world. A method for solving these problems and discovering various types of edges is a cost minimization method. In this method, the cost function and cost factor are defined and used. This cost function calculates the cost of the candidate edge model generated according to the candidate edge generation strategy. If a satisfactory result is obtained, the corresponding candidate edge model becomes the edge for the image. In this study, a new candidate edge generation strategy was proposed to discover edges for images of more diverse shapes in order to improve the disadvantage of only finding edges of a defined shape, which is a problem of the cost minimization method. In addition, the contents of improvement were confirmed through a simple simulation that reflected these points.

Image Segmentation Algorithm Based on Geometric Information of Circular Shape Object (원형객체의 기하학적 정보를 이용한 영상분할 알고리즘)

  • Eun, Sung-Jong;WhangBo, Taeg-Keun
    • Journal of Internet Computing and Services
    • /
    • v.10 no.6
    • /
    • pp.99-111
    • /
    • 2009
  • The result of Image segmentation, an indispensable process in image processing, significantly affects the analysis of an image. Despite the significance of image segmentation, it produces some problems when the variation of pixel values is large, or the boundary between background and an object is not clear. Also, these problems occur frequently when many objects in an image are placed very close by. In this paper, when the shape of objects in an image is circular, we proposed an algorithm which segment an each object in an image using the geometric characteristic of circular shape. The proposed algorithm is composed of 4 steps. First is the boundary edge extraction of whole object. Second step is to find the candidate points for further segmentation using the boundary edge in the first step. Calculating the representative circles using the candidate points is the third step. Final step is to draw the line connecting the overlapped points produced by the several erosions and dilations of the representative circles. To verify the efficiency of the proposed algorithm, the algorithm is compared with the three well-known cell segmentation algorithms. Comparison is conducted by the number of segmented region and the correctness of the inner segment line. As the result, the proposed algorithm is better than the well-known algorithms in both the number of segmented region and the correctness of the inner segment line by 16.7% and 21.8%, respectively.

  • PDF

Evaluation of the Geometric Accuracy of Anatomic Landmarks as Surrogates for Intrapulmonary Tumors in Image-guided Radiotherapy

  • Li, Hong-Sheng;Kong, Ling-Ling;Zhang, Jian;Li, Bao-Sheng;Chen, Jin-Hu;Zhu, Jian;Liu, Tong-Hai;Yin, Yong
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.13 no.5
    • /
    • pp.2393-2398
    • /
    • 2012
  • Objectives: The purpose of this study was to evaluate the geometric accuracy of thoracic anatomic landmarks as target surrogates of intrapulmonary tumors for manual rigid registration during image-guided radiotherapy (IGRT). Methods: Kilovolt cone-beam computed tomography (CBCT) images acquired during IGRT for 29 lung cancer patients with 33 tumors, including 16 central and 17 peripheral lesions, were analyzed. We selected the "vertebrae", "carina", and "large bronchi" as the candidate surrogates for central targets, and the "vertebrae", "carina", and "ribs" as the candidate surrogates for peripheral lesions. Three to six pairs of small identifiable markers were noted in the tumors for the planning CT and Day 1 CBCT. The accuracy of the candidate surrogates was evaluated by comparing the distances of the corresponding markers after manual rigid matching based on the "tumor" and a particular surrogate. Differences between the surrogates were assessed using 1-way analysis of variance and post hoc least-significant-difference tests. Results: For central targets, the residual errors increased in the following ascending order: "tumor", "bronchi", "carina", and "vertebrae"; there was a significant difference between "tumor" and "vertebrae" (p = 0.010). For peripheral diseases, the residual errors increased in the following ascending order: "tumor", "rib", "vertebrae", and "carina"; There was a significant difference between "tumor" and "carina" (p = 0.005). Conclusions: The "bronchi" and "carina" are the optimal surrogates for central lung targets, while "rib" and "vertebrae" are the optimal surrogates for peripheral lung targets for manual matching of online and planned tumors.

Fast Inter Mode Decision Algorithm Based on Macroblock Tracking in H.264/AVC Video

  • Kim, Byung-Gyu;Kim, Jong-Ho;Cho, Chang-Sik
    • ETRI Journal
    • /
    • v.29 no.6
    • /
    • pp.736-744
    • /
    • 2007
  • We propose a fast macroblock (MB) mode prediction and decision algorithm based on temporal correlation for P-slices in the H.264/AVC video standard. There are eight block types for temporal decorrelation, including SKIP mode based on rate-distortion (RD) optimization. This scheme gives rise to exhaustive computations (search) in the coding procedure. To overcome this problem, a thresholding method for fast inter mode decision using a MB tracking scheme to find the most correlated block and RD cost of the correlated block is suggested for early stop of the inter mode determination. We propose a two-step inter mode candidate selection method using statistical analysis. In the first step, a mode is selected based on the mode information of the co-located MB from the previous frame. Then, an adaptive thresholding scheme is applied using the RD cost of the most correlated MB. Secondly, additional candidate modes are considered to determine the best mode of the initial candidate modes that does not satisfy the designed thresholding rule. Comparative analysis shows that a speed-up factor of up to 70.59% is obtained when compared with the full mode search method with a negligible bit increment and a minimal loss of image quality.

  • PDF