Institution
Indian Institute of Technology Bhubaneswar
Education•Bhubaneswar, India•
About: Indian Institute of Technology Bhubaneswar is a education organization based out in Bhubaneswar, India. It is known for research contribution in the topics: Large Hadron Collider & Computer science. The organization has 1185 authors who have published 3132 publications receiving 48832 citations.
Papers
More filters
••
TL;DR: In this paper, aluminium metal matrix composites were synthesized through in situ process in which aluminium alloy 5052 (AA5052) and titanium carbide were used as matrix and reinforcement materials.
Abstract: In this paper, aluminium metal matrix composites were synthesized through in situ process in which aluminium alloy 5052 (AA5052) and titanium carbide were used as matrix and reinforcement materials...
30 citations
••
TL;DR: The proposed methodology works on the principle of augmenting 3D virtual objects over the English alphabets that are used as printed markers that are believed to create engaging experience for the kids, especially the kindergarten age group.
30 citations
••
TL;DR: The extensive test results indicate that the proposed intelligent relaying scheme can reliably provide protection measures for microgrids with different modes of operation.
Abstract: The proposed work develops a decision tree-induced fuzzy rule base intelligent protection scheme for fault detection and classification in a microgrid with multiple distributed generation interfaces. The proposed protection scheme retrieves one cycle post-fault current signal samples of each phase from fault inception at bus ends of the respective feeder to derive some differential features. The retrieved current samples are pre-processed using S-transform to obtain a time–frequency contour. The statistical features, such as energy, mean, standard deviation, and entropy, are computed from the time–frequency contour, which is further used to calculate the differential features. The differential features are used to build the fault classification tree. From the decision tree classification boundaries, the fuzzy membership functions are drawn, and further, the corresponding fuzzy rule base is generated for the final relaying decision. The proposed scheme is developed on a MATLAB/SIMULINK (The MathWor...
30 citations
••
TL;DR: A new promising technique for identification of hot spots in proteins using an efficient time-frequency filtering approach known as the S-transform filtering, which is superior to its counterparts and is consistent with results based on biological methods.
Abstract: Protein-protein interactions govern almost all biological processes and the underlying functions of proteins. The interaction sites of protein depend on the 3D structure which in turn depends on the amino acid sequence. Hence, prediction of protein function from its primary sequence is an important and challenging task in bioinformatics. Identification of the amino acids (hot spots) that leads to the characteristic frequency signifying a particular biological function is really a tedious job in proteomic signal processing. In this paper, we have proposed a new promising technique for identification of hot spots in proteins using an efficient time-frequency filtering approach known as the S-transform filtering. The S-transform is a powerful linear time-frequency representation and is especially useful for the filtering in the time-frequency domain. The potential of the new technique is analyzed in identifying hot spots in proteins and the result obtained is compared with the existing methods. The results demonstrate that the proposed method is superior to its counterparts and is consistent with results based on biological methods for identification of the hot spots. The proposed method also reveals some new hot spots which need further investigation and validation by the biological community.
30 citations
••
TL;DR: The proposed method produces promising results with shorter feature vector of length 56 and improved image retrieval rate of about 5–10% and outperforms similar techniques when tested with public data sets.
Abstract: Many content-based image retrieval (CBIR) methods are being developed to store more and more information about images in shorter feature vectors and to improve image retrieval rate. In the proposed method, two-step approach to CBIR has been developed. The first step generates an image mask from local binary pattern (LBP). This LBP mask is then utilized to draw comparison between the centre pixel and the eight surrounding pixels. The second step involves drawing the peak and valley patterns of local directional binary pattern for each image which is then combined with the colour histogram to retrieve similar images. Existing methods suffer from lower average image retrieval accuracy even with larger feature vectors. The proposed method overcomes such problems through shorter feature vectors that can store more information about the image. As illustrated through experimental results, the proposed method produces promising results with shorter feature vector of length 56 and improved image retrieval rate of about 5–10%. Our method outperforms similar techniques when tested with public data sets.
30 citations
Authors
Showing all 1220 results
Name | H-index | Papers | Citations |
---|---|---|---|
Gabor Istvan Veres | 135 | 1349 | 96104 |
Márton Bartók | 76 | 622 | 26762 |
Kulamani Parida | 70 | 469 | 19139 |
Seema Bahinipati | 65 | 526 | 19144 |
Deepak Kumar Sahoo | 62 | 438 | 17308 |
Krishna R. Reddy | 58 | 400 | 11076 |
Ramayya Krishnan | 52 | 195 | 10378 |
Saroj K. Nayak | 49 | 149 | 8319 |
Dipak Kumar Sahoo | 47 | 234 | 7293 |
Ganapati Panda | 46 | 356 | 8888 |
Raj Kishore | 45 | 149 | 6886 |
Sukumar Mishra | 44 | 405 | 7905 |
Mar Barrio Luna | 43 | 179 | 5248 |
Chandra Sekhar Rout | 41 | 183 | 7736 |
Subhransu Ranjan Samantaray | 39 | 167 | 4880 |