• 제목/요약/키워드: retrieval time

Search Result 841, Processing Time 0.027 seconds

Region-Based Image Retrieval System using Spatial Location Information as Weights for Relevance Feedback (공간 위치 정보를 적합성 피드백을 위한 가중치로 사용하는 영역 기반 이미지 검색 시스템)

  • Song Jae-Won;Kim Deok-Hwan;Lee Ju-Hong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.4 s.42
    • /
    • pp.1-7
    • /
    • 2006
  • Recently, studies of relevance feedback to increase the performance of image retrieval has been activated. In this Paper a new region weighting method in region based image retrieval with relevance feedback is proposed to reduce the semantic gap between the low level feature representation and the high level concept in a given query image. The new weighting method determines the importance of regions according to the spatial locations of regions in an image. Experimental results demonstrate that the retrieval quality of our method is about 18% in recall better than that of area percentage approach. and about 11% in recall better than that of region frequency weighted by inverse image frequency approach and the retrieval time of our method is a tenth of that of region frequency approach.

  • PDF

A Bitmap-based Continuous Block Allocation Scheme for Realtime Retrieval Service (실시간 재생 서비스를 위한 비트맵 방식의 연속 블록 할당 기법)

  • 박기현
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.3
    • /
    • pp.316-322
    • /
    • 2002
  • In this paper we consider continuous block allocation scheme of UNIX file system to support real time retrieval service. The proposed block allocation scheme is designed to place real time data at appropriate disk block location in considering the consume-rate that is given with real time data. To effectively determine the disk block location we analyze the relationship between consume-rate and the two variable factors that are the number of continuous blocks and the cylinder distance of logically consecutive data. In traditional UNIX block allocation scheme it is in fact impossible to find continuous free disk blocks in a specific cylinder location. Thus we propose new bitmap-based free block allocation scheme that enables to determine whether a block in specific cylinder location is free state, or not.

  • PDF

Comparison of Endoscopic Removal of Disk Batteries in Children (디스크 전지를 삼킨 소아에서 내시경적 이물 제거술의 비교)

  • Kim, Jung-Ok;Hong, Eun-Hui;Choe, Byung-Ho;Cho, Min-Hyun;Seo, Hye-Eun;Lim, Hae-Ri;Chu, Mi-Ae;Hwang, Su-Kyeong;Park, Sun-Min;Hong, Suk-Jin;Shim, Ye-Jee;Choi, Byung-Ho
    • Pediatric Gastroenterology, Hepatology & Nutrition
    • /
    • v.10 no.2
    • /
    • pp.147-156
    • /
    • 2007
  • Purpose: Any battery impacted in the esophagus must be removed urgently because of the possibility of serious complications such as perforation, fistula, and mediastinitis. The use of endoscopic procedures was compared to find the most rapid, effective, and safe method to remove disk batteries. Methods: The cases of 24 children (9 males, mean age, 1.5 years) that had accidentally ingested disk batteries were reviewed. The patients had visited the Department of Pediatrics, Kyungpook National University Hospital from July 1997 to June 2007 for the removal of disk batteries. Endoscopic removal was attempted using a retrieval net or a magnetic extractor with a balloon (condom). The procedure times for removing the ingested battery were compared. Results: Children that ingested batteries with a larger diameter (20 mm) had a greater chance to have esophageal impaction with serious injury, such as esophageal mucosal necrosis or ulcers, as compared to the ingestion of smaller diameter batteries (10 mm) (p<0.01). Endoscopic removal of disk batteries was attempted either using a retrieval net in 10 children or by using a magnetic extractor with a balloon in 6 children. Endoscopic removal using a retrieval net was more effective (mean procedure time: 1.5 min) as compared to using a magnetic extractor with a balloon (mean procedure time: 3.3 min) (p<0.05). Conclusion: Both procedures, either using a retrieval net or a magnetic extractor with a balloon were effective in removing ingested disk batteries. Based on our experience, an endoscopic procedure using a retrieval net was a more effective method for foreign body removal.

  • PDF

