• Journal of the Korea Society of Computer and Information
• /
• v.22 no.7
• /
• pp.47-54
• /
• 2017

Recently, correlation filter based trackers have shown excellent tracking performance and computational efficiency. In order to enhance tracking performance in the correlation filter based tracker, search area which is image patch for finding target must include target. In this paper, two methods to discriminatively represent target in the search area are proposed. Firstly, search area location is estimated using pyramidal Lucas-Kanade algorithm. By estimating search area location before filtering, fast motion target can be included in the search area. Secondly, we investigate multi-channel Local Edge Pattern(LEP) which is insensitive to illumination and noise variation. Qualitative and quantitative experiments are performed with eight dataset, which includes ground truth. In comparison with method without search area estimation, our approach retain tracking for the fast motion target. Additionally, the proposed multi-channel LEP improves discriminative performance compare to existing features.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.686-687
• /
• 2022

Existing clothing product search is possible only with text search, so it is not possible to properly search for the product that the user is looking for, and it takes a lot of time to search for the desired product. In addition, it was difficult to know where to sell unbranded products such as Soho Mall products, and it was difficult to search for detailed attributes of fashion products. To solve this problem, we would like to propose a deep learning technique that can search for the exact information that the user wants through the learned image search.

• The KIPS Transactions:PartB
• /
• v.16B no.2
• /
• pp.123-130
• /
• 2009

Motion estimation (ME) plays an important role in digital video compression. But it limits the performance of image quality and encoding speed and is computational demanding part of the encoder. To reduce computational time and maintain the image quality, integer pel and fractional pel ME methods are proposed in this paper. The proposed method for integer pel ME uses a hierarchical search strategy. This strategy method consists of symmetrical cross-X pattern, multi square grid pattern, diamond patterns. These search patterns places search points symmetrically and evenly that can cover the overall search area not to fall into the local minimum and to reduce the computational time. The proposed method for fractional pel uses full search pattern, center biased fractional pel search pattern and the proposed search pattern. According to block sizes, the proposed method for fractional pel decides the search pattern adaptively. Experiment results show that the speedup improvement of the proposed method over Unsymmetrical cross Multi Hexagon grid Search (UMHexagonS) and Full Search (FS) can be up to around $1.2{\sim}5.2$ times faster. Compared to image quality of FS, the proposed method shows an average PSNR drop of 0.01 dB while showing an average PSNR gain of 0.02 dB in comparison to that of UMHexagonS.

• Journal of the Korean Institute of Oriental Medical Informatics
• /
• v.15 no.1
• /
• pp.1-10
• /
• 2009

In these days everyone search the information easily with the Internet as the rapid distribution and active usage of the Internet. The search engines were developed specially to accuracy of information retrieval. User search the information more quickly and variously with them. The search portal system will be embossed with representation and basic services. The Internet user needs the result of text, image and video, knowledge search. The keyword based search is used generally for getting result of the information retrieval and another method is category based search. This paper investigates the classification of knowledge search structure for oriental medicine in market leader of search portal system by ranking web site. As a result, each classification system is unified and there is a possibility of getting up a many confusion to the user who approaches with classification systematic search method. This treatise proposed the improved oriental medicine classification system of internet information retrieval in knowledge search area. if the service provider amends about the classification system, there will be able to guarantee the compatibility of data. Also the proper access path of the knowledge which seeks is secured to user.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.779-788
• /
• 2002

There are many technically difficult issues in searching multimedia data such as image, video and audio because they are massive and more complex than simple text-based data. As a method of searching multimedia data, a similarity retrieval has been studied to retrieve automatically basic features of multimedia data and to make a search among data with retrieved features because exact match is not adaptable to a matrix of features of multimedia. In this paper, data clustering and its indexing are proposed as a speedy similarity-retrieval method of multimedia data. This approach clusters similar images on adjacent disk cylinders and then builds Indexes to access the clusters. To minimize the search cost, the hashing is adapted to index cluster. In addition, to reduce I/O time, the proposed searching takes just one I/O to look up the location of the cluster containing similar object and one sequential file I/O to read in this cluster. The proposed schema solves the problem of multi-dimension by using clustering and its indexing and has higher search efficiency than the content-based image retrieval that uses only clustering or indexing structure.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.17 no.1
• /
• pp.33-40
• /
• 2022

