• Title/Summary/Keyword: Cross search

Search Result 391, Processing Time 0.028 seconds

A Technique of Watermark Generation and Similarity Embedding for Still Images Based on Cross Reference Points (교차참조점에 기반한 정지영상의 워터마크 생성 및 유사성 삽입 기법)

  • Lee, Hang-Chan
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.8
    • /
    • pp.1484-1490
    • /
    • 2007
  • The Cross Reference Point(CRP) is a robust method for finding salient points in watermarking systems because it is based on the geometrical structure of a normalized image in order to avoid pointing error caused by digital attacks. After normalization of an image, the 100 CRPs are calculated. Next, the 100 blocks centered by CRPS are formed. These 100 blocks are arranged using a secrete key. Each boundary of 50 out of 100 blocks is surrounded by 8 blocks which are selected by the ordered number of a preceding block. This number is a seed of random number generator for selecting 8 out of 50 blocks. The search area of a center block is formed by a secrete key. The pixels of a center block are quantized to 10 levels by predefined thresholds. The watermarks are generated by the 50 quantized center blocks. These watermarks are embedded directly in the remaining 50 blocks. In other words, 50 out of 100 blocks are utilized to generate watermarks and the remaining 50 blocks are used to watermark embedding. Because the watermarks are generated in the given images, we can successfully detect watermarks after several digital attacks. The reason is that the blocks for the generation and detection of watermarks are equally affected by digital attacks except for the case of local distortion such as cropping.

Context Centrality in Distributions of Advertising Messages and Online Consumer Behavior

  • CHAE, Myoung-Jin
    • Journal of Distribution Science
    • /
    • v.20 no.8
    • /
    • pp.123-133
    • /
    • 2022
  • Purpose: As moment-based marketing messages (i.e., messages related to current moments or event), companies put significant investments to distribute TV advertising related to external moments in a retail environment. While the literature offers strong support for the value of distributions of context-based messaging to advertisers, less attention has been given to how to design those messages to effectively communicate across channels. This research adds a new dimension of analysis to the study of advertising context and its cross-channel effects on online consumer behavior. Research Design, Data and Methodology: A system-of-equations Tobit regression model was adopted using data collected from an advertising agency that consists of 1,223 TV ads aired during the Rio Olympics and NCAA, tagging from consumers, and a text analysis. Results: First, TV ads with high centrality of context lead to lower online search behavior and higher online social actions. Second, how brands can design messages more effectively was explored by using product information as a moderator that could improve the impact of context-based TV advertisements. Conclusions: Given that expenses in traditional channels are still one of the biggest channel management decisions, it is critical to understand how consumer engagement varies by design of context-based TV advertising.

Development of Cross-sectional Information Conversion System from STL file for Stereolithography (Stereolithography를 위한 STL파일로부터 단면정보 변환시스템의 개발)

  • Choi, Hong-Tae;Kim, Jun-An;Lee, Seok-Hee;Paik, In-Hwan
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.12 no.11
    • /
    • pp.140-147
    • /
    • 1995
  • This paper deals with conversion from the STL file to the Slice to the Slice cross-sectional information for Stereolithography. The STL file is widely used for Stereolithography, but it is very difficult to convert STL file into Slice file directly. Because it consists of an ordered list of triangular net without any topological information other than the orientation of each facet. So, The system is accomplished by data flow through several intermediate stages such as Reference. SL1. .SL2L. .SL3. and .SLC file. The data processing is performed in 5 steps: 1) Create a Reference file including common information. 2) Modify STL file within the effective range of SL machine. 3) Calculate a point of intersection between plane equation and line equation. 4) Sort z values in ascending order using quick sort algorithm. 5) Search the adjacent points and formulate a closed loop usingsingly linked linear list. The system is developed by using Borland C++ 3.1 compiler in the environment of Pentium PC, and verified to be satisfactory by making some prototypes of electric household appliances.

  • PDF

