scholarly journals Hash Ranking With Weighted Asymmetric Distance for Image Search

2017 ◽  
Vol 3 (4) ◽  
pp. 1008-1019 ◽  
Author(s):  
Yuan Cao ◽  
Heng Qi ◽  
Jien Kato ◽  
Keqiu Li
Keyword(s):  
Image Search ◽  
Asymmetric Distance

Customized Concept Learning in Image Search from Photo Sharing Websites

2012 ◽  
Vol 2 (2) ◽  
pp. 114-115
Author(s):  
Ch. priyanka Ch. priyanka ◽  
◽  
Dr P.Govardhan Dr P.Govardhan
Keyword(s):  
Concept Learning ◽  
Image Search ◽  
Photo Sharing

Pencarian File Gambar Berdasarkan Dominasi Warna

2011 ◽  
Vol 2 (1) ◽  
Author(s):  
Vina Chovan Epifania ◽  
Eko Sediyono
Keyword(s):  
Digital Image ◽  
Retrieval System ◽  
Color Image ◽  
Color Space ◽  
Image Data ◽  
Image Search ◽  
Test Results ◽  
Application Form ◽  
Space Model ◽  
Image File

Abstract. Image File Searching Based on Color Domination. One characteristic of an image that can be used in image searching process is the composition of the colors. Color is a trait that is easily seen by man in the picture. The use of color as a searching parameter can provide a solution in an easier searching for images stored in computer memory. Color images have RGB values that can be computed and converted into HSL color space model. Use of HSL images model is very easy because it can be calculated using a percent, so that in each pixel of the image can be grouped and named, this can give a dominant values of the colors contained in one image. By obtaining these values, the image search can be done quickly just by using these values to a retrieval system image file. This article discusses the use of the HSL color space model to facilitate the searching for a digital image in the digital image data warehouse. From the test results of the application form, a searching is faster by using the colors specified by the user. Obstacles encountered were still searching with a choice of 15 basic colors available, with a limit of 33% dominance of the color image search was not found. This is due to the dominant color in each image has the most dominant value below 33%.   Keywords: RGB, HSL, image searching Abstrak. Salah satu ciri gambar yang dapat dipergunakan dalam proses pencarian gambar adalah komposisi warna. Warna adalah ciri yang mudah dilihat oleh manusia dalam citra gambar. Penggunaan warna sebagai parameter pencarian dapat memberikan solusi dalam memudahkan pencarian gambar yang tersimpan dalam memori komputer. Warna gambar memiliki nilai RGB yang dapat dihitung dan dikonversi ke dalam model HSL color space. Penggunaan model gambar HSL sangat mudah karena dapat dihitung dengan menggunakan persen, sehingga dalam setiap piksel gambar dapat dikelompokan dan diberi nama, hal ini dapat memberikan suatu nilai dominan dari warna yang terdapat dalam satu gambar. Dengan diperolehnya nilai tersebut, pencarian gambar dapat dilakukan dengan cepat hanya dengan menggunakan nilai tersebut pada sistem pencarian file gambar. Artikel ini membahas tentang penggunaan model HSL color space untuk mempermudah pencarian suatu gambar digital didalam gudang data gambar digital. Dari hasil uji aplikasi yang sudah dibuat, diperoleh pencarian yang lebih cepat dengan menggunakan pilihan warna yang ditentukan sendiri oleh pengguna. Kendala yang masih dijumpai adalah pencarian dengan pilihan 15 warna dasar yang tersedia, dengan batas dominasi warna 33% tidak ditemukan gambar yang dicari. Hal ini disebabkan warna dominan disetiap gambar kebanyakan memiliki nilai dominan di bawah 33%. Kata Kunci: RGB, HSL, pencarian gambar

scholarly journals A Digital Pathology Solution to Resolve the Tissue Floater Conundrum

2020 ◽  
Author(s):  
Liron Pantanowitz ◽  
Pamela Michelow ◽  
Scott Hazelhurst ◽  
Shivam Kalra ◽  
Charles Choi ◽  
...  
Keyword(s):  
Digital Pathology ◽  
Primary Diagnosis ◽  
Image Search ◽  
Molecular Tests ◽  
Tissue Identification ◽  
Digital Database ◽  
Glass Slides ◽  
Search Tool ◽  
Hematoxylin And Eosin ◽  
Whole Slide Images

Context.— Pathologists may encounter extraneous pieces of tissue (tissue floaters) on glass slides because of specimen cross-contamination. Troubleshooting this problem, including performing molecular tests for tissue identification if available, is time consuming and often does not satisfactorily resolve the problem. Objective.— To demonstrate the feasibility of using an image search tool to resolve the tissue floater conundrum. Design.— A glass slide was produced containing 2 separate hematoxylin and eosin (H&E)-stained tissue floaters. This fabricated slide was digitized along with the 2 slides containing the original tumors used to create these floaters. These slides were then embedded into a dataset of 2325 whole slide images comprising a wide variety of H&E stained diagnostic entities. Digital slides were broken up into patches and the patch features converted into barcodes for indexing and easy retrieval. A deep learning-based image search tool was employed to extract features from patches via barcodes, hence enabling image matching to each tissue floater. Results.— There was a very high likelihood of finding a correct tumor match for the queried tissue floater when searching the digital database. Search results repeatedly yielded a correct match within the top 3 retrieved images. The retrieval accuracy improved when greater proportions of the floater were selected. The time to run a search was completed within several milliseconds. Conclusions.— Using an image search tool offers pathologists an additional method to rapidly resolve the tissue floater conundrum, especially for those laboratories that have transitioned to going fully digital for primary diagnosis.

scholarly journals A hybrid metaheuristic for solving asymmetric distance-constrained vehicle routing problem

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Ha-Bang Ban ◽  
Phuong Khanh Nguyen
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Natural Extension ◽  
Solution Space ◽  
Neighborhood Search ◽  
Np Hard ◽  
Routing Problem ◽  
Hybrid Metaheuristic ◽  
Asymmetric Distance ◽  
Constrained Vehicle Routing

AbstractThe Asymmetric Distance-Constrained Vehicle Routing Problem (ADVRP) is NP-hard as it is a natural extension of the NP-hard Vehicle Routing Problem. In ADVRP problem, each customer is visited exactly once by a vehicle; every tour starts and ends at a depot; and the traveled distance by each vehicle is not allowed to exceed a predetermined limit. We propose a hybrid metaheuristic algorithm combining the Randomized Variable Neighborhood Search (RVNS) and the Tabu Search (TS) to solve the problem. The combination of multiple neighborhoods and tabu mechanism is used for their capacity to escape local optima while exploring the solution space. Furthermore, the intensification and diversification phases are also included to deliver optimized and diversified solutions. Extensive numerical experiments and comparisons with all the state-of-the-art algorithms show that the proposed method is highly competitive in terms of solution quality and computation time, providing new best solutions for a number of instances.

Sign in / Sign up

Export Citation Format

Share Document