Efficient Similarity Search in Time Series Databases Based on the Minimum Distance (최단거리에 기반한 시계열 데이타의 효율적인 유사 검색)

  • 이상준;권동섭;이석호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04a
    • /
    • pp.533-535
    • /
    • 2003
  • The Euclidean distance is sensitive to the absolute offsets of time sequences, so it is not a suitable similarity measure in terms of shape. In this paper. we propose an indexing scheme for efficient matching and retrieval of time sequences based on the minimum distance. The minimum distance can give a better estimation of similarity in shape between two time sequences. Our indexing scheme can match time sequences of similar shapes irrespective of their vortical positions and guarantees no false dismissals

  • PDF

Development of Land Surface Temperature Retrieval Algorithm from the MTSAT-2 Data

  • Kim, Ji-Hyun;Suh, Myoung-Seok
    • Korean Journal of Remote Sensing
    • /
    • v.27 no.6
    • /
    • pp.653-662
    • /
    • 2011
  • Land surface temperature (LST) is a one of the key variables of land surface which can be estimated from geostationary meteorological satellite. In this study, we have developed the three sets of LST retrieval algorithm from MTSAT-2 data through the radiative transfer simulations under various atmospheric profiles (TIGR data), satellite zenith angle, spectral emissivity, and surface lapse rate conditions using MODTRAN 4. The three LST algorithms are daytime, nighttime and total LST algorithms. The weighting method based on the solar zenith angle is developed for the consistent retrieval of LST at the early morning and evening time. The spectral emissivity of two thermal infrared channels is estimated by using vegetation coverage method with land cover map and 15-day normalized vegetation index data. In general, the three LST algorithms well estimated the LST without regard to the satellite zenith angle, water vapour amount, and surface lapse rate. However, the daytime LST algorithm shows a large bias especially for the warm LST (> 300 K) at day time conditions. The night LST algorithm shows a relatively large error for the LST (260 ~ 280K) at the night time conditions. The sensitivity analysis showed that the performance of weighting method is clearly improved regardless of the impacting conditions although the improvements of the weighted LST compared to the total LST are quite different according to the atmospheric and surface lapse rate conditions. The validation results of daytime (nighttime) LST with MODIS LST showed that the correlation coefficients, bias and RMSE are about 0.62~0.93 (0.44~0.83), -1.47~1.53 (-1.80~0.17), and 2.25~4.77 (2.15~4.27), respectively. However, the performance of daytime/nighttime LST algorithms is slightly degraded compared to that of the total LST algorithm.

Real-time Montage System Design using Contents Based Image Retrieval (내용 기반 영상 검색을 이용한 실시간 몽타주 시스템 설계)

  • Choi, Hyeon-Seok;Bae, Seong-Joon;Kim, Tae-Yong;Choi, Jong-Soo
    • Archives of design research
    • /
    • v.19 no.2 s.64
    • /
    • pp.313-322
    • /
    • 2006
  • In this paper, we introduce 'Contents Based Image Retrieval' which helps a user find the images he or she needs more easily and reconfigures the images automatically. With this system, we try to realize the language of (motion) picture, that is, the Montage from the viewpoint of the user. The Real-time Montage System introduced in this paper uses 'Discrete Fourier Transform'. Through this, the user can find the feature of the image selected and compare the analogousness with the image in the database. This kind of system leads to the user's speedy and effective retrieving, Also, we can acquire the movement image of the user by Camera Tracking in Real-time. The movement image acquired is to be reconfigured automatically with the image of the user. In this way, we can get an easy and speedy image reconfiguration which sets to the user's intention. This system is a New Media Design tool(entertainment) which induces a user enjoy participating in it. In this system, Thus, the user is not just a passive consumer of one-way image channels but an active subject of image reproduction in this system. It is expected to be a foundation for a new style of user-centered movie (media based entertainment).

  • PDF