Is dentin biomodification with collagen cross-linking agents effective for improving dentin adhesion? A systematic review and meta-analysis

  • Julianne Coelho Silva;Edson Luiz Cetira Filho;Paulo Goberlanio de Barros Silva;Fabio Wildson Gurgel Costa;Vicente de Paulo Aragao Saboia
    • Restorative Dentistry and Endodontics
    • /
    • v.47 no.2
    • /
    • pp.23.1-23.18
    • /
    • 2022
  • Objectives: The aim of this investigation was to evaluate the effectiveness of collagen cross-linking agents (CCLAs) used in combination with the adhesive technique in restorative procedures. Materials and Methods: In this systematic review, the authors followed the Preferred Reporting Items for Systematic Reviews and Meta-Analyses checklist. An electronic search was performed using PubMed, Scopus, Web of Science, Cochrane Library, LILACS, and DOSS, up to October 2020. The gray literature was also researched. Only randomized clinical trials were selected. Results: The selection process yielded 3 studies from the 838 retrieved. The addition of CCLAs in the retention of restorations increased the number of events. The postoperative sensitivity scores and marginal adaptation scores showed no significant difference between the CCLA and control groups, and the marginal pigmentation scores showed a significant increase in the CCLA group. There were no caries events in any group throughout the evaluation period. Conclusions: This systematic review showed that there is no clinical efficacy to justify the use of CCLAs in the protocols performed.

AN ANALYSIS OF THE AUTOMATCHING USING LANDSAT TM DATA AND ASTRONOMICAL APROACH (LANDSAT TM 자료를 사용한 AUTOMATCHING ALGORITHM의 분석 및 천문학 연구 분야로서의 제안)

  • 박종현;최규홍;조성의;박경윤
    • Journal of Astronomy and Space Sciences
    • /
    • v.8 no.1
    • /
    • pp.115-123
    • /
    • 1991
  • Automatching algorithm is suitable for cross-correlation, which showed correlation surface about maximal correlation coefficient. The size of the window area must be determined empirically, whereas window size generally chosen as a compromise between speed and accuracy. It is possible that epipolar transform prevented from mismatching and decreased search space. In application of the astronomical fields, automatching algorithm mainly used to planet surface recovery in satellite image.

  • PDF

A Study on the Application of Radar Cross Section Characteristic Based Life Saving Appliance for Search and Rescue Activities (조난승객 구조를 위한 레이더반사체 활용에 관한 연구)

  • Jo, Min-Chul;Kim, Hwa-Young;Lim, Sung-Yong;Kang, Hee-Jin
    • Journal of Korea Ship Safrty Technology Authority
    • /
    • s.37
    • /
    • pp.77-87
    • /
    • 2014
  • 많은 선박 사고에서 해상 조난자를 수색 및 구조하는데 매우 많은 시간이 소요되며, 수중에서 체온저하 등으로 적정 시간 내에 구출되지 못한 조난자의 경우 사망 위험이 매우 높은 실정이다. 이러한 위험을 줄이기 위한 기존 기술로는 발광막대, SOS 부이, SART, EPIRB 등이 있으나, 급박한 상황에서 개인이 활용하는 데에는 한계가 있다. 이에 따라, 이러한 문제를 해결하고 효율적인 수색 및 구조 활동을 위한 새로운 방법을 연구하게 되었다.

  • PDF

Fast Motion Estimation based on Advanced Cross Search Algorithm using Spatial Correlation (공간적 상관관계를 이용한 개선된 교차 탐색 기반의 고속 블록 정합 움직임 추정)

  • Ko, Byung-Kwan;Choi, Myung-Ryul
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.11a
    • /
    • pp.361-362
    • /
    • 2009
  • 현재 H.264, MPEG-4 등 비디오 코덱에서 움직임 추정이 많이 사용되는데, 이를 효율적으로 계산하기 위해 여러 고속 블록 정합 움직임 추정이 제안되었다. 본 논문은 이를 위한 알고리즘을 제안한다.

