Random Draw Forest: A Salient Index for Similarity Search Over Multimedia Data

2018 ◽  
Author(s):  
Yangdi Lu ◽  
Wenbo He ◽  
Amir Nabatchian
Keyword(s):  
Similarity Search ◽  
Multimedia Data ◽  
Random Draw

FASTER SIMILARITY SEARCH FOR MULTIMEDIA DATA VIA QUERY TRANSFORMATIONS

2003 ◽  
Vol 03 (01) ◽  
pp. 3-29
Author(s):  
CHRISTIAN A. LANG ◽  
AMBUJ K. SINGH
Keyword(s):  
Similarity Search ◽  
Nearest Neighbor ◽  
Estimation Error ◽  
Fractal Dimensionality ◽  
Multimedia Data ◽  
Index Structure ◽  
High Dimensional ◽  
Range Queries ◽  
Query Execution ◽  
Real World Data

The performance of nearest neighbor (NN) queries degrades noticeably with increasing dimensionality of the data due to reduced selectivity of high-dimensional data and an increased number of seek operations during NN-query execution. If the NN-radii would be known in advance, the disk accesses could be reordered such that seek operations are minimized. We therefore propose a new way of estimating the NN-radius based on the fractal dimensionality and sampling. It is applicable to any page-based index structure. We show that the estimation error is considerably lower than for previous approaches. In the second part of the paper, we present two applications of this technique. We show how the radius estimations can be used to transform k-NN queries into at most two range queries, and how it can be used to reduce the number of page reads during all-NN queries. In both cases, we observe significant speedups over traditional techniques for synthetic and real-world data.

Similarity Search in Data Stream with Adaptive Segmental Approximations

2009 ◽  
Vol 20 (10) ◽  
pp. 2867-2884 ◽  
Author(s):  
Feng WU ◽  
Yan ZHONG ◽  
Quan-Yuan WU ◽  
Yan JIA ◽  
Shu-Qiang YANG
Keyword(s):  
Similarity Search ◽  
Data Stream

Combined QSAR Model and Chemical Similarity Search for Novel HMG-CoA Reductase Inhibitors for Coronary Heart Disease

2020 ◽  
Vol 16 (4) ◽  
pp. 473-485
Author(s):  
David Mary Rajathei ◽  
Subbiah Parthasarathy ◽  
Samuel Selvaraj
Keyword(s):  
Coronary Heart Disease ◽  
Heart Disease ◽  
Similarity Search ◽  
Qsar Model ◽  
Chemical Similarity ◽  
Cholesterol Accumulation ◽  
Reductase Inhibitors ◽  
Pubchem Database ◽  
Hmg Coa Reductase Inhibitors ◽  
Coa Reductase

Background: Coronary heart disease generally occurs due to cholesterol accumulation in the walls of the heart arteries. Statins are the most widely used drugs which work by inhibiting the active site of 3-Hydroxy-3-methylglutaryl-CoA reductase (HMGCR) enzyme that is responsible for cholesterol synthesis. A series of atorvastatin analogs with HMGCR inhibition activity have been synthesized experimentally which would be expensive and time-consuming. Methods: In the present study, we employed both the QSAR model and chemical similarity search for identifying novel HMGCR inhibitors for heart-related diseases. To implement this, a 2D QSAR model was developed by correlating the structural properties to their biological activity of a series of atorvastatin analogs reported as HMGCR inhibitors. Then, the chemical similarity search of atorvastatin analogs was performed by using PubChem database search. Results and Discussion: The three-descriptor model of charge (GATS1p), connectivity (SCH-7) and distance (VE1_D) of the molecules is obtained for HMGCR inhibition with the statistical values of R2= 0.67, RMSEtr= 0.33, R2 ext= 0.64 and CCCext= 0.76. The 109 novel compounds were obtained by chemical similarity search and the inhibition activities of the compounds were predicted using QSAR model, which were close in the range of experimentally observed threshold. Conclusion: The present study suggests that the QSAR model and chemical similarity search could be used in combination for identification of novel compounds with activity by in silico with less computation and effort.

An Efficient Shot Boundary Detection Using Data-cube Searching Technique

2020 ◽  
Vol 13 (4) ◽  
pp. 798-807
Author(s):  
J. Kavitha ◽  
P. Arockia Jansi Rani ◽  
P. Mohamed Fathimal ◽  
Asha Paul
Keyword(s):  
Texture Features ◽  
Boundary Detection ◽  
Data Cube ◽  
Multimedia Data ◽  
Shot Boundary Detection ◽  
Gradual Transition ◽  
Detection Rates ◽  
Effective Manner ◽  
Shot Boundary ◽  
Shot Transitions

Background:: In the internet era, there is a prime need to access and manage the huge volume of multimedia data in an effective manner. Shot is a sequence of frames captured by a single camera in an uninterrupted space and time. Shot detection is suitable for various applications such that video browsing, video indexing, content based video retrieval and video summarization. Objective:: To detect the shot transitions in the video within a short duration. It compares the visual features of frames like correlation, histogram and texture features only in the candidate region frames instead of comparing the full frames in the video file. Methods: This paper analyses candidate frames by searching the values of frame features which matches with the abrupt detector followed by the correct cut transition frame with in the datacube recursively until it detects the correct transition frame. If they are matched with the gradual detector, then it will give the gradual transition ranges, otherwise the algorithm will compare the frames within the next datacube to detect shot transition. Results:: The total average detection rates of all transitions computed in the proposed Data-cube Search Based Shot Boundary Detection technique are 92.06 for precision, 96.92 for recall and 93.94 for f1 measure and the maximum accurate detection rate. Conclusion:: Proposed method for shot transitions uses correlation value for searching procedure with less computation time than the existing methods which compares every single frame and uses multi features such as color, edge, motion and texture features in wavelet domain.

scholarly journals Adaptive Real-Time Routing Protocol for (m,k)-Firm in Industrial Wireless Multimedia Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (6) ◽  
pp. 1633 ◽  
Author(s):  
Beom-Su Kim ◽  
Sangdae Kim ◽  
Kyong Hoon Kim ◽  
Tae-Eung Sung ◽  
Babar Shah ◽  
...  
Keyword(s):  
Real Time ◽  
Routing Protocol ◽  
Traffic Management ◽  
Research Area ◽  
Multimedia Data ◽  
Wireless Multimedia ◽  
Multimedia Sensor Networks ◽  
Proposed Model ◽  
Event Information ◽  
Firm Model

Many applications are able to obtain enriched information by employing a wireless multimedia sensor network (WMSN) in industrial environments, which consists of nodes that are capable of processing multimedia data. However, as many aspects of WMSNs still need to be refined, this remains a potential research area. An efficient application needs the ability to capture and store the latest information about an object or event, which requires real-time multimedia data to be delivered to the sink timely. Motivated to achieve this goal, we developed a new adaptive QoS routing protocol based on the (m,k)-firm model. The proposed model processes captured information by employing a multimedia stream in the (m,k)-firm format. In addition, the model includes a new adaptive real-time protocol and traffic handling scheme to transmit event information by selecting the next hop according to the flow status as well as the requirement of the (m,k)-firm model. Different from the previous approach, two level adjustment in routing protocol and traffic management are able to increase the number of successful packets within the deadline as well as path setup schemes along the previous route is able to reduce the packet loss until a new path is established. Our simulation results demonstrate that the proposed schemes are able to improve the stream dynamic success ratio and network lifetime compared to previous work by meeting the requirement of the (m,k)-firm model regardless of the amount of traffic.

Sign in / Sign up

Export Citation Format

Share Document