Effective Image Retrieval for the M-Learning System (모바일 교육 시스템을 위한 효율적인 영상 검색 구축)

  • Han Eun-Jung;Park An-Jin;Jung Kee-Chul
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.5
    • /
    • pp.658-670
    • /
    • 2006
  • As the educational media tends to be more digitalized and individualized, the learning paradigm is dramatically changing into e-learning. Existing on-line courseware gives a learner more chances to learn when they are home with their own PCs. However, it is of little use when they are away from their digital media. Also, it is very labor-intensive to convert the original off-line contents to on-line contents. This paper proposes education mobile contents(EMC) that can supply the learners with dynamic interactions using various multimedia information by recognizing real images of off-line contents using mobile devices. Content-based image retrieval based on object shapes is used to recognize the real image, and shapes are represented by differential chain code with estimated new starting points to obtain rotation-invariant representation, which is fitted to computational resources of mobile devices with low resolution camera. Moreover we use a dynamic time warping method to recognize the object shape, which compensates scale variations of an object. The EMC can provide learners with quick and accurate on-line contents on off-line ones using mobile devices without limitations of space.

  • PDF

Enhancing Retrieval Performance for Hierarchical Compact Binary Tree (계층형 집약 이진 트리의 검색 성능 개선)

  • Kim, Sung Wan
    • Journal of Creative Information Culture
    • /
    • v.5 no.3
    • /
    • pp.345-353
    • /
    • 2019
  • Several studies have been proposed to improve storage space efficiency by expressing binary trie data structure as a linear binary bit string. Compact binary tree approach generated using one binary trie increases the key search time significantly as the binary bit string becomes very long as the size of the input key set increases. In order to reduce the key search range, a hierarchical compact binary tree technique that hierarchically expresses several small binary compact trees has been proposed. The search time increases proportionally with the number and length of binary bit streams. In this paper, we generate several binary compact trees represented by full binary tries hierarchically. The search performance is improved by allowing a path for the binary bit string corresponding to the search range to be determined through simple numeric conversion. Through the performance evaluation using the worst time and space complexity calculation, the proposed method showed the highest performance for retrieval and key insertion or deletion. In terms of space usage, the proposed method requires about 67% ~ 68% of space compared to the existing methods, showing the best space efficiency.

Indexing and Retrieval Mechanism using Variation Patterns of Theme Melodies in Content-based Music Information Retrievals (내용 기반 음악 정보 검색에서 주제 선율의 변화 패턴을 이용한 색인 및 검색 기법)

  • 구경이;신창환;김유성
    • Journal of KIISE:Databases
    • /
    • v.30 no.5
    • /
    • pp.507-520
    • /
    • 2003
  • In this paper, an automatic construction method of theme melody index for large music database and an associative content-based music retrieval mechanism in which the constructed theme melody index is mainly used to improve the users' response time are proposed. First, the system automatically extracted the theme melody from a music file by the graphical clustering algorithm based on the similarities between motifs of the music. To place an extracted theme melody into the metric space of M-tree, we chose the average length variation and the average pitch variation of the theme melody as the major features. Moreover, we added the pitch signature and length signature which summarize the pitch variation pattern and the length variation pattern of a theme melody, respectively, to increase the precision of retrieval results. We also proposed the associative content-based music retrieval mechanism in which the k-nearest neighborhood searching and the range searching algorithms of M-tree are used to select the similar melodies to user's query melody from the theme melody index. To improve the users' satisfaction, the proposed retrieval mechanism includes ranking and user's relevance feedback functions. Also, we implemented the proposed mechanisms as the essential components of content-based music retrieval systems to verify the usefulness.

A Real-time Vision Inspection System at a Laver Production Line (해태 생산라인에서의 실시간 시각검사 시스템)

  • Kim, Gi-Weon;Kim, Bong-Gi
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.601-604
    • /
    • 2007
  • In this paper dose a laver surface check using a real time image process. This system does false retrieval of a laver at a laver production line. At first, a laver image was read in real time using a CCD camera. In this paper, we use an area scan CCD camera. Image is converted into a binary code image using a high-speed imaging process board afterwards. A laver feature is extracted by a binary code image. Surface false retrieval is finally executed using a laver feature. In this paper, we use an area feature of a laver image.

  • PDF