A Study on Containerports Clustering Using Artificial Neural Network(Multilayer Perceptron and Radial Basis Function), Social Network, and Tabu Search Models with Empirical Verification of Clustering Using the Second Stage(Type IV) Cross-Efficiency Matrix Clustering Model (인공신경망모형(다층퍼셉트론, 방사형기저함수), 사회연결망모형, 타부서치모형을 이용한 컨테이너항만의 클러스터링 측정 및 2단계(Type IV) 교차효율성 메트릭스 군집모형을 이용한 실증적 검증에 관한 연구)

  • Park, Ro-Kyung
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.9 no.6
    • /
    • pp.757-772
    • /
    • 2019
  • The purpose of this paper is to measure the clustering change and analyze empirical results, and choose the clustering ports for Busan, Incheon, and Gwangyang ports by using Artificial Neural Network, Social Network, and Tabu Search models on 38 Asian container ports over the period 2007-2016. The models consider number of cranes, depth, birth length, and total area as inputs and container throughput as output. Followings are the main empirical results. First, the variables ranking order which affects the clustering according to artificial neural network are TEU, birth length, depth, total area, and number of cranes. Second, social network analysis shows the same clustering in the benevolent and aggressive models. Third, the efficiency of domestic ports are worsened after clustering using social network analysis and tabu search models. Forth, social network and tabu search models can increase the efficiency by 37% compared to that of the general CCR model. Fifth, according to the social network analysis and tabu search models, 3 Korean ports could be clustered with Asian ports like Busan Port(Kobe, Osaka, Port Klang, Tanjung Pelepas, and Manila), Incheon Port(Shahid Rajaee, and Gwangyang), and Gwangyang Port(Aqaba, Port Sulatan Qaboos, Dammam, Khor Fakkan, and Incheon). Korean seaport authority should introduce port improvement plans by using the methods used in this paper.

Efficient Hole Searching Algorithm for the Overset Grid System with Relative Body Motion (상대운동이 있는 중첩격자계에 효율적인 Hole Searching Algorithm 개발)

  • Lee, Seon-Hyeong;Chae, Sang-Hyun;Oh, Se-Jong;Yee, Kwan-Jung
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.39 no.11
    • /
    • pp.995-1004
    • /
    • 2011
  • Object X-ray method commonly used for hole search in overset grids requires huge amount of time due to complicated vector calculations to search the cross-points as well as time-consuming hole search algorithm with respect to background grids. Especially, when the grid system is in motion relative to the background, hole points should be searched at every time step, leading to hung computational burden. To cope with this difficulties, this study presents an efficient hole search algorithm mainly designed to reduce hole searching time. To this end, virtual surface with reduced grid points is suggested and logical operators are employed as a classification algorithm instead of complicated vector calculations. In addition, the searching process is further accelerated by designating hole points in a row rather than discriminating hole points with respect to each background grid points. If there exists a relative motion, the present algorithm requires much less time because only the virtual surface needs to be moved at every time step. The hole searching time has been systematically compared for a few selected geometries.

Completion of Occluded Objects in a Video Sequence using Spatio-Temporal Matching (시공간 정합을 이용한 비디오 시퀀스에서의 가려진 객체의 복원)

  • Heo, Mi-Kyoung;Moon, Jae-Kyoung;Park, Soon-Yong
    • The KIPS Transactions:PartB
    • /
    • v.14B no.5
    • /
    • pp.351-360
    • /
    • 2007
  • Video Completion refers to a computer vision technique which restores damaged images by filling missing pixels with suitable color in a video sequence. We propose a new video completion technique to fill in image holes which are caused by removing an unnecessary object in a video sequence, where two objects cross each other in the presence of camera motion. We remove the closer object from a camera which results in image holes. Then these holes are filled by color information of some others frames. First of all, spatio-temporal volumes of occluding and occluded objects are created according to the centroid of the objects. Secondly, a temporal search technique by voxel matching separates and removes the occluding object. Finally. these holes are filled by using spatial search technique. Seams on the boundary of completed pixels we removed by a simple blending technique. Experimental results using real video sequences show that the proposed technique produces new completed videos.