With the recent increase in the development of military drones, they are adopted and used as the combat system of battalion level or higher. However, it is difficult to use drones that can be used in battles below the platoon level due to the current conditions for the formation of units in the Korean military. In this paper, therefore, we developed a program drones equipped with a thermal imaging camera and LiDAR sensor for reconnaissance and exploration that can be applied in battles below the platoon level. Using these drones, we studied the possibility and feasibility of drones for small-scale combats that can find hidden enemies, search for an appropriate detour through image processing and conduct reconnaissance and search for battlefields, hiding and cover-up through image processing. In addition to the purpose of using the proposed drone to search for an enemies lying in ambush in the battlefield, it can be used as a function to check the optimal movement path when a combat unit is moving, or as a function to check the optimal place for cover-up or hiding. In particular, it is possible to check another route other than the route recommended by the program because the features of the terrain can be checked from various viewpoints through 3D modeling. We verified the possiblity of flying by designing and assembling in a form of adding LiDAR and thermal imaging camera module to a drone assembled based on racing drone parts, which are open source hardware, and developed autonomous flight and search functions which can be used even by non-professional drone operators based on open source software, and then installed them to verify their feasibility.

• Proceedings of the Korea Society of Design Studies Conference
• /
• 2005.05a
• /
• pp.142-143
• /
• 2005

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1232-1239
• /
• 2006

In video standards such as MPEG-1/2/4 and H.264/AVC, motion estimation / compensation(ME/MC) process causes the most encoding complexity of video encoder. The full search method, which is used in general video codecs, exhausts much encoding time because it compares current macroblock with those at all positions within search window for searching a matched block. For the alleviation of this problem, the fast search methods such as TSS, NTSS, DS and HEXBS are exploited at first. Thereafter, DS based MVFAST, PMVFAST, MAS and FAME, which utilize temporal or spacial correlation characteristics of motion vectors, are developed. But there remain the problems of image quality degradation and algorithm complexity increase. In this thesis, the proposed algorithm maximizes search speed and minimizes the degradation of image quality by determining initial search point correctly and using simple one-dimension search patterns considering motion characteristics of each frame.

• The Journal of the Convergence on Culture Technology
• /
• v.8 no.6
• /
• pp.703-708
• /
• 2022

Tables and figures in academic literature contain important and valuable information. Tables and figures represent the essence of the refined study, which is the closest to the raw dataset. If so, can researchers easily access and utilize these image data through the search system? In this study, we try to identify user perceptions and needs for image data through user and case studies. Through this study we also explore expected effects and utilizations of image search systems. It was found that the majority of researchers prefer a system that combines table and figure indexing functions with traditional search functions. They valued the provision of an advanced search function that would allow them to limit their searches to specific object types (pictures and tables). Overall, researchers discovered many potential uses of the system for indexing tables and figures. It has been shown to be helpful in finding special types of information for teaching, presentation, research and learning. It should be also noticed that the usefulness of these systems is highest when features are integrated into existing systems, seamlessly link to fulltexts, and include high-quality images with full captions. Expected effects and utilizations for user-centered image search systems are also discussed.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.117-128
• /
• 2001

In order to achieve optimal retrieval, i.e., to find the best match to a query according to a certain similarity measure, the exhaustive search should be performed literally for all the images in a database. However, the straightforward exhaustive search algorithm is computationally expensive in large image databases. To reduce its heavy computational cost, this paper presents a fast exhaustive multi-resolution search algorithm based on image database clustering. Firstly, the proposed algorithm partitions the whole image data set into a pre-defined number of clusters having similar feature contents. Next, for a given query, it checks the lower bound of distances in each cluster, eliminating disqualified clusters. Then, it only examines the candidates in the remaining clusters. To alleviate unnecessary feature matching operations in the search procedure, the distance inequality property is employed based on a multi-resolution data structure. The proposed algorithm realizes a fast exhaustive multi-resolution search for either the best match or multiple best matches to the query. Using luminance histograms as a feature, we prove that the proposed algorithm guarantees optimal retrieval with high searching speed.